2
Simple DirectMedia Layer
3
Copyright (C) 1997-2011 Sam Lantinga <slouken@libsdl.org>
5
This software is provided 'as-is', without any express or implied
6
warranty. In no event will the authors be held liable for any damages
7
arising from the use of this software.
9
Permission is granted to anyone to use this software for any purpose,
10
including commercial applications, and to alter it and redistribute it
11
freely, subject to the following restrictions:
13
1. The origin of this software must not be misrepresented; you must not
14
claim that you wrote the original software. If you use this software
15
in a product, an acknowledgment in the product documentation would be
16
appreciated but is not required.
17
2. Altered source versions must be plainly marked as such, and must not be
18
misrepresented as being the original software.
19
3. This notice may not be removed or altered from any source distribution.
25
* Header file for SDL_rect definition and management functions.
31
#include "SDL_stdinc.h"
32
#include "SDL_error.h"
33
#include "SDL_pixels.h"
34
#include "SDL_rwops.h"
36
#include "begin_code.h"
37
/* Set up for C function definitions, even when using C++ */
45
* \brief The structure that defines a point
47
* \sa SDL_EnclosePoints
56
* \brief A rectangle, with the origin at the upper left.
60
* \sa SDL_HasIntersection
61
* \sa SDL_IntersectRect
63
* \sa SDL_EnclosePoints
65
typedef struct SDL_Rect
72
* \brief Returns true if the rectangle has no area.
74
#define SDL_RectEmpty(X) (((X)->w <= 0) || ((X)->h <= 0))
77
* \brief Returns true if the two rectangles are equal.
79
#define SDL_RectEquals(A, B) (((A)->x == (B)->x) && ((A)->y == (B)->y) && \
80
((A)->w == (B)->w) && ((A)->h == (B)->h))
83
* \brief Determine whether two rectangles intersect.
85
* \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
87
extern DECLSPEC SDL_bool SDLCALL SDL_HasIntersection(const SDL_Rect * A,
91
* \brief Calculate the intersection of two rectangles.
93
* \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
95
extern DECLSPEC SDL_bool SDLCALL SDL_IntersectRect(const SDL_Rect * A,
100
* \brief Calculate the union of two rectangles.
102
extern DECLSPEC void SDLCALL SDL_UnionRect(const SDL_Rect * A,
107
* \brief Calculate a minimal rectangle enclosing a set of points
109
* \return SDL_TRUE if any points were within the clipping rect
111
extern DECLSPEC SDL_bool SDLCALL SDL_EnclosePoints(const SDL_Point * points,
113
const SDL_Rect * clip,
117
* \brief Calculate the intersection of a rectangle and line segment.
119
* \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise.
121
extern DECLSPEC SDL_bool SDLCALL SDL_IntersectRectAndLine(const SDL_Rect *
126
/* Ends C function definitions when using C++ */
132
#include "close_code.h"
134
#endif /* _SDL_rect_h */
136
/* vi: set ts=4 sw=4 expandtab: */