#include <array.H>

Inheritance diagram for Designar::DynArray< T >:

Collaboration diagram for Designar::DynArray< T >:

Classes
class	Iterator

Public Types
using	ItemType = T

using	KeyType = T

using	DataType = T

using	ValueType = T

using	SizeType = nat_t

Public Member Functions
	DynArray (nat_t cap)

	DynArray (nat_t cap, const T &init_val)

	DynArray ()

	DynArray (const DynArray &a)

	DynArray (DynArray &&a)

	DynArray (const std::initializer_list< T > &)

void	swap (DynArray &a)

nat_t	get_capacity () const

nat_t	size () const

bool	is_empty () const

void	clear ()

T &	get_first ()

const T &	get_first () const

T &	get_last ()

const T &	get_last () const

T &	insert (nat_t pos, const T &item)

T &	insert (nat_t pos, T &&item)

T &	insert (const T &item)

T &	insert (T &&item)

T &	append (const T &item)

T &	append (T &&item)

T	remove_pos (nat_t pos)

T	remove (T &item)

T	remove_pos_closing_breach (nat_t pos)

T	remove_closing_breach (T &item)

T	remove_first ()

T	remove_last ()

DynArray &	operator= (const DynArray &a)

DynArray &	operator= (DynArray &&a)

T &	at (nat_t i)

const T &	at (nat_t i) const

T &	operator[] (nat_t i)

const T &	operator[] (nat_t i) const

Iterator	begin ()

Iterator	begin () const

Iterator	end ()

Iterator	end () const

Public Member Functions inherited from Designar::ContainerAlgorithms< DynArray< T >, T >
T *	nth_ptr (nat_t i)

T &	nth (nat_t i)

const T &	nth (nat_t i) const

void	for_each (Op &op) const

void	for_each (Op &&op=Op()) const

ContainerRet	filter (Pred &pred) const

ContainerRet	filter (Pred &&pred=Pred()) const

ContainerRet	map (Op &op) const

ContainerRet	map (Op &&op=Op()) const

ContainerRet	map_if (Op &op, Pred &pred) const

ContainerRet	map_if (Op &op, Pred &&pred=Pred()) const

ContainerRet	map_if (Op &&op, Pred &pred) const

ContainerRet	map_if (Op &&op=Op(), Pred &&pred=Pred()) const

RetT	fold (const RetT &init_val, Op &op) const

RetT	fold (const RetT &init_val, Op &&op=Op()) const

RetT	fold (RetT &&init_val, Op &op) const

RetT	fold (RetT &&init_val, Op &&op=Op()) const

bool	all (Pred &pred) const

bool	all (Pred &&pred=Pred()) const

bool	exists (Pred &pred) const

bool	exists (Pred &&pred=Pred()) const

bool	none (Pred &pred) const

bool	none (Pred &&pred=Pred()) const

T *	search_ptr (Pred &pred) const

T *	search_ptr (Pred &&pred=Pred()) const

bool	remove_first_if (Pred &pred)

bool	remove_first_if (Pred &&pred=Pred())

void	remove_if (Pred &pred)

void	remove_if (Pred &&pred=Pred())

bool	equal (const ContainerType2 &c, Eq &eq) const

bool	equal (const ContainerType2 &c, Eq &&eq=Eq()) const

bool	is_sorted (Cmp &cmp) const

bool	is_sorted (Cmp &&cmp=Cmp()) const

SLList< std::pair< T, typename ContainerType2::KeyType > >	zip (const ContainerType2 &c) const

SLList< std::pair< T, typename ContainerType2::KeyType > >	zip_eq (const ContainerType2 &c) const

SLList< std::pair< T, typename ContainerType2::KeyType > >	zip_left (const ContainerType2 &c) const

SLList< std::pair< T, typename ContainerType2::KeyType > >	zip_right (const ContainerType2 &c) const

DynArray< T >	to_array () const

SLList< T >	to_list () const

Member Typedef Documentation

template<typename T>

using Designar::DynArray< T >::DataType = T

template<typename T>

using Designar::DynArray< T >::ItemType = T

template<typename T>

using Designar::DynArray< T >::KeyType = T

template<typename T>

using Designar::DynArray< T >::SizeType = nat_t

template<typename T>

using Designar::DynArray< T >::ValueType = T

Constructor & Destructor Documentation

template<typename T>

Designar::DynArray< T >::DynArray ( nat_t cap )

inline

template<typename T>

Designar::DynArray< T >::DynArray	(	nat_t	cap,
		const T &	init_val
	)

inline

template<typename T>

Designar::DynArray< T >::DynArray ( )

inline

template<typename T>

Designar::DynArray< T >::DynArray ( const DynArray< T > & a )

inline

template<typename T>

Designar::DynArray< T >::DynArray ( DynArray< T > && a )

inline

template<typename T>

Designar::DynArray< T >::DynArray ( const std::initializer_list< T > & l )

Member Function Documentation

template<typename T>

T& Designar::DynArray< T >::append ( const T & item )

inline

template<typename T>

T& Designar::DynArray< T >::append ( T && item )

inline

template<typename T>

T& Designar::DynArray< T >::at ( nat_t i )

inline

template<typename T>

const T& Designar::DynArray< T >::at ( nat_t i ) const

inline

template<typename T>

Iterator Designar::DynArray< T >::begin ( )

inline

template<typename T>

Iterator Designar::DynArray< T >::begin ( ) const

inline

template<typename T>

void Designar::DynArray< T >::clear ( )

inline

template<typename T>

Iterator Designar::DynArray< T >::end ( )

inline

template<typename T>

Iterator Designar::DynArray< T >::end ( ) const

inline

template<typename T>

nat_t Designar::DynArray< T >::get_capacity ( ) const

inline

template<typename T>

T& Designar::DynArray< T >::get_first ( )

inline

template<typename T>

const T& Designar::DynArray< T >::get_first ( ) const

inline

template<typename T>

T& Designar::DynArray< T >::get_last ( )

inline

template<typename T>

const T& Designar::DynArray< T >::get_last ( ) const

inline

template<typename T>

T& Designar::DynArray< T >::insert	(	nat_t	pos,
		const T &	item
	)

inline

template<typename T>

T& Designar::DynArray< T >::insert	(	nat_t	pos,
		T &&	item
	)

inline

template<typename T>

T& Designar::DynArray< T >::insert ( const T & item )

inline

template<typename T>

T& Designar::DynArray< T >::insert ( T && item )

inline

template<typename T>

bool Designar::DynArray< T >::is_empty ( ) const

inline

template<typename T>

DynArray& Designar::DynArray< T >::operator= ( const DynArray< T > & a )

inline

template<typename T>

DynArray& Designar::DynArray< T >::operator= ( DynArray< T > && a )

inline

template<typename T>

T& Designar::DynArray< T >::operator[] ( nat_t i )

inline

template<typename T>

const T& Designar::DynArray< T >::operator[] ( nat_t i ) const

inline

template<typename T>

T Designar::DynArray< T >::remove ( T & item )

inline

template<typename T>

T Designar::DynArray< T >::remove_closing_breach ( T & item )

inline

template<typename T>

T Designar::DynArray< T >::remove_first ( )

inline

template<typename T>

T Designar::DynArray< T >::remove_last ( )

inline

template<typename T>

T Designar::DynArray< T >::remove_pos ( nat_t pos )

inline

template<typename T>

T Designar::DynArray< T >::remove_pos_closing_breach ( nat_t pos )

inline

template<typename T>

nat_t Designar::DynArray< T >::size ( ) const

inline

template<typename T>

void Designar::DynArray< T >::swap ( DynArray< T > & a )

inline

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

include/array.H

Classes

Public Types

Public Member Functions

Member Typedef Documentation

Constructor & Destructor Documentation

Member Function Documentation