Collection of unique objects stored in an ordered vector.
More...
#include <vector_set.hpp>
|
typedef Vector_set | self_type |
|
typedef T | value_type |
|
typedef std::size_t | size_type |
|
typedef std::ptrdiff_t | difference_type |
|
typedef stor_t::iterator | iterator |
|
typedef stor_t::const_iterator | const_iterator |
|
|
iterator | begin () |
|
iterator | end () |
|
const_iterator | begin () const |
|
const_iterator | end () const |
|
value_type const & | front () const |
|
value_type const & | back () const |
|
std::size_t | size () const |
|
bool | empty () const |
|
void | reserve (const std::size_t n) |
|
void | pop_back () |
|
void | clear () |
|
template<class Iter > |
void | insert (Iter i1, Iter i2) |
|
std::pair< iterator, bool > | insert (value_type const &t) |
|
template<typename CompatType > |
unsigned | erase (CompatType const &t) |
|
template<typename CompatType > |
value_type const * | find (CompatType const &t) const |
|
value_type const & | operator[] (const std::size_t n) const |
|
value_type & | operator[] (const std::size_t n) |
|
value_type const & | at (const std::size_t n) const |
|
value_type & | at (const std::size_t n) |
|
bool | operator== (self_type const &vs2) const |
|
bool | operator< (self_type const &vs2) const |
|
template<class T, class Alloc = std::allocator<T>>
class vdj_pipe::detail::Vector_set< T, Alloc >
Collection of unique objects stored in an ordered vector.
template<class T, class Alloc = std::allocator<T>>
template<typename CompatType >
- Template Parameters
-
CompatType | less than comparable to value_type |
The documentation for this class was generated from the following file: