123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390 |
- //////////////////////////////////////////////////////////////////////////////
- //
- // (C) Copyright Ion Gaztanaga 2005-2014. Distributed under the Boost
- // Software License, Version 1.0. (See accompanying file
- // LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
- //
- // See http://www.boost.org/libs/container for documentation.
- //
- //////////////////////////////////////////////////////////////////////////////
- #ifndef BOOST_CONTAINER_CONTAINER_FWD_HPP
- #define BOOST_CONTAINER_CONTAINER_FWD_HPP
- #ifndef BOOST_CONFIG_HPP
- # include <boost/config.hpp>
- #endif
- #if defined(BOOST_HAS_PRAGMA_ONCE)
- # pragma once
- #endif
- //! \file
- //! This header file forward declares the following containers:
- //! - boost::container::vector
- //! - boost::container::stable_vector
- //! - boost::container::static_vector
- //! - boost::container::small_vector_base
- //! - boost::container::small_vector
- //! - boost::container::devector
- //! - boost::container::slist
- //! - boost::container::list
- //! - boost::container::set
- //! - boost::container::multiset
- //! - boost::container::map
- //! - boost::container::multimap
- //! - boost::container::flat_set
- //! - boost::container::flat_multiset
- //! - boost::container::flat_map
- //! - boost::container::flat_multimap
- //! - boost::container::basic_string
- //! - boost::container::string
- //! - boost::container::wstring
- //!
- //! Forward declares the following allocators:
- //! - boost::container::allocator
- //! - boost::container::node_allocator
- //! - boost::container::adaptive_pool
- //!
- //! Forward declares the following polymorphic resource classes:
- //! - boost::container::pmr::memory_resource
- //! - boost::container::pmr::polymorphic_allocator
- //! - boost::container::pmr::monotonic_buffer_resource
- //! - boost::container::pmr::pool_options
- //! - boost::container::pmr::unsynchronized_pool_resource
- //! - boost::container::pmr::synchronized_pool_resource
- //!
- //! And finally it defines the following types
- #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- //Std forward declarations
- #ifndef BOOST_CONTAINER_DETAIL_STD_FWD_HPP
- #include <boost/container/detail/std_fwd.hpp>
- #endif
- namespace boost{
- namespace intrusive{
- namespace detail{
- //Create namespace to avoid compilation errors
- }}}
- namespace boost{ namespace container{ namespace dtl{
- namespace bi = boost::intrusive;
- namespace bid = boost::intrusive::detail;
- }}}
- namespace boost{ namespace container{ namespace pmr{
- namespace bi = boost::intrusive;
- namespace bid = boost::intrusive::detail;
- }}}
- #include <cstddef>
- #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- //////////////////////////////////////////////////////////////////////////////
- // Containers
- //////////////////////////////////////////////////////////////////////////////
- namespace boost {
- namespace container {
- #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- template<class T1, class T2>
- struct pair;
- template<class T>
- class new_allocator;
- template <class T
- ,class Allocator = void
- ,class Options = void>
- class vector;
- template <class T
- ,class Allocator = void >
- class stable_vector;
- template < class T
- , std::size_t Capacity
- , class Options = void>
- class static_vector;
- template < class T
- , class Allocator = void
- , class Options = void >
- class small_vector_base;
- template < class T
- , std::size_t N
- , class Allocator = void
- , class Options = void >
- class small_vector;
- template <class T
- ,class Allocator = void
- ,class Options = void>
- class devector;
- template <class T
- ,class Allocator = void
- ,class Options = void>
- class deque;
- template <class T
- ,class Allocator = void >
- class list;
- template <class T
- ,class Allocator = void >
- class slist;
- template <class Key
- ,class Compare = std::less<Key>
- ,class Allocator = void
- ,class Options = void>
- class set;
- template <class Key
- ,class Compare = std::less<Key>
- ,class Allocator = void
- ,class Options = void >
- class multiset;
- template <class Key
- ,class T
- ,class Compare = std::less<Key>
- ,class Allocator = void
- ,class Options = void >
- class map;
- template <class Key
- ,class T
- ,class Compare = std::less<Key>
- ,class Allocator = void
- ,class Options = void >
- class multimap;
- template <class Key
- ,class Compare = std::less<Key>
- ,class Allocator = void >
- class flat_set;
- template <class Key
- ,class Compare = std::less<Key>
- ,class Allocator = void >
- class flat_multiset;
- template <class Key
- ,class T
- ,class Compare = std::less<Key>
- ,class Allocator = void >
- class flat_map;
- template <class Key
- ,class T
- ,class Compare = std::less<Key>
- ,class Allocator = void >
- class flat_multimap;
- #ifndef BOOST_NO_CXX11_TEMPLATE_ALIASES
- //! Alias templates for small_flat_[multi]{set|map} using small_vector as container
- template < class Key
- , std::size_t N
- , class Compare = std::less<Key>
- , class SmallVectorAllocator = void
- , class SmallVectorOptions = void >
- using small_flat_set = flat_set<Key, Compare, small_vector<Key, N, SmallVectorAllocator, SmallVectorOptions>>;
- template < class Key
- , std::size_t N
- , class Compare = std::less<Key>
- , class SmallVectorAllocator = void
- , class SmallVectorOptions = void >
- using small_flat_multiset = flat_multiset<Key, Compare, small_vector<Key, N, SmallVectorAllocator, SmallVectorOptions>>;
- template < class Key
- , class T
- , std::size_t N
- , class Compare = std::less<Key>
- , class SmallVectorAllocator = void
- , class SmallVectorOptions = void >
- using small_flat_map = flat_map<Key, T, Compare, small_vector<std::pair<Key, T>, N, SmallVectorAllocator, SmallVectorOptions>>;
- template < class Key
- , class T
- , std::size_t N
- , class Compare = std::less<Key>
- , class SmallVectorAllocator = void
- , class SmallVectorOptions = void >
- using small_flat_multimap = flat_multimap<Key, T, Compare, small_vector<std::pair<Key, T>, N, SmallVectorAllocator, SmallVectorOptions>>;
- #endif // #ifndef BOOST_NO_CXX11_TEMPLATE_ALIASES
- //! A portable metafunction to obtain a small_flat_set
- template < class Key
- , std::size_t N
- , class Compare = std::less<Key>
- , class SmallVectorAllocator = void
- , class SmallVectorOptions = void >
- struct small_flat_set_of
- {
- typedef flat_set<Key, Compare, small_vector<Key, N, SmallVectorAllocator, SmallVectorOptions> > type;
- };
- //! A portable metafunction to obtain a small_flat_multiset
- template < class Key
- , std::size_t N
- , class Compare = std::less<Key>
- , class SmallVectorAllocator = void
- , class SmallVectorOptions = void >
- struct small_flat_multiset_of
- {
- typedef flat_multiset<Key, Compare, small_vector<Key, N, SmallVectorAllocator, SmallVectorOptions> > type;
- };
- //! A portable metafunction to obtain a small_flat_map
- template < class Key
- , class T
- , std::size_t N
- , class Compare = std::less<Key>
- , class SmallVectorAllocator = void
- , class SmallVectorOptions = void >
- struct small_flat_map_of
- {
- typedef flat_map<Key, T, Compare, small_vector<std::pair<Key, T>, N, SmallVectorAllocator, SmallVectorOptions> > type;
- };
- //! A portable metafunction to obtain a small_flat_multimap
- template < class Key
- , class T
- , std::size_t N
- , class Compare = std::less<Key>
- , class SmallVectorAllocator = void
- , class SmallVectorOptions = void >
- struct small_flat_multimap_of
- {
- typedef flat_multimap<Key, T, Compare, small_vector<std::pair<Key, T>, N, SmallVectorAllocator, SmallVectorOptions> > type;
- };
- template <class CharT
- ,class Traits = std::char_traits<CharT>
- ,class Allocator = void >
- class basic_string;
- typedef basic_string <char> string;
- typedef basic_string<wchar_t> wstring;
- static const std::size_t ADP_nodes_per_block = 256u;
- static const std::size_t ADP_max_free_blocks = 2u;
- static const std::size_t ADP_overhead_percent = 1u;
- static const std::size_t ADP_only_alignment = 0u;
- template < class T
- , std::size_t NodesPerBlock = ADP_nodes_per_block
- , std::size_t MaxFreeBlocks = ADP_max_free_blocks
- , std::size_t OverheadPercent = ADP_overhead_percent
- , unsigned Version = 2
- >
- class adaptive_pool;
- template < class T
- , unsigned Version = 2
- , unsigned int AllocationDisableMask = 0>
- class allocator;
- static const std::size_t NodeAlloc_nodes_per_block = 256u;
- template
- < class T
- , std::size_t NodesPerBlock = NodeAlloc_nodes_per_block
- , std::size_t Version = 2>
- class node_allocator;
- namespace pmr {
- class memory_resource;
- template<class T>
- class polymorphic_allocator;
- class monotonic_buffer_resource;
- struct pool_options;
- template <class Allocator>
- class resource_adaptor_imp;
- class unsynchronized_pool_resource;
- class synchronized_pool_resource;
- } //namespace pmr {
- #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- //! Type used to tag that the input range is
- //! guaranteed to be ordered
- struct ordered_range_t
- {};
- //! Value used to tag that the input range is
- //! guaranteed to be ordered
- static const ordered_range_t ordered_range = ordered_range_t();
- //! Type used to tag that the input range is
- //! guaranteed to be ordered and unique
- struct ordered_unique_range_t
- : public ordered_range_t
- {};
- //! Value used to tag that the input range is
- //! guaranteed to be ordered and unique
- static const ordered_unique_range_t ordered_unique_range = ordered_unique_range_t();
- //! Type used to tag that the inserted values
- //! should be default initialized
- struct default_init_t
- {};
- //! Value used to tag that the inserted values
- //! should be default initialized
- static const default_init_t default_init = default_init_t();
- #ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- //! Type used to tag that the inserted values
- //! should be value initialized
- struct value_init_t
- {};
- //! Value used to tag that the inserted values
- //! should be value initialized
- static const value_init_t value_init = value_init_t();
- namespace container_detail_really_deep_namespace {
- //Otherwise, gcc issues a warning of previously defined
- //anonymous_instance and unique_instance
- struct dummy
- {
- dummy()
- {
- (void)ordered_range;
- (void)ordered_unique_range;
- (void)default_init;
- }
- };
- } //detail_really_deep_namespace {
- #endif //#ifndef BOOST_CONTAINER_DOXYGEN_INVOKED
- }} //namespace boost { namespace container {
- #endif //#ifndef BOOST_CONTAINER_CONTAINER_FWD_HPP
|