Name | Description | ||
---|---|---|---|
|
T |
Algo::Accumulate ( |
Sums a range. |
|
T |
Algo::Accumulate ( |
Sums a range by successively applying Op. |
|
Algo::AllOf ( |
Checks if every element in the range is truthy. |
|
|
Algo::AllOf ( |
Checks if every projection of the elements in the range is truthy. |
|
|
Algo::AnyOf ( |
Checks if any element in the range is truthy. |
|
|
Algo::AnyOf ( |
Checks if any projection of the elements in the range is truthy. |
|
|
auto |
Algo::BinarySearch ( |
|
|
auto |
Algo::BinarySearch ( |
Returns index to the first found element matching a value in a range, the range must be sorted by < |
|
auto |
Algo::BinarySearchBy ( |
|
|
auto |
Algo::BinarySearchBy ( |
Returns index to the first found element with projected value matching Value in a range, the range must be sorted by predicate |
|
constexpr bo... |
Algo::CompareByPredicate ( |
Compares two contiguous containers using a predicate to compare pairs of elements. |
|
Algo::Copy ( |
Copies a range into a container |
|
|
Algo::CopyIf ( |
Conditionally copies a range into a container |
|
|
Algo::Count ( |
Counts elements of a range that equal the supplied value |
|
|
Algo::CountIf ( |
Counts elements of a range that match a given predicate |
|
|
auto |
Algo::Find ( |
Returns a pointer to the first element in the range which is equal to the given value. |
|
auto |
Algo::FindBy ( |
Returns a pointer to the first element in the range whose projection is equal to the given value. |
|
auto |
Algo::FindByPredicate ( |
Returns a pointer to the first element in the range which matches the predicate. |
|
auto |
Algo::FindLast ( |
Returns a pointer to the last element in the range which is equal to the given value. |
|
auto |
Algo::FindLastBy ( |
Returns a pointer to the last element in the range whose projection is equal to the given value. |
|
auto |
Algo::FindLastByPredicate ( |
Returns a pointer to the last element in the range which matches the predicate. |
|
auto |
Algo::FindSequence ( |
Searches for the first occurrence of a sequence of elements in another sequence. |
|
Algo::FindSortedStringCaseInsensitive |
Finds a string in an array of sorted strings, by case-insensitive search, by using binary subdivision of the array. |
|
|
Algo::ForEach ( |
Invokes a callable to each element in a range |
|
|
Algo::ForEachIf ( |
Conditionally invokes a callable to each element in a range |
|
|
Algo::Heapify ( |
Builds an implicit min-heap from a range of elements. |
|
|
Algo::Heapify ( |
Builds an implicit min-heap from a range of elements. |
|
|
Algo::HeapifyBy ( |
Builds an implicit min-heap from a range of elements. |
|
|
Algo::HeapifyBy ( |
Builds an implicit min-heap from a range of elements. |
|
|
Algo::HeapSort ( |
Performs heap sort on the elements. |
|
|
Algo::HeapSort ( |
Performs heap sort on the elements. Assumes < operator is defined for the element type. |
|
|
Algo::HeapSortBy ( |
Performs heap sort on the elements. |
|
|
Algo::HeapSortBy ( |
Performs heap sort on the elements. Assumes < operator is defined for the projected element type. |
|
|
Algo::IntroSort ( |
Sort a range of elements using a user-defined predicate class. The sort is unstable. |
|
|
Algo::IntroSort ( |
Sort a range of elements using its operator<. The sort is unstable. |
|
|
Algo::IntroSortBy ( |
Sort a range of elements by a projection using a user-defined predicate class. |
|
|
Algo::IntroSortBy ( |
Sort a range of elements by a projection using the projection's operator<. The sort is unstable. |
|
|
Algo::IsHeap ( |
Verifies that the range is a min-heap (parent <= child) |
|
|
Algo::IsHeap ( |
Verifies that the range is a min-heap (parent <= child). |
|
|
Algo::IsHeapBy ( |
Verifies that the range is a min-heap (parent <= child) |
|
|
Algo::IsHeapBy ( |
Verifies that the range is a min-heap (parent <= child). |
|
|
Algo::IsSorted ( |
IsSorted taking a pointer and size has been deprecated - please pass a TArrayView instead |
|
|
Algo::IsSorted ( |
Tests if a range is sorted by a user-defined predicate. |
|
|
Algo::IsSorted ( |
Tests if a range is sorted by its element type's operator<. |
|
|
Algo::IsSorted ( |
IsSorted taking a pointer and size has been deprecated - please pass a TArrayView instead |
|
|
Algo::IsSortedBy ( |
Tests if a range is sorted by a projection of the element type, using the projection's operator<. |
|
|
Algo::IsSortedBy ( |
Tests if a range is sorted by a projection of the element type, using a user-defined predicate on the projection. |
|
|
Algo::LegacySort ( |
Sort a range of elements using a user-defined predicate class. |
|
|
Algo::LegacySort ( |
Sort a range of elements using its operator<. |
|
|
Algo::LegacySortBy ( |
Sort a range of elements by a projection using a user-defined predicate class. |
|
|
Algo::LegacySortBy ( |
Sort a range of elements by a projection using the projection's operator<. |
|
|
Algo::LevenshteinDistance ( |
LevenshteinDistance return the number of edit operation we need to transform RangeA to RangeB. |
|
|
auto |
Algo::LowerBound ( |
|
|
auto |
Algo::LowerBound ( |
Performs binary search, resulting in position of the first element >= Value using predicate |
|
auto |
Algo::LowerBoundBy ( |
Performs binary search, resulting in position of the first element with projected value >= Value using predicate |
|
auto |
Algo::LowerBoundBy ( |
|
|
auto |
Algo::MaxElement ( |
Returns a pointer to the maximum element in a range with a user-defined binary comparator. |
|
auto |
Algo::MaxElement ( |
Returns a pointer to the maximum element in a range. |
|
auto |
Algo::MaxElementBy ( |
Returns a pointer to the maximum element in a range with a user-defined binary comparator. |
|
auto |
Algo::MaxElementBy ( |
Returns a pointer to the maximum element in a range with a user-defined binary comparator. |
|
auto |
Algo::MinElement ( |
Returns a pointer to the minimum element in a range. |
|
auto |
Algo::MinElement ( |
Returns a pointer to the minimum element in a range with a user-defined binary comparator. |
|
auto |
Algo::MinElementBy ( |
Returns a pointer to the minimum element in a range with a user-defined binary comparator. |
|
auto |
Algo::MinElementBy ( |
Returns a pointer to the minimum element in a range with a user-defined binary comparator. |
|
Algo::NoneOf ( |
Checks if no element in the range is truthy. |
|
|
Algo::NoneOf ( |
Checks if no projection of the elements in the range is truthy. |
|
|
IndexType |
Algo::Partition ( |
Rearranges the elements so that all the elements for which Predicate returns true precede all those for which it returns false. |
|
Algo::RemoveIf ( |
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. |
|
|
Algo::Replace ( |
Replaces all elements that compare equal to one value with a new value. |
|
|
Algo::ReplaceIf ( |
Replaces all elements that satisfy the predicate with the given value. |
|
|
Algo::Reverse ( |
Reverses a range |
|
|
Algo::Reverse ( |
Reverses a range |
|
|
Algo::Reverse ( |
Reverses a range |
|
|
Algo::Rotate ( |
Rotates a given amount of elements from the front of the range to the end of the range. |
|
|
Algo::Sort ( |
Sort a range of elements using a user-defined predicate class. The sort is unstable. |
|
|
Algo::Sort ( |
Sort a range of elements using its operator<. The sort is unstable. |
|
|
Algo::SortBy ( |
Sort a range of elements by a projection using a user-defined predicate class. |
|
|
Algo::SortBy ( |
Sort a range of elements by a projection using the projection's operator<. The sort is unstable. |
|
|
Algo::StableRemoveIf ( |
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. |
|
|
Algo::StableSort ( |
Sort a range of elements using a user-defined predicate class. The sort is stable. |
|
|
Algo::StableSort ( |
Sort a range of elements using its operator<. The sort is stable. |
|
|
Algo::StableSortBy ( |
Sort a range of elements by a projection using a user-defined predicate class. The sort is stable. |
|
|
Algo::StableSortBy ( |
Sort a range of elements by a projection using the projection's operator<. The sort is stable. |
|
|
Algo::Transform ( |
Applies a transform to a range and stores the results into a container |
|
|
T |
Algo::TransformAccumulate ( |
Sums a range by applying MapOp to each element, and then summing the results. |
|
T |
Algo::TransformAccumulate ( |
Sums a range by applying MapOp to each element, and then summing the results. |
|
Algo::TransformIf ( |
Conditionally applies a transform to a range and stores the results into a container |
|
|
auto |
Algo::Unique ( |
Eliminates all but the first element from every consecutive group of equivalent elements and returns past-the-end index of unique elements for the new logical end of the range. |
|
auto |
Algo::Unique ( |
|
|
auto |
Algo::UpperBound ( |
|
|
auto |
Algo::UpperBound ( |
Performs binary search, resulting in position of the first element > Value using predicate |
|
auto |
Algo::UpperBoundBy ( |
Performs binary search, resulting in position of the first element with projected value > Value using predicate |
|
auto |
Algo::UpperBoundBy ( |
|
|
TRangePointe... |
AlgoImpl::FindBy ( |
|
|
TRangePointe... |
AlgoImpl::FindByPredicate ( |
|
|
T * |
AlgoImpl::FindLastBy ( |
|
|
T * |
AlgoImpl::FindLastByPredicate ( |
|
|
constexpr Wh... |
AlgoImpl::FindSequence ( |
|
|
AlgoImpl::IntroSortInternal ( |
Implementation of an introspective sort. |
|
|
AlgoImpl::IsHeapInternal ( |
Verifies that the range is a min-heap (parent <= child) This is the internal function used by IsHeap overrides. |
|
|
AlgoImpl::IsSortedBy ( |
||
|
AlgoImpl::LegacySortInternal ( |
Sort elements using user defined predicate class. |
|
|
SizeType |
AlgoImpl::LowerBoundInternal ( |
Performs binary search, resulting in position of the first element >= Value |
|
TRangePointe... |
AlgoImpl::MaxElementBy ( |
|
|
AlgoImpl::Merge |
||
|
TRangePointe... |
AlgoImpl::MinElementBy ( |
|
|
AlgoImpl::Reverse ( |
||
|
AlgoImpl::RotateInternal |
||
|
AlgoImpl::StableSortInternal ( |
Sort elements using user defined projection and predicate classes. |
|
|
SizeType |
AlgoImpl::Unique ( |
|
|
SizeType |
AlgoImpl::UpperBoundInternal ( |
Performs binary search, resulting in position of the first element that is larger than the given value |
Name | Description | ||
---|---|---|---|
|
constexpr int32 |
MinMergeSubgroupSize |