__gnu_pbds::detail Namespace Reference

Classes
class	PB_DS_BIN_TREE_NAME
class	bin_search_tree_const_node_it_
	Const node iterator. More...
class	bin_search_tree_node_it_
	Node iterator. More...
class	bin_search_tree_const_it_
	Const iterator. More...
class	bin_search_tree_it_
	Iterator. More...
struct	bin_search_tree_traits
struct	bin_search_tree_traits< Key, null_type, Cmp_Fn, Node_Update, Node, _Alloc >
class	binary_heap
class	binary_heap_const_iterator_
	Const point-type iterator. More...
struct	entry_cmp
	Entry compare, primary template. More...
struct	entry_cmp< _VTp, Cmp_Fn, _Alloc, true >
	Specialization, true. More...
struct	entry_cmp< _VTp, Cmp_Fn, _Alloc, false >
	Specialization, false. More...
struct	entry_pred
	Entry predicate primary class template. More...
struct	entry_pred< _VTp, Pred, _Alloc, true >
	Specialization, true. More...
struct	entry_pred< _VTp, Pred, _Alloc, false >
	Specialization, false. More...
class	binary_heap_point_const_iterator_
	Const point-type iterator. More...
class	resize_policy
	Resize policy for binary heap. More...
class	binomial_heap
class	binomial_heap_base
	Base class for binomial heap. More...
struct	branch_policy
	Primary template, base class for branch structure policies. More...
struct	branch_policy< Node_CItr, Node_CItr, _Alloc >
	Specialization for const iterators. More...
struct	dumnode_const_iterator
	Constant node iterator. More...
struct	tree_traits
	Tree traits class, primary template. More...
struct	trie_traits
	Trie traits class, primary template. More...
class	PB_DS_CC_HASH_NAME
class	cond_dealtor
	Conditional dey destructor, cc_hash. More...
struct	container_base_dispatch< Key, Mapped, _Alloc, list_update_tag, Policy_Tl >
	Specialization for list-update map. More...
struct	container_base_dispatch< Key, null_type, _Alloc, list_update_tag, Policy_Tl >
	Specialization for list-update set. More...
struct	container_base_dispatch< Key, Mapped, _Alloc, pat_trie_tag, Policy_Tl >
	Specialization for PATRICIA trie map. More...
struct	container_base_dispatch< Key, null_type, _Alloc, pat_trie_tag, Policy_Tl >
	Specialization for PATRICIA trie set. More...
struct	container_base_dispatch< Key, Mapped, _Alloc, rb_tree_tag, Policy_Tl >
	Specialization for R-B tree map. More...
struct	container_base_dispatch< Key, null_type, _Alloc, rb_tree_tag, Policy_Tl >
	Specialization for R-B tree set. More...
struct	container_base_dispatch< Key, Mapped, _Alloc, splay_tree_tag, Policy_Tl >
	Specialization splay tree map. More...
struct	container_base_dispatch< Key, null_type, _Alloc, splay_tree_tag, Policy_Tl >
	Specialization splay tree set. More...
struct	container_base_dispatch< Key, Mapped, _Alloc, ov_tree_tag, Policy_Tl >
	Specialization ordered-vector tree map. More...
struct	container_base_dispatch< Key, null_type, _Alloc, ov_tree_tag, Policy_Tl >
	Specialization ordered-vector tree set. More...
struct	container_base_dispatch< Key, Mapped, _Alloc, cc_hash_tag, Policy_Tl >
	Specialization colision-chaining hash map. More...
struct	container_base_dispatch< Key, null_type, _Alloc, cc_hash_tag, Policy_Tl >
	Specialization colision-chaining hash set. More...
struct	container_base_dispatch< Key, Mapped, _Alloc, gp_hash_tag, Policy_Tl >
	Specialization general-probe hash map. More...
struct	container_base_dispatch< Key, null_type, _Alloc, gp_hash_tag, Policy_Tl >
	Specialization general-probe hash set. More...
struct	eq_by_less
	Equivalence function. More...
struct	hash_eq_fn
	Primary template. More...
struct	hash_eq_fn< Key, Eq_Fn, _Alloc, false >
	Specialization 1 - The client requests that hash values not be stored. More...
struct	hash_eq_fn< Key, Eq_Fn, _Alloc, true >
	Specialization 2 - The client requests that hash values be stored. More...
class	PB_DS_GP_HASH_NAME
class	mask_based_range_hashing
	Range hashing policy. More...
class	mod_based_range_hashing
	Mod based range hashing. More...
class	probe_fn_base
	Probe functor base. More...
class	ranged_hash_fn
	Primary template. More...
class	ranged_hash_fn< Key, Hash_Fn, _Alloc, Comb_Hash_Fn, false >
class	ranged_hash_fn< Key, Hash_Fn, _Alloc, Comb_Hash_Fn, true >
class	ranged_hash_fn< Key, null_type, _Alloc, Comb_Hash_Fn, false >
class	ranged_hash_fn< Key, null_type, _Alloc, Comb_Hash_Fn, true >
class	ranged_probe_fn
	Primary template. More...
class	ranged_probe_fn< Key, Hash_Fn, _Alloc, Comb_Probe_Fn, Probe_Fn, false >
class	ranged_probe_fn< Key, Hash_Fn, _Alloc, Comb_Probe_Fn, Probe_Fn, true >
class	ranged_probe_fn< Key, null_type, _Alloc, Comb_Probe_Fn, null_type, false >
class	left_child_next_sibling_heap_const_iterator_
	Const point-type iterator. More...
class	left_child_next_sibling_heap
	Base class for a basic heap. More...
struct	left_child_next_sibling_heap_node_
	Node. More...
struct	left_child_next_sibling_heap_node_< _Value, null_type, _Alloc >
class	left_child_next_sibling_heap_node_point_const_iterator_
	Const point-type iterator. More...
struct	lu_map_entry_metadata_base
struct	lu_map_entry_metadata_base< null_type >
class	PB_DS_LU_NAME
class	lu_counter_policy_base
	Base class for list-update counter policy. More...
class	lu_counter_metadata
class	ov_tree_node_const_it_
	Const node reference. More...
class	ov_tree_node_it_
	Node reference. More...
class	PB_DS_OV_TREE_NAME
	Ordered-vector tree associative-container. More...
struct	tree_traits< Key, Mapped, Cmp_Fn, Node_Update, ov_tree_tag, _Alloc >
struct	tree_traits< Key, null_type, Cmp_Fn, Node_Update, ov_tree_tag, _Alloc >
class	pairing_heap
class	PB_DS_PAT_TRIE_NAME
	PATRICIA trie.This implementation loosely borrows ideas from: 1) Fast Mergeable Integer Maps, Okasaki, Gill 1998 2) Ptset: Sets of integers implemented as Patricia trees, Jean-Christophe Filliatr, 2000. More...
struct	pat_trie_base
	Base type for PATRICIA trees. More...
struct	synth_access_traits
	Synthetic element access traits. More...
struct	trie_traits< Key, Mapped, _ATraits, Node_Update, pat_trie_tag, _Alloc >
struct	trie_traits< Key, null_type, _ATraits, Node_Update, pat_trie_tag, _Alloc >
struct	container_base_dispatch< _VTp, Cmp_Fn, _Alloc, pairing_heap_tag, null_type >
	Specialization for pairing_heap. More...
struct	container_base_dispatch< _VTp, Cmp_Fn, _Alloc, binomial_heap_tag, null_type >
	Specialization for binomial_heap. More...
struct	container_base_dispatch< _VTp, Cmp_Fn, _Alloc, rc_binomial_heap_tag, null_type >
	Specialization for rc_binary_heap. More...
struct	container_base_dispatch< _VTp, Cmp_Fn, _Alloc, binary_heap_tag, null_type >
	Specialization for binary_heap. More...
struct	container_base_dispatch< _VTp, Cmp_Fn, _Alloc, thin_heap_tag, null_type >
	Specialization for thin_heap. More...
struct	rb_tree_node_
	Node for Red-Black trees. More...
struct	rb_tree_node_< Value_Type, null_type, _Alloc >
class	PB_DS_RB_TREE_NAME
	Red-Black tree.This implementation uses an idea from the SGI STL (using a header node which is needed for efficient iteration). More...
struct	tree_traits< Key, Mapped, Cmp_Fn, Node_Update, rb_tree_tag, _Alloc >
struct	tree_traits< Key, null_type, Cmp_Fn, Node_Update, rb_tree_tag, _Alloc >
class	rc
	Redundant binary counter. More...
class	rc_binomial_heap
class	hash_load_check_resize_trigger_size_base
	Primary template. More...
class	hash_load_check_resize_trigger_size_base< Size_Type, true >
	Specializations. More...
class	hash_load_check_resize_trigger_size_base< Size_Type, false >
struct	splay_tree_node_
	Node for splay tree. More...
struct	splay_tree_node_< Value_Type, null_type, _Alloc >
class	PB_DS_S_TREE_NAME
	Splay tree. More...
struct	tree_traits< Key, Mapped, Cmp_Fn, Node_Update, splay_tree_tag, _Alloc >
struct	tree_traits< Key, null_type, Cmp_Fn, Node_Update, splay_tree_tag, _Alloc >
struct	default_hash_fn
	Primary template, default_hash_fn. More...
struct	default_eq_fn
	Primary template, default_eq_fn. More...
struct	default_comb_hash_fn
	Primary template, default_comb_hash_fn. More...
struct	default_resize_policy
	Primary template, default_resize_policy. More...
struct	default_update_policy
	Default update policy. More...
struct	default_probe_fn
	Primary template, default_probe_fn. More...
struct	default_trie_access_traits
	Primary template, default_trie_access_traits. More...
struct	default_trie_access_traits< __dtrie_string >
	Partial specialization, default_trie_access_traits. More...
class	thin_heap
struct	tree_metadata_helper
	Tree metadata helper. More...
struct	tree_metadata_helper< Node_Update, false >
	Specialization, false. More...
struct	tree_metadata_helper< Node_Update, true >
	Specialization, true. More...
struct	tree_node_metadata_dispatch
	Tree node metadata dispatch. More...
struct	trie_metadata_helper
	Trie metadata helper. More...
struct	trie_metadata_helper< Node_Update, false >
	Specialization, false. More...
struct	trie_metadata_helper< Node_Update, true >
	Specialization, true. More...
struct	trie_node_metadata_dispatch
	Trie node metadata dispatch. More...
class	trie_policy_base
	Base class for trie policies. More...
struct	is_const_pointer
struct	is_const_reference
struct	is_simple
class	is_pair
struct	__static_assert
struct	__static_assert< true >
struct	__static_assert_dumclass
struct	type_to_type
struct	no_throw_copies
	Primary template. More...
struct	no_throw_copies< Key, null_type >
	Specialization. More...
struct	stored_value
	Stored value. More...
struct	stored_hash
	Stored hash. More...
struct	stored_data
struct	stored_data< _Tv, null_type >
	Specialization for representation of stored data of just value type. More...
struct	type_base
	Primary template. More...
struct	type_base< Key, Mapped, _Alloc, false >
struct	type_base< Key, Mapped, _Alloc, true >
struct	type_base< Key, null_type, _Alloc, false >
struct	type_base< Key, null_type, _Alloc, true >
struct	type_dispatch
	Type base dispatch. More...
struct	types_traits
	Traits for abstract types. More...
struct	container_base_dispatch
	Dispatch mechanism, primary template for associative types. More...

Typedefs
typedef std::tr1::integral_constant < int, 1 >	true_type
typedef std::tr1::integral_constant < int, 0 >	false_type

Enumerations
enum	{ default_store_hash = false }
	Enumeration for default behavior of stored hash data. More...
enum	{ num_distinct_rank_bounds = 48 }

Variables
static const std::size_t	g_a_rank_bounds [num_distinct_rank_bounds]

Typedef Documentation

typedef std::tr1::integral_constant<int, 0> __gnu_pbds::detail::false_type

typedef std::tr1::integral_constant<int, 1> __gnu_pbds::detail::true_type

Enumeration Type Documentation

anonymous enum

Enumeration for default behavior of stored hash data.

Enumerator
default_store_hash

      {
    default_store_hash = false
      };

anonymous enum

Enumerator
num_distinct_rank_bounds

      {
    num_distinct_rank_bounds = 48
      };

Variable Documentation

const std::size_t __gnu_pbds::detail::g_a_rank_bounds[num_distinct_rank_bounds]

static