#include <Range.h>
Public Member Functions | |
T & | back () const |
T * | begin () const |
bool | empty () const |
T * | end () const |
T & | front () const |
T & | operator[] (uint32_t i) const |
void | popBack () |
void | popFront () |
template<typename S > | |
Range (const Range< S > &other) | |
Range (T *begin, T *end) | |
Construct a range (array like container) using existing memory. | |
Range () | |
Construct an empty range. | |
uint32_t | size () const |
nv::cloth::Range< T >::Range | ( | ) | [inline] |
Construct an empty range.
nv::cloth::Range< T >::Range | ( | T * | begin, | |
T * | end | |||
) | [inline] |
Construct a range (array like container) using existing memory.
Range doesn't take ownership of this memory. Interface works similar to std::vector.
begin | start of the memory | |
end | end of the memory range, point to one element past the last valid element. |
nv::cloth::Range< T >::Range | ( | const Range< S > & | other | ) | [inline] |
T & nv::cloth::Range< T >::back | ( | ) | const [inline] |
T * nv::cloth::Range< T >::begin | ( | ) | const [inline] |
bool nv::cloth::Range< T >::empty | ( | ) | const [inline] |
T * nv::cloth::Range< T >::end | ( | ) | const [inline] |
T & nv::cloth::Range< T >::front | ( | ) | const [inline] |
T & nv::cloth::Range< T >::operator[] | ( | uint32_t | i | ) | const [inline] |
void nv::cloth::Range< T >::popBack | ( | ) | [inline] |
void nv::cloth::Range< T >::popFront | ( | ) | [inline] |
uint32_t nv::cloth::Range< T >::size | ( | ) | const [inline] |