3 #ifndef __CDS_CONTAINER_STRIPED_MAP_STD_LIST_ADAPTER_H
4 #define __CDS_CONTAINER_STRIPED_MAP_STD_LIST_ADAPTER_H
6 #include <cds/container/striped_set/adapter.h>
9 #include <algorithm> // std::lower_bound
10 #include <utility> // std::pair
13 namespace cds { namespace container {
14 namespace striped_set {
16 // Copy policy for map
17 template <typename K, typename T, typename Alloc>
18 struct copy_item_policy< std::list< std::pair< K const, T >, Alloc > >
20 typedef std::pair< K const, T> pair_type;
21 typedef std::list< pair_type, Alloc > list_type;
22 typedef typename list_type::iterator iterator;
24 void operator()( list_type& list, iterator itInsert, iterator itWhat )
26 list.insert( itInsert, *itWhat );
30 // Swap policy for map
31 template <typename K, typename T, typename Alloc>
32 struct swap_item_policy< std::list< std::pair< K const, T >, Alloc > >
34 typedef std::pair< K const, T> pair_type;
35 typedef std::list< pair_type, Alloc > list_type;
36 typedef typename list_type::iterator iterator;
38 void operator()( list_type& list, iterator itInsert, iterator itWhat )
40 pair_type newVal( itWhat->first, typename pair_type::second_type() );
41 itInsert = list.insert( itInsert, newVal );
42 std::swap( itInsert->second, itWhat->second );
46 #ifdef CDS_MOVE_SEMANTICS_SUPPORT
47 // Move policy for map
48 template <typename K, typename T, typename Alloc>
49 struct move_item_policy< std::list< std::pair< K const, T >, Alloc > >
51 typedef std::pair< K const, T> pair_type;
52 typedef std::list< pair_type, Alloc > list_type;
53 typedef typename list_type::iterator iterator;
55 void operator()( list_type& list, iterator itInsert, iterator itWhat )
57 list.insert( itInsert, std::move( *itWhat ) );
61 } // namespace striped_set
62 }} // namespace cds:container
64 namespace cds { namespace intrusive { namespace striped_set {
66 /// std::list adapter for hash map bucket
67 template <typename Key, typename T, class Alloc, CDS_SPEC_OPTIONS>
68 class adapt< std::list< std::pair<Key const, T>, Alloc>, CDS_OPTIONS >
71 typedef std::list< std::pair<Key const, T>, Alloc> container_type ; ///< underlying container type
74 /// Adapted container type
75 class adapted_container: public cds::container::striped_set::adapted_sequential_container
78 typedef typename container_type::value_type value_type ; ///< value type stored in the container
79 typedef typename value_type::first_type key_type;
80 typedef typename value_type::second_type mapped_type;
81 typedef typename container_type::iterator iterator ; ///< container iterator
82 typedef typename container_type::const_iterator const_iterator ; ///< container const iterator
84 static bool const has_find_with = true;
85 static bool const has_erase_with = true;
89 typedef typename cds::opt::details::make_comparator_from_option_list< value_type, CDS_OPTIONS >::type key_comparator;
92 typedef typename cds::opt::select<
93 typename cds::opt::value<
94 typename cds::opt::find_option<
95 cds::opt::copy_policy< cds::container::striped_set::move_item >
99 , cds::container::striped_set::copy_item, cds::container::striped_set::copy_item_policy<container_type>
100 , cds::container::striped_set::swap_item, cds::container::striped_set::swap_item_policy<container_type>
101 #ifdef CDS_MOVE_SEMANTICS_SUPPORT
102 , cds::container::striped_set::move_item, cds::container::striped_set::move_item_policy<container_type>
106 struct find_predicate
108 bool operator()( value_type const& i1, value_type const& i2) const
110 return key_comparator()( i1.first, i2.first ) < 0;
113 template <typename Q>
114 bool operator()( Q const& i1, value_type const& i2) const
116 return key_comparator()( i1, i2.first ) < 0;
119 template <typename Q>
120 bool operator()( value_type const& i1, Q const& i2) const
122 return key_comparator()( i1.first, i2 ) < 0;
129 container_type m_List;
132 // In GCC (at least up to 4.7.x), the complexity of std::list::size() is O(N)
133 // (see http://gcc.gnu.org/bugzilla/show_bug.cgi?id=49561)
134 size_t m_nSize ; // list size
145 template <typename Q, typename Func>
146 bool insert( const Q& key, Func f )
148 iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate() );
149 if ( it == m_List.end() || key_comparator()( key, it->first ) != 0 ) {
150 //value_type newItem( key );
151 it = m_List.insert( it, value_type( key, mapped_type()) );
152 cds::unref( f )( *it );
160 // key already exists
164 # ifdef CDS_EMPLACE_SUPPORT
165 template <typename K, typename... Args>
166 bool emplace( K&& key, Args&&... args )
168 iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate() );
169 if ( it == m_List.end() || key_comparator()( key, it->first ) != 0 ) {
170 //value_type newItem( key );
171 it = m_List.emplace( it, value_type( std::forward<K>(key), std::move( mapped_type( std::forward<Args>(args)...) )) );
182 template <typename Q, typename Func>
183 std::pair<bool, bool> ensure( const Q& key, Func func )
185 iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate() );
186 if ( it == m_List.end() || key_comparator()( key, it->first ) != 0 ) {
188 value_type newItem( key, mapped_type() );
189 it = m_List.insert( it, newItem );
190 cds::unref( func )( true, *it );
194 return std::make_pair( true, true );
198 cds::unref( func )( false, *it );
199 return std::make_pair( true, false );
203 template <typename Q, typename Func>
204 bool erase( Q const& key, Func f )
206 iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate() );
207 if ( it == m_List.end() || key_comparator()( key, it->first ) != 0 )
211 cds::unref( f )( *it );
220 template <typename Q, typename Less, typename Func>
221 bool erase( Q const& key, Less pred, Func f )
223 iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, pred );
224 if ( it == m_List.end() || pred( key, it->first ) || pred( it->first, key ) )
228 cds::unref( f )( *it );
237 template <typename Q, typename Func>
238 bool find( Q& val, Func f )
240 iterator it = std::lower_bound( m_List.begin(), m_List.end(), val, find_predicate() );
241 if ( it == m_List.end() || key_comparator()( val, it->first ) != 0 )
245 cds::unref( f )( *it, val );
249 template <typename Q, typename Less, typename Func>
250 bool find( Q& val, Less pred, Func f )
252 iterator it = std::lower_bound( m_List.begin(), m_List.end(), val, pred );
253 if ( it == m_List.end() || pred( val, it->first ) || pred( it->first, val ) )
257 cds::unref( f )( *it, val );
266 iterator begin() { return m_List.begin(); }
267 const_iterator begin() const { return m_List.begin(); }
268 iterator end() { return m_List.end(); }
269 const_iterator end() const { return m_List.end(); }
271 void move_item( adapted_container& /*from*/, iterator itWhat )
273 iterator it = std::lower_bound( m_List.begin(), m_List.end(), *itWhat, find_predicate() );
274 assert( it == m_List.end() || key_comparator()( itWhat->first, it->first ) != 0 );
276 copy_item()( m_List, it, itWhat );
287 return m_List.size();
294 typedef adapted_container type ; ///< Result of \p adapt metafunction
297 }}} // namespace cds::intrusive::striped_set
301 #endif // #ifndef __CDS_CONTAINER_STRIPED_MAP_STD_LIST_ADAPTER_H