\hypertarget{kblib__build_8h}{}\section{kblib\+\_\+build.\+h File Reference}
\label{kblib__build_8h}\index{kblib\+\_\+build.\+h@{kblib\+\_\+build.\+h}}
{\ttfamily \#include \char`\"{}kblib\+\_\+fakestd.\+h\char`\"{}}\newline
{\ttfamily \#include \char`\"{}kblib\+\_\+iterators.\+h\char`\"{}}\newline
{\ttfamily \#include \char`\"{}kblib\+\_\+tdecl.\+h\char`\"{}}\newline
{\ttfamily \#include \char`\"{}kblib\+\_\+traits.\+h\char`\"{}}\newline
{\ttfamily \#include $<$algorithm$>$}\newline
{\ttfamily \#include $<$iterator$>$}\newline
{\ttfamily \#include $<$numeric$>$}\newline
{\ttfamily \#include $<$tuple$>$}\newline
Include dependency graph for kblib\+\_\+build.\+h\+:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=350pt]{kblib__build_8h__incl}
\end{center}
\end{figure}
This graph shows which files directly or indirectly include this file\+:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=151pt]{kblib__build_8h__dep__incl}
\end{center}
\end{figure}
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
struct \hyperlink{structkblib_1_1detail_1_1buildiota__impl_3_01_container_00_01true_01_4}{kblib\+::detail\+::buildiota\+\_\+impl$<$ Container, true $>$}
\item 
struct \hyperlink{structkblib_1_1detail_1_1buildiota__impl_3_01_array_00_01false_01_4}{kblib\+::detail\+::buildiota\+\_\+impl$<$ Array, false $>$}
\item 
struct \hyperlink{structkblib_1_1containing__ptr}{kblib\+::containing\+\_\+ptr$<$ T $>$}
\begin{DoxyCompactList}\small\item\em A smart pointer to an object contained inside the smart pointer object. \end{DoxyCompactList}\item 
class \hyperlink{classkblib_1_1back__insert__iterator___f}{kblib\+::back\+\_\+insert\+\_\+iterator\+\_\+\+F$<$ Container, F $>$}
\begin{DoxyCompactList}\small\item\em An Output\+Iterator that transforms the values assigned to it before inserting them into the back of a container. \end{DoxyCompactList}\item 
class \hyperlink{classkblib_1_1consume__iterator}{kblib\+::consume\+\_\+iterator$<$ F $>$}
\begin{DoxyCompactList}\small\item\em An Output\+Iterator that simply calls a provided functor for each value assigned to it. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespacekblib}{kblib}
\item 
 \hyperlink{namespacekblib_1_1detail}{kblib\+::detail}
\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Unary\+Function $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_accf8a17c6539ca3fd02616b705f88c6d}{kblib\+::build} (Input\+It first, Input\+It last, Unary\+Function f, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\})
\begin{DoxyCompactList}\small\item\em Constructs a container by applying a Unary\+Function to every element of an input range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Input\+It2 , typename Binary\+Function $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_a62e753f734e0e89dd86c74af44420ed3}{kblib\+::build} (Input\+It first, Input\+It last, Input\+It2 first2, Binary\+Function f, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\})
\begin{DoxyCompactList}\small\item\em Constructs a container by applying a Binary\+Function to every pair of elements in the input ranges. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Array , typename Input\+It , typename Unary\+Function , typename std\+::enable\+\_\+if$<$!detail\+::is\+\_\+resizable\+\_\+v$<$ Array $>$, int $>$\+::type  = 0$>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Array \hyperlink{namespacekblib_a914332643d644849f6b3b88cccd969ef}{kblib\+::build} (Input\+It first, Input\+It last, Unary\+Function f)
\begin{DoxyCompactList}\small\item\em Constructs an array-\/like container by applying a Unary\+Function to every element of an input range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Array , typename Input\+It , typename Input\+It2 , typename Binary\+Function , typename std\+::enable\+\_\+if$<$!detail\+::is\+\_\+resizable\+\_\+v$<$ Array $>$, int $>$\+::type  = 0$>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Array \hyperlink{namespacekblib_aff85d3edf8d91e2949aa8d889f383b8d}{kblib\+::build} (Input\+It first, Input\+It last, Input\+It2 first2, Binary\+Function f)
\begin{DoxyCompactList}\small\item\em Constructs an array-\/like container by applying a Binary\+Function to every pair of elements in the input ranges. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Functor $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_ace1708b00d1849073f7c8c005ae2e2a5}{kblib\+::build} (Functor f, size\+\_\+t size, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\})
\begin{DoxyCompactList}\small\item\em Constructs a container with elements initialized by repeatedly calling a generating function. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Array , typename Functor , typename std\+::enable\+\_\+if$<$!detail\+::is\+\_\+resizable\+\_\+v$<$ Array $>$, int $>$\+::type  = 0$>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Array \hyperlink{namespacekblib_a95dd9292f5b5c4f2c25ce9689bab9cef}{kblib\+::build} (Functor f, size\+\_\+t size=std\+::tuple\+\_\+size$<$ Array $>$\+::value)
\begin{DoxyCompactList}\small\item\em Constructs an array-\/like container with elements initialized by repeatedly calling a generating function. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Unary\+Function $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_a8666b51c427a16b7c90154d1209799dd}{kblib\+::build\+\_\+dy} (Input\+It first, Input\+It last, Unary\+Function f)
\begin{DoxyCompactList}\small\item\em Constructs a container by applying a Unary\+Function to every element of an input range. Exactly like {\ttfamily build}, but for resizable non-\/\+Allocator\+Aware Containers (which are hard to detect automatically). \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Input\+It2 , typename Binary\+Function $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_a966ce9806122d263b83b776cde5169f4}{kblib\+::build\+\_\+dy} (Input\+It first, Input\+It last, Input\+It2 first2, Binary\+Function f)
\begin{DoxyCompactList}\small\item\em Constructs a container by applying a Binary\+Function to every pair of elements in the input ranges. Exactly like {\ttfamily build}, but for resizable non-\/\+Allocator\+Aware Containers (which are hard to detect automatically). \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Functor $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_a29189fd22a50ddaf323864efa94ce039}{kblib\+::build\+\_\+dy} (Functor f, size\+\_\+t size)
\begin{DoxyCompactList}\small\item\em Constructs a container with elements initialized by repeatedly calling a generating function. Exactly like {\ttfamily build}, but for resizable non-\/\+Allocator\+Aware Containers (which are hard to detect automatically). \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename... Args$>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} constexpr auto \hyperlink{namespacekblib_a3402d3fe5903198989b43d58df73b6d9}{kblib\+::buildiota} (Args \&\&... args)
\begin{DoxyCompactList}\small\item\em Builds a container of increasing values. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename C , typename T $>$ }\\void \hyperlink{namespacekblib_abbcf8680c0279c14a303e6606de326d6}{kblib\+::erase} (C \&c, const T \&val)
\begin{DoxyCompactList}\small\item\em Abbreviation of the erase-\/remove idiom as a free function. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename C , typename Unary\+Predicate $>$ }\\void \hyperlink{namespacekblib_a220329cd9b347f38cc35b3de2221c50a}{kblib\+::erase\+\_\+if} (C \&c, Unary\+Predicate p)
\begin{DoxyCompactList}\small\item\em Abbreviation of the erase-\/remove idiom as a free function. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename T $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} It \hyperlink{namespacekblib_ad090e32c364abe0b88a0116eac6c5e69}{kblib\+::find\+\_\+last} (It begin, It end, const T \&v)
\begin{DoxyCompactList}\small\item\em Searches a range for the last occurence of a match, and returns an iterator to it. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename Pred $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} It \hyperlink{namespacekblib_aad2924a542d62311bba866ec27e1b3d1}{kblib\+::find\+\_\+last\+\_\+if} (It begin, It end, Pred p)
\begin{DoxyCompactList}\small\item\em Searches a range for the last element on which a predicate returns true. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename Pred $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} It \hyperlink{namespacekblib_a3870712c308738e204a5f1a7a2b8c65c}{kblib\+::find\+\_\+last\+\_\+if\+\_\+not} (It begin, It end, Pred p)
\begin{DoxyCompactList}\small\item\em Searches a range for the last element on which a predicate returns false. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename T $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_a64715dbb8f8071f007cc49dc8ef7d45f}{kblib\+::find\+\_\+in} (It begin, It end, const T \&v)
\begin{DoxyCompactList}\small\item\em Find the offset of the first ocurrence of v in a range from the beginning. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename Unary\+Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_ae95f410884f1fe829d26df3c67be2d48}{kblib\+::find\+\_\+in\+\_\+if} (It begin, It end, Unary\+Predicate p)
\begin{DoxyCompactList}\small\item\em Find the offset of the first element for which p returns true. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename Unary\+Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_acb385de38f725022017cfc2c487e651e}{kblib\+::find\+\_\+in\+\_\+if\+\_\+not} (It begin, It end, Unary\+Predicate p)
\begin{DoxyCompactList}\small\item\em Find the offset of the first element for which p returns false. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename T $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_a72f9ca59fa1933a81fc169e00f22f22e}{kblib\+::find\+\_\+last\+\_\+in} (It begin, It end, const T \&v)
\begin{DoxyCompactList}\small\item\em Find the offset of the last ocurrence of v in a range from the beginning. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename Unary\+Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_abb4dddd325b25be342e881177165515f}{kblib\+::find\+\_\+last\+\_\+in\+\_\+if} (It begin, It end, Unary\+Predicate p)
\begin{DoxyCompactList}\small\item\em Find the offset of the last element for which p returns true. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename Unary\+Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_a32072074f690b384ae5a973443286a8c}{kblib\+::find\+\_\+last\+\_\+in\+\_\+if\+\_\+not} (It begin, It end, Unary\+Predicate p)
\begin{DoxyCompactList}\small\item\em Find the offset of the last element for which p returns false. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename T $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_a4284331d112c3709f2c8df25206b94d1}{kblib\+::find\+\_\+in} (const Container \&c, const T \&v)
\begin{DoxyCompactList}\small\item\em Find the first element in c equal to v and return the position. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Unary\+Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_ae6b47b8289fa33bf10f891ac606a3580}{kblib\+::find\+\_\+in\+\_\+if} (const Container \&c, Unary\+Predicate p)
\begin{DoxyCompactList}\small\item\em Find the first element in c for which p returns true and return the position. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Unary\+Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_a71bca4c50d742a699c718dd588b0ae50}{kblib\+::find\+\_\+in\+\_\+if\+\_\+not} (const Container \&c, Unary\+Predicate p)
\begin{DoxyCompactList}\small\item\em Find the first element in c for which p returns false and return the position. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename T $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_aa64c395d03b5f3623bad88538abf4d89}{kblib\+::find\+\_\+last\+\_\+in} (const Container \&c, const T \&v)
\begin{DoxyCompactList}\small\item\em Find the last element in c equal to v and return the position. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Unary\+Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_a647416a5aae57e456f3d20814a2c7d7e}{kblib\+::find\+\_\+last\+\_\+in\+\_\+if} (const Container \&c, Unary\+Predicate p)
\begin{DoxyCompactList}\small\item\em Find the last element in c for which p returns true and return the position. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Unary\+Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} size\+\_\+t \hyperlink{namespacekblib_a83950e36caa4a1068758485494527d67}{kblib\+::find\+\_\+last\+\_\+in\+\_\+if\+\_\+not} (const Container \&c, Unary\+Predicate p)
\begin{DoxyCompactList}\small\item\em Find the last element in c for which p returns true and return the position. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Comp  = std\+::less$<$$>$, typename It , typename std\+::enable\+\_\+if$<$ is\+\_\+linear\+\_\+container\+\_\+v$<$ Container $>$, int $>$\+::type  = 0$>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_a1e53a81c50a26abe53fe84d6706be803}{kblib\+::get\+\_\+max\+\_\+n\+\_\+old} (It begin, It end, std\+::size\+\_\+t count, Comp cmp=\{\})
\begin{DoxyCompactList}\small\item\em Returns a container of the greatest count elements according to cmp of the range \mbox{[}begin, end), in arbitrary order. This overload works for linear containers. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Comp  = std\+::less$<$$>$, typename It , typename std\+::enable\+\_\+if$<$ is\+\_\+linear\+\_\+container\+\_\+v$<$ Container $>$, int $>$\+::type  = 0$>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_a58dea4b432dc5d32943a507b9f2b2a6e}{kblib\+::get\+\_\+max\+\_\+n} (It begin, It end, std\+::size\+\_\+t count, Comp cmp=\{\})
\begin{DoxyCompactList}\small\item\em Returns a container of the greatest count elements according to cmp of the range \mbox{[}begin, end), in descending order. This overload works for linear containers. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Comp  = std\+::less$<$$>$, typename I\+It , typename O\+It , typename ElementT  = typename std\+::iterator\+\_\+traits$<$\+I\+It$>$\+::value\+\_\+type$>$ }\\auto \hyperlink{namespacekblib_afe76ab11885d5258fc7930a667056c5b}{kblib\+::get\+\_\+max\+\_\+n} (I\+It begin, I\+It end, O\+It d\+\_\+begin, std\+::size\+\_\+t count, Comp cmp=\{\}) -\/$>$ return\+\_\+assert\+\_\+t$<$ is\+\_\+output\+\_\+iterator$<$ O\+It, ElementT $>$\+::value, O\+It $>$
\begin{DoxyCompactList}\small\item\em Copies the count greatest elements according to cmp of the range \mbox{[}begin, end) to the range beginning at d\+\_\+begin. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename It2 , typename Binary\+Function $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} constexpr Binary\+Function \hyperlink{namespacekblib_a2d37b631f4a8c14acd31bee7774b674e}{kblib\+::for\+\_\+each} (It first, It last, It2 second, Binary\+Function f)
\item 
{\footnotesize template$<$typename It , typename It2 , typename Size , typename Binary\+Function $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} constexpr It \hyperlink{namespacekblib_aa4ec73b8c749624ea6356e8291612d85}{kblib\+::for\+\_\+each\+\_\+n} (It first, Size n, It2 second, Binary\+Function f)
\item 
{\footnotesize template$<$typename Input\+It , typename Size , typename Output\+It , typename Unary\+Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Output\+It \hyperlink{namespacekblib_a0a606d6619c906d1c6f4619c0d2650a1}{kblib\+::copy\+\_\+n\+\_\+if} (Input\+It first, Size count, Output\+It out, Unary\+Predicate pred)
\item 
{\footnotesize template$<$typename Input\+It , typename Size , typename Output\+It , typename Unary\+Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Output\+It \hyperlink{namespacekblib_a10d4efc26b68c0d2c98f81ebc710e4d7}{kblib\+::replace\+\_\+copy\+\_\+n\+\_\+if} (Input\+It first, Size count, Output\+It out, Unary\+Predicate pred)
\item 
{\footnotesize template$<$typename Container , typename Input\+It $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_ac933e62df5c2091a1d36055455ab0506}{kblib\+::build\+\_\+copy} (Input\+It first, Input\+It last, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\})
\item 
{\footnotesize template$<$typename Container , typename Range $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_a70cd39db8c10cd59d3a21f8ea7c084b6}{kblib\+::build\+\_\+copy} (Range \&\&r, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\})
\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename std\+::enable\+\_\+if$<$!detail\+::is\+\_\+resizable\+\_\+v$<$ Container $>$, int $>$\+::type  = 0$>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} constexpr Container \hyperlink{namespacekblib_a0614a9032a1acbd04a45474d87dff528}{kblib\+::build\+\_\+copy} (Input\+It first, Input\+It last)
\item 
{\footnotesize template$<$typename Container , typename Range , typename std\+::enable\+\_\+if$<$!detail\+::is\+\_\+resizable\+\_\+v$<$ Container $>$, int $>$\+::type  = 0$>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} constexpr Container \hyperlink{namespacekblib_aac423bca1b97c24d70cd2dc1c7140278}{kblib\+::build\+\_\+copy} (Range \&\&r)
\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename std\+::enable\+\_\+if$<$!detail\+::is\+\_\+resizable\+\_\+v$<$ Container $>$, int $>$\+::type  = 0$>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_af960ab172c73b55fe2fb901867b80a63}{kblib\+::build\+\_\+copy} (Input\+It first, Input\+It last, std\+::size\+\_\+t size)
\item 
{\footnotesize template$<$typename Container , typename Range , typename std\+::enable\+\_\+if$<$!detail\+::is\+\_\+resizable\+\_\+v$<$ Container $>$, int $>$\+::type  = 0$>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_a24b23d362b002b77ee1cd48b2c0cd6b6}{kblib\+::build\+\_\+copy} (Range \&\&r, std\+::size\+\_\+t size)
\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_af038dbac7a9ecdadb7bb74f424bda308}{kblib\+::build\+\_\+copy\+\_\+if} (Input\+It first, Input\+It last, Predicate f, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\})
\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Size $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_ae0591cc27c7840cadd758b32a568743f}{kblib\+::build\+\_\+copy\+\_\+n} (Input\+It first, Size count, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\})
\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Size , typename Predicate $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} Container \hyperlink{namespacekblib_a570b678c26741a736d3758270a8cc38b}{kblib\+::build\+\_\+copy\+\_\+n\+\_\+if} (Input\+It first, Size count, Predicate f, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\})
\item 
{\footnotesize template$<$typename F $>$ }\\consume\+\_\+iterator$<$ F $>$ \hyperlink{namespacekblib_a68d54cd158cd9573c80402f1c7fec401}{kblib\+::consumer} (F f)
\begin{DoxyCompactList}\small\item\em Creates a \hyperlink{classkblib_1_1consume__iterator}{consume\+\_\+iterator} of deduced type F. \end{DoxyCompactList}\end{DoxyCompactItemize}
