Class template flat_set . Boost , Chapter 1. Boost.Compute , Reference

Class template flat_set

boost::compute::flat_set

Synopsis

// In header: <boost/compute/container/flat_set.hpp>
template<typename T> 
class flat_set {
public:
  // types
  typedef T                                   key_type;              
  typedef vector< T >::value_type             value_type;            
  typedef vector< T >::size_type              size_type;             
  typedef vector< T >::difference_type        difference_type;       
  typedef vector< T >::reference              reference;             
  typedef vector< T >::const_reference        const_reference;       
  typedef vector< T >::pointer                pointer;               
  typedef vector< T >::const_pointer          const_pointer;         
  typedef vector< T >::iterator               iterator;              
  typedef vector< T >::const_iterator         const_iterator;        
  typedef vector< T >::reverse_iterator       reverse_iterator;      
  typedef vector< T >::const_reverse_iterator const_reverse_iterator;
  // construct/copy/destruct
  explicit flat_set(const context & = system::default_context());
  flat_set(const flat_set< T > &);
  flat_set< T > & operator=(const flat_set< T > &);
  ~flat_set();
  // public member functions
  iterator begin();
  const_iterator begin() const;
  const_iterator cbegin() const;
  iterator end();
  const_iterator end() const;
  const_iterator cend() const;
  reverse_iterator rbegin();
  const_reverse_iterator rbegin() const;
  const_reverse_iterator crbegin() const;
  reverse_iterator rend();
  const_reverse_iterator rend() const;
  const_reverse_iterator crend() const;
  size_type size() const;
  size_type max_size() const;
  bool empty() const;
  size_type capacity() const;
  void reserve(size_type, command_queue &);
  void reserve(size_type);
  void shrink_to_fit();
  void clear();
  std::pair< iterator, bool > insert(const value_type &, command_queue &);
  std::pair< iterator, bool > insert(const value_type &);
  iterator erase(const const_iterator &, command_queue &);
  iterator erase(const const_iterator &);
  iterator erase(const const_iterator &, const const_iterator &, 
                 command_queue &);
  iterator erase(const const_iterator &, const const_iterator &);
  size_type erase(const key_type &, command_queue &);
  size_type erase(const key_type &);
  iterator find(const key_type &, command_queue &);
  iterator find(const key_type &);
  const_iterator find(const key_type &, command_queue &) const;
  const_iterator find(const key_type &) const;
  size_type count(const key_type &, command_queue &) const;
  size_type count(const key_type &) const;
  iterator lower_bound(const key_type &, command_queue &);
  iterator lower_bound(const key_type &);
  const_iterator lower_bound(const key_type &, command_queue &) const;
  const_iterator lower_bound(const key_type &) const;
  iterator upper_bound(const key_type &, command_queue &);
  iterator upper_bound(const key_type &);
  const_iterator upper_bound(const key_type &, command_queue &) const;
  const_iterator upper_bound(const key_type &) const;
};

Description

`flat_set` public construct/copy/destruct

explicitflat_set(constcontext&context=system::default_context());

<
```
flat_set(constflat_set<T>&other);
```
>

flat_set<T>&operator=(constflat_set<T>&other);

<
```
~flat_set();
```
>

`flat_set` public member functions

<
```
iteratorbegin();
```
>
<
```
const_iteratorbegin()const;
```
>
<
```
const_iteratorcbegin()const;
```
>
<
```
iteratorend();
```
>
<
```
const_iteratorend()const;
```
>
<
```
const_iteratorcend()const;
```
>
<
```
reverse_iteratorrbegin();
```
>
<
```
const_reverse_iteratorrbegin()const;
```
>
<
```
const_reverse_iteratorcrbegin()const;
```
>
<
```
reverse_iteratorrend();
```
>
<
```
const_reverse_iteratorrend()const;
```
>
<
```
const_reverse_iteratorcrend()const;
```
>
<
```
size_typesize()const;
```
>
<
```
size_typemax_size()const;
```
>
<
```
boolempty()const;
```
>
<
```
size_typecapacity()const;
```
>

voidreserve(size_typesize,command_queue&queue);

<
```
voidreserve(size_typesize);
```
>
<
```
voidshrink_to_fit();
```
>
<
```
voidclear();
```
>

std::pair<iterator,bool>
insert(constvalue_type&value,command_queue&queue);

std::pair<iterator,bool>insert(constvalue_type&value);

iteratorerase(constconst_iterator&position,command_queue&queue);

iteratorerase(constconst_iterator&position);

iteratorerase(constconst_iterator&first,constconst_iterator&last,
              command_queue&queue);

iteratorerase(constconst_iterator&first,constconst_iterator&last);

size_typeerase(constkey_type&value,command_queue&queue);

<
```
size_typeerase(constkey_type&value);
```
>

iteratorfind(constkey_type&value,command_queue&queue);

<
```
iteratorfind(constkey_type&value);
```
>

const_iteratorfind(constkey_type&value,command_queue&queue)const;

const_iteratorfind(constkey_type&value)const;

size_typecount(constkey_type&value,command_queue&queue)const;

size_typecount(constkey_type&value)const;

iteratorlower_bound(constkey_type&value,command_queue&queue);

iteratorlower_bound(constkey_type&value);

const_iterator
lower_bound(constkey_type&value,command_queue&queue)const;

const_iteratorlower_bound(constkey_type&value)const;

iteratorupper_bound(constkey_type&value,command_queue&queue);

iteratorupper_bound(constkey_type&value);

const_iterator
upper_bound(constkey_type&value,command_queue&queue)const;

const_iteratorupper_bound(constkey_type&value)const;

Статья Class template flat_set раздела Chapter 1. Boost.Compute Reference может быть полезна для разработчиков на c++ и boost.

Class template flat_set

Boost , Chapter 1. Boost.Compute , Reference

Boost C++ Libraries

Class template flat_set

Synopsis

Description

flat_set public construct/copy/destruct

flat_set public member functions

`flat_set` public construct/copy/destruct

`flat_set` public member functions