|
| btree_set () |
|
| btree_set_container () |
|
| btree_set_container (InputIterator b, InputIterator e, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type()) |
|
| btree_set_container (std::initializer_list< init_type > init, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type()) |
|
| btree_set_container (std::initializer_list< init_type > init, const allocator_type &alloc) |
|
size_type | count (const key_arg< K > &key) const |
|
std::pair< iterator, bool > | insert (const value_type &x) |
|
std::pair< iterator, bool > | insert (value_type &&x) |
|
iterator | insert (const_iterator hint, const value_type &x) |
|
iterator | insert (const_iterator hint, value_type &&x) |
|
void | insert (InputIterator b, InputIterator e) |
|
void | insert (std::initializer_list< init_type > init) |
|
insert_return_type | insert (node_type &&node) |
|
iterator | insert (const_iterator hint, node_type &&node) |
|
std::pair< iterator, bool > | emplace (Args &&... args) |
|
iterator | emplace_hint (const_iterator hint, Args &&... args) |
|
size_type | erase (const key_arg< K > &key) |
|
iterator | erase (const_iterator iter) |
|
iterator | erase (iterator iter) |
|
iterator | erase (const_iterator first, const_iterator last) |
|
size_type | erase (const key_arg< K > &key) |
|
node_type | extract (const key_arg< K > &key) |
|
node_type | extract (iterator position) |
|
node_type | extract (const_iterator position) |
|
void | merge (btree_container< T > &src) |
|
void | merge (btree_container< T > &&src) |
|
| btree_container () |
|
| btree_container (const key_compare &comp, const allocator_type &alloc=allocator_type()) |
|
| btree_container (const btree_container &x)=default |
|
| btree_container (btree_container &&x) noexcept=default |
|
btree_container & | operator= (const btree_container &x)=default |
|
btree_container & | operator= (btree_container &&x) noexcept(std::is_nothrow_move_assignable< Tree >::value)=default |
|
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 |
|
template<typename K = key_type> |
size_type | count (const key_arg< K > &key) const |
|
template<typename K = key_type> |
iterator | find (const key_arg< K > &key) |
|
template<typename K = key_type> |
const_iterator | find (const key_arg< K > &key) const |
|
template<typename K = key_type> |
bool | contains (const key_arg< K > &key) const |
|
template<typename K = key_type> |
iterator | lower_bound (const key_arg< K > &key) |
|
template<typename K = key_type> |
const_iterator | lower_bound (const key_arg< K > &key) const |
|
template<typename K = key_type> |
iterator | upper_bound (const key_arg< K > &key) |
|
template<typename K = key_type> |
const_iterator | upper_bound (const key_arg< K > &key) const |
|
template<typename K = key_type> |
std::pair< iterator, iterator > | equal_range (const key_arg< K > &key) |
|
template<typename K = key_type> |
std::pair< const_iterator, const_iterator > | equal_range (const key_arg< K > &key) const |
|
iterator | erase (const_iterator iter) |
|
iterator | erase (iterator iter) |
|
iterator | erase (const_iterator first, const_iterator last) |
|
template<typename K = key_type> |
size_type | erase (const key_arg< K > &key) |
|
node_type | extract (iterator position) |
|
node_type | extract (const_iterator position) |
|
void | clear () |
|
void | swap (btree_container &x) |
|
void | verify () const |
|
size_type | size () const |
|
size_type | max_size () const |
|
bool | empty () const |
|
allocator_type | get_allocator () const |
|
key_compare | key_comp () const |
|
value_compare | value_comp () const |
|