\hypertarget{struct_k_b_l_i_b___n_s_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unar11796da988c7fdaa8949d61d2e25db60}{}\doxysection{KBLIB\+\_\+\+NS\+::detail\+\_\+sort\+::sort\+\_\+transform\+\_\+impl\texorpdfstring{$<$}{<} Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, small\+\_\+size, true, false, false, false \texorpdfstring{$>$}{>} Struct Template Reference}
\label{struct_k_b_l_i_b___n_s_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unar11796da988c7fdaa8949d61d2e25db60}\index{KBLIB\_NS::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, BinaryPredicate, SortKey, small\_size, true, false, false, false $>$@{KBLIB\_NS::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, BinaryPredicate, SortKey, small\_size, 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 \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__sort_a4252cc2ee4c8cd7ef1617eda8340a7de}{sort()}})  




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

\doxysubsection*{Static Public Member Functions}
\begin{DoxyCompactItemize}
\item 
static constexpr auto \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unar11796da988c7fdaa8949d61d2e25db60_ac65ad58d55392c2c658cf8859954339b}{inplace}} (Random\+Access\+It begin, const Random\+Access\+It end, Unary\+Operation \&\&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a776689bdcc9e3aa8017448393fe85f3a}{transform}}, Binary\+Predicate \&\&compare) -\/$>$ void
\end{DoxyCompactItemize}


\doxysubsection{Detailed Description}
\subsubsection*{template$<$typename Random\+Access\+It, typename Unary\+Operation, typename Binary\+Predicate, typename Sort\+Key, std\+::size\+\_\+t small\+\_\+size$>$\newline
struct KBLIB\+\_\+\+NS\+::detail\+\_\+sort\+::sort\+\_\+transform\+\_\+impl$<$ Random\+Access\+It, Unary\+Operation, Binary\+Predicate, Sort\+Key, small\+\_\+size, 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 \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__sort_a4252cc2ee4c8cd7ef1617eda8340a7de}{sort()}}) 

Definition at line \mbox{\hyperlink{sort_8h_source_l00533}{533}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.



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

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

Definition at line \mbox{\hyperlink{sort_8h_source_l00535}{535}} 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}