#include <mn_sorted_vector.hpp>
|
| bool | invariant () const |
| |
| | basic_vector (const allocator_type &allocator=allocator_type()) |
| |
| | basic_vector (size_type initialSize, const allocator_type &allocator=allocator_type()) |
| |
| | basic_vector (const_iterator first, const_iterator last, const allocator_type &allocator=allocator_type()) |
| |
| | basic_vector (const basic_vector &rhs, const allocator_type &allocator=allocator_type()) |
| |
| | ~basic_vector () |
| |
| void | copy (const basic_vector &rhs) |
| |
| iterator | begin () |
| |
| iterator | end () |
| |
| size_type | size () const |
| |
| bool | empty () const |
| |
| size_type | capacity () |
| |
| pointer | data () |
| |
| reference | front () |
| |
| const reference | cfront () |
| |
| reference | back () |
| |
| const reference | cback () |
| |
| reference | at (size_type i) |
| |
| const reference | const_at (size_type i) |
| |
| void | push_back (const_reference v) |
| |
| void | push_back (lreference v) |
| |
| void | push_back () |
| |
| void | pop_back () |
| |
| void | assign (const pointer first, const pointer last) |
| |
| void | insert (size_type index, size_type n, const reference val) |
| |
| void | insert (iterator it, size_type n, const reference val) |
| |
| iterator | insert (iterator it, const_reference val) |
| |
| iterator | erase (iterator it) |
| |
| iterator | erase (iterator first, iterator last) |
| |
| void | resize (size_type n) |
| |
| void | reserve (size_type n) |
| |
| void | clear () |
| |
| void | reset () |
| |
| void | set_capacity (size_type newCapacity) |
| |
| size_type | index_of (const reference item, size_type index=0) const |
| |
| iterator | find (const reference item) |
| |
| const allocator_type & | get_allocator () const |
| |
| void | set_allocator (const allocator_type &allocator) |
| |
| bool | validate_iterator (const_iterator it) const |
| |
| basic_vector & | operator= (const basic_vector &rhs) |
| |
| reference | operator[] (size_type i) |
| |
| const reference | operator[] (size_type i) const |
| |
◆ allocator_type
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ base_type
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ compare_type
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ const_iterator
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ iterator
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ key_type
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ mapped_type
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ pair_type
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ pointer
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ reference
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ size_type
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ value_type
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ basic_sorted_vector() [1/3]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ basic_sorted_vector() [2/3]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
template<class InputIterator >
◆ basic_sorted_vector() [3/3]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ begin()
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ capacity()
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ clear()
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ empty()
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ end()
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ erase() [1/2]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ erase() [2/2]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ find() [1/2]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ find() [2/2]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ get_allocator()
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ insert() [1/2]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ insert() [2/2]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ invariant()
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ lower_bound() [1/2]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ lower_bound() [2/2]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ operator=()
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ set_allocator()
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ size()
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ upper_bound() [1/2]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ upper_bound() [2/2]
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
◆ m_compare
template<typename TKey , typename TValue , class TAllocator , class TCompare = mn::less<TKey>, class TStorage = basic_vector_storage< basic_pair<TKey, TValue>, TAllocator>>
The documentation for this class was generated from the following file: