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




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

\subsection*{Static Public Member Functions}
\begin{DoxyCompactItemize}
\item 
static constexpr auto \hyperlink{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation65897db85534ed8e5f7e1a2efe6c14ff_af225b6ac8faef260f37fc093324aca7e}{inplace} (\mbox{[}\mbox{[}maybe\+\_\+unused\mbox{]}\mbox{]} Random\+Access\+It begin, \mbox{[}\mbox{[}maybe\+\_\+unused\mbox{]}\mbox{]} const Random\+Access\+It end, \mbox{[}\mbox{[}maybe\+\_\+unused\mbox{]}\mbox{]} Unary\+Operation \&\&\hyperlink{namespacekblib_aff53cc55f02129e6192d7a87c7cdf7f0}{transform}, \mbox{[}\mbox{[}maybe\+\_\+unused\mbox{]}\mbox{]} 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\+::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__sort_adf05c283862e8bb29ba42e5bafa148f7}{sort()}) 

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



\subsection{Member Function Documentation}
\mbox{\Hypertarget{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation65897db85534ed8e5f7e1a2efe6c14ff_af225b6ac8faef260f37fc093324aca7e}\label{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation65897db85534ed8e5f7e1a2efe6c14ff_af225b6ac8faef260f37fc093324aca7e}} 
\index{kblib\+::detail\+\_\+sort\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, false $>$@{kblib\+::detail\+\_\+sort\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, false $>$}!inplace@{inplace}}
\index{inplace@{inplace}!kblib\+::detail\+\_\+sort\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, false $>$@{kblib\+::detail\+\_\+sort\+::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__sort_1_1sort__transform__impl}{kblib\+::detail\+\_\+sort\+::sort\+\_\+transform\+\_\+impl}$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, true, false, false, false $>$\+::inplace (\begin{DoxyParamCaption}\item[{\mbox{[}\mbox{[}maybe\+\_\+unused\mbox{]} \mbox{]} Random\+Access\+It}]{begin,  }\item[{\mbox{[}\mbox{[}maybe\+\_\+unused\mbox{]} \mbox{]} const Random\+Access\+It}]{end,  }\item[{\mbox{[}\mbox{[}maybe\+\_\+unused\mbox{]} \mbox{]} Unary\+Operation \&\&}]{transform,  }\item[{\mbox{[}\mbox{[}maybe\+\_\+unused\mbox{]} \mbox{]} 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 470 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}