1 //---------------------------------------------------------------------------//
2 // Copyright (c) 2013 Kyle Lutz <kyle.r.lutz@gmail.com>
4 // Distributed under the Boost Software License, Version 1.0
5 // See accompanying file LICENSE_1_0.txt or copy at
6 // http://www.boost.org/LICENSE_1_0.txt
8 // See http://boostorg.github.com/compute for more information.
9 //---------------------------------------------------------------------------//
11 #ifndef BOOST_COMPUTE_CONTAINER_FLAT_SET_HPP
12 #define BOOST_COMPUTE_CONTAINER_FLAT_SET_HPP
17 #include <boost/compute/algorithm/find.hpp>
18 #include <boost/compute/algorithm/lower_bound.hpp>
19 #include <boost/compute/algorithm/upper_bound.hpp>
20 #include <boost/compute/container/vector.hpp>
30 typedef typename vector<T>::value_type value_type;
31 typedef typename vector<T>::size_type size_type;
32 typedef typename vector<T>::difference_type difference_type;
33 typedef typename vector<T>::reference reference;
34 typedef typename vector<T>::const_reference const_reference;
35 typedef typename vector<T>::pointer pointer;
36 typedef typename vector<T>::const_pointer const_pointer;
37 typedef typename vector<T>::iterator iterator;
38 typedef typename vector<T>::const_iterator const_iterator;
39 typedef typename vector<T>::reverse_iterator reverse_iterator;
40 typedef typename vector<T>::const_reverse_iterator const_reverse_iterator;
42 explicit flat_set(const context &context = system::default_context())
47 flat_set(const flat_set<T> &other)
48 : m_vector(other.m_vector)
52 flat_set<T>& operator=(const flat_set<T> &other)
55 m_vector = other.m_vector;
67 return m_vector.begin();
70 const_iterator begin() const
72 return m_vector.begin();
75 const_iterator cbegin() const
77 return m_vector.cbegin();
82 return m_vector.end();
85 const_iterator end() const
87 return m_vector.end();
90 const_iterator cend() const
92 return m_vector.cend();
95 reverse_iterator rbegin()
97 return m_vector.rbegin();
100 const_reverse_iterator rbegin() const
102 return m_vector.rbegin();
105 const_reverse_iterator crbegin() const
107 return m_vector.crbegin();
110 reverse_iterator rend()
112 return m_vector.rend();
115 const_reverse_iterator rend() const
117 return m_vector.rend();
120 const_reverse_iterator crend() const
122 return m_vector.crend();
125 size_type size() const
127 return m_vector.size();
130 size_type max_size() const
132 return m_vector.max_size();
137 return m_vector.empty();
140 size_type capacity() const
142 return m_vector.capacity();
145 void reserve(size_type size, command_queue &queue)
147 m_vector.reserve(size, queue);
150 void reserve(size_type size)
152 command_queue queue = m_vector.default_queue();
153 reserve(size, queue);
159 m_vector.shrink_to_fit();
167 std::pair<iterator, bool>
168 insert(const value_type &value, command_queue &queue)
170 iterator location = upper_bound(value, queue);
172 if(location != begin()){
173 value_type current_value;
174 ::boost::compute::copy_n(location - 1, 1, ¤t_value, queue);
175 if(value == current_value){
176 return std::make_pair(location - 1, false);
180 m_vector.insert(location, value, queue);
181 return std::make_pair(location, true);
184 std::pair<iterator, bool> insert(const value_type &value)
186 command_queue queue = m_vector.default_queue();
187 std::pair<iterator, bool> result = insert(value, queue);
192 iterator erase(const const_iterator &position, command_queue &queue)
194 return erase(position, position + 1, queue);
197 iterator erase(const const_iterator &position)
199 command_queue queue = m_vector.default_queue();
200 iterator iter = erase(position, queue);
205 iterator erase(const const_iterator &first,
206 const const_iterator &last,
207 command_queue &queue)
209 return m_vector.erase(first, last, queue);
212 iterator erase(const const_iterator &first, const const_iterator &last)
214 command_queue queue = m_vector.default_queue();
215 iterator iter = erase(first, last, queue);
220 size_type erase(const key_type &value, command_queue &queue)
222 iterator position = find(value, queue);
224 if(position == end()){
228 erase(position, queue);
233 size_type erase(const key_type &value)
235 command_queue queue = m_vector.default_queue();
236 size_type result = erase(value, queue);
241 iterator find(const key_type &value, command_queue &queue)
243 return ::boost::compute::find(begin(), end(), value, queue);
246 iterator find(const key_type &value)
248 command_queue queue = m_vector.default_queue();
249 iterator iter = find(value, queue);
254 const_iterator find(const key_type &value, command_queue &queue) const
256 return ::boost::compute::find(begin(), end(), value, queue);
259 const_iterator find(const key_type &value) const
261 command_queue queue = m_vector.default_queue();
262 const_iterator iter = find(value, queue);
267 size_type count(const key_type &value, command_queue &queue) const
269 return find(value, queue) != end() ? 1 : 0;
272 size_type count(const key_type &value) const
274 command_queue queue = m_vector.default_queue();
275 size_type result = count(value, queue);
280 iterator lower_bound(const key_type &value, command_queue &queue)
282 return ::boost::compute::lower_bound(begin(), end(), value, queue);
285 iterator lower_bound(const key_type &value)
287 command_queue queue = m_vector.default_queue();
288 iterator iter = lower_bound(value, queue);
293 const_iterator lower_bound(const key_type &value, command_queue &queue) const
295 return ::boost::compute::lower_bound(begin(), end(), value, queue);
298 const_iterator lower_bound(const key_type &value) const
300 command_queue queue = m_vector.default_queue();
301 const_iterator iter = lower_bound(value, queue);
306 iterator upper_bound(const key_type &value, command_queue &queue)
308 return ::boost::compute::upper_bound(begin(), end(), value, queue);
311 iterator upper_bound(const key_type &value)
313 command_queue queue = m_vector.default_queue();
314 iterator iter = upper_bound(value, queue);
319 const_iterator upper_bound(const key_type &value, command_queue &queue) const
321 return ::boost::compute::upper_bound(begin(), end(), value, queue);
324 const_iterator upper_bound(const key_type &value) const
326 command_queue queue = m_vector.default_queue();
327 const_iterator iter = upper_bound(value, queue);
336 } // end compute namespace
337 } // end boost namespace
339 #endif // BOOST_COMPUTE_CONTAINER_FLAT_SET_HPP