original::algorithms Class Reference

Collaboration diagram for original::algorithms:

Public Member Functions
template<typename TYPE>
auto	distance (const iterator< TYPE > &end, const iterator< TYPE > &begin) -> int64_t
template<typename TYPE>
original::iterator< TYPE > *	frontOf (const iterator< TYPE > &it, int64_t steps)
template<typename TYPE>
original::iterator< TYPE > *	backOf (const iterator< TYPE > &it, int64_t steps)
template<typename TYPE>
auto	find (const iterator< TYPE > &begin, const iterator< TYPE > &end, const TYPE &target) -> iterator< TYPE > *
template<typename TYPE>
auto	find (const iterator< TYPE > &begin, const uint32_t n, const TYPE &target) -> iterator< TYPE > *
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
auto	find (const iterator< TYPE > &begin, const iterator< TYPE > &end, const Callback &condition) -> iterator< TYPE > *
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
auto	find (const iterator< TYPE > &begin, const uint32_t n, const Callback &condition) -> iterator< TYPE > *
template<typename TYPE>
auto	count (const iterator< TYPE > &begin, const iterator< TYPE > &end, const TYPE &target) -> uint32_t
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
auto	count (const iterator< TYPE > &begin, const iterator< TYPE > &end, const Callback &condition) -> uint32_t
template<typename TYPE>
auto	equal (const iterator< TYPE > &begin1, const iterator< TYPE > &end1, const iterator< TYPE > &begin2, const iterator< TYPE > &end2) -> bool
template<typename TYPE, typename Callback> requires original::Operation<Callback, TYPE>
auto	forEach (const iterator< TYPE > &begin, const iterator< TYPE > &end, Callback operation) -> void
template<typename TYPE, typename Callback> requires original::Operation<Callback, TYPE>
auto	forEach (const iterator< TYPE > &begin, const uint32_t n, Callback operation) -> iterator< TYPE > *
template<typename TYPE, typename Callback_O, typename Callback_C> requires original::Operation<Callback_O, TYPE> && original::Condition<Callback_C, TYPE>
auto	forEach (const iterator< TYPE > &begin, const iterator< TYPE > &end, Callback_O operation, const Callback_C &condition) -> void
template<typename TYPE, typename Callback_O, typename Callback_C> requires original::Operation<Callback_O, TYPE> && original::Condition<Callback_C, TYPE>
auto	forEach (const iterator< TYPE > &begin, const uint32_t n, Callback_O operation, const Callback_C &condition) -> iterator< TYPE > *
template<typename TYPE>
auto	fill (const iterator< TYPE > &begin, const iterator< TYPE > &end, const TYPE &value) -> void
template<typename TYPE>
auto	fill (const iterator< TYPE > &begin, const uint32_t n, const TYPE &value) -> iterator< TYPE > *
template<typename TYPE>
auto	swap (const iterator< TYPE > &it1, const iterator< TYPE > &it2) noexcept -> void
template<typename TYPE>
auto	copy (const iterator< TYPE > &begin_src, const iterator< TYPE > &end_src, const iterator< TYPE > &begin_tar) -> iterator< TYPE > *
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
auto	copy (const iterator< TYPE > &begin_src, const iterator< TYPE > &end_src, const iterator< TYPE > &begin_tar, Callback condition) -> iterator< TYPE > *
template<typename TYPE>
auto	reverse (const iterator< TYPE > &begin, const iterator< TYPE > &end) -> iterator< TYPE > *
template<typename TYPE, typename Callback> requires original::Compare<Callback, TYPE>
auto	compare (const iterator< TYPE > &it1, const iterator< TYPE > &it2, const Callback &compares) -> bool
template<typename TYPE, typename Callback> requires original::Compare<Callback, TYPE>
auto	heapAdjustDown (const iterator< TYPE > &begin, const iterator< TYPE > &range, const iterator< TYPE > &current, const Callback &compares) -> void
template<typename TYPE, typename Callback> requires original::Compare<Callback, TYPE>
auto	heapAdjustUp (const iterator< TYPE > &begin, const iterator< TYPE > &current, const Callback &compares) -> void
template<typename TYPE, typename Callback> requires original::Compare<Callback, TYPE>
auto	heapInit (const iterator< TYPE > &begin, const iterator< TYPE > &end, const Callback &compares) -> void
template<typename TYPE, typename Callback> requires original::Compare<Callback, TYPE>
auto	heapGetPrior (const iterator< TYPE > &begin, const iterator< TYPE > &range, const iterator< TYPE > &parent, const Callback &compares) -> iterator< TYPE > *

Static Public Member Functions
template<typename TYPE>
static int64_t	distance (const iterator< TYPE > &end, const iterator< TYPE > &begin)
template<typename TYPE>
static iterator< TYPE > *	frontOf (const iterator< TYPE > &it, int64_t steps)
template<typename TYPE>
static iterator< TYPE > *	backOf (const iterator< TYPE > &it, int64_t steps)
template<typename TYPE, typename Callback> requires Condition<Callback, TYPE>
static bool	allOf (const iterator< TYPE > &begin, const iterator< TYPE > &end, const Callback &condition)
template<typename TYPE, typename Callback> requires Condition<Callback, TYPE>
static bool	anyOf (const iterator< TYPE > &begin, const iterator< TYPE > &end, const Callback &condition)
template<typename TYPE, typename Callback> requires Condition<Callback, TYPE>
static bool	noneOf (const iterator< TYPE > &begin, const iterator< TYPE > &end, const Callback &condition)
template<typename TYPE>
static iterator< TYPE > *	find (const iterator< TYPE > &begin, const iterator< TYPE > &end, const TYPE &target)
template<typename TYPE>
static iterator< TYPE > *	find (const iterator< TYPE > &begin, uint32_t n, const TYPE &target)
template<typename TYPE, typename Callback> requires Condition<Callback, TYPE>
static iterator< TYPE > *	find (const iterator< TYPE > &begin, const iterator< TYPE > &end, const Callback &condition)
template<typename TYPE, typename Callback> requires Condition<Callback, TYPE>
static iterator< TYPE > *	find (const iterator< TYPE > &begin, uint32_t n, const Callback &condition)
template<typename TYPE>
static uint32_t	count (const iterator< TYPE > &begin, const iterator< TYPE > &end, const TYPE &target)
template<typename TYPE, typename Callback> requires Condition<Callback, TYPE>
static uint32_t	count (const iterator< TYPE > &begin, const iterator< TYPE > &end, const Callback &condition)
template<typename TYPE>
static bool	equal (const iterator< TYPE > &begin1, const iterator< TYPE > &end1, const iterator< TYPE > &begin2, const iterator< TYPE > &end2)
template<typename TYPE, typename Callback> requires Operation<Callback, TYPE>
static void	forEach (const iterator< TYPE > &begin, const iterator< TYPE > &end, Callback operation)
template<typename TYPE, typename Callback> requires Operation<Callback, TYPE>
static iterator< TYPE > *	forEach (const iterator< TYPE > &begin, uint32_t n, Callback operation)
template<typename TYPE, typename Callback_O, typename Callback_C> requires Operation<Callback_O, TYPE> && Condition<Callback_C, TYPE>
static void	forEach (const iterator< TYPE > &begin, const iterator< TYPE > &end, Callback_O operation, const Callback_C &condition)
template<typename TYPE, typename Callback_O, typename Callback_C> requires Operation<Callback_O, TYPE> && Condition<Callback_C, TYPE>
static iterator< TYPE > *	forEach (const iterator< TYPE > &begin, uint32_t n, Callback_O operation, const Callback_C &condition)
template<typename TYPE>
static void	fill (const iterator< TYPE > &begin, const iterator< TYPE > &end, const TYPE &value=TYPE{})
template<typename TYPE>
static iterator< TYPE > *	fill (const iterator< TYPE > &begin, uint32_t n, const TYPE &value=TYPE{})
template<typename TYPE>
static void	swap (const iterator< TYPE > &it1, const iterator< TYPE > &it2) noexcept
template<typename TYPE>
static iterator< TYPE > *	copy (const iterator< TYPE > &begin_src, const iterator< TYPE > &end_src, const iterator< TYPE > &begin_tar)
template<typename TYPE, typename Callback> requires Condition<Callback, TYPE>
static iterator< TYPE > *	copy (const iterator< TYPE > &begin_src, const iterator< TYPE > &end_src, const iterator< TYPE > &begin_tar, Callback condition=filter< TYPE >{})
template<typename TYPE>
static iterator< TYPE > *	reverse (const iterator< TYPE > &begin, const iterator< TYPE > &end)
template<typename TYPE, typename Callback> requires Compare<Callback, TYPE>
static bool	compare (const iterator< TYPE > &it1, const iterator< TYPE > &it2, const Callback &compares)
template<typename TYPE, typename Callback> requires Compare<Callback, TYPE>
static void	heapAdjustDown (const iterator< TYPE > &begin, const iterator< TYPE > &range, const iterator< TYPE > &current, const Callback &compares)
template<typename TYPE, typename Callback> requires Compare<Callback, TYPE>
static void	heapAdjustUp (const iterator< TYPE > &begin, const iterator< TYPE > &current, const Callback &compares)
template<typename TYPE, typename Callback> requires Compare<Callback, TYPE>
static void	heapInit (const iterator< TYPE > &begin, const iterator< TYPE > &end, const Callback &compares)
template<typename TYPE>
static auto	distance (const iterator< TYPE > *end, const iterator< TYPE > *begin) -> int64_t
template<typename TYPE>
static auto	frontOf (const iterator< TYPE > *it, int64_t steps) -> iterator< TYPE > *
template<typename TYPE>
static auto	backOf (const iterator< TYPE > *it, int64_t steps) -> iterator< TYPE > *
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
static auto	allOf (const iterator< TYPE > *begin, const iterator< TYPE > *end, const Callback &condition) -> bool
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
static auto	anyOf (const iterator< TYPE > *begin, const iterator< TYPE > *end, const Callback &condition) -> bool
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
static auto	noneOf (const iterator< TYPE > *begin, const iterator< TYPE > *end, const Callback &condition) -> bool
template<typename TYPE>
static auto	find (const iterator< TYPE > *begin, const iterator< TYPE > *end, const TYPE &target) -> iterator< TYPE > *
template<typename TYPE>
static auto	find (const iterator< TYPE > *begin, uint32_t n, const TYPE &target) -> iterator< TYPE > *
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
static auto	find (const iterator< TYPE > *begin, const iterator< TYPE > *end, const Callback &condition) -> iterator< TYPE > *
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
static auto	find (const iterator< TYPE > *begin, uint32_t n, const Callback &condition) -> iterator< TYPE > *
template<typename TYPE>
static auto	count (const iterator< TYPE > *begin, const iterator< TYPE > *end, const TYPE &target) -> uint32_t
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
static auto	count (const iterator< TYPE > *begin, const iterator< TYPE > *end, const Callback &condition) -> uint32_t
template<typename TYPE>
static auto	equal (const iterator< TYPE > *begin1, const iterator< TYPE > *end1, const iterator< TYPE > *begin2, const iterator< TYPE > *end2) -> bool
template<typename TYPE, typename Callback> requires original::Operation<Callback, TYPE>
static auto	forEach (const iterator< TYPE > *begin, const iterator< TYPE > *end, Callback operation) -> void
template<typename TYPE, typename Callback> requires original::Operation<Callback, TYPE>
static auto	forEach (const iterator< TYPE > *begin, uint32_t n, Callback operation) -> iterator< TYPE > *
template<typename TYPE>
static auto	fill (const iterator< TYPE > *begin, const iterator< TYPE > *end, const TYPE &value) -> void
template<typename TYPE>
static auto	fill (const iterator< TYPE > *begin, uint32_t n, const TYPE &value) -> iterator< TYPE > *
template<typename TYPE>
static auto	swap (const iterator< TYPE > *it1, const iterator< TYPE > *it2) noexcept -> void
template<typename TYPE>
static auto	copy (const iterator< TYPE > *begin_src, const iterator< TYPE > *end_src, const iterator< TYPE > *begin_tar) -> iterator< TYPE > *
template<typename TYPE, typename Callback> requires original::Condition<Callback, TYPE>
static auto	copy (const iterator< TYPE > *begin_src, const iterator< TYPE > *end_src, const iterator< TYPE > *begin_tar, Callback condition) -> iterator< TYPE > *
template<typename TYPE>
static auto	reverse (const iterator< TYPE > *begin, const iterator< TYPE > *end) -> iterator< TYPE > *
template<typename TYPE, typename Callback> requires original::Compare<Callback, TYPE>
static auto	compare (const iterator< TYPE > *it1, const iterator< TYPE > *it2, const Callback &compares) -> bool
template<typename TYPE, typename Callback> requires original::Compare<Callback, TYPE>
static auto	heapAdjustDown (const iterator< TYPE > *begin, const iterator< TYPE > *range, const iterator< TYPE > *current, const Callback &compares) -> void
template<typename TYPE, typename Callback> requires original::Compare<Callback, TYPE>
static auto	heapAdjustUp (const iterator< TYPE > *begin, const iterator< TYPE > *current, const Callback &compares) -> void
template<typename TYPE, typename Callback> requires original::Compare<Callback, TYPE>
static auto	heapInit (const iterator< TYPE > *begin, const iterator< TYPE > *end, const Callback &compares) -> void
template<typename TYPE, typename Callback> requires original::Compare<Callback, TYPE>
static auto	heapGetPrior (const iterator< TYPE > *begin, const iterator< TYPE > *range, const iterator< TYPE > *parent, const Callback &compares) -> iterator< TYPE > *

Static Protected Member Functions
template<typename TYPE, typename Callback> requires Compare<Callback, TYPE>
static iterator< TYPE > *	heapGetPrior (const iterator< TYPE > &begin, const iterator< TYPE > &range, const iterator< TYPE > &parent, const Callback &compares)

Member Function Documentation

distance()

template<typename TYPE>

static auto original::algorithms::distance ( const iterator< TYPE > * end, const iterator< TYPE > * begin ) -> int64_t

inlinestatic

-— Implementation of pointer overload version. -—

---

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

• src/core/algorithms.h