2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
6 Source code repo: http://github.com/khizmax/libcds/
7 Download: http://sourceforge.net/projects/libcds/files/
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are met:
12 * Redistributions of source code must retain the above copyright notice, this
13 list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 this list of conditions and the following disclaimer in the documentation
17 and/or other materials provided with the distribution.
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
23 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #ifndef CDSLIB_CONTAINER_STRIPED_SET_STD_SET_ADAPTER_H
32 #define CDSLIB_CONTAINER_STRIPED_SET_STD_SET_ADAPTER_H
34 #include <cds/container/striped_set/adapter.h>
38 namespace cds { namespace container {
39 namespace striped_set {
41 // Copy policy for std::set
42 template <typename T, typename Traits, typename Alloc>
43 struct copy_item_policy< std::set< T, Traits, Alloc > >
45 typedef std::set< T, Traits, Alloc > set_type;
46 typedef typename set_type::iterator iterator;
48 void operator()( set_type& set, iterator itWhat )
50 set.insert( *itWhat );
54 template <typename T, typename Traits, typename Alloc>
55 struct swap_item_policy< std::set< T, Traits, Alloc > >: public copy_item_policy< std::set< T, Traits, Alloc > >
58 // Move policy for std::set
59 template <typename T, typename Traits, typename Alloc>
60 struct move_item_policy< std::set< T, Traits, Alloc > >
62 typedef std::set< T, Traits, Alloc > set_type;
63 typedef typename set_type::iterator iterator;
65 void operator()( set_type& set, iterator itWhat )
67 set.insert( std::move( *itWhat ));
70 } // namespace striped_set
71 }} // namespace cds::container
73 namespace cds { namespace intrusive { namespace striped_set {
75 /// std::set adapter for hash set bucket
76 template <typename T, class Traits, class Alloc, typename... Options>
77 class adapt< std::set<T, Traits, Alloc>, Options... >
80 typedef std::set<T, Traits, Alloc> container_type ; ///< underlying container type
83 /// Adapted container type
84 class adapted_container: public cds::container::striped_set::adapted_container
87 typedef typename container_type::value_type value_type ; ///< value type stored in the container
88 typedef typename container_type::iterator iterator ; ///< container iterator
89 typedef typename container_type::const_iterator const_iterator ; ///< container const iterator
91 static bool const has_find_with = false;
92 static bool const has_erase_with = false;
96 typedef typename cds::opt::select<
97 typename cds::opt::value<
98 typename cds::opt::find_option<
99 cds::opt::copy_policy< cds::container::striped_set::move_item >
103 , cds::container::striped_set::copy_item, cds::container::striped_set::copy_item_policy<container_type>
104 , cds::container::striped_set::swap_item, cds::container::striped_set::swap_item_policy<container_type>
105 , cds::container::striped_set::move_item, cds::container::striped_set::move_item_policy<container_type>
111 container_type m_Set;
116 template <typename Q, typename Func>
117 bool insert( const Q& val, Func f )
119 std::pair<iterator, bool> res = m_Set.insert( value_type(val));
121 f( const_cast<value_type&>(*res.first));
125 template <typename... Args>
126 bool emplace( Args&&... args )
128 std::pair<iterator, bool> res = m_Set.emplace( std::forward<Args>(args)... );
132 template <typename Q, typename Func>
133 std::pair<bool, bool> update( const Q& val, Func func, bool bAllowInsert )
135 if ( bAllowInsert ) {
136 std::pair<iterator, bool> res = m_Set.insert( value_type(val));
137 func( res.second, const_cast<value_type&>(*res.first), val );
138 return std::make_pair( true, res.second );
141 auto it = m_Set.find(value_type(val));
142 if ( it == m_Set.end())
143 return std::make_pair( false, false );
144 func( false, const_cast<value_type&>(*it), val );
145 return std::make_pair( true, false );
149 template <typename Q, typename Func>
150 bool erase( const Q& key, Func f )
152 iterator it = m_Set.find( value_type(key));
153 if ( it == m_Set.end())
155 f( const_cast<value_type&>(*it));
160 template <typename Q, typename Func>
161 bool find( Q& val, Func f )
163 iterator it = m_Set.find( value_type(val));
164 if ( it == m_Set.end())
166 f( const_cast<value_type&>(*it), val );
175 iterator begin() { return m_Set.begin(); }
176 const_iterator begin() const { return m_Set.begin(); }
177 iterator end() { return m_Set.end(); }
178 const_iterator end() const { return m_Set.end(); }
180 void move_item( adapted_container& /*from*/, iterator itWhat )
182 assert( m_Set.find( *itWhat ) == m_Set.end());
183 copy_item()( m_Set, itWhat );
193 typedef adapted_container type ; ///< Result of \p adapt metafunction
196 }}} // namespace cds::intrusive::striped_set
201 #endif // #ifndef CDSLIB_CONTAINER_STRIPED_SET_STD_SET_ADAPTER_H