#include <Rect.h>
|
| T | x = 0 |
| |
| T | y = 0 |
| |
| T | w = 0 |
| |
| T | h = 0 |
| |
◆ Rect() [1/4]
◆ Rect() [2/4]
◆ Rect() [3/4]
◆ Rect() [4/4]
◆ bottomLeft()
◆ bottomRight()
◆ center()
◆ contains() [1/2]
template<class T >
| bool Rect< T >::contains |
( |
const Point< T > & |
point | ) |
const |
|
inline |
◆ contains() [2/2]
template<class T >
| bool Rect< T >::contains |
( |
const Rect< T > & |
rect | ) |
const |
|
inline |
◆ intersects()
template<class T >
template<class U >
| bool Rect< T >::intersects |
( |
const Rect< U > & |
other | ) |
const |
|
inline |
◆ isEmpty()
template<class T >
| bool Rect< T >::isEmpty |
( |
| ) |
const |
|
inline |
◆ operator&=()
template<class T >
| Rect< T > & Rect< T >::operator&= |
( |
const Rect< T > & |
other | ) |
|
|
inline |
◆ operator|=()
template<class T >
| Rect< T > & Rect< T >::operator|= |
( |
const Rect< T > & |
other | ) |
|
|
inline |
◆ size()
◆ topLeft()
◆ topRight()
◆ operator&
template<class T >
| Rect< T > operator& |
( |
const Rect< T > & |
l, |
|
|
const Rect< T > & |
r |
|
) |
| |
|
friend |
- Parameters
-
| l | First rectangle. |
| r | Second rectangle. |
- Returns
- Intersection of two rectangles. Can return an empty rect with negative size if the rectangles don't intersect.
◆ operator==
template<class T >
| bool operator== |
( |
const Rect< T > & |
l, |
|
|
const Rect< T > & |
r |
|
) |
| |
|
friend |
◆ operator|
template<class T >
| Rect< T > operator| |
( |
const Rect< T > & |
l, |
|
|
const Rect< T > & |
r |
|
) |
| |
|
friend |
- Parameters
-
| l | First rectangle. |
| r | Second rectangle. |
- Returns
- Bounding box of two rectangles (smallest rectangle that contains both).
The documentation for this struct was generated from the following file: