MorphoGraphX
|
Implementation of a set using a sorted vector as container. More...
#include <SetVector.hpp>
Public Types | |
typedef super_type::key_type | key_type |
typedef super_type::value_type | value_type |
typedef super_type::key_compare | key_compare |
typedef super_type::value_compare | value_compare |
typedef super_type::allocator_type | allocator_type |
typedef super_type::reference | reference |
typedef super_type::const_reference | const_reference |
typedef super_type::pointer | pointer |
typedef super_type::const_pointer | const_pointer |
typedef super_type::iterator | iterator |
typedef super_type::const_iterator | const_iterator |
typedef super_type::size_type | size_type |
typedef super_type::difference_type | difference_type |
typedef super_type::reverse_iterator | reverse_iterator |
typedef super_type::const_reverse_iterator | const_reverse_iterator |
![]() | |
typedef Key | key_type |
typedef Key | value_type |
typedef Compare | key_compare |
typedef Compare | value_compare |
typedef Allocator | allocator_type |
typedef value_type & | reference |
typedef const value_type & | const_reference |
typedef allocator_type::pointer | pointer |
typedef allocator_type::const_pointer | const_pointer |
typedef content_t::const_iterator | iterator |
typedef content_t::const_iterator | const_iterator |
typedef content_t::size_type | size_type |
typedef content_t::difference_type | difference_type |
typedef std::reverse_iterator < iterator > | reverse_iterator |
typedef std::reverse_iterator < const_iterator > | const_reverse_iterator |
Public Member Functions | |
Construct/copy/destroy | |
set_vector (const Compare &comp=Compare(), const Allocator &alloc=Allocator()) | |
template<typename InputIterator > | |
set_vector (InputIterator first, InputIterator last, const Compare &comp=Compare(), const Allocator &alloc=Allocator()) | |
set_vector (const set_vector ©) | |
set_vector (const Allocator &alloc) | |
set_vector (const set_vector ©, const Allocator &alloc) | |
~set_vector () | |
set_vector & | operator= (const set_vector ©) |
Modifiers | |
std::pair< iterator, bool > | insert (const value_type &value) |
std::pair< iterator, bool > | insert (const_iterator pos, const value_type &value) |
template<typename InputIterator > | |
void | insert (InputIterator first, InputIterator last) |
size_type | erase (const key_type &x) |
void | swap (set_vector &other) |
![]() | |
multiset_vector (const Compare &comp=Compare(), const Allocator &alloc=Allocator()) | |
template<typename InputIterator > | |
multiset_vector (InputIterator first, InputIterator last, const Compare &comp=Compare(), const Allocator &alloc=Allocator()) | |
multiset_vector (const multiset_vector ©) | |
multiset_vector (const Allocator &alloc) | |
multiset_vector (const multiset_vector ©, const Allocator &alloc) | |
~multiset_vector () | |
multiset_vector & | operator= (const multiset_vector ©) |
allocator_type | get_allocator () const NOEXCEPT |
iterator | begin () NOEXCEPT |
iterator | end () NOEXCEPT |
const_iterator | begin () const NOEXCEPT |
const_iterator | end () const NOEXCEPT |
reverse_iterator | rbegin () NOEXCEPT |
reverse_iterator | rend () NOEXCEPT |
const_reverse_iterator | rbegin () const NOEXCEPT |
const_reverse_iterator | rend () const NOEXCEPT |
const_iterator | cbegin () const NOEXCEPT |
const_iterator | cend () const NOEXCEPT |
const_reverse_iterator | crbegin () const NOEXCEPT |
const_reverse_iterator | crend () const NOEXCEPT |
const_reference | operator[] (size_type i) const |
const_reference | at (size_type i) const |
const_pointer | data () const NOEXCEPT |
const_reference | front () const |
const_reference | back () const |
const content_t & | vector () const |
Return the underlying vector. | |
bool | empty () const NOEXCEPT |
size_type | size () const NOEXCEPT |
size_type | max_size () const NOEXCEPT |
void | reserve (size_type n) |
iterator | insert (const value_type &value) |
iterator | insert (const_iterator pos, const value_type &value) |
template<typename InputIterator > | |
void | insert (InputIterator first, InputIterator last) |
iterator | erase (const_iterator position) |
size_type | erase (const key_type &x) |
iterator | erase (const_iterator first, const_iterator last) |
void | swap (multiset_vector &other) |
void | clear () NOEXCEPT |
key_compare | key_comp () const |
value_compare | value_comp () const |
iterator | find (const key_type &k) |
const_iterator | find (const key_type &k) const |
size_type | count (const key_type &k) const |
iterator | lower_bound (const key_type &k) |
const_iterator | lower_bound (const key_type &k) const |
iterator | upper_bound (const key_type &k) |
const_iterator | upper_bound (const key_type &k) const |
std::pair< iterator, iterator > | equal_range (const key_type &k) |
std::pair< const_iterator, const_iterator > | equal_range (const key_type &k) const |
Implementation of a set using a sorted vector as container.