phmap::priv::btree_container< Tree > 模板类 参考

#include <btree.h>

类 phmap::priv::btree_container< Tree > 继承关系图:

Public 类型
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

Public 成员函数
	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

Protected 类型
template<class K >
using	key_arg

Protected 属性
Tree	tree_

Private 类型
using	params_type = typename Tree::params_type

友元
bool	operator== (const btree_container &x, const btree_container &y)
bool	operator!= (const btree_container &x, const btree_container &y)
bool	operator< (const btree_container &x, const btree_container &y)
bool	operator> (const btree_container &x, const btree_container &y)
bool	operator<= (const btree_container &x, const btree_container &y)
bool	operator>= (const btree_container &x, const btree_container &y)
template<typename State >
State	AbslHashValue (State h, const btree_container &b)

成员类型定义说明

allocator_type

template<typename Tree >

using phmap::priv::btree_container< Tree >::allocator_type = typename Tree::allocator_type

const_iterator

template<typename Tree >

using phmap::priv::btree_container< Tree >::const_iterator = typename Tree::const_iterator

const_pointer

template<typename Tree >

using phmap::priv::btree_container< Tree >::const_pointer = typename Tree::const_pointer

const_reference

template<typename Tree >

using phmap::priv::btree_container< Tree >::const_reference = typename Tree::const_reference

const_reverse_iterator

template<typename Tree >

using phmap::priv::btree_container< Tree >::const_reverse_iterator = typename Tree::const_reverse_iterator

difference_type

template<typename Tree >

using phmap::priv::btree_container< Tree >::difference_type = typename Tree::difference_type

iterator

template<typename Tree >

using phmap::priv::btree_container< Tree >::iterator = typename Tree::iterator

key_arg

template<typename Tree >

template<class K >

using phmap::priv::btree_container< Tree >::key_arg

protected

初始值:

 
            typename KeyArg<IsTransparent<typename Tree::key_compare>::value>::
            template type<K, typename Tree::key_type>

key_compare

template<typename Tree >

using phmap::priv::btree_container< Tree >::key_compare = typename Tree::key_compare

key_type

template<typename Tree >

using phmap::priv::btree_container< Tree >::key_type = typename Tree::key_type

node_type

template<typename Tree >

using phmap::priv::btree_container< Tree >::node_type = typename Tree::node_handle_type

params_type

template<typename Tree >

using phmap::priv::btree_container< Tree >::params_type = typename Tree::params_type

private

pointer

template<typename Tree >

using phmap::priv::btree_container< Tree >::pointer = typename Tree::pointer

reference

template<typename Tree >

using phmap::priv::btree_container< Tree >::reference = typename Tree::reference

reverse_iterator

template<typename Tree >

using phmap::priv::btree_container< Tree >::reverse_iterator = typename Tree::reverse_iterator

size_type

template<typename Tree >

using phmap::priv::btree_container< Tree >::size_type = typename Tree::size_type

value_compare

template<typename Tree >

using phmap::priv::btree_container< Tree >::value_compare = typename Tree::value_compare

value_type

template<typename Tree >

using phmap::priv::btree_container< Tree >::value_type = typename Tree::value_type

构造及析构函数说明

btree_container() [1/4]

template<typename Tree >

phmap::priv::btree_container< Tree >::btree_container ( )

inline

btree_container() [2/4]

template<typename Tree >

phmap::priv::btree_container< Tree >::btree_container ( const key_compare & comp, const allocator_type & alloc = allocator_type() )

inlineexplicit

btree_container() [3/4]

template<typename Tree >

phmap::priv::btree_container< Tree >::btree_container ( const btree_container< Tree > & x )

default

btree_container() [4/4]

template<typename Tree >

phmap::priv::btree_container< Tree >::btree_container ( btree_container< Tree > && x )

defaultnoexcept

成员函数说明

begin() [1/2]

template<typename Tree >

iterator phmap::priv::btree_container< Tree >::begin ( )

inline

begin() [2/2]

template<typename Tree >

const_iterator phmap::priv::btree_container< Tree >::begin ( ) const

inline

cbegin()

template<typename Tree >

const_iterator phmap::priv::btree_container< Tree >::cbegin ( ) const

inline

cend()

template<typename Tree >

const_iterator phmap::priv::btree_container< Tree >::cend ( ) const

inline

clear()

template<typename Tree >

void phmap::priv::btree_container< Tree >::clear ( )

inline

contains()

template<typename Tree >

template<typename K = key_type>

bool phmap::priv::btree_container< Tree >::contains ( const key_arg< K > & key ) const

inline

count()

template<typename Tree >

template<typename K = key_type>

size_type phmap::priv::btree_container< Tree >::count ( const key_arg< K > & key ) const

inline

crbegin()

template<typename Tree >

const_reverse_iterator phmap::priv::btree_container< Tree >::crbegin ( ) const

inline

crend()

template<typename Tree >

const_reverse_iterator phmap::priv::btree_container< Tree >::crend ( ) const

inline

empty()

template<typename Tree >

bool phmap::priv::btree_container< Tree >::empty ( ) const

inline

end() [1/2]

template<typename Tree >

iterator phmap::priv::btree_container< Tree >::end ( )

inline

end() [2/2]

template<typename Tree >

const_iterator phmap::priv::btree_container< Tree >::end ( ) const

inline

equal_range() [1/2]

template<typename Tree >

template<typename K = key_type>

std::pair< iterator, iterator > phmap::priv::btree_container< Tree >::equal_range ( const key_arg< K > & key )

inline

equal_range() [2/2]

template<typename Tree >

template<typename K = key_type>

std::pair< const_iterator, const_iterator > phmap::priv::btree_container< Tree >::equal_range ( const key_arg< K > & key ) const

inline

erase() [1/4]

template<typename Tree >

template<typename K = key_type>

size_type phmap::priv::btree_container< Tree >::erase ( const key_arg< K > & key )

inline

erase() [2/4]

template<typename Tree >

iterator phmap::priv::btree_container< Tree >::erase ( const_iterator first, const_iterator last )

inline

erase() [3/4]

template<typename Tree >

iterator phmap::priv::btree_container< Tree >::erase ( const_iterator iter )

inline

erase() [4/4]

template<typename Tree >

iterator phmap::priv::btree_container< Tree >::erase ( iterator iter )

inline

extract() [1/2]

template<typename Tree >

node_type phmap::priv::btree_container< Tree >::extract ( const_iterator position )

inline

extract() [2/2]

template<typename Tree >

node_type phmap::priv::btree_container< Tree >::extract ( iterator position )

inline

find() [1/2]

template<typename Tree >

template<typename K = key_type>

iterator phmap::priv::btree_container< Tree >::find ( const key_arg< K > & key )

inline

find() [2/2]

template<typename Tree >

template<typename K = key_type>

const_iterator phmap::priv::btree_container< Tree >::find ( const key_arg< K > & key ) const

inline

get_allocator()

template<typename Tree >

allocator_type phmap::priv::btree_container< Tree >::get_allocator ( ) const

inline

key_comp()

template<typename Tree >

key_compare phmap::priv::btree_container< Tree >::key_comp ( ) const

inline

lower_bound() [1/2]

template<typename Tree >

template<typename K = key_type>

iterator phmap::priv::btree_container< Tree >::lower_bound ( const key_arg< K > & key )

inline

lower_bound() [2/2]

template<typename Tree >

template<typename K = key_type>

const_iterator phmap::priv::btree_container< Tree >::lower_bound ( const key_arg< K > & key ) const

inline

max_size()

template<typename Tree >

size_type phmap::priv::btree_container< Tree >::max_size ( ) const

inline

operator=() [1/2]

template<typename Tree >

btree_container & phmap::priv::btree_container< Tree >::operator= ( btree_container< Tree > && x )

defaultnoexcept

operator=() [2/2]

template<typename Tree >

btree_container & phmap::priv::btree_container< Tree >::operator= ( const btree_container< Tree > & x )

default

rbegin() [1/2]

template<typename Tree >

reverse_iterator phmap::priv::btree_container< Tree >::rbegin ( )

inline

rbegin() [2/2]

template<typename Tree >

const_reverse_iterator phmap::priv::btree_container< Tree >::rbegin ( ) const

inline

rend() [1/2]

template<typename Tree >

reverse_iterator phmap::priv::btree_container< Tree >::rend ( )

inline

rend() [2/2]

template<typename Tree >

const_reverse_iterator phmap::priv::btree_container< Tree >::rend ( ) const

inline

size()

template<typename Tree >

size_type phmap::priv::btree_container< Tree >::size ( ) const

inline

swap()

template<typename Tree >

void phmap::priv::btree_container< Tree >::swap ( btree_container< Tree > & x )

inline

upper_bound() [1/2]

template<typename Tree >

template<typename K = key_type>

iterator phmap::priv::btree_container< Tree >::upper_bound ( const key_arg< K > & key )

inline

upper_bound() [2/2]

template<typename Tree >

template<typename K = key_type>

const_iterator phmap::priv::btree_container< Tree >::upper_bound ( const key_arg< K > & key ) const

inline

value_comp()

template<typename Tree >

value_compare phmap::priv::btree_container< Tree >::value_comp ( ) const

inline

verify()

template<typename Tree >

void phmap::priv::btree_container< Tree >::verify ( ) const

inline

友元及相关函数文档

AbslHashValue

template<typename Tree >

template<typename State >

State AbslHashValue ( State h, const btree_container< Tree > & b )

friend

operator!=

template<typename Tree >

bool operator!= ( const btree_container< Tree > & x, const btree_container< Tree > & y )

friend

operator<

template<typename Tree >

bool operator< ( const btree_container< Tree > & x, const btree_container< Tree > & y )

friend

operator<=

template<typename Tree >

bool operator<= ( const btree_container< Tree > & x, const btree_container< Tree > & y )

friend

operator==

template<typename Tree >

bool operator== ( const btree_container< Tree > & x, const btree_container< Tree > & y )

friend

operator>

template<typename Tree >

bool operator> ( const btree_container< Tree > & x, const btree_container< Tree > & y )

friend

operator>=

template<typename Tree >

bool operator>= ( const btree_container< Tree > & x, const btree_container< Tree > & y )

friend

类成员变量说明

tree_

template<typename Tree >

Tree phmap::priv::btree_container< Tree >::tree_

protected

---

该类的文档由以下文件生成:

• D:/GitLab/builds/wydSYb3b/0/nim-pc/california/nim-cross-platform-sdk/exports/include/btree.h