|
mdds
|
#include <delayed_delete_vector.hpp>
Public Member Functions | |
| delayed_delete_vector (size_t n, const T &val) | |
| delayed_delete_vector (size_t n) | |
| template<typename InputIt > | |
| delayed_delete_vector (InputIt first, InputIt last) | |
| iterator | begin () noexcept |
| iterator | end () noexcept |
| const_iterator | begin () const noexcept |
| const_iterator | end () const noexcept |
| reverse_iterator | rbegin () noexcept |
| const_reverse_iterator | rbegin () const noexcept |
| reverse_iterator | rend () noexcept |
| const_reverse_iterator | rend () const noexcept |
| reference | operator[] (size_type pos) |
| const_reference | operator[] (size_type pos) const |
| reference | at (size_type pos) |
| const_reference | at (size_type pos) const |
| void | push_back (const T &value) |
| void | push_back (T &&value) |
| void | swap (delayed_delete_vector &other) noexcept(std::is_nothrow_swappable_v< store_type >) |
| template<typename... Args> | |
| void | emplace_back (Args &&... args) |
| iterator | insert (iterator pos, const T &value) |
| iterator | insert (const_iterator pos, T &&value) |
| template<typename InputIt > | |
| void | insert (iterator pos, InputIt first, InputIt last) |
| void | resize (size_type count) |
| iterator | erase (iterator pos) |
| iterator | erase (iterator first, iterator last) |
| size_type | capacity () const noexcept |
| void | shrink_to_fit () |
| void | reserve (size_type new_cap) |
| size_type | size () const |
| template<typename InputIt > | |
| void | assign (InputIt first, InputIt last) |
| T * | data () |
| const T * | data () const |
Vector that delays deleting from the front of the vector, which avoids O(n^2) memory move operations when code needs to delete items from one element block and add to another element block.