CLRX
1
An unofficial OpenCL extensions designed for Radeon GPUs
|
#include <DTree.h>
Public Types | |
typedef Impl::const_iterator | const_iterator |
typedef Impl::iterator | iterator |
typedef Impl::value_type | value_type |
typedef Impl::key_type | key_type |
![]() | |
enum | |
node type | |
typedef ConstIter | const_iterator |
typedef Iter | iterator |
typedef T | value_type |
typedef T | key_type |
Public Member Functions | |
DTreeSet (const Comp &comp=Comp()) | |
default constructor | |
template<typename Iter > | |
DTreeSet (Iter first, Iter last, const Comp &comp=Comp()) | |
constructor iterator ranges | |
DTreeSet (std::initializer_list< value_type > init, const Comp &comp=Comp()) | |
constructor with element ranges | |
![]() | |
DTree (const Comp &comp=Comp(), const Identity< T > &kofval=Identity< T >()) | |
default constructor | |
DTree (Iter first, Iter last, const Comp &comp=Comp(), const Identity< T > &kofval=Identity< T >()) | |
constructor with range assignment | |
DTree (std::initializer_list< value_type > init, const Comp &comp=Comp(), const Identity< T > &kofval=Identity< T >()) | |
constructor with initializer list | |
DTree (const DTree &dt) | |
copy construcror | |
DTree (DTree &&dt) noexcept | |
move constructor | |
~DTree () | |
destructor | |
DTree & | operator= (const DTree &dt) |
copy assignment | |
DTree & | operator= (DTree &&dt) noexcept |
move assignment | |
DTree & | operator= (std::initializer_list< value_type > init) |
assignment of initilizer list | |
bool | empty () const |
return true if empty | |
size_t | size () const |
return size | |
void | clear () |
clear (remove all elements) | |
iterator | find (const key_type &key) |
find element or return end iterator | |
const_iterator | find (const key_type &key) const |
find element or return end iterator | |
iterator | begin () |
return iterator to first element | |
const_iterator | begin () const |
return iterator to first element | |
const_iterator | cbegin () const |
return iterator to first element | |
iterator | end () |
return iterator after last element | |
const_iterator | end () const |
return iterator after last element | |
const_iterator | cend () const |
return iterator after last element | |
iterator | lower_bound (const key_type &key) |
first element that not less than key | |
const_iterator | lower_bound (const key_type &key) const |
first element that not less than key | |
iterator | upper_bound (const key_type &key) |
first element that greater than key | |
const_iterator | upper_bound (const key_type &key) const |
first element that greater than key | |
std::pair< iterator, bool > | insert (const value_type &value) |
insert new element | |
void | insert (std::initializer_list< value_type > ilist) |
insert new elements from initializer list | |
void | insert (Iter first, Iter last) |
iterator | erase (const_iterator it) |
remove element in postion pointed by iterator | |
size_t | erase (const key_type &key) |
remove element by key | |
void | replace (iterator iter, const value_type &value) |
replace element with checking range | |
bool | operator== (const DTree &dt) const |
lexicograhical equal to | |
bool | operator!= (const DTree &dt) const |
lexicograhical not equal | |
bool | operator< (const DTree &dt) const |
lexicograhical less | |
bool | operator<= (const DTree &dt) const |
lexicograhical less or equal | |
bool | operator> (const DTree &dt) const |
lexicograhical greater | |
bool | operator>= (const DTree &dt) const |
lexicograhical greater or equal | |
Additional Inherited Members | |
![]() | |
static size_t | maxTotalSize (cxuint level) |
static size_t | normalTotalSize (cxuint level) |
static size_t | minTotalSize (cxuint level) |
![]() | |
Node0 | n0 |
Node1 | n1 |
NodeV | nv |
![]() | |
static const cxuint | maxNode1Size |
static const cxuint | maxNode1Shift |
static const cxuint | normalNode1Shift |
static const cxuint | maxNode1Depth |
static const cxuint | maxNode0Capacity |
static const cxuint | normalNode0Capacity |
static const cxuint | minNode0Capacity |
static const cxuint | freePlacesShift |
static const cxuint | minFreePlacesShift |
static const cxuint | maxNode0Size |
static const cxuint | normalNode0Size |
static const cxuint | minNode0Size |
static const int | parentEntrySize |
static const int | parentEntryIndex |
static const size_t | MaxNode01Size |
static const size_t | NodeVElemsNum |
![]() | |
union { | |
Node0 n0 | |
Node1 n1 | |
NodeV nv | |
}; | |
DTree set.