williamr@2
|
1 |
//
|
williamr@2
|
2 |
// Boost.Pointer Container
|
williamr@2
|
3 |
//
|
williamr@2
|
4 |
// Copyright Thorsten Ottosen 2003-2005. Use, modification and
|
williamr@2
|
5 |
// distribution is subject to the Boost Software License, Version
|
williamr@2
|
6 |
// 1.0. (See accompanying file LICENSE_1_0.txt or copy at
|
williamr@2
|
7 |
// http://www.boost.org/LICENSE_1_0.txt)
|
williamr@2
|
8 |
//
|
williamr@2
|
9 |
// For more information, see http://www.boost.org/libs/ptr_container/
|
williamr@2
|
10 |
//
|
williamr@2
|
11 |
|
williamr@2
|
12 |
#ifndef BOOST_PTR_CONTAINER_PTR_MAP_HPP
|
williamr@2
|
13 |
#define BOOST_PTR_CONTAINER_PTR_MAP_HPP
|
williamr@2
|
14 |
|
williamr@2
|
15 |
#if defined(_MSC_VER) && (_MSC_VER >= 1200)
|
williamr@2
|
16 |
# pragma once
|
williamr@2
|
17 |
#endif
|
williamr@2
|
18 |
|
williamr@2
|
19 |
#include <map>
|
williamr@2
|
20 |
#include <boost/ptr_container/ptr_map_adapter.hpp>
|
williamr@2
|
21 |
|
williamr@2
|
22 |
namespace boost
|
williamr@2
|
23 |
{
|
williamr@2
|
24 |
|
williamr@2
|
25 |
template
|
williamr@2
|
26 |
<
|
williamr@2
|
27 |
class Key,
|
williamr@2
|
28 |
class T,
|
williamr@2
|
29 |
class Compare = std::less<Key>,
|
williamr@2
|
30 |
class CloneAllocator = heap_clone_allocator,
|
williamr@2
|
31 |
class Allocator = std::allocator< std::pair<const Key,void*> >
|
williamr@2
|
32 |
>
|
williamr@2
|
33 |
class ptr_map :
|
williamr@2
|
34 |
public ptr_map_adapter<T,std::map<Key,void*,
|
williamr@2
|
35 |
Compare,Allocator>,CloneAllocator>
|
williamr@2
|
36 |
{
|
williamr@2
|
37 |
typedef ptr_map_adapter<T,std::map<Key,void*,
|
williamr@2
|
38 |
Compare,Allocator>,CloneAllocator>
|
williamr@2
|
39 |
base_type;
|
williamr@2
|
40 |
|
williamr@2
|
41 |
typedef ptr_map<Key,T,Compare,CloneAllocator,Allocator> this_type;
|
williamr@2
|
42 |
|
williamr@2
|
43 |
public:
|
williamr@2
|
44 |
explicit ptr_map( const Compare& comp = Compare(),
|
williamr@2
|
45 |
const Allocator& a = Allocator() )
|
williamr@2
|
46 |
: base_type( comp, a ) { }
|
williamr@2
|
47 |
|
williamr@2
|
48 |
template< class InputIterator >
|
williamr@2
|
49 |
ptr_map( InputIterator first, InputIterator last,
|
williamr@2
|
50 |
const Compare& comp = Compare(),
|
williamr@2
|
51 |
const Allocator& a = Allocator() )
|
williamr@2
|
52 |
: base_type( first, last, comp, a )
|
williamr@2
|
53 |
{ }
|
williamr@2
|
54 |
|
williamr@2
|
55 |
BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( ptr_map, base_type,
|
williamr@2
|
56 |
this_type );
|
williamr@2
|
57 |
|
williamr@2
|
58 |
};
|
williamr@2
|
59 |
|
williamr@2
|
60 |
|
williamr@2
|
61 |
|
williamr@2
|
62 |
template
|
williamr@2
|
63 |
<
|
williamr@2
|
64 |
class Key,
|
williamr@2
|
65 |
class T,
|
williamr@2
|
66 |
class Compare = std::less<Key>,
|
williamr@2
|
67 |
class CloneAllocator = heap_clone_allocator,
|
williamr@2
|
68 |
class Allocator = std::allocator< std::pair<const Key,void*> >
|
williamr@2
|
69 |
>
|
williamr@2
|
70 |
class ptr_multimap :
|
williamr@2
|
71 |
public ptr_multimap_adapter<T,std::multimap<Key,void*,
|
williamr@2
|
72 |
Compare,Allocator>,CloneAllocator>
|
williamr@2
|
73 |
{
|
williamr@2
|
74 |
typedef ptr_multimap_adapter<T,std::multimap<Key,void*,
|
williamr@2
|
75 |
Compare,Allocator>,CloneAllocator>
|
williamr@2
|
76 |
base_type;
|
williamr@2
|
77 |
|
williamr@2
|
78 |
typedef ptr_multimap<Key,T,Compare,CloneAllocator,Allocator> this_type;
|
williamr@2
|
79 |
|
williamr@2
|
80 |
public:
|
williamr@2
|
81 |
explicit ptr_multimap( const Compare& comp = Compare(),
|
williamr@2
|
82 |
const Allocator& a = Allocator() )
|
williamr@2
|
83 |
: base_type( comp, a ) { }
|
williamr@2
|
84 |
|
williamr@2
|
85 |
template< class InputIterator >
|
williamr@2
|
86 |
ptr_multimap( InputIterator first, InputIterator last,
|
williamr@2
|
87 |
const Compare& comp = Compare(),
|
williamr@2
|
88 |
const Allocator& a = Allocator() )
|
williamr@2
|
89 |
: base_type( first, last, comp, a )
|
williamr@2
|
90 |
{ }
|
williamr@2
|
91 |
|
williamr@2
|
92 |
BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( ptr_multimap,
|
williamr@2
|
93 |
base_type,
|
williamr@2
|
94 |
this_type );
|
williamr@2
|
95 |
|
williamr@2
|
96 |
};
|
williamr@2
|
97 |
|
williamr@2
|
98 |
//////////////////////////////////////////////////////////////////////////////
|
williamr@2
|
99 |
// clonability
|
williamr@2
|
100 |
|
williamr@2
|
101 |
template< class K, class T, class C, class CA, class A >
|
williamr@2
|
102 |
inline ptr_map<K,T,C,CA,A>* new_clone( const ptr_map<K,T,C,CA,A>& r )
|
williamr@2
|
103 |
{
|
williamr@2
|
104 |
return r.clone().release();
|
williamr@2
|
105 |
}
|
williamr@2
|
106 |
|
williamr@2
|
107 |
template< class K, class T, class C, class CA, class A >
|
williamr@2
|
108 |
inline ptr_multimap<K,T,C,CA,A>* new_clone( const ptr_multimap<K,T,C,CA,A>& r )
|
williamr@2
|
109 |
{
|
williamr@2
|
110 |
return r.clone().release();
|
williamr@2
|
111 |
}
|
williamr@2
|
112 |
|
williamr@2
|
113 |
/////////////////////////////////////////////////////////////////////////
|
williamr@2
|
114 |
// swap
|
williamr@2
|
115 |
|
williamr@2
|
116 |
template< typename K, typename T, typename C, typename CA, typename A >
|
williamr@2
|
117 |
inline void swap( ptr_map<K,T,C,CA,A>& l, ptr_map<K,T,C,CA,A>& r )
|
williamr@2
|
118 |
{
|
williamr@2
|
119 |
l.swap(r);
|
williamr@2
|
120 |
}
|
williamr@2
|
121 |
|
williamr@2
|
122 |
template< typename K, typename T, typename C, typename CA, typename A >
|
williamr@2
|
123 |
inline void swap( ptr_multimap<K,T,C,CA,A>& l, ptr_multimap<K,T,C,CA,A>& r )
|
williamr@2
|
124 |
{
|
williamr@2
|
125 |
l.swap(r);
|
williamr@2
|
126 |
}
|
williamr@2
|
127 |
|
williamr@2
|
128 |
|
williamr@2
|
129 |
}
|
williamr@2
|
130 |
|
williamr@2
|
131 |
#endif
|