Golias Engine
A C++ 20 'game engine' built with SDL3 with wide platform support.
Public Member Functions | List of all members
TypedArray< T > Class Template Reference

#include <vector.h>

Inheritance diagram for TypedArray< T >:

Public Member Functions

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)
 
min () const
 
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 >
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
 

Member Function Documentation

◆ 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()

template<typename T >
void TypedArray< T >::append ( const T &  value)

◆ append_array()

template<typename T >
void TypedArray< T >::append_array ( const TypedArray< T > &  other)

◆ count()

template<typename T >
int TypedArray< T >::count ( const T &  what) const

◆ duplicate()

template<typename T >
TypedArray< T > TypedArray< T >::duplicate ( bool  deep = false) const

◆ erase()

template<typename T >
void TypedArray< T >::erase ( size_t  position)

◆ filter()

template<typename T >
template<typename Func >
TypedArray< T > TypedArray< T >::filter ( Func  predicate) const

◆ find()

template<typename T >
int TypedArray< T >::find ( const T &  what,
int  from = 0 
) const

◆ first() [1/2]

template<typename T >
T & TypedArray< T >::first

◆ first() [2/2]

template<typename T >
const T & TypedArray< T >::first

◆ for_each()

template<typename T >
template<typename Func >
void TypedArray< T >::for_each ( Func  func)

◆ get() [1/2]

template<typename T >
T & TypedArray< T >::get ( size_t  index)

◆ get() [2/2]

template<typename T >
const T & TypedArray< T >::get ( size_t  index) const

◆ has()

template<typename T >
bool TypedArray< T >::has ( const T &  what) const

◆ is_empty()

template<typename T >
bool TypedArray< T >::is_empty

◆ last() [1/2]

template<typename T >
T & TypedArray< T >::last

◆ last() [2/2]

template<typename T >
const T & TypedArray< T >::last

◆ map()

template<typename T >
template<typename Func >
auto TypedArray< T >::map ( Func  func) const

◆ max()

template<typename T >
T TypedArray< T >::max

◆ min()

template<typename T >
T TypedArray< T >::min

◆ pop_front()

template<typename T >
void TypedArray< T >::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,
initial_value 
) const

◆ remove()

template<typename T >
void TypedArray< T >::remove ( size_t  position)

◆ remove_at()

template<typename T >
void TypedArray< T >::remove_at ( size_t  position)

◆ reverse()

template<typename T >
void TypedArray< T >::reverse

◆ rfind()

template<typename T >
int TypedArray< T >::rfind ( const T &  what) const

◆ slice()

template<typename T >
TypedArray< T > TypedArray< T >::slice ( int  begin_pos,
int  end_pos = INT32_MAX 
) const

◆ sort() [1/2]

template<typename T >
void TypedArray< T >::sort

◆ sort() [2/2]

template<typename T >
template<typename Func >
void TypedArray< T >::sort ( Func  comparator)

The documentation for this class was generated from the following file: