Sort implementation for pointer to member object of fundamental non-integral type with default sorting, so sort keys are constant time to extract and compare. More...

#include <kblib/sort.h>

Static Public Member Functions
static constexpr auto	inplace (RandomAccessIt begin, const RandomAccessIt end, UnaryOperation &&transform, std::less< LessT > &&compare) -> void

Detailed Description

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

Sort implementation for pointer to member object of fundamental non-integral type with default sorting, so sort keys are constant time to extract and compare.

Definition at line 557 of file sort.h.

Member Function Documentation

◆ inplace()

template<typename RandomAccessIt , typename UnaryOperation , typename LessT , typename SortKey , std::size_t small_size>

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

inlinestaticconstexpr

TODO(killerbee13): write efficient inplace sort_transform

Definition at line 559 of file sort.h.

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

kblib/sort.h

Static Public Member Functions

Detailed Description

Member Function Documentation

◆ inplace()