3 #ifndef CDSLIB_CONTAINER_STRIPED_MAP_BOOST_LIST_ADAPTER_H
4 #define CDSLIB_CONTAINER_STRIPED_MAP_BOOST_LIST_ADAPTER_H
6 #include <boost/version.hpp>
7 #if BOOST_VERSION < 104800
8 # error "For boost::container::list you must use boost 1.48 or above"
11 #include <functional> // ref
12 #include <algorithm> // std::lower_bound
13 #include <utility> // std::pair
14 #include <cds/container/striped_set/adapter.h>
15 #include <boost/container/list.hpp>
18 namespace cds { namespace container {
19 namespace striped_set {
21 // Copy policy for map
22 template <typename K, typename T, typename Alloc>
23 struct copy_item_policy< boost::container::list< std::pair< K const, T >, Alloc > >
25 typedef std::pair< K const, T> pair_type;
26 typedef boost::container::list< pair_type, Alloc > list_type;
27 typedef typename list_type::iterator iterator;
29 void operator()( list_type& list, iterator itInsert, iterator itWhat )
31 list.insert( itInsert, *itWhat );
35 // Swap policy for map
36 template <typename K, typename T, typename Alloc>
37 struct swap_item_policy< boost::container::list< std::pair< K const, T >, Alloc > >
39 typedef std::pair< K const, T> pair_type;
40 typedef boost::container::list< pair_type, Alloc > list_type;
41 typedef typename list_type::iterator iterator;
43 void operator()( list_type& list, iterator itInsert, iterator itWhat )
45 pair_type newVal( itWhat->first, typename pair_type::second_type() );
46 itInsert = list.insert( itInsert, newVal );
47 std::swap( itInsert->second, itWhat->second );
51 // Move policy for map
52 template <typename K, typename T, typename Alloc>
53 struct move_item_policy< boost::container::list< std::pair< K const, T >, Alloc > >
55 typedef std::pair< K const, T> pair_type;
56 typedef boost::container::list< pair_type, Alloc > list_type;
57 typedef typename list_type::iterator iterator;
59 void operator()( list_type& list, iterator itInsert, iterator itWhat )
61 list.insert( itInsert, std::move( *itWhat ) );
64 } // namespace striped_set
65 }} // namespace cds:container
67 namespace cds { namespace intrusive { namespace striped_set {
69 /// boost::container::list adapter for hash map bucket
70 template <typename Key, typename T, class Alloc, typename... Options>
71 class adapt< boost::container::list< std::pair<Key const, T>, Alloc>, Options... >
74 typedef boost::container::list< std::pair<Key const, T>, Alloc> container_type ; ///< underlying container type
77 /// Adapted container type
78 class adapted_container: public cds::container::striped_set::adapted_sequential_container
81 typedef typename container_type::value_type value_type ; ///< value type stored in the container
82 typedef typename value_type::first_type key_type;
83 typedef typename value_type::second_type mapped_type;
84 typedef typename container_type::iterator iterator ; ///< container iterator
85 typedef typename container_type::const_iterator const_iterator ; ///< container const iterator
87 static bool const has_find_with = true;
88 static bool const has_erase_with = true;
92 typedef typename cds::opt::details::make_comparator_from_option_list< value_type, Options... >::type key_comparator;
94 typedef typename cds::opt::select<
95 typename cds::opt::value<
96 typename cds::opt::find_option<
97 cds::opt::copy_policy< cds::container::striped_set::move_item >
101 , cds::container::striped_set::copy_item, cds::container::striped_set::copy_item_policy<container_type>
102 , cds::container::striped_set::swap_item, cds::container::striped_set::swap_item_policy<container_type>
103 , 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;
136 template <typename Q, typename Func>
137 bool insert( const Q& key, Func f )
139 iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate() );
140 if ( it == m_List.end() || key_comparator()( key, it->first ) != 0 ) {
141 //value_type newItem( key );
142 it = m_List.insert( it, value_type( key, mapped_type()) );
148 // key already exists
152 template <typename K, typename... Args>
153 bool emplace( K&& key, Args&&... args )
155 iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate() );
156 if ( it == m_List.end() || key_comparator()( key, it->first ) != 0 ) {
157 m_List.emplace( it, std::forward<K>(key), std::move( mapped_type( std::forward<Args>(args)... )) );
163 template <typename Q, typename Func>
164 std::pair<bool, bool> ensure( const Q& key, Func func )
166 iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, find_predicate() );
167 if ( it == m_List.end() || key_comparator()( key, it->first ) != 0 ) {
169 value_type newItem( key, mapped_type() );
170 it = m_List.insert( it, newItem );
173 return std::make_pair( true, true );
178 return std::make_pair( true, false );
182 template <typename Q, typename Func>
183 bool erase( Q const& key, Func f )
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 )
196 template <typename Q, typename Less, typename Func>
197 bool erase( Q const& key, Less pred, Func f )
199 iterator it = std::lower_bound( m_List.begin(), m_List.end(), key, pred );
200 if ( it == m_List.end() || pred( key, it->first ) || pred(it->first, key) )
210 template <typename Q, typename Func>
211 bool find( Q& val, Func f )
213 iterator it = std::lower_bound( m_List.begin(), m_List.end(), val, find_predicate() );
214 if ( it == m_List.end() || key_comparator()( val, it->first ) != 0 )
222 template <typename Q, typename Less, typename Func>
223 bool find( Q& val, Less pred, Func f )
225 iterator it = std::lower_bound( m_List.begin(), m_List.end(), val, pred );
226 if ( it == m_List.end() || pred( val, it->first ) || pred( it->first, val ) )
234 /// Clears the container
240 iterator begin() { return m_List.begin(); }
241 const_iterator begin() const { return m_List.begin(); }
242 iterator end() { return m_List.end(); }
243 const_iterator end() const { return m_List.end(); }
245 void move_item( adapted_container& /*from*/, iterator itWhat )
247 iterator it = std::lower_bound( m_List.begin(), m_List.end(), *itWhat, find_predicate() );
248 assert( it == m_List.end() || key_comparator()( itWhat->first, it->first ) != 0 );
250 copy_item()( m_List, it, itWhat );
255 return m_List.size();
260 typedef adapted_container type ; ///< Result of \p adapt metafunction
264 }}} // namespace cds::intrusive::striped_set
267 #endif // #ifndef CDSLIB_CONTAINER_STRIPED_MAP_BOOST_LIST_ADAPTER_H