| int32_t Compare(const SharedPtr<T>&, const SharedPtr<U>&) | Compares two smart pointers. |
| int32_t Compare(const T&, const T&) | Compares two arithmetic values. |
| int32_t Compare(const SharedPtr<T>&, const U&) | Compares a smart pointer with a value. |
| int32_t LastIndexOfImpl(const ReadOnlySpan<T>&, int32_t, const T&) | Finds the last index of a value in a span. |
| bool SequenceEqualImpl(const ReadOnlySpan<T>&, const int32_t, int32_t, const ReadOnlySpan<T>&) | Checks if two spans are equal starting from specified positions. |
| void IntroSort(Span<TKey>&, Span<TValue>&, int32_t, std::function<int32_t(const TKey&, const TKey&)>) | Internal implementation of introsort algorithm for key-value pairs. |
| void SwapIfGreaterWithValues(Span<TKey>&, Span<TValue>&, std::function<int32_t(const TKey&, const TKey&)>, int32_t, int32_t) | Swaps key-value pairs if comparison condition is met. |
| void InsertionSort(Span<TKey>&, Span<TValue>&, std::function<int32_t(const TKey&, const TKey&)>) | Performs insertion sort on key-value pairs. |
| void HeapSort(Span<TKey>&, Span<TValue>&, std::function<int32_t(const TKey&, const TKey&)>) | Performs heap sort on key-value pairs. |
| void Heapify(Span<TKey>&, Span<TValue>&, int32_t, int32_t, std::function<int32_t(const TKey&, const TKey&)>) | Maintains heap property for key-value pairs. |
| int32_t PickPivotAndPartition(Span<TKey>&, Span<TValue>&, std::function<int32_t(const TKey&, const TKey&)>) | Selects pivot and partitions key-value pairs for quicksort. |
| int32_t BinarySearchImpl(const ReadOnlySpan<T>&, const TValue&, TCompareFunc) | Common binary search implementation. |