\hypertarget{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation3c2c850b5ad1e4acd66097d89e51c4f1}{}\doxysection{kblib\+::detail\+\_\+sort\+::sort\+\_\+transform\+\_\+impl\texorpdfstring{$<$}{<} Random\+Access\+It, Unary\+Operation, std\+::greater\texorpdfstring{$<$}{<} LessT \texorpdfstring{$>$}{>}, Sort\+Key, small\+\_\+size, true, true, false, false \texorpdfstring{$>$}{>} Struct Template Reference}
\label{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation3c2c850b5ad1e4acd66097d89e51c4f1}\index{kblib::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, std::greater$<$ LessT $>$, SortKey, small\_size, true, true, false, false $>$@{kblib::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, std::greater$<$ LessT $>$, SortKey, small\_size, true, true, false, false $>$}}


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




{\ttfamily \#include $<$kblib/sort.\+h$>$}

\doxysubsection*{Static Public Member Functions}
\begin{DoxyCompactItemize}
\item 
static constexpr auto \mbox{\hyperlink{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation3c2c850b5ad1e4acd66097d89e51c4f1_a546fe519d33a1084abd981807ae380d3}{inplace}} (Random\+Access\+It begin, const Random\+Access\+It end, Unary\+Operation \&\&\mbox{\hyperlink{namespacekblib_aff53cc55f02129e6192d7a87c7cdf7f0}{transform}}, std\+::greater$<$ LessT $>$ \&\&compare) -\/$>$ void
\end{DoxyCompactItemize}


\doxysubsection{Detailed Description}
\subsubsection*{template$<$typename Random\+Access\+It, typename Unary\+Operation, typename LessT, typename Sort\+Key, std\+::size\+\_\+t small\+\_\+size$>$\newline
struct kblib\+::detail\+\_\+sort\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, std\+::greater$<$ Less\+T $>$, Sort\+Key, small\+\_\+size, true, true, false, false $>$}
Sort implementation for pointer to member object of fundamental non-\/integral type with reverse sorting, so sort keys are constant time to extract and compare. 

Definition at line \mbox{\hyperlink{sort_8h_source_l00574}{574}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.



\doxysubsection{Member Function Documentation}
\mbox{\Hypertarget{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation3c2c850b5ad1e4acd66097d89e51c4f1_a546fe519d33a1084abd981807ae380d3}\label{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation3c2c850b5ad1e4acd66097d89e51c4f1_a546fe519d33a1084abd981807ae380d3}} 
\index{kblib::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, std::greater$<$ LessT $>$, SortKey, small\_size, true, true, false, false $>$@{kblib::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, std::greater$<$ LessT $>$, SortKey, small\_size, true, true, false, false $>$}!inplace@{inplace}}
\index{inplace@{inplace}!kblib::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, std::greater$<$ LessT $>$, SortKey, small\_size, true, true, false, false $>$@{kblib::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, std::greater$<$ LessT $>$, SortKey, small\_size, true, true, false, false $>$}}
\doxysubsubsection{\texorpdfstring{inplace()}{inplace()}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It , typename Unary\+Operation , typename LessT , typename Sort\+Key , std\+::size\+\_\+t small\+\_\+size$>$ \\
static constexpr auto \mbox{\hyperlink{structkblib_1_1detail__sort_1_1sort__transform__impl}{kblib\+::detail\+\_\+sort\+::sort\+\_\+transform\+\_\+impl}}$<$ Random\+Access\+It, Unary\+Operation, std\+::greater$<$ LessT $>$, Sort\+Key, small\+\_\+size, true, true, false, false $>$\+::inplace (\begin{DoxyParamCaption}\item[{Random\+Access\+It}]{begin,  }\item[{const Random\+Access\+It}]{end,  }\item[{Unary\+Operation \&\&}]{transform,  }\item[{std\+::greater$<$ LessT $>$ \&\&}]{compare }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [static]}, {\ttfamily [constexpr]}}

TODO(killerbee13)\+: write efficient inplace sort\+\_\+transform

Definition at line \mbox{\hyperlink{sort_8h_source_l00577}{577}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.



The documentation for this struct was generated from the following file\+:\begin{DoxyCompactItemize}
\item 
kblib/\mbox{\hyperlink{sort_8h}{sort.\+h}}\end{DoxyCompactItemize}