#include <vector.h>
|
| bool | is_empty () const |
| |
| void | push_front (const T &value) |
| |
| void | append (const T &value) |
| |
| void | append_array (const TypedArray< T > &other) |
| |
| void | pop_front () |
| |
| void | erase (size_t position) |
| |
| void | remove (size_t position) |
| |
| void | remove_at (size_t position) |
| |
| T & | get (size_t index) |
| |
| const T & | get (size_t index) const |
| |
| int | find (const T &what, int from=0) const |
| |
| int | rfind (const T &what) const |
| |
| bool | has (const T &what) const |
| |
| int | count (const T &what) const |
| |
| TypedArray< T > | duplicate (bool deep=false) const |
| |
| TypedArray< T > | slice (int begin_pos, int end_pos=INT32_MAX) const |
| |
| void | reverse () |
| |
| void | sort () |
| |
| template<typename Func > |
| void | sort (Func comparator) |
| |
| T | min () const |
| |
| T | max () const |
| |
| template<typename Func > |
| TypedArray< T > | filter (Func predicate) const |
| |
| template<typename Func > |
| auto | map (Func func) const |
| |
| template<typename Func > |
| void | for_each (Func func) |
| |
| template<typename U , typename Func > |
| U | reduce (Func func, U initial_value) const |
| |
| bool | all (std::function< bool(const T &)> predicate) const |
| |
| bool | any (std::function< bool(const T &)> predicate) const |
| |
| T & | first () |
| |
| const T & | first () const |
| |
| T & | last () |
| |
| const T & | last () const |
| |
◆ all()
template<typename T >
| bool TypedArray< T >::all |
( |
std::function< bool(const T &)> |
predicate | ) |
const |
◆ any()
template<typename T >
| bool TypedArray< T >::any |
( |
std::function< bool(const T &)> |
predicate | ) |
const |
◆ append()
◆ append_array()
◆ count()
template<typename T >
| int TypedArray< T >::count |
( |
const T & |
what | ) |
const |
◆ duplicate()
◆ erase()
◆ filter()
template<typename T >
template<typename Func >
◆ find()
template<typename T >
| int TypedArray< T >::find |
( |
const T & |
what, |
|
|
int |
from = 0 |
|
) |
| const |
◆ first() [1/2]
◆ first() [2/2]
◆ for_each()
template<typename T >
template<typename Func >
◆ get() [1/2]
◆ get() [2/2]
template<typename T >
| const T & TypedArray< T >::get |
( |
size_t |
index | ) |
const |
◆ has()
◆ is_empty()
◆ last() [1/2]
◆ last() [2/2]
◆ map()
template<typename T >
template<typename Func >
◆ max()
◆ min()
◆ pop_front()
◆ push_front()
template<typename T >
| void TypedArray< T >::push_front |
( |
const T & |
value | ) |
|
◆ reduce()
template<typename T >
template<typename U , typename Func >
| U TypedArray< T >::reduce |
( |
Func |
func, |
|
|
U |
initial_value |
|
) |
| const |
◆ remove()
◆ remove_at()
template<typename T >
| void TypedArray< T >::remove_at |
( |
size_t |
position | ) |
|
◆ reverse()
◆ rfind()
template<typename T >
| int TypedArray< T >::rfind |
( |
const T & |
what | ) |
const |
◆ slice()
◆ sort() [1/2]
◆ sort() [2/2]
template<typename T >
template<typename Func >
The documentation for this class was generated from the following file: