Go to the documentation of this file.
101 return ( (
p->x >=
r->x) && (
p->x < (
r->x +
r->w)) &&
118 return (
a &&
b && (
a->x ==
b->x) && (
a->y ==
b->y) &&
GLfixed GLfixed GLint GLint GLfixed points
SDL_bool SDL_EnclosePoints(const SDL_Point *points, int count, const SDL_Rect *clip, SDL_Rect *result)
Calculate a minimal rectangle enclosing a set of points.
GLboolean GLboolean GLboolean b
GLuint GLuint GLsizei count
GLdouble GLdouble GLdouble r
SDL_FORCE_INLINE SDL_bool SDL_RectEmpty(const SDL_Rect *r)
Returns true if the rectangle has no area.
GLboolean GLboolean GLboolean GLboolean a
SDL_bool SDL_IntersectRectAndLine(const SDL_Rect *rect, int *X1, int *Y1, int *X2, int *Y2)
Calculate the intersection of a rectangle and line segment.
The structure that defines a point (floating point)
SDL_bool SDL_IntersectRect(const SDL_Rect *A, const SDL_Rect *B, SDL_Rect *result)
Calculate the intersection of two rectangles.
SDL_FORCE_INLINE SDL_bool SDL_PointInRect(const SDL_Point *p, const SDL_Rect *r)
Returns true if point resides inside a rectangle.
void SDL_UnionRect(const SDL_Rect *A, const SDL_Rect *B, SDL_Rect *result)
Calculate the union of two rectangles.
SDL_bool SDL_HasIntersection(const SDL_Rect *A, const SDL_Rect *B)
Determine whether two rectangles intersect.
The structure that defines a point (integer)
SDL_FORCE_INLINE SDL_bool SDL_RectEquals(const SDL_Rect *a, const SDL_Rect *b)
Returns true if the two rectangles are equal.
A rectangle, with the origin at the upper left (integer).
A rectangle, with the origin at the upper left (floating point).