\hypertarget{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation935542bc395b86fd33cf9be63ad3de74}{}\doxysection{kblib\+::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{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation935542bc395b86fd33cf9be63ad3de74}\index{kblib::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, BinaryPredicate, SortKey, small\_size, true, false, false, false $>$@{kblib::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{namespacekblib_1_1detail__sort_a3b873e1b1c2c3a4865638d2c904c4c1d}{sort()}})  




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

\doxysubsection*{Static Public Member Functions}
\begin{DoxyCompactItemize}
\item 
static constexpr auto \mbox{\hyperlink{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation935542bc395b86fd33cf9be63ad3de74_a8c04627b9d1cf01790c456c25c5cabd0}{inplace}} (Random\+Access\+It begin, const Random\+Access\+It end, Unary\+Operation \&\&\mbox{\hyperlink{namespacekblib_aff53cc55f02129e6192d7a87c7cdf7f0}{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\+::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{namespacekblib_1_1detail__sort_a3b873e1b1c2c3a4865638d2c904c4c1d}{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{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation935542bc395b86fd33cf9be63ad3de74_a8c04627b9d1cf01790c456c25c5cabd0}\label{structkblib_1_1detail__sort_1_1sort__transform__impl_3_01_random_access_it_00_01_unary_operation935542bc395b86fd33cf9be63ad3de74_a8c04627b9d1cf01790c456c25c5cabd0}} 
\index{kblib::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, BinaryPredicate, SortKey, small\_size, true, false, false, false $>$@{kblib::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, BinaryPredicate, SortKey, small\_size, true, false, false, false $>$}!inplace@{inplace}}
\index{inplace@{inplace}!kblib::detail\_sort::sort\_transform\_impl$<$ RandomAccessIt, UnaryOperation, BinaryPredicate, SortKey, small\_size, true, false, false, false $>$@{kblib::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{structkblib_1_1detail__sort_1_1sort__transform__impl}{kblib\+::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}
