\hypertarget{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation_00_017e32f3fc0548eefe1122630b71a5e923}{}\section{kblib\+:\+:detail\+:\+:sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, false $>$ Struct Template Reference}
\label{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation_00_017e32f3fc0548eefe1122630b71a5e923}\index{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, false $>$@{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, 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 \hyperlink{namespacekblib_1_1detail_aa89dce9a3b7d031584d4dd02c402195e}{sort()})  




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

\subsection*{Static Public Member Functions}
\begin{DoxyCompactItemize}
\item 
static constexpr auto \hyperlink{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation_00_017e32f3fc0548eefe1122630b71a5e923_a23e73936dd80e8fdafef14b2d4229fa4}{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_aff53cc55f02129e6192d7a87c7cdf7f0}{transform}, \hyperlink{tdecl_8h_a607cffc585fe3bfcb06b63be2948de4a}{K\+B\+L\+I\+B\+\_\+\+U\+N\+U\+S\+ED} Binary\+Predicate \&\&compare) -\/$>$ void
\end{DoxyCompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$typename Random\+Access\+It, typename Unary\+Operation, typename Binary\+Predicate, typename Sort\+Key$>$\newline
struct kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, 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 \hyperlink{namespacekblib_1_1detail_aa89dce9a3b7d031584d4dd02c402195e}{sort()}) 

Definition at line 438 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_017e32f3fc0548eefe1122630b71a5e923_a23e73936dd80e8fdafef14b2d4229fa4}\label{structkblib_1_1detail_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation_00_017e32f3fc0548eefe1122630b71a5e923_a23e73936dd80e8fdafef14b2d4229fa4}} 
\index{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, false $>$@{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, false $>$}!inplace@{inplace}}
\index{inplace@{inplace}!kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, false $>$@{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, false $>$}}
\subsubsection{\texorpdfstring{inplace()}{inplace()}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It , typename Unary\+Operation , typename Binary\+Predicate , typename Sort\+Key $>$ \\
static constexpr auto \hyperlink{structkblib_1_1detail_1_1sort__transform__impl}{kblib\+::detail\+::sort\+\_\+transform\+\_\+impl}$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, 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} Binary\+Predicate \&\&}]{compare }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [static]}}

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

Definition at line 440 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}