NIM PC Cross Platform SDK
载入中...
搜索中...
未找到
Public 成员函数 | Private 类型 | 所有成员列表
phmap::btree_multimap< Key, Value, Compare, Alloc > 模板类 参考

#include <btree.h>

类 phmap::btree_multimap< Key, Value, Compare, Alloc > 继承关系图:
phmap::priv::btree_multimap_container< priv::btree< priv::map_params< Key, Value, Compare, Alloc, 256, true > > > phmap::priv::btree_multiset_container< Tree > phmap::priv::btree_container< Tree >

Public 成员函数

 btree_multimap ()
 
- Public 成员函数 继承自 phmap::priv::btree_multimap_container< priv::btree< priv::map_params< Key, Value, Compare, Alloc, 256, true > > >
 btree_multimap_container ()
 
- Public 成员函数 继承自 phmap::priv::btree_multiset_container< Tree >
 btree_multiset_container ()
 
template<class InputIterator >
 btree_multiset_container (InputIterator b, InputIterator e, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type())
 
 btree_multiset_container (std::initializer_list< init_type > init, const key_compare &comp=key_compare(), const allocator_type &alloc=allocator_type())
 
template<typename K = key_type>
size_type count (const key_arg< K > &key) const
 
iterator insert (const value_type &x)
 
iterator insert (value_type &&x)
 
iterator insert (const_iterator hint, const value_type &x)
 
iterator insert (const_iterator hint, value_type &&x)
 
template<typename InputIterator >
void insert (InputIterator b, InputIterator e)
 
void insert (std::initializer_list< init_type > init)
 
template<typename... Args>
iterator emplace (Args &&... args)
 
template<typename... Args>
iterator emplace_hint (const_iterator hint, Args &&... args)
 
iterator insert (node_type &&node)
 
iterator insert (const_iterator hint, node_type &&node)
 
template<typename K = key_type>
size_type erase (const key_arg< K > &key)
 
template<typename K = key_type>
node_type extract (const key_arg< K > &key)
 
template<typename T , typename phmap::enable_if_t< phmap::conjunction< std::is_same< value_type, typename T::value_type >, std::is_same< allocator_type, typename T::allocator_type >, std::is_same< typename params_type::is_map_container, typename T::params_type::is_map_container > >::value, int > = 0>
void merge (btree_container< T > &src)
 
template<typename T , typename phmap::enable_if_t< phmap::conjunction< std::is_same< value_type, typename T::value_type >, std::is_same< allocator_type, typename T::allocator_type >, std::is_same< typename params_type::is_map_container, typename T::params_type::is_map_container > >::value, int > = 0>
void merge (btree_container< T > &&src)
 
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)
 
- Public 成员函数 继承自 phmap::priv::btree_container< Tree >
 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
 

Private 类型

using Base = typename btree_multimap::btree_multimap_container
 

额外继承的成员函数

- Public 类型 继承自 phmap::priv::btree_multimap_container< priv::btree< priv::map_params< Key, Value, Compare, Alloc, 256, true > > >
using mapped_type = typename params_type::mapped_type
 
- Public 类型 继承自 phmap::priv::btree_multiset_container< Tree >
using key_type = typename Tree::key_type
 
using value_type = typename Tree::value_type
 
using size_type = typename Tree::size_type
 
using key_compare = typename Tree::key_compare
 
using allocator_type = typename Tree::allocator_type
 
using iterator = typename Tree::iterator
 
using const_iterator = typename Tree::const_iterator
 
using node_type = typename super_type::node_type
 
- Public 类型 继承自 phmap::priv::btree_container< Tree >
using key_type = typename Tree::key_type
 
using value_type = typename Tree::value_type
 
using size_type = typename Tree::size_type
 
using difference_type = typename Tree::difference_type
 
using key_compare = typename Tree::key_compare
 
using value_compare = typename Tree::value_compare
 
using allocator_type = typename Tree::allocator_type
 
using reference = typename Tree::reference
 
using const_reference = typename Tree::const_reference
 
using pointer = typename Tree::pointer
 
using const_pointer = typename Tree::const_pointer
 
using iterator = typename Tree::iterator
 
using const_iterator = typename Tree::const_iterator
 
using reverse_iterator = typename Tree::reverse_iterator
 
using const_reverse_iterator = typename Tree::const_reverse_iterator
 
using node_type = typename Tree::node_handle_type
 
- Protected 类型 继承自 phmap::priv::btree_container< Tree >
template<class K >
using key_arg = typename KeyArg< IsTransparent< typename Tree::key_compare >::value >::template type< K, typename Tree::key_type >
 
- Protected 属性 继承自 phmap::priv::btree_container< Tree >
Tree tree_
 

成员类型定义说明

◆ Base

template<typename Key , typename Value , typename Compare , typename Alloc >
using phmap::btree_multimap< Key, Value, Compare, Alloc >::Base = typename btree_multimap::btree_multimap_container
private

构造及析构函数说明

◆ btree_multimap()

template<typename Key , typename Value , typename Compare , typename Alloc >
phmap::btree_multimap< Key, Value, Compare, Alloc >::btree_multimap ( )
inline
该类的文档由以下文件生成: