\hypertarget{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation_00_01615e8db815bc6abc40546017bc12e86f}{}\section{kblib\+:\+:detail\+:\+:sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, 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_operation_00_01615e8db815bc6abc40546017bc12e86f}\index{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, false $>$@{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, 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 $<$sort.\+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_operation_00_01615e8db815bc6abc40546017bc12e86f_abee548c58ae436740ce0fbbe81d29afa}{inplace} (\hyperlink{tdecl_8h_a607cffc585fe3bfcb06b63be2948de4a}{K\+B\+L\+I\+B\+\_\+\+U\+N\+U\+S\+ED} Random\+Access\+It begin, \hyperlink{tdecl_8h_a607cffc585fe3bfcb06b63be2948de4a}{K\+B\+L\+I\+B\+\_\+\+U\+N\+U\+S\+ED} const Random\+Access\+It end, \hyperlink{tdecl_8h_a607cffc585fe3bfcb06b63be2948de4a}{K\+B\+L\+I\+B\+\_\+\+U\+N\+U\+S\+ED} Unary\+Operation \&\&\hyperlink{namespacekblib_a5d09107465c92a05730858bddf2ea718}{transform}, \hyperlink{tdecl_8h_a607cffc585fe3bfcb06b63be2948de4a}{K\+B\+L\+I\+B\+\_\+\+U\+N\+U\+S\+ED} std\+::greater$<$ LessT $>$ \&\&compare)
\end{DoxyCompactItemize}


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



\subsection{Member Function Documentation}
\mbox{\Hypertarget{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation_00_01615e8db815bc6abc40546017bc12e86f_abee548c58ae436740ce0fbbe81d29afa}\label{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation_00_01615e8db815bc6abc40546017bc12e86f_abee548c58ae436740ce0fbbe81d29afa}} 
\index{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, false $>$@{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, false $>$}!inplace@{inplace}}
\index{inplace@{inplace}!kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, false $>$@{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, std\+::greater$<$ Less\+T $>$, Sort\+Key, true, true, false $>$}}
\subsubsection{\texorpdfstring{inplace()}{inplace()}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It , typename Unary\+Operation , 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\+Operation, std\+::greater$<$ LessT $>$, Sort\+Key, true, true, false $>$\+::inplace (\begin{DoxyParamCaption}\item[{\hyperlink{tdecl_8h_a607cffc585fe3bfcb06b63be2948de4a}{K\+B\+L\+I\+B\+\_\+\+U\+N\+U\+S\+ED} Random\+Access\+It}]{begin,  }\item[{\hyperlink{tdecl_8h_a607cffc585fe3bfcb06b63be2948de4a}{K\+B\+L\+I\+B\+\_\+\+U\+N\+U\+S\+ED} const Random\+Access\+It}]{end,  }\item[{\hyperlink{tdecl_8h_a607cffc585fe3bfcb06b63be2948de4a}{K\+B\+L\+I\+B\+\_\+\+U\+N\+U\+S\+ED} Unary\+Operation \&\&}]{transform,  }\item[{\hyperlink{tdecl_8h_a607cffc585fe3bfcb06b63be2948de4a}{K\+B\+L\+I\+B\+\_\+\+U\+N\+U\+S\+ED} std\+::greater$<$ LessT $>$ \&\&}]{compare }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [static]}}

T\+O\+D\+O(killerbee13)\+: write efficient inplace sort\+\_\+transform 

Definition at line 425 of file sort.\+h.



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