| 123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438 | // Boost.Bimap//// Copyright (c) 2006-2007 Matias Capeletto//// 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)/// \file bimap.hpp/// \brief Includes the basic bimap container/** \mainpage notitle\n\image html http://matias.capeletto.googlepages.com/boost.bimap.reference.logo.png\section IntroductionThis is the complete reference of Boost.Bimap.After getting a good understanding of the library from a user perspectivethe next step will be:    - Understand the tagged idiom. (boost::bimaps::tags)    - Understand the internals of the relation class (boost::bimaps::relation)    - Read the container_adaptor toolbox docs (boost::bimaps::container_adaptor)    - Understand the internals of the bimap class. (boost::bimaps, boost::bimaps::views      and boost::bimaps::detail)                                                                        **//** \defgroup mutant_group mutant idiom\brief A safe wrapper around reinterpret_cast                                                                        **//** \defgroup relation_group relation\brief The relation                                                                        **//** \defgroup tags_group tagged idiom\brief The tagged idiom                                                                        **/#ifndef BOOST_BIMAP_BIMAP_HPP#define BOOST_BIMAP_BIMAP_HPP#if defined(_MSC_VER)#pragma once#endif#include <boost/config.hpp>#include <boost/bimap/detail/user_interface_config.hpp>#include <boost/mpl/aux_/na.hpp>#ifndef BOOST_BIMAP_DISABLE_SERIALIZATION    #include <boost/serialization/nvp.hpp>#endif // BOOST_BIMAP_DISABLE_SERIALIZATION// Boost.Bimap#include <boost/bimap/detail/bimap_core.hpp>#include <boost/bimap/detail/map_view_base.hpp>#include <boost/bimap/detail/modifier_adaptor.hpp>#include <boost/bimap/relation/support/data_extractor.hpp>#include <boost/bimap/relation/support/member_with_tag.hpp>#include <boost/bimap/support/map_type_by.hpp>#include <boost/bimap/support/map_by.hpp>#include <boost/bimap/support/iterator_type_by.hpp>/// \brief The namespace where all the boost libraries lives.namespace boost {/// \brief Boost.Bimap library namespace/**All the entities in the library are defined in this namespace.                                                                    **/namespace bimaps {/// \brief The bimap class is the entry point to the library./**This class manages the instantiation of the desired bimap type.As there are several types of bidirectional maps that can becreated using it. the main job of it is to find the desiredtype. This is done using metaprogramming to obtain the relationtype that will be stored, the map_view type of each side andthe set_view type of the general relationship. The instantiationis kept simple using an extended standard set theory, where abidirectional map type is defined by the set types it relates.For example, a bidirectional map that has multimap semanticsviewed from both sides is defined by specifying that the twokeys sets are of \c multiset_of<Key> type.This allows the bimap class to support seamingless N-N, 1-N,ordered/unordered and even vector-list types of mapping.The three last parameters are used to specify the set type ofthe relation, an inplace hooked data class and the allocatortype. As a help to the bimap user, these parameters supportdefault types but use a special idiom that allow them to bespecified without interleaving the usual use_default keyword.The possible bimap instantiation are enumerated here:\c {Side}KeyType can be directly a type, this is default to\c set_of<{Side}KeyType>, or can be a \c {SetType}_of<Type>specification. Additionally this two parameters can be taggedto specify others tags instead of the usual \c member_at::{Side}ones.\code    typedef bimap    <        LeftCollectionType, RightCollectionType        [ , SetTypeOfRelation  ]  // Default to left_based        [ , info_hook< Info >  ]  // Default to no info        [ , Allocator          ]  // Default to std::allocator<>    > bm;\endcode                                                                       **/template<    class KeyTypeA, class KeyTypeB,    class AP1 = ::boost::mpl::na,    class AP2 = ::boost::mpl::na,    class AP3 = ::boost::mpl::na>class bimap:    // Bimap Core, use mpl magic to find the desired bimap type    public ::boost::bimaps::detail::bimap_core<KeyTypeA,KeyTypeB,AP1,AP2,AP3>,    // You can use bimap as a collection of relations    public ::boost::bimaps::detail::bimap_core<KeyTypeA,KeyTypeB,AP1,AP2,AP3>                ::relation_set,    // Include extra typedefs (i.e. left_local_iterator for unordered_map)    public ::boost::bimaps::detail:: left_map_view_extra_typedefs<        BOOST_DEDUCED_TYPENAME ::boost::bimaps::detail::left_map_view_type<            ::boost::bimaps::detail::bimap_core<KeyTypeA,KeyTypeB,AP1,AP2,AP3>        >::type    >,    public ::boost::bimaps::detail::right_map_view_extra_typedefs<         BOOST_DEDUCED_TYPENAME ::boost::bimaps::detail::right_map_view_type<            ::boost::bimaps::detail::bimap_core<KeyTypeA,KeyTypeB,AP1,AP2,AP3>        >::type    >{    typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::detail::        bimap_core<KeyTypeA,KeyTypeB,AP1,AP2,AP3> base_;    BOOST_DEDUCED_TYPENAME base_::core_type core;    public:    // metadata --------------------------------------------------------    /*    // The rest is computed in the core, because it is quite difficult to    // expose a nice interface with so many metaprogramming stuff.        // Map by {side} metadata    typedef -unspecified- {side}_tag;    typedef -unspecified- {side}_data_type;    typedef -unspecified- {side}_value_type;    typedef -unspecified- {side}_key_type;        // There are other typedefs for definitions of different map views        ------------------------------------------------------------------*/    typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::detail::          left_map_view_type<base_>::type  left_map;    typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::detail::         right_map_view_type<base_>::type right_map;	    typedef BOOST_DEDUCED_TYPENAME         left_map::iterator        left_iterator;    typedef BOOST_DEDUCED_TYPENAME         left_map::const_iterator  left_const_iterator;    typedef BOOST_DEDUCED_TYPENAME         right_map::iterator       right_iterator;    typedef BOOST_DEDUCED_TYPENAME         right_map::const_iterator right_const_iterator;    typedef BOOST_DEDUCED_TYPENAME         left_map::reference       left_reference;    typedef BOOST_DEDUCED_TYPENAME         left_map::const_reference left_const_reference;    typedef BOOST_DEDUCED_TYPENAME        right_map::reference       right_reference;    typedef BOOST_DEDUCED_TYPENAME        right_map::const_reference right_const_reference;    typedef BOOST_DEDUCED_TYPENAME base_::relation::info_type info_type;    typedef BOOST_DEDUCED_TYPENAME base_::core_type::allocator_type allocator_type;         /// Left map view    left_map  left;    /// Right map view    right_map right;    typedef BOOST_DEDUCED_TYPENAME base_::logic_relation_set_tag                                           logic_relation_set_tag;    typedef BOOST_DEDUCED_TYPENAME base_::logic_left_tag logic_left_tag;    typedef BOOST_DEDUCED_TYPENAME base_::logic_right_tag logic_right_tag;    typedef BOOST_DEDUCED_TYPENAME base_::core_type::ctor_args_list                                                      ctor_args_list;   bimap(const allocator_type& al = allocator_type()) :       base_::relation_set(           ::boost::multi_index::get<               logic_relation_set_tag           >(core)       ),       core(al),       left (           ::boost::multi_index::get<               logic_left_tag           >(core)       ),       right (           ::boost::multi_index::get<               logic_right_tag           >(core)       )   {}   template< class InputIterator >   bimap(InputIterator first,InputIterator last,         const allocator_type& al = allocator_type()) :       base_::relation_set(           ::boost::multi_index::get<               BOOST_DEDUCED_TYPENAME base_::logic_relation_set_tag>(core)       ),       core(first,last,ctor_args_list(),al),       left (           ::boost::multi_index::get<               BOOST_DEDUCED_TYPENAME base_::logic_left_tag>(core)       ),       right (           ::boost::multi_index::get<               BOOST_DEDUCED_TYPENAME base_::logic_right_tag>(core)       )   {}   bimap(const bimap& x) :       base_::relation_set(           ::boost::multi_index::get<               BOOST_DEDUCED_TYPENAME base_::logic_relation_set_tag>(core)       ),       core(x.core),       left (           ::boost::multi_index::get<               BOOST_DEDUCED_TYPENAME base_::logic_left_tag>(core)       ),       right (           ::boost::multi_index::get<               BOOST_DEDUCED_TYPENAME base_::logic_right_tag>(core)       )   {}    bimap& operator=(const bimap& x)    {        core = x.core;        return *this;    }    // Projection of iterators    template< class IteratorType >    left_iterator project_left(IteratorType iter)    {        return core.template project<            BOOST_DEDUCED_TYPENAME base_::logic_left_tag>(iter.base());    }    template< class IteratorType >    left_const_iterator project_left(IteratorType iter) const    {        return core.template project<            BOOST_DEDUCED_TYPENAME base_::logic_left_tag>(iter.base());    }    template< class IteratorType >    right_iterator project_right(IteratorType iter)    {        return core.template project<            BOOST_DEDUCED_TYPENAME base_::logic_right_tag>(iter.base());    }    template< class IteratorType >    right_const_iterator project_right(IteratorType iter) const    {        return core.template project<            BOOST_DEDUCED_TYPENAME base_::logic_right_tag>(iter.base());    }    template< class IteratorType >    BOOST_DEDUCED_TYPENAME base_::relation_set::iterator        project_up(IteratorType iter)    {        return core.template project<            BOOST_DEDUCED_TYPENAME base_::logic_relation_set_tag>(iter.base());    }    template< class IteratorType >    BOOST_DEDUCED_TYPENAME base_::relation_set::const_iterator        project_up(IteratorType iter) const    {        return core.template project<            BOOST_DEDUCED_TYPENAME base_::logic_relation_set_tag>(iter.base());    }    // Support for tags    template< class Tag, class IteratorType >    BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::    iterator_type_by<Tag,bimap>::type        project(IteratorType iter)    {        return core.template project<Tag>(iter.base());    }    template< class Tag, class IteratorType >    BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::    const_iterator_type_by<Tag,bimap>::type        project(IteratorType iter) const    {        return core.template project<Tag>(iter.base());    }    template< class Tag >    struct map_by :        public ::boost::bimaps::support::map_type_by<Tag,bimap>::type    {        typedef BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::            map_type_by<Tag,bimap>::type type;        private: map_by() {}    };    template< class Tag >    BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::    map_type_by<Tag,bimap>::type &by()    {        return ::boost::bimaps::support::map_by<Tag>(*this);    }    template< class Tag >    const BOOST_DEDUCED_TYPENAME ::boost::bimaps::support::    map_type_by<Tag,bimap>::type &by() const    {        return ::boost::bimaps::support::map_by<Tag>(*this);    }    #ifndef BOOST_BIMAP_DISABLE_SERIALIZATION    // Serialization support    private:    friend class boost::serialization::access;    template<class Archive>    void serialize(Archive & ar, const unsigned int)    {        ar & serialization::make_nvp("mi_core",core);    }    #endif // BOOST_BIMAP_DISABLE_SERIALIZATION};} // namespace bimaps} // namespace boost/** \namespace boost::bimaps::support\brief Metafunctions to help working with bimaps.                                                            **//** \namespace boost::bimaps::views\brief Bimap views.                                                            **//** \namespace boost::bimaps::views::detail\brief Bimap views details.                                                            **/// Include basic tools for user commodity#include <boost/bimap/tags/tagged.hpp>#include <boost/bimap/relation/member_at.hpp>#include <boost/multi_index/detail/unbounded.hpp>// Bring the most used namespaces directly to the user main namespacenamespace boost {namespace bimaps {using ::boost::bimaps::tags::tagged;namespace member_at = ::boost::bimaps::relation::member_at;using ::boost::multi_index::unbounded;} // namespace bimaps} // namespace boost#endif // BOOST_BIMAP_BIMAP_HPP
 |