|
using | data_member = persistent_connection< T > |
|
using | value_type = T |
| So that back_inserter works.
|
|
using | derived_type = vector< T > |
|
using | base_type = basic_member< vector< T > > |
|
using | on_change = util::event< vector< T > & > |
|
using | connection = typename on_change::connection |
|
using | scoped_connection = typename on_change::scoped_connection |
|
using | callback_type = typename on_change::callback_type |
|
|
| vector (size_t elements, const T &t) |
|
| vector (size_t elements) |
|
template<typename It > |
| vector (It b, It e) |
|
template<size_t N> |
| vector (const T(&arr)[N]) |
|
| vector (const vector &other) |
|
vector & | operator= (const vector &other) |
| Not strongly exception safe.
|
|
const auto & | operator[] (size_t index) const |
|
auto & | operator[] (size_t index) |
|
auto & | front () |
|
const auto & | front () const |
|
auto & | back () |
|
const auto & | back () const |
|
auto | cbegin () const |
|
auto | begin () const |
|
auto | begin () |
|
auto | cend () const |
|
auto | end () const |
|
auto | end () |
|
void | reserve (size_t items) |
|
template<typename It > |
auto | insert (It it, const T &t) |
|
void | push_back (const value_type &t) |
|
void | pop_back () |
|
template<typename It > |
auto | erase (It it) |
|
void | resize (size_t new_size, const value_type &t) |
|
void | resize (size_t new_size) |
|
auto | size () const |
|
auto | empty () const |
|
void | clear () |
|
template<typename Archive > |
void | serialize (Archive &archive) |
|
bool | operator== (const vector &x) const |
|
bool | operator!= (const vector &x) const |
|
| basic_member (const basic_member &) |
|
basic_member & | operator= (const basic_member &) |
|
connection | connect (callback_type t) |
|
void | notify () |
|
size_t | connections () const |
|
template<typename T >
template<typename Archive >
Inspired by the cereal vector serialization methods.
The documentation for this class was generated from the following file:
- src/combined/include/combined/model/vector.h