\hypertarget{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_op_00_01std_1_14b6230def95127c2549620aa70952b3c}{}\section{kblib\+:\+:detail\+:\+:sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Op, std\+:\+:greater$<$ LessT $>$, Sort\+Key, true, true, false $>$ Struct Template Reference}
\label{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_op_00_01std_1_14b6230def95127c2549620aa70952b3c}\index{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Op, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, false $>$@{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Op, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, 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 $<$algorithm.\+h$>$}

\subsection*{Static Public Member Functions}
\begin{DoxyCompactItemize}
\item 
static constexpr void \hyperlink{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_op_00_01std_1_14b6230def95127c2549620aa70952b3c_a2d5d7c1bf62231c8544ae9c3bd9a5183}{inplace} (Random\+Access\+It begin, const Random\+Access\+It end, Unary\+Op \&\&transform, std\+::greater$<$ LessT $>$ \&\&compare)
\end{DoxyCompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$typename Random\+Access\+It, typename Unary\+Op, typename LessT, typename Sort\+Key$>$\newline
struct kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Op, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, 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 939 of file algorithm.\+h.



\subsection{Member Function Documentation}
\mbox{\Hypertarget{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_op_00_01std_1_14b6230def95127c2549620aa70952b3c_a2d5d7c1bf62231c8544ae9c3bd9a5183}\label{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_op_00_01std_1_14b6230def95127c2549620aa70952b3c_a2d5d7c1bf62231c8544ae9c3bd9a5183}} 
\index{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Op, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, false $>$@{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Op, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, false $>$}!inplace@{inplace}}
\index{inplace@{inplace}!kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Op, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, false $>$@{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Op, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, false $>$}}
\subsubsection{\texorpdfstring{inplace()}{inplace()}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It , typename Unary\+Op , typename LessT , typename Sort\+Key $>$ \\
static constexpr void \hyperlink{structkblib_1_1detail_1_1sort__transform__impl}{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl}$<$ Random\+Access\+It, Unary\+Op, std\+::greater$<$ LessT $>$, Sort\+Key, true, true, false $>$\+::inplace (\begin{DoxyParamCaption}\item[{Random\+Access\+It}]{begin,  }\item[{const Random\+Access\+It}]{end,  }\item[{Unary\+Op \&\&}]{transform,  }\item[{std\+::greater$<$ LessT $>$ \&\&}]{compare }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [static]}}



Definition at line 941 of file algorithm.\+h.



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