1. Epic GamesDeveloper
  3. Algo

Algo

Unreal Engine C++ API Reference > Runtime > Core

Filters

Classes

  Type Name Description
Public struct FKahnContext Some variables shared with subfunctions  
Public struct FMutuallyReachableVertexSetContext Scratch variables shared across multiple calls to FindMostIndependentMutuallyReachableVertexSet  
Public struct TLess    
Public struct TPlus TPlus specifically takes const T& and returns T.  
Public struct TTiedTupleAdder    

Typedefs

Name Description
FKahnHandle KahnTopologicalSort converts vertices and edges from ElementType to indexes of the vertex in the original UniqueRange of ElementType.

Enums

  Type Name Description
Public enum Algo::ENoRef A special enum indicating that reference should NOT be used when iterating a container.  
Public enum Algo::ETopologicalSort Flags for behavior of TopologicalSort; see the function comment in TopologicalSort.h  

Functions

  Type Name Description
Public function T

Algo::Accumulate ( const A& Input,
T Init,
OpT Op
)

 Sums a range by successively applying Op.
Public function T

Algo::Accumulate ( const A& Input,
T Init
)

 Sums a range.
Public function bool

Algo::AllOf ( const RangeType& Range,
ProjectionType Projection
)

 Checks if every projection of the elements in the range is truthy.
Public function bool

Algo::AllOf ( const RangeType& Range
)

 Checks if every element in the range is truthy.
Public function bool

Algo::AnyOf ( const RangeType& Range,
ProjectionType Projection,
ENoRef NoRef
)

 Checks if any projection of the elements in the range is truthy.
Public function bool

Algo::AnyOf ( const RangeType& Range,
ProjectionType Projection
)

 Checks if any projection of the elements in the range is truthy.
Public function bool

Algo::AnyOf ( const RangeType& Range
)

 Checks if any element in the range is truthy.
Public function decltype(GetNum(Range))

Algo::BinarySearch ( RangeType& Range,
const ValueType& Value,
SortPredicateType SortPredicate
)

 Returns index to the first found element matching a value in a range, the range must be sorted by <
Public function auto

Algo::BinarySearch ( RangeType& Range,
const ValueType& Value
)

  
Public function decltype(GetNum(Range))

Algo::BinarySearchBy ( RangeType& Range,
const ValueType& Value,
ProjectionType Projection,
SortPredicateType SortPredicate
)

 Returns index to the first found element with projected value matching Value in a range, the range must be sorted by predicate
Public function auto

Algo::BinarySearchBy ( RangeType& Range,
const ValueType& Value,
ProjectionType Projection
)

  
Public function bool

Algo::Compare ( InAT&& InputA,
InBT&& InputB
)

 Compares two contiguous containers using operator== to compare pairs of elements.
Public function bool

Algo::Compare ( InAT&& InputA,
InBT&& InputB,
PredicateT Predicate
)

 Compares two contiguous containers using a predicate to compare pairs of elements.
Public function bool

Algo::CompareBy ( InAT&& InputA,
InBT&& InputB,
ProjectionT Projection,
PredicateT Predicate
)

 Compares two contiguous containers using a predicate to compare pairs of projected elements.
Public function bool

Algo::CompareBy ( InAT&& InputA,
InBT&& InputB,
ProjectionT Projection
)

 Compares two contiguous containers using operator== to compare pairs of projected elements.
Public function bool

Algo::CompareByPredicate ( InAT&& InputA,
InBT&& InputB,
PredicateT Predicate
)

  
Public function int

Algo::CompareMap ( const MapType& A,
const MapType& B
)

  
Public function int

Algo::CompareMap ( const MapType& A,
const MapType& B,
KeyLessThanType KeyLessThan
)

  
Public function int

Algo::CompareMap ( const MapType& A,
const MapType& B,
KeyLessThanType KeyLessThan,
ValueLessThanType ValueLessThan
)

 Compares two unique-key maps (e.g. TMap) as if they were sorted arrays of key,value pairs sorted by Key and then by Value (almost, see note on sort order).
Public function int

Algo::CompareSet ( const SetType& A,
const SetType& B,
KeyLessThanType KeyLessThan
)

 Compares two sets (e.g. TSet) as if they were sorted arrays of keys (almost, see note on sort order).
Public function int

Algo::CompareSet ( const SetType& A,
const SetType& B
)

  
Public function void

Algo::Copy ( const InT& Input,
OutT& Output,
ENoRef NoRef
)

 Copies a range into a container.
Public function void

Algo::Copy ( const InT& Input,
OutT& Output
)

 Copies a range into a container
Public function void

Algo::CopyIf ( const InT& Input,
OutT& Output,
PredicateT Predicate
)

 Conditionally copies a range into a container
Public function SIZE_T

Algo::Count ( const InT& Input,
const ValueT& InValue
)

 Counts elements of a range that equal the supplied value
Public function SIZE_T

Algo::CountBy ( const InT& Input,
const ValueT& InValue,
ProjectionT Proj
)

 Counts elements of a range whose projection equals the supplied value
Public function SIZE_T

Algo::CountIf ( const InT& Input,
PredicateT Predicate
)

 Counts elements of a range that match a given predicate
Public function decltype(AlgoImpl::FindBy(Forward< RangeType >(Range), Value, FIdentityFunctor()))

Algo::Find ( RangeType&& Range,
const ValueType& Value
)

 Returns a pointer to the first element in the range which is equal to the given value.
Public function decltype(AlgoImpl::FindBy(Forward< RangeType >(Range), Value, MoveTemp(Proj)))

Algo::FindBy ( RangeType&& Range,
const ValueType& Value,
ProjectionType Proj
)

 Returns a pointer to the first element in the range whose projection is equal to the given value.
Public function decltype(AlgoImpl::FindByPredicate(Forward< RangeType >(Range), MoveTemp(Pred)))

Algo::FindByPredicate ( RangeType&& Range,
PredicateType Pred
)

 Returns a pointer to the first element in the range which matches the predicate.
Public function decltype(AlgoImpl::FindLastBy(GetData(Range), GetNum(Range), Value, FIdentityFunctor()))

Algo::FindLast ( RangeType&& Range,
const ValueType& Value
)

 Returns a pointer to the last element in the range which is equal to the given value.
Public function decltype(AlgoImpl::FindLastBy(GetData(Range), GetNum(Range), Value, MoveTemp(Proj)))

Algo::FindLastBy ( RangeType&& Range,
const ValueType& Value,
ProjectionType Proj
)

 Returns a pointer to the last element in the range whose projection is equal to the given value.
Public function decltype(AlgoImpl::FindLastByPredicate(GetData(Range), GetNum(Range), MoveTemp(Pred)))

Algo::FindLastByPredicate ( RangeType&& Range,
PredicateType Pred
)

 Returns a pointer to the last element in the range which matches the predicate.
Public function decltype(AlgoImpl::FindSequence(GetData(Where), GetData(Where)+GetNum(Where), GetData(What), GetData...

Algo::FindSequence ( const RangeWhereType& Where,
const RangeWhatType& What
)

 Searches for the first occurrence of a sequence of elements in another sequence.
Public function int32

Algo::FindSortedStringCaseInsensitive ( const TCHAR* Str,
const TCHAR*const (&) SortedArray
)

 Finds a string in an array of sorted strings, by case-insensitive search, by using binary subdivision of the array.
Public function void

Algo::ForEach ( InT& Input,
CallableT Callable
)

 Invokes a callable to each element in a range
Public function void

Algo::ForEachIf ( InT& Input,
PredicateT Predicate,
CallableT Callable
)

 Conditionally invokes a callable to each element in a range
Public function void

Algo::Heapify ( RangeType& Range
)

 Builds an implicit min-heap from a range of elements.
Public function void

Algo::Heapify ( RangeType& Range,
PredicateType Predicate
)

 Builds an implicit min-heap from a range of elements.
Public function void

Algo::HeapifyBy ( RangeType& Range,
ProjectionType Projection
)

 Builds an implicit min-heap from a range of elements.
Public function void

Algo::HeapifyBy ( RangeType& Range,
ProjectionType Projection,
PredicateType Predicate
)

 Builds an implicit min-heap from a range of elements.
Public function void

Algo::HeapSort ( RangeType&& Range
)

 Performs heap sort on the elements. Assumes < operator is defined for the element type.
Public function void

Algo::HeapSort ( RangeType&& Range,
PredicateType Predicate
)

 Performs heap sort on the elements.
Public function void

Algo::HeapSortBy ( RangeType&& Range,
ProjectionType Projection,
PredicateType Predicate
)

 Performs heap sort on the elements.
Public function void

Algo::HeapSortBy ( RangeType&& Range,
ProjectionType Projection
)

 Performs heap sort on the elements. Assumes < operator is defined for the projected element type.
Public function bool

Algo::Includes ( RangeTypeA&& RangeA,
RangeTypeB&& RangeB,
SortPredicateType SortPredicate
)

 Checks if one sorted contiguous container is a subsequence of another sorted contiguous container by comparing pairs of elements using a custom predicate.
Public function bool

Algo::Includes ( RangeTypeA&& RangeA,
RangeTypeB&& RangeB
)

 Checks if one sorted contiguous container is a subsequence of another sorted contiguous container by comparing pairs of elements.
Public function bool

Algo::IncludesBy ( RangeTypeA&& RangeA,
RangeTypeB&& RangeB,
ProjectionType Projection
)

 Checks if one sorted contiguous container is a subsequence of another sorted contiguous container by comparing pairs of projected elements.
Public function bool

Algo::IncludesBy ( RangeTypeA&& RangeA,
RangeTypeB&& RangeB,
ProjectionType Projection,
SortPredicateType SortPredicate
)

 Checks if one sorted contiguous container is a subsequence of another sorted contiguous container by comparing pairs of projected elements using a custom predicate.
Public function auto

Algo::IndexOf ( RangeType&& Range,
const ValueType& Value
)

 Returns the index of the first element in the range which is equal to the given value.
Public function auto

Algo::IndexOfBy ( RangeType&& Range,
const ValueType& Value,
ProjectionType Proj
)

 Returns the index of the first element in the range whose projection is equal to the given value.
Public function auto

Algo::IndexOfByPredicate ( RangeType&& Range,
PredicateType Pred
)

 Returns the index of the first element in the range which matches the predicate.
Public function void

Algo::IntroSort ( RangeType&& Range
)

 Sort a range of elements using its operator<. The sort is unstable.
Public function void

Algo::IntroSort ( RangeType&& Range,
PredicateType Predicate
)

 Sort a range of elements using a user-defined predicate class. The sort is unstable.
Public function void

Algo::IntroSortBy ( RangeType&& Range,
ProjectionType Projection
)

 Sort a range of elements by a projection using the projection's operator<. The sort is unstable.
Public function void

Algo::IntroSortBy ( RangeType&& Range,
ProjectionType Projection,
PredicateType Predicate
)

 Sort a range of elements by a projection using a user-defined predicate class.
Public function bool

Algo::IsHeap ( RangeType& Range
)

 Verifies that the range is a min-heap (parent <= child).
Public function bool

Algo::IsHeap ( RangeType& Range,
PredicateType Predicate
)

 Verifies that the range is a min-heap (parent <= child)
Public function bool

Algo::IsHeapBy ( RangeType& Range,
ProjectionType Projection
)

 Verifies that the range is a min-heap (parent <= child).
Public function bool

Algo::IsHeapBy ( RangeType& Range,
ProjectionType Projection,
PredicateType Predicate
)

 Verifies that the range is a min-heap (parent <= child)
Public function bool

Algo::IsSorted ( const RangeType& Range
)

 Tests if a range is sorted by its element type's operator<.
Public function bool

Algo::IsSorted ( const RangeType& Range,
PredType Pred
)

 Tests if a range is sorted by a user-defined predicate.
Public function bool

Algo::IsSortedBy ( const RangeType& Range,
ProjectionType Projection
)

 Tests if a range is sorted by a projection of the element type, using the projection's operator<.
Public function bool

Algo::IsSortedBy ( const RangeType& Range,
ProjectionType Projection,
PredType Pred
)

 Tests if a range is sorted by a projection of the element type, using a user-defined predicate on the projection.
Public function bool

Algo::KahnTopologicalSort ( RangeType& UniqueRange,
GetElementDependenciesType GetElementDependencies,
ETopologicalSort Flags
)

 Public entrypoint.
Public function void

Algo::LegacySort ( RangeType&& Range
)

 Sort a range of elements using its operator<.
Public function void

Algo::LegacySort ( RangeType&& Range,
PredicateType Pred
)

 Sort a range of elements using a user-defined predicate class.
Public function void

Algo::LegacySortBy ( RangeType&& Range,
ProjectionType Proj
)

 Sort a range of elements by a projection using the projection's operator<.
Public function void

Algo::LegacySortBy ( RangeType&& Range,
ProjectionType Proj,
PredicateType Pred
)

 Sort a range of elements by a projection using a user-defined predicate class.
Public function int32

Algo::LevenshteinDistance ( const RangeAType& RangeA,
const RangeBType& RangeB
)

 LevenshteinDistance return the number of edit operation we need to transform RangeA to RangeB.
Public function decltype(GetNum(Range))

Algo::LowerBound ( RangeType& Range,
const ValueType& Value
)

  
Public function decltype(GetNum(Range))

Algo::LowerBound ( RangeType& Range,
const ValueType& Value,
SortPredicateType SortPredicate
)

 Performs binary search, resulting in position of the first element >= Value using predicate
Public function decltype(GetNum(Range))

Algo::LowerBoundBy ( RangeType& Range,
const ValueType& Value,
ProjectionType Projection
)

  
Public function decltype(GetNum(Range))

Algo::LowerBoundBy ( RangeType& Range,
const ValueType& Value,
ProjectionType Projection,
SortPredicateType SortPredicate
)

 Performs binary search, resulting in position of the first element with projected value >= Value using predicate
Public function decltype(AlgoImpl::MaxElementBy(Range, FIdentityFunctor(), MoveTemp(Comp)))

Algo::MaxElement ( RangeType& Range,
ComparatorType Comp
)

 Returns a pointer to the maximum element in a range with a user-defined binary comparator.
Public function decltype(AlgoImpl::MaxElementBy(Range, FIdentityFunctor(), TLess<>()))

Algo::MaxElement ( RangeType& Range
)

 Returns a pointer to the maximum element in a range.
Public function decltype(AlgoImpl::MaxElementBy(Range, MoveTemp(Proj), TLess<>()))

Algo::MaxElementBy ( RangeType& Range,
ProjectionType Proj
)

 Returns a pointer to the maximum element in a range with a user-defined binary comparator.
Public function decltype(AlgoImpl::MaxElementBy(Range, MoveTemp(Proj), MoveTemp(Comp)))

Algo::MaxElementBy ( RangeType& Range,
ProjectionType Proj,
ComparatorType Comp
)

 Returns a pointer to the maximum element in a range with a user-defined binary comparator.
Public function decltype(AlgoImpl::MinElementBy(Range, FIdentityFunctor(), TLess<>()))

Algo::MinElement ( RangeType& Range
)

 Returns a pointer to the minimum element in a range.
Public function decltype(AlgoImpl::MinElementBy(Range, FIdentityFunctor(), MoveTemp(Comp)))

Algo::MinElement ( RangeType& Range,
ComparatorType Comp
)

 Returns a pointer to the minimum element in a range with a user-defined binary comparator.
Public function decltype(AlgoImpl::MinElementBy(Range, MoveTemp(Proj), TLess<>()))

Algo::MinElementBy ( RangeType& Range,
ProjectionType Proj
)

 Returns a pointer to the minimum element in a range with a user-defined binary comparator.
Public function decltype(AlgoImpl::MinElementBy(Range, MoveTemp(Proj), MoveTemp(Comp)))

Algo::MinElementBy ( RangeType& Range,
ProjectionType Proj,
ComparatorType Comp
)

 Returns a pointer to the minimum element in a range with a user-defined binary comparator.
Public function std::common_type_t< decltype(GetNum(InputA)), decltype(GetNum(InputB))>

Algo::Mismatch ( InputAType&& InputA,
InputBType&& InputB,
PredicateType Predicate
)

 Returns the index at which two contiguous containers differ, using operator== to compare pairs of elements.
Public function std::common_type_t< decltype(GetNum(InputA)), decltype(GetNum(InputB))>

Algo::Mismatch ( InputAType&& InputA,
InputBType&& InputB
)

 Returns the index at which two contiguous containers differ, using operator== to compare pairs of elements.
Public function std::common_type_t< decltype(GetNum(InputA)), decltype(GetNum(InputB))>

Algo::MismatchBy ( InputAType&& InputA,
InputBType&& InputB,
ProjectionType Projection,
PredicateType Predicate
)

 Returns the index at which two contiguous containers differ, using a predicate to compare pairs of projected elements.
Public function std::common_type_t< decltype(GetNum(InputA)), decltype(GetNum(InputB))>

Algo::MismatchBy ( InputAType&& InputA,
InputBType&& InputB,
ProjectionType Projection
)

 Returns the index at which two contiguous containers differ, using operator== to compare pairs of projected elements.
Public function bool

Algo::NoneOf ( const RangeType& Range,
ProjectionType Projection,
ENoRef NoRef
)

 Checks if no projection of the elements in the range is truthy.
Public function bool

Algo::NoneOf ( const RangeType& Range,
ProjectionType Projection
)

 Checks if no projection of the elements in the range is truthy.
Public function bool

Algo::NoneOf ( const RangeType& Range
)

 Checks if no element in the range is truthy.
Public function bool  
Public function ETopologicalSort  
Public function ETopologicalSort &  
Public function ETopologicalSort  
Public function ETopologicalSort &  
Public function ETopologicalSort  
Public function ETopologicalSort &  
Public function ETopologicalSort  
Public function IndexType

Algo::Partition ( T* Elements,
const IndexType Num,
UnaryPredicate Predicate
)

 Rearranges the elements so that all the elements for which Predicate returns true precede all those for which it returns false.
Public function decltype(GetNum(Range))

Algo::Partition ( RangeType&& Range,
UnaryPredicateType Predicate
)

 Rearranges the elements so that all the elements for which Predicate returns true precede all those for which it returns false.
Public function bool

Algo::Private::Compare ( InAT&& InputA,
InBT&& InputB,
ProjectionT Projection,
PredicateT Predicate
)

  
Public function bool

Algo::Private::Includes ( const DataTypeA* DataA,
SizeTypeA NumA,
const DataTypeB* DataB,
SizeTypeB NumB,
ProjectionType Projection,
SortPredicateType SortPredicate
)

  
Public function auto

Algo::Private::Mismatch ( InputAType&& InputA,
InputBType&& InputB,
ProjectionType Projection,
PredicateType Predicate
)

  
Public function void

Algo::RandomShuffle ( RangeType& Range
)

 Randomly shuffle a range of elements.
Public function int32

Algo::RemoveIf ( RangeType& Range,
Predicate Pred
)

 Moves all elements which do not match the predicate to the front of the range, while leaving all other elements is a constructed but unspecified state.
Public function void

Algo::Replace ( RangeType&& Range,
const ValueType& InOld,
const ValueType& InNew
)

 Replaces all elements that compare equal to one value with a new value.
Public function void

Algo::ReplaceIf ( RangeType&& Range,
PredicateType InPred,
const ValueType& InNew
)

 Replaces all elements that satisfy the predicate with the given value.
Public function void

Algo::Reverse ( T(&) Array
)

 Reverses a range
Public function void

Algo::Reverse ( ContainerType& Container
)

 Reverses a range
Public function void

Algo::Reverse ( T* Array,
int32 ArraySize
)

 Reverses a range
Public function int32

Algo::Rotate ( RangeType& Range,
int32 Count
)

 Rotates a given amount of elements from the front of the range to the end of the range.
Public function decltype(AlgoImpl::SelectRandomWeightedBy(Forward< RangeType >(Range), MoveTemp(Proj)))

Algo::SelectRandomWeightedBy ( RangeType&& Range,
ProjectionType Proj
)

 Randomly select an element from a range of elements, weighted by a projection.
Public function void

Algo::Sort ( RangeType&& Range,
PredicateType Pred
)

 Sort a range of elements using a user-defined predicate class. The sort is unstable.
Public function void

Algo::Sort ( RangeType&& Range
)

 Sort a range of elements using its operator<. The sort is unstable.
Public function void

Algo::SortBy ( RangeType&& Range,
ProjectionType Proj,
PredicateType Pred
)

 Sort a range of elements by a projection using a user-defined predicate class.
Public function void

Algo::SortBy ( RangeType&& Range,
ProjectionType Proj
)

 Sort a range of elements by a projection using the projection's operator<. The sort is unstable.
Public function int32

Algo::StableRemoveIf ( RangeType& Range,
Predicate Pred
)

 Moves all elements which do not match the predicate to the front of the range, while leaving all other elements is a constructed but unspecified state.
Public function void

Algo::StableSort ( RangeType&& Range
)

 Sort a range of elements using its operator<. The sort is stable.
Public function void

Algo::StableSort ( RangeType&& Range,
PredicateType Pred
)

 Sort a range of elements using a user-defined predicate class. The sort is stable.
Public function void

Algo::StableSortBy ( RangeType&& Range,
ProjectionType Proj
)

 Sort a range of elements by a projection using the projection's operator<. The sort is stable.
Public function void

Algo::StableSortBy ( RangeType&& Range,
ProjectionType Proj,
PredicateType Pred
)

 Sort a range of elements by a projection using a user-defined predicate class. The sort is stable.
Public function Private::TTiedTupleAdder< OutputTypes... >

Algo::TieTupleAdd ( OutputTypes&... Outputs
)

 Ties n objects with an Add function, usually containers, into one object with an Add function accepting an n-tuple that forwards the Add calls.
Public function bool

Algo::TopologicalSort ( RangeType& UniqueRange,
GetElementDependenciesType GetElementDependencies,
ETopologicalSort Flags
)

 Sorts the given range in leaf to root order: For every pair of elements (A,B) where SortedIndex(A) < SortedIndex(B), either B is not reachable from A, or A and B are mutually reachable.
Public function void

Algo::Transform ( const InT& Input,
OutT&& Output,
TransformT Trans
)

 Applies a transform to a range and stores the results into a container
Public function T

Algo::TransformAccumulate ( const A& Input,
MapT MapOp,
T Init
)

 Sums a range by applying MapOp to each element, and then summing the results.
Public function T

Algo::TransformAccumulate ( const A& Input,
MapT MapOp,
T Init,
OpT Op
)

 Sums a range by applying MapOp to each element, and then summing the results.
Public function void

Algo::TransformIf ( const InT& Input,
OutT&& Output,
PredicateT Predicate,
TransformT Trans
)

 Conditionally applies a transform to a range and stores the results into a container
Public function decltype(GetNum(Range))

Algo::UpperBound ( RangeType& Range,
const ValueType& Value
)

  
Public function decltype(GetNum(Range))

Algo::UpperBound ( RangeType& Range,
const ValueType& Value,
SortPredicateType SortPredicate
)

 Performs binary search, resulting in position of the first element > Value using predicate
Public function decltype(GetNum(Range))

Algo::UpperBoundBy ( RangeType& Range,
const ValueType& Value,
ProjectionType Projection,
SortPredicateType SortPredicate
)

 Performs binary search, resulting in position of the first element with projected value > Value using predicate
Public function decltype(GetNum(Range))

Algo::UpperBoundBy ( RangeType& Range,
const ValueType& Value,
ProjectionType Projection
)

  
Public function TRangePointerType< typenameTRemoveReference< RangeType >::Type >::Type

AlgoImpl::FindBy ( RangeType&& Range,
const ValueType& Value,
ProjectionType Proj
)

  
Public function TRangePointerType< typenameTRemoveReference< RangeType >::Type >::Type

AlgoImpl::FindByPredicate ( RangeType&& Range,
PredicateType Pred
)

  
Public function T *

AlgoImpl::FindLastBy ( T* First,
SIZE_T Num,
const ValueType& Value,
ProjectionType Proj
)

  
Public function T *

AlgoImpl::FindLastByPredicate ( T* First,
SIZE_T Num,
PredicateType Pred
)

  
Public function const TSet< FKahnHandle > & Called when there is a MutuallyReachableVertexSet (aka no vertices are independent).
Public function WhereType *

AlgoImpl::FindSequence ( WhereType* First,
WhereType* Last,
WhatType* WhatFirst,
WhatType* WhatLast
)

  
Public function auto

AlgoImpl::IndexOfBy ( RangeType&& Range,
const ValueType& Value,
ProjectionType Proj
)

  
Public function auto

AlgoImpl::IndexOfByPredicate ( RangeType&& Range,
PredicateType Pred
)

  
Public function void

AlgoImpl::IntroSortInternal ( T* First,
IndexType Num,
ProjectionType Projection,
PredicateType Predicate
)

 Implementation of an introspective sort.
Public function bool

AlgoImpl::IsHeapInternal ( RangeValueType* Heap,
IndexType Num,
ProjectionType Projection,
PredicateType Predicate
)

 Verifies that the range is a min-heap (parent <= child) This is the internal function used by IsHeap overrides.
Public function bool

AlgoImpl::IsSortedBy ( const T* Range,
IndexType RangeSize,
ProjectionType Proj,
PredType Pred
)

  
Public function void

AlgoImpl::KahnTopologicalSort_CreateWorkingGraph ( FKahnContext& Context,
RangeType& UniqueRange,
GetElementDependenciesType GetElementDependencies,
TSet< FKahnHandle >& OutInitialIndependents
)

 Helper functions.
Public function void

AlgoImpl::LegacySortInternal ( T* First,
int32 Num,
ProjectionType Projection,
PredicateType Predicate
)

 Sort elements using user defined predicate class.
Public function SizeType

AlgoImpl::LowerBoundInternal ( RangeValueType* First,
const SizeType Num,
const PredicateValueType& Value,
ProjectionType Projection,
SortPredicateType SortPredicate
)

 Performs binary search, resulting in position of the first element >= Value
Public function TRangePointerType< RangeType >::Type

AlgoImpl::MaxElementBy ( RangeType& Range,
ProjectionType Proj,
PredicateType Pred
)

  
Public function void

AlgoImpl::Merge ( T* First,
int32 Mid,
int32 Num,
ProjectionType Projection,
PredicateType Predicate
)

  
Public function TRangePointerType< RangeType >::Type

AlgoImpl::MinElementBy ( RangeType& Range,
ProjectionType Proj,
PredicateType Pred
)

  
Public function void

AlgoImpl::Reverse ( T* Array,
int32 ArraySize
)

  
Public function int32

AlgoImpl::RotateInternal ( T* First,
int32 Num,
int32 Count
)

  
Public function TRangePointerType< typenameTRemoveReference< RangeType >::Type >::Type

AlgoImpl::SelectRandomWeightedBy ( RangeType&& Range,
ProjectionType Proj
)

  
Public function void

AlgoImpl::StableSortInternal ( T* First,
int32 Num,
ProjectionType Projection,
PredicateType Predicate
)

 Sort elements using user defined projection and predicate classes.
Public function SizeType

AlgoImpl::Unique ( T* Array,
SizeType ArraySize,
ProjectionType Proj,
BinaryPredicate Predicate
)

  
Public function SizeType

AlgoImpl::UpperBoundInternal ( RangeValueType* First,
const SizeType Num,
const PredicateValueType& Value,
ProjectionType Projection,
SortPredicateType SortPredicate
)

 Performs binary search, resulting in position of the first element that is larger than the given value

Variables

  Type Name Description
Public variable int32 MinMergeSubgroupSize  

Ask questions and help your peers Developer Forums

Write your own tutorials or read those from others Learning Library

On this page