Policy-Based Data Structures

Collaboration diagram for Policy-Based Data Structures:

Classes
class	__gnu_pbds::basic_hash_table< Key, Mapped, Hash_Fn, Eq_Fn, Resize_Policy, Store_Hash, Tag, Policy_TL, Allocator >
class	__gnu_pbds::basic_tree< Key, Mapped, Tag, Node_Update, Policy_Tl, Allocator >
class	__gnu_pbds::cc_hash_table< Key, Mapped, Hash_Fn, Eq_Fn, Comb_Hash_Fn, Resize_Policy, Store_Hash, Allocator >
class	__gnu_pbds::container_base< Key, Mapped, Tag, Policy_Tl, Allocator >
class	__gnu_pbds::gp_hash_table< Key, Mapped, Hash_Fn, Eq_Fn, Comb_Probe_Fn, Probe_Fn, Resize_Policy, Store_Hash, Allocator >
class	__gnu_pbds::list_update< Key, Mapped, Eq_Fn, Update_Policy, Allocator >
class	__gnu_pbds::tree< Key, Mapped, Cmp_Fn, Tag, Node_Update, Allocator >
class	__gnu_pbds::trie< Key, Mapped, E_Access_Traits, Tag, Node_Update, Allocator >

Macros
#define	PB_DS_BASE_C_DEC
#define	PB_DS_BASE_C_DEC
#define	PB_DS_BASE_C_DEC
#define	PB_DS_BASE_C_DEC
#define	PB_DS_BASE_C_DEC
#define	PB_DS_BASE_C_DEC
#define	PB_DS_BASE_C_DEC
#define	PB_DS_BASE_C_DEC
#define	PB_DS_TREE_NODE_AND_IT_TRAITS_C_DEC
#define	PB_DS_TRIE_NODE_AND_ITS_TRAITS

Detailed Description

This is a library of policy-based elementary data structures: associative containers and priority queues. It is designed for high-performance, flexibility, semantic safety, and conformance to the corresponding containers in std (except for some points where it differs by design).

For details, see: http://gcc.gnu.org/onlinedocs/libstdc++/ext/pb_ds/index.html