This header file forward declares the following containers: More...
#include <boost/container/detail/std_fwd.hpp>
#include <cstddef>
Classes | |
class | boost::container::vector< T, BOOST_CONTAINER_DOCONLY > |
A vector is a sequence that supports random access to elements, constant time insertion and removal of elements at the end, and linear time insertion and removal of elements at the beginning or in the middle. More... | |
class | boost::container::stable_vector< T, Allocator > |
Originally developed by Joaquin M. More... | |
class | boost::container::static_vector< Value, Capacity > |
A variable-size array container with fixed capacity. More... | |
class | boost::container::deque< T, Allocator > |
class | boost::container::list< T, Allocator > |
A list is a doubly linked list. More... | |
class | boost::container::slist< T, Allocator > |
An slist is a singly linked list: a list where each element is linked to the next element, but not to the previous element. More... | |
struct | boost::container::tree_opt< TreeType, OptimizeSize > |
class | boost::container::set< Key, Compare, Allocator, SetOptions > |
class | boost::container::multiset< Key, Compare, Allocator, MultiSetOptions > |
class | boost::container::map< Key, T, Compare, Allocator, MapOptions > |
class | boost::container::multimap< Key, T, Compare, Allocator, MultiMapOptions > |
class | boost::container::flat_set< Key, Compare, Allocator > |
flat_set is a Sorted Associative Container that stores objects of type Key. More... | |
class | boost::container::flat_multiset< Key, Compare, Allocator > |
flat_multiset is a Sorted Associative Container that stores objects of type Key. More... | |
class | boost::container::flat_map< Key, T, Compare, Allocator > |
A flat_map is a kind of associative container that supports unique keys (contains at most one of each key value) and provides for fast retrieval of values of another type T based on the keys. More... | |
class | boost::container::flat_multimap< Key, T, Compare, Allocator > |
A flat_multimap is a kind of associative container that supports equivalent keys (possibly containing multiple copies of the same key value) and provides for fast retrieval of values of another type T based on the keys. More... | |
class | boost::container::basic_string< CharT, Traits, Allocator > |
The basic_string class represents a Sequence of characters. More... | |
singleton | boost::container::adaptive_pool< T, BOOST_CONTAINER_DOCONLY, BOOST_CONTAINER_DOCONLY, BOOST_CONTAINER_DOCONLY > |
An STL node allocator that uses a modified DLMalloc as memory source. More... | |
singleton | boost::container::allocator< T, Version, AllocationDisableMask > |
If Version is 1, the allocator is a STL conforming allocator. More... | |
class | boost::container::node_allocator< T, NodesPerBlock, Version > |
An STL node allocator that uses a modified DlMalloc as memory source. More... | |
struct | boost::container::ordered_range_t |
Type used to tag that the input range is guaranteed to be ordered. More... | |
struct | boost::container::ordered_unique_range_t |
Type used to tag that the input range is guaranteed to be ordered and unique. More... | |
struct | boost::container::default_init_t |
Type used to tag that the inserted values should be default initialized. More... | |
struct | boost::container::value_init_t |
Type used to tag that the inserted values should be value initialized. More... | |
struct | boost::container::container_detail_really_deep_namespace::dummy |
Namespaces | |
boost | |
Duration formatting facet for input. | |
boost::intrusive | |
boost::container | |
boost::container::container_detail | |
boost::container::container_detail_really_deep_namespace | |
Typedefs | |
typedef tree_opt < red_black_tree, true > | boost::container::tree_assoc_defaults |
typedef basic_string< char,std::char_traits < char >,std::allocator< char > > | boost::container::string |
typedef basic_string< wchar_t,std::char_traits < wchar_t >,std::allocator < wchar_t > > | boost::container::wstring |
Enumerations | |
enum | boost::container::tree_type_enum { boost::container::red_black_tree, boost::container::avl_tree, boost::container::scapegoat_tree, boost::container::splay_tree } |
Enumeration used to configure ordered associative containers with a concrete tree implementation. More... | |
This header file forward declares the following containers:
It forward declares the following allocators:
And finally it defines the following types