Buckets:
| /* | |
| Simple DirectMedia Layer | |
| Copyright (C) 1997-2011 Sam Lantinga <slouken@libsdl.org> | |
| This software is provided 'as-is', without any express or implied | |
| warranty. In no event will the authors be held liable for any damages | |
| arising from the use of this software. | |
| Permission is granted to anyone to use this software for any purpose, | |
| including commercial applications, and to alter it and redistribute it | |
| freely, subject to the following restrictions: | |
| 1. The origin of this software must not be misrepresented; you must not | |
| claim that you wrote the original software. If you use this software | |
| in a product, an acknowledgment in the product documentation would be | |
| appreciated but is not required. | |
| 2. Altered source versions must be plainly marked as such, and must not be | |
| misrepresented as being the original software. | |
| 3. This notice may not be removed or altered from any source distribution. | |
| */ | |
| /** | |
| * \file SDL_rect.h | |
| * | |
| * Header file for SDL_rect definition and management functions. | |
| */ | |
| /* Set up for C function definitions, even when using C++ */ | |
| /* *INDENT-OFF* */ | |
| extern "C" { | |
| /* *INDENT-ON* */ | |
| /** | |
| * \brief The structure that defines a point | |
| * | |
| * \sa SDL_EnclosePoints | |
| */ | |
| typedef struct | |
| { | |
| int x; | |
| int y; | |
| } SDL_Point; | |
| /** | |
| * \brief A rectangle, with the origin at the upper left. | |
| * | |
| * \sa SDL_RectEmpty | |
| * \sa SDL_RectEquals | |
| * \sa SDL_HasIntersection | |
| * \sa SDL_IntersectRect | |
| * \sa SDL_UnionRect | |
| * \sa SDL_EnclosePoints | |
| */ | |
| typedef struct SDL_Rect | |
| { | |
| int x, y; | |
| int w, h; | |
| } SDL_Rect; | |
| /** | |
| * \brief Returns true if the rectangle has no area. | |
| */ | |
| /** | |
| * \brief Returns true if the two rectangles are equal. | |
| */ | |
| /** | |
| * \brief Determine whether two rectangles intersect. | |
| * | |
| * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise. | |
| */ | |
| extern DECLSPEC SDL_bool SDLCALL SDL_HasIntersection(const SDL_Rect * A, | |
| const SDL_Rect * B); | |
| /** | |
| * \brief Calculate the intersection of two rectangles. | |
| * | |
| * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise. | |
| */ | |
| extern DECLSPEC SDL_bool SDLCALL SDL_IntersectRect(const SDL_Rect * A, | |
| const SDL_Rect * B, | |
| SDL_Rect * result); | |
| /** | |
| * \brief Calculate the union of two rectangles. | |
| */ | |
| extern DECLSPEC void SDLCALL SDL_UnionRect(const SDL_Rect * A, | |
| const SDL_Rect * B, | |
| SDL_Rect * result); | |
| /** | |
| * \brief Calculate a minimal rectangle enclosing a set of points | |
| * | |
| * \return SDL_TRUE if any points were within the clipping rect | |
| */ | |
| extern DECLSPEC SDL_bool SDLCALL SDL_EnclosePoints(const SDL_Point * points, | |
| int count, | |
| const SDL_Rect * clip, | |
| SDL_Rect * result); | |
| /** | |
| * \brief Calculate the intersection of a rectangle and line segment. | |
| * | |
| * \return SDL_TRUE if there is an intersection, SDL_FALSE otherwise. | |
| */ | |
| extern DECLSPEC SDL_bool SDLCALL SDL_IntersectRectAndLine(const SDL_Rect * | |
| rect, int *X1, | |
| int *Y1, int *X2, | |
| int *Y2); | |
| /* Ends C function definitions when using C++ */ | |
| /* *INDENT-OFF* */ | |
| } | |
| /* *INDENT-ON* */ | |
| /* vi: set ts=4 sw=4 expandtab: */ | |
Xet Storage Details
- Size:
- 4.07 kB
- Xet hash:
- d32a2eb0c8eb5e6a383f06ba233b3c756cdc91f4ebbffeb7214dc9b08802ffc2
·
Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.