|
| point_multiset () |
|
| point_multiset (const Compare &compare) |
|
| point_multiset (const Compare &compare, const BalancingPolicy &balancing) |
|
| point_multiset (const Compare &compare, const BalancingPolicy &balancing, const Alloc &alloc) |
|
| point_multiset (const point_multiset &other) |
|
point_multiset & | operator= (const point_multiset &other) |
|
iterator | begin () |
|
const_iterator | begin () const |
|
const_iterator | cbegin () const |
|
iterator | end () |
|
const_iterator | end () const |
|
const_iterator | cend () const |
|
reverse_iterator | rbegin () |
|
const_reverse_iterator | rbegin () const |
|
const_reverse_iterator | crbegin () const |
|
reverse_iterator | rend () |
|
const_reverse_iterator | rend () const |
|
const_reverse_iterator | crend () const |
|
balancing_policy | balancing () const |
| Returns the balancing policy for the container. More...
|
|
rank_type | rank () const |
| Returns the rank type used internally to get the number of dimensions in the container. More...
|
|
dimension_type | dimension () const |
| Returns the dimension of the container. More...
|
|
key_compare | key_comp () const |
| Returns the compare function used for the key. More...
|
|
value_compare | value_comp () const |
| Returns the compare function used for the value. More...
|
|
allocator_type | get_allocator () const |
| Returns the allocator used by the tree. More...
|
|
bool | empty () const |
| True if the tree is empty. More...
|
|
size_type | size () const |
| Returns the number of elements in the K-d tree. More...
|
|
size_type | count () const |
| Returns the number of elements in the K-d tree. More...
|
|
size_type | max_size () const |
| The maximum number of elements that can be allocated. More...
|
|
| Relaxed_kdtree () |
|
| Relaxed_kdtree (const rank_type &rank_) |
|
| Relaxed_kdtree (const rank_type &rank_, const key_compare &compare_) |
|
| Relaxed_kdtree (const rank_type &rank_, const key_compare &compare_, const balancing_policy &balancing_) |
|
| Relaxed_kdtree (const rank_type &rank_, const key_compare &compare_, const balancing_policy &balancing_, const allocator_type &allocator_) |
|
| Relaxed_kdtree (const Relaxed_kdtree &other) |
| Deep copy of other into the new tree. More...
|
|
Relaxed_kdtree & | operator= (const Relaxed_kdtree &other) |
| Assignment of other into the tree, with deep copy. More...
|
|
| ~Relaxed_kdtree () |
| Deallocate all nodes in the destructor. More...
|
|
void | swap (Self &other) |
| Swap the K-d tree content with others. More...
|
|
void | clear () |
| Erase all elements in the K-d tree. More...
|
|
iterator | insert (const value_type &value) |
| Insert a single key key in the tree. More...
|
|
void | insert (InputIterator first, InputIterator last) |
| Insert a serie of values in the tree at once. More...
|
|
void | erase (iterator position) |
| Deletes the node pointed to by the iterator. More...
|
|
size_type | erase (const key_type &key) |
| Deletes all nodes that match key value . More...
|
|
iterator | find (const key_type &key) |
| Find the first node that matches with key and returns an iterator to it found, otherwise it returns an iterator to the element past the end of the container. More...
|
|
const_iterator | find (const key_type &key) const |
| Find the first node that matches with key and returns an iterator to it found, otherwise it returns an iterator to the element past the end of the container. More...
|
|
template<dimension_type Rank, typename Key, typename Compare = bracket_less<Key>, typename BalancingPolicy = loose_balancing, typename Alloc = std::allocator<Key>>
struct spatial::point_multiset< Rank, Key, Compare, BalancingPolicy, Alloc >
- Examples:
- runtime_container_rank.cpp.
Definition at line 37 of file point_multiset.hpp.