|
MorphoGraphX
|
Implementation of a multiset using a sorted vector as container. More...
#include <SetVector.hpp>
Inheritance diagram for mgx::util::multiset_vector< Key, Compare, Allocator >:Public Types | |
| 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 | |
| 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 |
Iterators | |
| 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 |
Vector-like access | |
| 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. | |
Capacity | |
| bool | empty () const NOEXCEPT |
| size_type | size () const NOEXCEPT |
| size_type | max_size () const NOEXCEPT |
| void | reserve (size_type n) |
Modifiers | |
| 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 |
Observers | |
| key_compare | key_comp () const |
| value_compare | value_comp () const |
Set operations | |
| 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 |
| bool | operator== (const multiset_vector &v1, const multiset_vector &v2) |
| bool | operator!= (const multiset_vector &v1, const multiset_vector &v2) |
| bool | operator< (const multiset_vector &v1, const multiset_vector &v2) |
| bool | operator> (const multiset_vector &v1, const multiset_vector &v2) |
| bool | operator<= (const multiset_vector &v1, const multiset_vector &v2) |
| bool | operator>= (const multiset_vector &v1, const multiset_vector &v2) |
| content_t::iterator | remove_iterator_const (const_iterator it) |
| void | sort () |
| iterator | _find_insert_range (const_iterator first, const_iterator last, const value_type &value) const |
| const_iterator | _find_insert_hint (const_iterator hint, const value_type &value) |
| template<typename T > | |
| iterator | _insert_vector (const_iterator it, const T &value) |
| template<typename T > | |
| iterator | _insert (const T &value) |
| template<typename T > | |
| iterator | _insert_hint (const_iterator hint, const T &value) |
| bool | equiv_keys (const key_type &k1, const key_type &k2) const |
| bool | differ_keys (const key_type &k1, const key_type &k2) const |
| bool | compare (const key_type &k1, const key_type &k2) const |
Implementation of a multiset using a sorted vector as container.
1.8.11