forked from boostorg/mpl
fc18efc259
Taking advantage of the fact that order of insertion doesn't really matter for associative sequences. Comparing to the default implementation, which at any rate does work for associative sequences, this specialization essencially avoids reinserting every element of Sequence into a new sequence, besides the fact no joint_view nor iterator_range needs to be instantiated.
38 lines
1.2 KiB
C++
38 lines
1.2 KiB
C++
|
|
#ifndef BOOST_MPL_MAP_MAP0_HPP_INCLUDED
|
|
#define BOOST_MPL_MAP_MAP0_HPP_INCLUDED
|
|
|
|
// Copyright Aleksey Gurtovoy 2003-2004
|
|
// Copyright David Abrahams 2003-2004
|
|
//
|
|
// 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/mpl for documentation.
|
|
|
|
// $Id$
|
|
// $Date$
|
|
// $Revision$
|
|
|
|
#include <boost/mpl/map/aux_/contains_impl.hpp>
|
|
#include <boost/mpl/map/aux_/at_impl.hpp>
|
|
//#include <boost/mpl/map/aux_/O1_size.hpp>
|
|
#include <boost/mpl/map/aux_/insert_impl.hpp>
|
|
#include <boost/mpl/map/aux_/insert_range_impl.hpp>
|
|
#include <boost/mpl/map/aux_/erase_impl.hpp>
|
|
#include <boost/mpl/map/aux_/erase_key_impl.hpp>
|
|
#include <boost/mpl/map/aux_/has_key_impl.hpp>
|
|
#include <boost/mpl/map/aux_/key_type_impl.hpp>
|
|
#include <boost/mpl/map/aux_/value_type_impl.hpp>
|
|
#include <boost/mpl/map/aux_/clear_impl.hpp>
|
|
#include <boost/mpl/map/aux_/size_impl.hpp>
|
|
#include <boost/mpl/map/aux_/empty_impl.hpp>
|
|
#include <boost/mpl/map/aux_/begin_end_impl.hpp>
|
|
#include <boost/mpl/map/aux_/iterator.hpp>
|
|
#include <boost/mpl/map/aux_/item.hpp>
|
|
#include <boost/mpl/map/aux_/map0.hpp>
|
|
#include <boost/mpl/map/aux_/tag.hpp>
|
|
|
|
#endif // BOOST_MPL_MAP_MAP0_HPP_INCLUDED
|