mirror of
https://github.com/ecency/ecency-mobile.git
synced 2024-12-23 05:13:04 +03:00
166 lines
4.9 KiB
C++
166 lines
4.9 KiB
C++
|
//
|
||
|
// Boost.Pointer Container
|
||
|
//
|
||
|
// Copyright Thorsten Ottosen 2003-2005. Use, modification and
|
||
|
// distribution is subject to 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)
|
||
|
//
|
||
|
// For more information, see http://www.boost.org/libs/ptr_container/
|
||
|
//
|
||
|
|
||
|
#ifndef BOOST_PTR_CONTAINER_PTR_MAP_HPP
|
||
|
#define BOOST_PTR_CONTAINER_PTR_MAP_HPP
|
||
|
|
||
|
#if defined(_MSC_VER) && (_MSC_VER >= 1200)
|
||
|
# pragma once
|
||
|
#endif
|
||
|
|
||
|
#include <map>
|
||
|
#include <boost/ptr_container/ptr_map_adapter.hpp>
|
||
|
|
||
|
namespace boost
|
||
|
{
|
||
|
|
||
|
template
|
||
|
<
|
||
|
class Key,
|
||
|
class T,
|
||
|
class Compare = std::less<Key>,
|
||
|
class CloneAllocator = heap_clone_allocator,
|
||
|
class Allocator = std::allocator< std::pair<const Key,void*> >
|
||
|
>
|
||
|
class ptr_map :
|
||
|
public ptr_map_adapter<T,std::map<Key,void*,
|
||
|
Compare,Allocator>,CloneAllocator>
|
||
|
{
|
||
|
typedef ptr_map_adapter<T,std::map<Key,void*,
|
||
|
Compare,Allocator>,CloneAllocator>
|
||
|
base_type;
|
||
|
|
||
|
typedef ptr_map<Key,T,Compare,CloneAllocator,Allocator> this_type;
|
||
|
|
||
|
public:
|
||
|
ptr_map()
|
||
|
{ }
|
||
|
|
||
|
explicit ptr_map( const Compare& comp,
|
||
|
const Allocator& a = Allocator() )
|
||
|
: base_type( comp, a ) { }
|
||
|
|
||
|
template< class InputIterator >
|
||
|
ptr_map( InputIterator first, InputIterator last )
|
||
|
: base_type( first, last )
|
||
|
{ }
|
||
|
|
||
|
template< class InputIterator >
|
||
|
ptr_map( InputIterator first, InputIterator last,
|
||
|
const Compare& comp,
|
||
|
const Allocator& a = Allocator() )
|
||
|
: base_type( first, last, comp, a )
|
||
|
{ }
|
||
|
|
||
|
BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( ptr_map, base_type,
|
||
|
this_type )
|
||
|
|
||
|
template< class U >
|
||
|
ptr_map( const ptr_map<Key,U>& r ) : base_type( r )
|
||
|
{ }
|
||
|
|
||
|
ptr_map& operator=( ptr_map r )
|
||
|
{
|
||
|
this->swap( r );
|
||
|
return *this;
|
||
|
}
|
||
|
};
|
||
|
|
||
|
|
||
|
|
||
|
template
|
||
|
<
|
||
|
class Key,
|
||
|
class T,
|
||
|
class Compare = std::less<Key>,
|
||
|
class CloneAllocator = heap_clone_allocator,
|
||
|
class Allocator = std::allocator< std::pair<const Key,void*> >
|
||
|
>
|
||
|
class ptr_multimap :
|
||
|
public ptr_multimap_adapter<T,std::multimap<Key,void*,
|
||
|
Compare,Allocator>,CloneAllocator>
|
||
|
{
|
||
|
typedef ptr_multimap_adapter<T,std::multimap<Key,void*,
|
||
|
Compare,Allocator>,CloneAllocator>
|
||
|
base_type;
|
||
|
|
||
|
typedef ptr_multimap<Key,T,Compare,CloneAllocator,Allocator> this_type;
|
||
|
|
||
|
public:
|
||
|
ptr_multimap()
|
||
|
{ }
|
||
|
|
||
|
explicit ptr_multimap( const Compare& comp,
|
||
|
const Allocator& a = Allocator() )
|
||
|
: base_type( comp, a ) { }
|
||
|
|
||
|
template< class InputIterator >
|
||
|
ptr_multimap( InputIterator first, InputIterator last )
|
||
|
: base_type( first, last )
|
||
|
{ }
|
||
|
|
||
|
template< class InputIterator >
|
||
|
ptr_multimap( InputIterator first, InputIterator last,
|
||
|
const Compare& comp,
|
||
|
const Allocator& a = Allocator() )
|
||
|
: base_type( first, last, comp, a )
|
||
|
{ }
|
||
|
|
||
|
BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( ptr_multimap,
|
||
|
base_type,
|
||
|
this_type )
|
||
|
|
||
|
template< class U >
|
||
|
ptr_multimap( const ptr_multimap<Key,U>& r ) : base_type( r )
|
||
|
{ }
|
||
|
|
||
|
ptr_multimap& operator=( ptr_multimap r )
|
||
|
{
|
||
|
this->swap( r );
|
||
|
return *this;
|
||
|
}
|
||
|
};
|
||
|
|
||
|
//////////////////////////////////////////////////////////////////////////////
|
||
|
// clonability
|
||
|
|
||
|
template< class K, class T, class C, class CA, class A >
|
||
|
inline ptr_map<K,T,C,CA,A>* new_clone( const ptr_map<K,T,C,CA,A>& r )
|
||
|
{
|
||
|
return r.clone().release();
|
||
|
}
|
||
|
|
||
|
template< class K, class T, class C, class CA, class A >
|
||
|
inline ptr_multimap<K,T,C,CA,A>* new_clone( const ptr_multimap<K,T,C,CA,A>& r )
|
||
|
{
|
||
|
return r.clone().release();
|
||
|
}
|
||
|
|
||
|
/////////////////////////////////////////////////////////////////////////
|
||
|
// swap
|
||
|
|
||
|
template< typename K, typename T, typename C, typename CA, typename A >
|
||
|
inline void swap( ptr_map<K,T,C,CA,A>& l, ptr_map<K,T,C,CA,A>& r )
|
||
|
{
|
||
|
l.swap(r);
|
||
|
}
|
||
|
|
||
|
template< typename K, typename T, typename C, typename CA, typename A >
|
||
|
inline void swap( ptr_multimap<K,T,C,CA,A>& l, ptr_multimap<K,T,C,CA,A>& r )
|
||
|
{
|
||
|
l.swap(r);
|
||
|
}
|
||
|
|
||
|
|
||
|
}
|
||
|
|
||
|
#endif
|