Lines Matching refs:RArea
16 * Construct an RArea from given components.
18 RArea
21 RArea area = { x, y, width, height };
27 * Return a pointer to a static newly constructed RArea.
30 * pointer. This is used in places that need to take RArea pointers, but
34 RArea *
37 static RArea area;
44 * Return a facially-invalid RArea.
48 RArea
51 RArea area = { -1, -1, -1, -1 };
57 * Is an RArea facially valid?
63 RAreaIsValid(const RArea *self)
70 * Return the right edge of an RArea.
73 RAreaX2(const RArea *self)
80 * Return the bottom edge of an RArea.
83 RAreaY2(const RArea *self)
90 * Return the area of an RArea.
93 RAreaArea(const RArea *self)
100 * Return an RArea describing the intersection of two RArea's.
102 RArea
103 RAreaIntersect(const RArea *self, const RArea *other)
127 RAreaIsIntersect(const RArea *self, const RArea *other)
156 * Is a given coordinate inside a RArea?
159 RAreaContainsXY(const RArea *self, int x, int y)
167 * Create a list of maximal horizontal stripes of two RArea's.
169 * This yields a set of RArea's that completely cover (without overlap)
170 * the pair of input RArea's (or NULL if the inputs are disjoint). That
171 * could be just a single RArea if e.g. they're the same height and
179 RAreaHorizontalUnion(const RArea *self, const RArea *other)
239 const RArea *top, *bot;
294 * Create a list of maximal vertical stripes of two RArea's.
296 * This yields a set of RArea's that completely cover (without overlap)
297 * the pair of input RArea's (or NULL if the inputs are disjoint). This
304 RAreaVerticalUnion(const RArea *self, const RArea *other)
355 const RArea *left, *right;
406 * Pretty-print an RArea.
411 RAreaPrint(const RArea *self)