|
| Vector (Vector< val::Value > &&v) |
| move constructor.
|
|
| Vector (const Vector< val::Value > &v, std::unique_ptr< baseallocator > &&alloc_p=nullptr) |
|
| Vector (size_t n=0, const val::Value &value=getInitValue< val::Value >(), std::unique_ptr< baseallocator > &&alloc_p=nullptr) |
| basic constructor with conditional initial value.
|
|
| Vector (rsv_t, size_t n, std::unique_ptr< baseallocator > &&alloc_p=nullptr) |
| basic constructor leaving the vector allocated but unininitialized.
|
|
| Vector (const vector_const_iterator< val::Value, O > &b, const vector_const_iterator< val::Value, O > &e, std::unique_ptr< baseallocator > &&alloc_p=nullptr) |
| vector_iterator constructor.
|
|
template<class InputIterator > |
| Vector (const InputIterator &b, const InputIterator &e, std::unique_ptr< baseallocator > &&alloc_p=nullptr) |
| std::vector iterator constructor.
|
|
| Vector (std::initializer_list< val::Value > l, std::unique_ptr< baseallocator > &&alloc_p=nullptr) |
|
| Vector (std::unique_ptr< baseallocator > &&alloc_p) |
| constructor from a mmapallocator.
|
|
void | swap (Vector< val::Value > &o) |
|
Vector & | operator= (Vector< val::Value > other) |
|
bool | isOrdered () |
|
void | at (arr::idx_type i, const val::Value &v) |
|
val::Value & | operator[] (size_t i) |
|
const val::Value & | operator[] (size_t i) const |
|
void | push_back (const val::Value &value) |
|
template<class InputIterator > |
vector_iterator< val::Value, O > | insert (vector_iterator< val::Value, O > position, InputIterator first, InputIterator last) |
|
vector_iterator< val::Value, O > | erase (const vector_iterator< val::Value, O > &position) |
|
vector_iterator< val::Value, O > | erase (const vector_iterator< val::Value, O > &first, const vector_iterator< val::Value, O > &last) |
|
| operator std::vector< val::Value > () const |
|
const val::Value & | front () const |
|
const val::Value & | back () const |
|
size_t | size () const |
|
void | forceUnOrdered () |
|
Vector< val::Value > & | assign (size_t count, const val::Value &value) |
|
Vector< val::Value > & | resize (size_t n, size_t from=0) |
|
Vector< val::Value > & | resize (size_t n, const value_type &v) |
|
bool | operator== (const Vector< val::Value, O > &v1) const |
|
template<typename AO = O> |
Vector & | sort () |
|
template<typename U , typename AO = O> |
Vector< U > | sort_idx (size_t base) |
|
void | deallocate () |
|
vector_iterator< val::Value, O > | begin () |
|
vector_iterator< val::Value, O > | end () |
|
vector_const_iterator< val::Value, O > | begin () const |
|
vector_const_iterator< val::Value, O > | end () const |
|
vector_const_iterator< val::Value, O > | cbegin () const |
|
vector_const_iterator< val::Value, O > | cend () const |
|
|
struct | vector_iterator< val::Value, O > |
|
struct | vector_const_iterator< val::Value, O > |
|
template<typename U , typename UO > |
void | setv (Vector< U, UO > &v, size_t i, const U &t) |
|
template<typename U , typename UO > |
void | setv_checkbefore (Vector< U, UO > &v, size_t i, const U &t) |
|