kblib 0.2.3
General utilities library for modern C++
kblib::detail_sort::sort_transform_impl< RandomAccessIt, UnaryOperation, BinaryPredicate, SortKey, small_size, true, false, false, false > Struct Template Reference

Sort implementation for pointer to member object of non-fundamental type, so sort keys are constant time to extract (this is most similar to a general sort()) More...

#include <kblib/sort.h>

Static Public Member Functions

static constexpr auto inplace (RandomAccessIt begin, const RandomAccessIt end, UnaryOperation &&transform, BinaryPredicate &&compare) -> void
 

Detailed Description

template<typename RandomAccessIt, typename UnaryOperation, typename BinaryPredicate, typename SortKey, std::size_t small_size>
struct kblib::detail_sort::sort_transform_impl< RandomAccessIt, UnaryOperation, BinaryPredicate, SortKey, small_size, true, false, false, false >

Sort implementation for pointer to member object of non-fundamental type, so sort keys are constant time to extract (this is most similar to a general sort())

Definition at line 533 of file sort.h.

Member Function Documentation

◆ inplace()

template<typename RandomAccessIt , typename UnaryOperation , typename BinaryPredicate , typename SortKey , std::size_t small_size>
static constexpr auto kblib::detail_sort::sort_transform_impl< RandomAccessIt, UnaryOperation, BinaryPredicate, SortKey, small_size, true, false, false, false >::inplace ( RandomAccessIt  begin,
const RandomAccessIt  end,
UnaryOperation &&  transform,
BinaryPredicate &&  compare 
) -> void
inlinestaticconstexpr

TODO(killerbee13): write efficient sort_transform

Definition at line 535 of file sort.h.


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