/usr/include/mircore/mir/geometry/rectangle.h is in libmircore-dev 0.26.3+16.04.20170605-0ubuntu1.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 | /*
* Copyright © 2012, 2016 Canonical Ltd.
*
* This program is free software: you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License version 3,
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
* Authored by: Alan Griffiths <alan@octopull.co.uk>
* Alexandros Frantzis <alexandros.frantzis@canonical.com>
*/
#ifndef MIR_GEOMETRY_RECTANGLE_H_
#define MIR_GEOMETRY_RECTANGLE_H_
#include "mir/geometry/point.h"
#include "size.h"
#include <iosfwd>
namespace mir
{
namespace geometry
{
struct Rectangle
{
constexpr Rectangle() = default;
constexpr Rectangle(Point const& top_left, Size const& size)
: top_left{top_left}, size{size}
{
}
Point top_left;
Size size;
/**
* The bottom right boundary point of the rectangle.
*
* Note that the returned point is *not* included in the rectangle
* area, that is, the rectangle is represented as [top_left,bottom_right).
*/
Point bottom_right() const;
Point top_right() const;
Point bottom_left() const;
bool contains(Point const& p) const;
/**
* Test if the rectangle contains another.
*
* Note that an empty rectangle can still contain other empty rectangles,
* which are treated as points or lines of thickness zero.
*/
bool contains(Rectangle const& r) const;
bool overlaps(Rectangle const& r) const;
Rectangle intersection_with(Rectangle const& r) const;
X left() const { return top_left.x; }
X right() const { return bottom_right().x; }
Y top() const { return top_left.y; }
Y bottom() const { return bottom_right().y; }
};
inline constexpr bool operator == (Rectangle const& lhs, Rectangle const& rhs)
{
return lhs.top_left == rhs.top_left && lhs.size == rhs.size;
}
inline constexpr bool operator != (Rectangle const& lhs, Rectangle const& rhs)
{
return lhs.top_left != rhs.top_left || lhs.size != rhs.size;
}
std::ostream& operator<<(std::ostream& out, Rectangle const& value);
}
}
#endif /* MIR_GEOMETRY_RECTANGLE_H_ */
|