italgorithms.H File Reference

#include <types.H>

Include dependency graph for italgorithms.H:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	Designar::DynArray< T >
class	Designar::SLList< T >

Namespaces
	Designar

Functions
template<typename RetT , class It >
RetT *	Designar::nth_ptr_it (const It &, const It &, nat_t)
template<typename RetT , class It >
RetT &	Designar::nth_it (const It &, const It &, nat_t)
template<class It , class Op >
void	Designar::for_each_it (const It &, const It &, Op &)
template<class It , class Op >
void	Designar::for_each_it (const It &, const It &, Op &&op=Op())
template<class It , class ContainerRet , class Pred >
ContainerRet	Designar::filter_it (const It &, const It &, Pred &)
template<class ContainerRet , class It , class Pred >
ContainerRet	Designar::filter_it (const It &, const It &, Pred &&pred=Pred())
template<class ContainerRet , class It , class Op >
ContainerRet	Designar::map_it (const It &, const It &, Op &)
template<class ContainerRet , class It , class Op >
ContainerRet	Designar::map_it (const It &, const It &, Op &&op=Op())
template<class ContainerRet , class It , class Op , class Pred >
ContainerRet	Designar::map_if_it (const It &, const It &, Op &, Pred &)
template<class ContainerRet , class It , class Op , class Pred >
ContainerRet	Designar::map_if_it (const It &, const It &, Op &, Pred &&pred=Pred())
template<class ContainerRet , class It , class Op , class Pred >
ContainerRet	Designar::map_if_it (const It &, const It &, Op &&, Pred &)
template<class ContainerRet , class It , class Op , class Pred >
ContainerRet	Designar::map_if_it (const It &, const It &, Op &&op=Op(), Pred &&pred=Pred())
template<typename RetT , class It , class Pred >
RetT *	Designar::search_ptr_it (const It &, const It &, Pred &)
template<typename RetT , class It , class Pred >
RetT *	Designar::search_ptr_it (const It &, const It &, Pred &&pred=Pred())
template<class It , class Pred >
bool	Designar::all_it (const It &, const It &, Pred &)
template<class It , class Pred >
bool	Designar::all_it (const It &, const It &, Pred &&pred=Pred())
template<class It , class Pred >
bool	Designar::exists_it (const It &, const It &, Pred &)
template<class It , class Pred >
bool	Designar::exists_it (const It &, const It &, Pred &&pred=Pred())
template<class It , class Pred >
bool	Designar::none_it (const It &, const It &, Pred &)
template<class It , class Pred >
bool	Designar::none_it (const It &, const It &, Pred &&pred=Pred())
template<typename RetT , class It , class Op >
RetT	Designar::fold_it (const It &, const It &, const RetT &, Op &)
template<typename RetT , class It , class Op >
RetT	Designar::fold_it (const It &, const It &, const RetT &, Op &&op=Op())
template<typename RetT , class It , class Op >
RetT	Designar::fold_it (const It &, const It &, RetT &&, Op &)
template<typename RetT , class It , class Op >
RetT	Designar::fold_it (const It &, const It &, RetT &&, Op &&op=Op())
template<class It , class Pred >
bool	Designar::remove_first_if_it (const It &, const It &, Pred &)
template<class It , class Pred >
bool	Designar::remove_first_if_it (const It &, const It &, Pred &&pred=Pred())
template<class It , class Pred >
void	Designar::remove_if_it (const It &, const It &, Pred &)
template<class It , class Pred >
void	Designar::remove_if_it (const It &, const It &, Pred &&pred=Pred())
template<class It1 , class It2 , class Eq >
bool	Designar::equal_it (const It1 &, const It1 &, const It2 &, const It2 &, Eq &)
template<class It1 , class It2 , class Eq >
bool	Designar::equal_it (const It1 &, const It1 &, const It2 &, const It2 &, Eq &&eq=Eq())
template<class It , class Cmp >
bool	Designar::is_sorted_it (const It &, const It &, Cmp &)
template<class It , class Cmp >
bool	Designar::is_sorted_it (const It &, const It &, Cmp &&cmp=Cmp())
template<typename T1 , typename T2 , class It1 , class It2 >
SLList< std::pair< T1, T2 > >	Designar::zip_it (const It1 &, const It1 &, const It2 &, const It2 &)
template<typename T1 , typename T2 , class It1 , class It2 >
SLList< std::pair< T1, T2 > >	Designar::zip_eq_it (const It1 &, const It1 &, const It2 &, const It2 &)
template<typename T1 , typename T2 , class It1 , class It2 >
SLList< std::pair< T1, T2 > >	Designar::zip_left_it (const It1 &, const It1 &, const It2 &, const It2 &)
template<typename T1 , typename T2 , class It1 , class It2 >
SLList< std::pair< T1, T2 > >	Designar::zip_right_it (const It1 &, const It1 &, const It2 &, const It2 &)
template<class ContainerType , class It >
ContainerType	Designar::to_container (const It &, const It &)
template<typename T , class It >
SLList< T >	Designar::to_list_it (const It &, const It &)
template<typename T , class It >
DynArray< T >	Designar::to_array_it (const It &, const It &)