\hypertarget{namespace_k_b_l_i_b___n_s}{}\doxysection{KBLIB\+\_\+\+NS Namespace Reference}
\label{namespace_k_b_l_i_b___n_s}\index{KBLIB\_NS@{KBLIB\_NS}}
\doxysubsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1asserts}{asserts}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1best__lcgs}{best\+\_\+lcgs}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1common__lcgs}{common\+\_\+lcgs}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail}{detail}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__algorithm}{detail\+\_\+algorithm}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__bits}{detail\+\_\+bits}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__convert}{detail\+\_\+convert}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__cry}{detail\+\_\+cry}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__direct__map}{detail\+\_\+direct\+\_\+map}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__enumerate}{detail\+\_\+enumerate}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__hash}{detail\+\_\+hash}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__io}{detail\+\_\+io}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__iterators}{detail\+\_\+iterators}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__memory}{detail\+\_\+memory}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__poly}{detail\+\_\+poly}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__simple}{detail\+\_\+simple}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__sort}{detail\+\_\+sort}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__units}{detail\+\_\+units}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1fakestd}{fakestd}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1fnv}{fnv}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1icu__str__ops}{icu\+\_\+str\+\_\+ops}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs}{lcgs}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1literals}{literals}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1multi__impl}{multi\+\_\+impl}}
\item 
namespace \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1nums}{nums}}
\end{DoxyCompactItemize}
\doxysubsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1adjacent__iterator}{adjacent\+\_\+iterator}}
\begin{DoxyCompactList}\small\item\em TODO(killerbee13)\+: Implement \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1adjacent__iterator}{adjacent\+\_\+iterator}}. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1adjuster}{adjuster}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1back__insert__iterator___f}{back\+\_\+insert\+\_\+iterator\+\_\+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 \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1basic__teestream}{basic\+\_\+teestream}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1bitfield}{bitfield}}
\begin{DoxyCompactList}\small\item\em Implements a bitfield abstraction. May be used in a union with other bitfields. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1build__end__t}{build\+\_\+end\+\_\+t}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1build__iterator}{build\+\_\+iterator}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1build__iterator_3_01_container_00_01true_01_4}{build\+\_\+iterator$<$ Container, true $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1class__of}{class\+\_\+of}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1class__of_3_01_m_01_t_1_1_5_01_4}{class\+\_\+of$<$ M T\+::$\ast$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1clone__copy}{clone\+\_\+copy}}
\begin{DoxyCompactList}\small\item\em Implements copy construction using a virtual clone method. This type is provided mostly as an example. \end{DoxyCompactList}\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1compact__bit__trie}{compact\+\_\+bit\+\_\+trie}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1cond__ptr}{cond\+\_\+ptr}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1cond__ptr_3_01_t_0f_0e_00_01_deleter_01_4}{cond\+\_\+ptr$<$ T\mbox{[}$\,$\mbox{]}, Deleter $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1constant}{constant}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1construct__with__capacity}{construct\+\_\+with\+\_\+capacity}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1construct__with__size}{construct\+\_\+with\+\_\+size}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1consume__iterator}{consume\+\_\+iterator}}
\begin{DoxyCompactList}\small\item\em An Output\+Iterator that simply calls a provided functor for each value assigned to it. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1containing__ptr}{containing\+\_\+ptr}}
\begin{DoxyCompactList}\small\item\em A smart pointer to an object contained inside the smart pointer object. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__type}{contains\+\_\+type}}
\begin{DoxyCompactList}\small\item\em Determines if T is a type in Tuple, which must be a std\+::tuple. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__type_3_01std_1_1tuple_3_01_t_00_01_ts_8_8_8_01_4_00_01_t_01_4}{contains\+\_\+type$<$ std\+::tuple$<$ T, Ts... $>$, T $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__type_3_01std_1_1tuple_3_01_t_00_01_ts_8_8_8_01_4_00_01_u_01_4}{contains\+\_\+type$<$ std\+::tuple$<$ T, Ts... $>$, U $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__type_3_01std_1_1tuple_3_4_00_01_t_01_4}{contains\+\_\+type$<$ std\+::tuple$<$$>$, T $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__types}{contains\+\_\+types}}
\begin{DoxyCompactList}\small\item\em Determines if Lhs contains all of the types in Rhs, where both are std\+::tuples. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__types_3_01_tuple_00_01std_1_1tuple_3_01_t_00_01_ts_8_8_8_01_4_01_4}{contains\+\_\+types$<$ Tuple, std\+::tuple$<$ T, Ts... $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__types_3_01_tuple_00_01std_1_1tuple_3_4_01_4}{contains\+\_\+types$<$ Tuple, std\+::tuple$<$$>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1copy__const}{copy\+\_\+const}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1copy__const_3_01_c_00_01_t_01_6_6_00_01true_01_4}{copy\+\_\+const$<$ C, T \&\&, true $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1copy__const_3_01_c_00_01_t_01_6_00_01true_01_4}{copy\+\_\+const$<$ C, T \&, true $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1copy__const_3_01_c_00_01_t_00_01true_01_4}{copy\+\_\+const$<$ C, T, true $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1counting__back__insert__iterator}{counting\+\_\+back\+\_\+insert\+\_\+iterator}}
\begin{DoxyCompactList}\small\item\em Like a std\+::back\+\_\+insert\+\_\+iterator, but it keeps track of how many insertions it has made, allowing an end iterator to be created. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1decrementer}{decrementer}}
\begin{DoxyCompactList}\small\item\em A struct which decrements anything it is added to. Suitable for use as a Delta type for \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1range__t}{range\+\_\+t}}. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1default__copy}{default\+\_\+copy}}
\begin{DoxyCompactList}\small\item\em Implements type erasure for copy construction. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1default__copy_3_01_obj_00_01false_01_4}{default\+\_\+copy$<$ Obj, false $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1default__destroy}{default\+\_\+destroy}}
\begin{DoxyCompactList}\small\item\em Uses the class\textquotesingle{}s virtual destructor. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1default__extract}{default\+\_\+extract}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1default__extract_3_01_key_00_01void__if__t_3_01is__linear__container__v_3_01_key_01_4_01_4_01_4}{default\+\_\+extract$<$ Key, void\+\_\+if\+\_\+t$<$ is\+\_\+linear\+\_\+container\+\_\+v$<$ Key $>$ $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1default__extract_3_01_key_elem_0f_0e_00_01void__if__t_3_01std_1_1is__ia9271ddf1b68df65af4c72e775442b71}{default\+\_\+extract$<$ Key\+Elem\mbox{[}$\,$\mbox{]}, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+integral\+\_\+v$<$ Key\+Elem $>$ $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1default__move}{default\+\_\+move}}
\begin{DoxyCompactList}\small\item\em Implements type erasure for move construction. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1default__move_3_01_obj_00_01false_00_01nothrow_00_01false_01_4}{default\+\_\+move$<$ Obj, false, nothrow, false $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1default__move_3_01_obj_00_01false_00_01nothrow_00_01true_01_4}{default\+\_\+move$<$ Obj, false, nothrow, true $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1delayed__construct}{delayed\+\_\+construct}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1direct__map}{direct\+\_\+map}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1direct__map_3_01_key_00_01_t_00_01void_01_4}{direct\+\_\+map$<$ Key, T, void $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1enumerate__iterator}{enumerate\+\_\+iterator}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1enumerate__t}{enumerate\+\_\+t}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1enumerate__t_3_01_range_00_01void_01_4}{enumerate\+\_\+t$<$ Range, void $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumeration}{enumeration}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumerator__iterator}{enumerator\+\_\+iterator}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumerator__t}{enumerator\+\_\+t}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumerator__t_3_01_range_00_01void_01_4}{enumerator\+\_\+t$<$ Range, void $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1equivalent}{equivalent}}
\begin{DoxyCompactList}\small\item\em A function object implementing the equivalence relationship over a comparison predicate. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1equivalent_3_01_compare_00_01void_01_4}{equivalent$<$ Compare, void $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1equivalent_3_01void_00_01_obj_01_4}{equivalent$<$ void, Obj $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1equivalent_3_01void_00_01void_01_4}{equivalent$<$ void, void $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1exists}{exists}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1exists__t}{exists\+\_\+t}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1extractor__policy__for}{extractor\+\_\+policy\+\_\+for}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1extractor__policy__for_3_01_container_00_01void__t_3_01decltype_07std_56e81d2e167b01deb31e8f2fbef0bc28}{extractor\+\_\+policy\+\_\+for$<$ Container, void\+\_\+t$<$ decltype(std\+::declval$<$ Container $>$()\mbox{[}0\mbox{]})$>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1file__deleter}{file\+\_\+deleter}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1first__bigger__than}{first\+\_\+bigger\+\_\+than}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1first__bigger__than_3_01size_00_01_t_01_4}{first\+\_\+bigger\+\_\+than$<$ size, T $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}
\begin{DoxyCompactList}\small\item\em The primary template has to exist, but not be constructible, in order to be compatible with std\+::hash. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01bool_00_01_hash_int_00_01void_01_4}{FNV\+\_\+hash$<$ bool, Hash\+Int, void $>$}}
\begin{DoxyCompactList}\small\item\em Hasher for bool. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01char_00_01_hash_int_00_01void_01_4}{FNV\+\_\+hash$<$ char, Hash\+Int, void $>$}}
\begin{DoxyCompactList}\small\item\em Hasher for char. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01_container_00_01_hash_int_00_01void__if__t_3_01value_910ba60218b4b4271cfbb059b6082863}{FNV\+\_\+hash$<$ Container, Hash\+Int, void\+\_\+if\+\_\+t$<$ value\+\_\+detected$<$ Container $>$\+::value and is\+\_\+hashable\+\_\+v$<$ value\+\_\+detected\+\_\+t$<$ Container $>$ $>$ and not hash\+\_\+detected$<$ Container $>$\+::value and is\+\_\+iterable$<$ Container $>$\+::value and not(is\+\_\+contiguous$<$ Container $>$\+::value and is\+\_\+trivially\+\_\+hashable\+\_\+v$<$ typename Container\+::value\+\_\+type $>$) and not is\+\_\+iterator\+\_\+v$<$ Container $>$ $>$ $>$}}
\begin{DoxyCompactList}\small\item\em Container hasher, for non-\/trivial elements (or non-\/contiguous storage) \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01_container_00_01_hash_int_00_01void__if__t_3_07is__co3aa82538de267337ce1ca01fa2fc3a1f}{FNV\+\_\+hash$<$ Container, Hash\+Int, void\+\_\+if\+\_\+t$<$(is\+\_\+contiguous\+\_\+v$<$ Container $>$ and is\+\_\+trivially\+\_\+hashable\+\_\+v$<$ typename Container\+::value\+\_\+type $>$)$>$ $>$}}
\begin{DoxyCompactList}\small\item\em Container hasher, for contiguously-\/stored trivial elements. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01delayed__construct_3_01_t_01_4_00_01void_01_4}{FNV\+\_\+hash$<$ delayed\+\_\+construct$<$ T $>$, void $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01signed_01char_00_01_hash_int_00_01void_01_4}{FNV\+\_\+hash$<$ signed char, Hash\+Int, void $>$}}
\begin{DoxyCompactList}\small\item\em Hasher for signed char. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01std_1_1optional_3_01_t_01_4_00_01_hash_int_00_01void_01_4}{FNV\+\_\+hash$<$ std\+::optional$<$ T $>$, Hash\+Int, void $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01_t_00_01_hash_int_00_01void__if__t_3_01not_01is__contd2b0c25de1e3df83b7699e68762c66d2}{FNV\+\_\+hash$<$ T, Hash\+Int, void\+\_\+if\+\_\+t$<$ not is\+\_\+contiguous\+\_\+v$<$ T $>$ and not std\+::is\+\_\+integral$<$ T $>$\+::value and not std\+::is\+\_\+pointer$<$ T $>$\+::value and is\+\_\+trivially\+\_\+hashable\+\_\+v$<$ T $>$ $>$ $>$}}
\begin{DoxyCompactList}\small\item\em Hasher for any non-\/integral trivially copyable type that has no padding. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01_t_00_01_hash_int_00_01void__if__t_3_01std_1_1is__emp845ff852e00bc5763f716e73ff8348db}{FNV\+\_\+hash$<$ T, Hash\+Int, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+empty$<$ T $>$\+::value $>$ $>$}}
\begin{DoxyCompactList}\small\item\em An empty type is treated as if it were a single null byte. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01_t_00_01_hash_int_00_01void__if__t_3_01std_1_1is__inta99ad312e98bed39113f97a968610545}{FNV\+\_\+hash$<$ T, Hash\+Int, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+integral$<$ T $>$\+::value and is\+\_\+trivially\+\_\+hashable\+\_\+v$<$ T $>$ $>$ $>$}}
\begin{DoxyCompactList}\small\item\em Hasher for any integral type without padding type not explicitly mentioned above. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01_t_00_01_hash_int_00_01void__if__t_3_01std_1_1is__poi07c589cfec21657e376fb1d8d282af92}{FNV\+\_\+hash$<$ T, Hash\+Int, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+pointer$<$ T $>$\+::value $>$ $>$}}
\begin{DoxyCompactList}\small\item\em Hasher for any pointer type. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01_t_00_01_hash_int_00_01void__if__t_3_07std_1_1is__basea486f0654055be00075b7ba16e1b406}{FNV\+\_\+hash$<$ T, Hash\+Int, void\+\_\+if\+\_\+t$<$(std\+::is\+\_\+base\+\_\+of$<$ std\+::forward\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ T $>$\+::iterator\+\_\+category $>$\+::value and not std\+::is\+\_\+pointer$<$ T $>$\+::value and not is\+\_\+trivially\+\_\+hashable\+\_\+v$<$ T $>$ and std\+::is\+\_\+pointer$<$ typename fakestd\+::invoke\+\_\+result$<$ decltype(\&\+T\+::operator-\/$>$), T $>$\+::type $>$\+::value)$>$ $>$}}
\begin{DoxyCompactList}\small\item\em Hasher for any forward iterator type. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01unsigned_01char_00_01_hash_int_00_01void_01_4}{FNV\+\_\+hash$<$ unsigned char, Hash\+Int, void $>$}}
\begin{DoxyCompactList}\small\item\em Hasher for unsigned char. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash_3_01void_00_01_hash_int_00_01void_01_4}{FNV\+\_\+hash$<$ void, Hash\+Int, void $>$}}
\begin{DoxyCompactList}\small\item\em Transparent hasher for any hashable type. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1get__manip}{get\+\_\+manip}}
\begin{DoxyCompactList}\small\item\em A helper class for wrapping stream manipulators. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1has__member__swap}{has\+\_\+member\+\_\+swap}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1has__reserve}{has\+\_\+reserve}}
\begin{DoxyCompactList}\small\item\em True if and only if C contains an accessible reserve() member. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1hash__detected}{hash\+\_\+detected}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1hash__detected_3_01_t_00_01void__t_3_01typename_01_t_1_1hasher_01_4_01_4}{hash\+\_\+detected$<$ T, void\+\_\+t$<$ typename T\+::hasher $>$ $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1heap__value}{heap\+\_\+value}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1heap__value2}{heap\+\_\+value2}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1heap__value2_3_01_t_0f_0e_00_01_d_01_4}{heap\+\_\+value2$<$ T\mbox{[}$\,$\mbox{]}, D $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1identity}{identity}}
\begin{DoxyCompactList}\small\item\em The identity function, as a function object. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1ignore}{ignore}}
\begin{DoxyCompactList}\small\item\em Ignores its first template argument entirely, and returns its second. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1implies}{implies}}
\begin{DoxyCompactList}\small\item\em A metafunction for logical implication. That is, if A, then B. If not A, B is unimportant. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1implies_3_01true_00_01false_01_4}{implies$<$ true, false $>$}}
\begin{DoxyCompactList}\small\item\em Logical implication is only not satisfied by true -\/\texorpdfstring{$>$}{>} false. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1in__place__agg__t}{in\+\_\+place\+\_\+agg\+\_\+t}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1incrementer}{incrementer}}
\begin{DoxyCompactList}\small\item\em A struct which increments anything it is added to. Suitable for use as a Delta type for \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1range__t}{range\+\_\+t}}. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1indexer__extractor}{indexer\+\_\+extractor}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1indirect__range}{indirect\+\_\+range}}
\begin{DoxyCompactList}\small\item\em Allow range-\/for iteration of an iterator pair. \end{DoxyCompactList}\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1intrusive__dual__map}{intrusive\+\_\+dual\+\_\+map}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1intrusive__hash__map}{intrusive\+\_\+hash\+\_\+map}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1irange__t}{irange\+\_\+t}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__aliasing__type}{is\+\_\+aliasing\+\_\+type}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__aliasing__type_3_01char_01_4}{is\+\_\+aliasing\+\_\+type$<$ char $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__aliasing__type_3_01unsigned_01char_01_4}{is\+\_\+aliasing\+\_\+type$<$ unsigned char $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__bidirectional__iterator}{is\+\_\+bidirectional\+\_\+iterator}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__bidirectional__iterator_3_01_t_00_01void__if__t_3_01std_1_1is__bascefa0302131a6ac813e11a778897fb54}{is\+\_\+bidirectional\+\_\+iterator$<$ T, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+base\+\_\+of$<$ std\+::bidirectional\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ T $>$\+::iterator\+\_\+category $>$\+::value $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__bounded__array}{is\+\_\+bounded\+\_\+array}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__bounded__array_3_01_t_0f_n_0e_4}{is\+\_\+bounded\+\_\+array$<$ T\mbox{[}\+N\mbox{]}$>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__callable}{is\+\_\+callable}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__character}{is\+\_\+character}}
\begin{DoxyCompactList}\small\item\em Determine if the given type, ignoring const or reference qualifiers, is a character type. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__contiguous}{is\+\_\+contiguous}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__forward__iterator}{is\+\_\+forward\+\_\+iterator}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__forward__iterator_3_01_t_00_01void__if__t_3_01std_1_1is__base__of_9dc5b55b182f1f5263c92e2286345203}{is\+\_\+forward\+\_\+iterator$<$ T, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+base\+\_\+of$<$ std\+::forward\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ T $>$\+::iterator\+\_\+category $>$\+::value $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__hashable}{is\+\_\+hashable}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__hashable_3_01_key_00_01void__if__t_3_01std_1_1is__constructible_3_c80f6d6436e1c46b87ed626b466ae7f7}{is\+\_\+hashable$<$ Key, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+constructible$<$ FNV\+\_\+hash$<$ Key $>$ $>$\+::value $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator_3_01_t_00_01void__if__t_3_01std_1_1is__base__of_3_6996178b5c6d7026225ede60aa715b86}{is\+\_\+input\+\_\+iterator$<$ T, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+base\+\_\+of$<$ std\+::input\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ T $>$\+::iterator\+\_\+category $>$\+::value $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable_3_01_range_00_01void__if__t_3_01is__input__iterator_3_01d6469e56b4426cddd1b4a6ef67d3ecca0}{is\+\_\+iterable$<$ Range, void\+\_\+if\+\_\+t$<$ is\+\_\+input\+\_\+iterator$<$ decltype(begin(std\+::declval$<$ Range \& $>$()))$>$\+::value $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable_3_01_t_07_6_08_0f_n_0e_00_01void_01_4}{is\+\_\+iterable$<$ T(\&)\mbox{[}\+N\mbox{]}, void $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable_3_01_t_0f_n_0e_00_01void_01_4}{is\+\_\+iterable$<$ T\mbox{[}\+N\mbox{]}, void $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterator}{is\+\_\+iterator}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterator_3_01_t_00_01void__t_3_01decltype_07_5std_1_1declval_3_01_c6e33d1ef55ea3a35e8fde6b15af2a0d}{is\+\_\+iterator$<$ T, void\+\_\+t$<$ decltype($\ast$std\+::declval$<$ T \& $>$(), void(),++std\+::declval$<$ T \& $>$())$>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__linear__container}{is\+\_\+linear\+\_\+container}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__optional}{is\+\_\+optional}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__optional_3_01std_1_1optional_3_01_u_01_4_01_4}{is\+\_\+optional$<$ std\+::optional$<$ U $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__output__iterator__for}{is\+\_\+output\+\_\+iterator\+\_\+for}}
\begin{DoxyCompactList}\small\item\em Determine if T is a valid output iterator to which values of type E may be written. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__output__iterator__for_3_01_t_00_01_e_00_01void__t_3_01decltype_07_f8986dd0c7a18d2330212b57a9cc6b14}{is\+\_\+output\+\_\+iterator\+\_\+for$<$ T, E, void\+\_\+t$<$ decltype($\ast$std\+::declval$<$ T \& $>$()++=std\+::declval$<$ const E \& $>$())$>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__radix__sortable}{is\+\_\+radix\+\_\+sortable}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__radix__sortable_3_01std_1_1bitset_3_01_b_01_4_00_01void_01_4}{is\+\_\+radix\+\_\+sortable$<$ std\+::bitset$<$ B $>$, void $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__radix__sortable_3_01_t_00_01void__if__t_3_01is__linear__container_344c5d81cddda4e0c3ec70cd01646919}{is\+\_\+radix\+\_\+sortable$<$ T, void\+\_\+if\+\_\+t$<$ is\+\_\+linear\+\_\+container\+\_\+v$<$ T $>$ and std\+::is\+\_\+integral$<$ typename T\+::value\+\_\+type $>$\+::value $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__radix__sortable_3_01_t_00_01void__if__t_3_01std_1_1is__enum_3_01_t_01_4_1_1value_01_4_01_4}{is\+\_\+radix\+\_\+sortable$<$ T, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+enum$<$ T $>$\+::value $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__radix__sortable_3_01_t_00_01void__if__t_3_01std_1_1is__integral_3_01_t_01_4_1_1value_01_4_01_4}{is\+\_\+radix\+\_\+sortable$<$ T, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+integral$<$ T $>$\+::value $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__random__access__iterator}{is\+\_\+random\+\_\+access\+\_\+iterator}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__random__access__iterator_3_01_t_00_01void__if__t_3_01std_1_1is__baabe99df6ab2e6df56c95e1db0eabccfb}{is\+\_\+random\+\_\+access\+\_\+iterator$<$ T, void\+\_\+if\+\_\+t$<$ std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ T $>$\+::iterator\+\_\+category $>$\+::value $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__resizable}{is\+\_\+resizable}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__space}{is\+\_\+space}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__trivial__transformation}{is\+\_\+trivial\+\_\+transformation}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__trivial__transformation_3_01identity_01_4}{is\+\_\+trivial\+\_\+transformation$<$ identity $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__trivially__hashable}{is\+\_\+trivially\+\_\+hashable}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__tuple__like}{is\+\_\+tuple\+\_\+like}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__tuple__like_3_01_t_00_01void__t_3_01typename_01std_1_1tuple__eleme015afca101efbb586e870a2b46416511}{is\+\_\+tuple\+\_\+like$<$ T, void\+\_\+t$<$ typename std\+::tuple\+\_\+element$<$ 0, T $>$\+::type $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__unbounded__array}{is\+\_\+unbounded\+\_\+array}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__unbounded__array_3_01_t_0f_0e_4}{is\+\_\+unbounded\+\_\+array$<$ T\mbox{[}$\,$\mbox{]}$>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__variant__like}{is\+\_\+variant\+\_\+like}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1iterator__extractor}{iterator\+\_\+extractor}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1iterator__type__for}{iterator\+\_\+type\+\_\+for}}
\begin{DoxyCompactList}\small\item\em Type trait that determines the iterator type for a range. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1iterator__type__for_3_01_range_00_01void__t_3_01decltype_07begin_07stdcb78f48cdb85137aa3a523ad35dadfb5}{iterator\+\_\+type\+\_\+for$<$ Range, void\+\_\+t$<$ decltype(begin(std\+::declval$<$ Range \& $>$()))$>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1iterator__type__for_3_01_t_0f_n_0e_00_01void_01_4}{iterator\+\_\+type\+\_\+for$<$ T\mbox{[}\+N\mbox{]}, void $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1key__detected}{key\+\_\+detected}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1key__detected_3_01_t_00_01void__t_3_01typename_01_t_1_1key__type_01_4_01_4}{key\+\_\+detected$<$ T, void\+\_\+t$<$ typename T\+::key\+\_\+type $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1key__type__setlike}{key\+\_\+type\+\_\+setlike}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1key__type__setlike_3_01_container_00_01true_00_01false_01_4}{key\+\_\+type\+\_\+setlike$<$ Container, true, false $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1lexical__caster}{lexical\+\_\+caster}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1lexical__caster_3_01_same_00_01_same_01_4}{lexical\+\_\+caster$<$ Same, Same $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1lexical__caster_3_01std_1_1string_00_01_from_01_4}{lexical\+\_\+caster$<$ std\+::string, From $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1lexical__caster_3_01std_1_1string_00_01std_1_1string_01_4}{lexical\+\_\+caster$<$ std\+::string, std\+::string $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1lexical__caster_3_01std_1_1string__view_00_01_from_01_4}{lexical\+\_\+caster$<$ std\+::string\+\_\+view, From $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1lexical__caster_3_01std_1_1string__view_00_01std_1_1string_01_4}{lexical\+\_\+caster$<$ std\+::string\+\_\+view, std\+::string $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1lexical__caster_3_01std_1_1string__view_00_01std_1_1string__view_01_4}{lexical\+\_\+caster$<$ std\+::string\+\_\+view, std\+::string\+\_\+view $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1lexical__caster_3_01_to_00_01std_1_1string_01_4}{lexical\+\_\+caster$<$ To, std\+::string $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1lexical__caster_3_01_to_00_01std_1_1string__view_01_4}{lexical\+\_\+caster$<$ To, std\+::string\+\_\+view $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1list__as__tuple}{list\+\_\+as\+\_\+tuple}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1list__as__tuple_3_01_tuple_3_01_ts_8_8_8_01_4_01_4}{list\+\_\+as\+\_\+tuple$<$ Tuple$<$ Ts... $>$ $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1live__ptr}{live\+\_\+ptr}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1live__ptr_3_01const_01m_t_01_4}{live\+\_\+ptr$<$ const m\+T $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1live__wrapper}{live\+\_\+wrapper}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1live__wrapper_3_01const_01_t_01_4}{live\+\_\+wrapper$<$ const T $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1mapped__detected}{mapped\+\_\+detected}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1mapped__detected_3_01_t_00_01void__t_3_01typename_01_t_1_1mapped__type_01_4_01_4}{mapped\+\_\+detected$<$ T, void\+\_\+t$<$ typename T\+::mapped\+\_\+type $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1nums_1_1max__t}{max\+\_\+t}}
\begin{DoxyCompactList}\small\item\em Shorthand for \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1nums_a8f5e5a9f72912486d090c7f2727d2ca0}{std\+::numeric\+\_\+limits\+::max()}}. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1member__of}{member\+\_\+of}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1member__of_3_01_m_01_t_1_1_5_01_4}{member\+\_\+of$<$ M T\+::$\ast$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1meta__type}{meta\+\_\+type}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1meta__type_3_01_t_01_4}{meta\+\_\+type$<$ T $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1metafunction__success}{metafunction\+\_\+success}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1metafunction__success_3_01_t_00_01void__t_3_01typename_01_t_1_1type_01_4_01_4}{metafunction\+\_\+success$<$ T, void\+\_\+t$<$ typename T\+::type $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1nums_1_1min__t}{min\+\_\+t}}
\begin{DoxyCompactList}\small\item\em Shorthand for \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1nums_ac73062a0b718117734c8b40eafb4589e}{std\+::numeric\+\_\+limits\+::min()}} \end{DoxyCompactList}\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1multi__range}{multi\+\_\+range}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1multi__range_3_01_iter1_00_01_end_iter_00_010_01_4}{multi\+\_\+range$<$ Iter1, End\+Iter, 0 $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1multi__span}{multi\+\_\+span}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1null__construct}{null\+\_\+construct}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1null__construct_3_01_t_00_01true_01_4}{null\+\_\+construct$<$ T, true $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1padding__bits}{padding\+\_\+bits}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1poly__obj}{poly\+\_\+obj}}
\begin{DoxyCompactList}\small\item\em Inline polymorphic object. Generally mimics the interfaces of std\+::optional and std\+::variant. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1poly__obj__traits}{poly\+\_\+obj\+\_\+traits}}
\begin{DoxyCompactList}\small\item\em \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1poly__obj__traits}{poly\+\_\+obj\+\_\+traits}} is a traits class template which abstracts the allowed operations on a polymorphic type hierarchy. Any operation allowed by the traits must be usable for the entire hierarchy, not just the base class. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1punner}{punner}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_r_a_i_i__wrapper}{RAII\+\_\+wrapper}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1range__t}{range\+\_\+t}}
\begin{DoxyCompactList}\small\item\em A range generator, similar to Python 3\textquotesingle{}s \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range()}}. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1return__assert}{return\+\_\+assert}}
\begin{DoxyCompactList}\small\item\em Essentially just like std\+::enable\+\_\+if, but with a different name that makes it clearer what it does in the context of return type SFINAE. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1return__assert_3_01true_00_01_t_01_4}{return\+\_\+assert$<$ true, T $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1return__type}{return\+\_\+type}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1return__type_3_01_r_07_args_8_8_8_08_01const_01_4}{return\+\_\+type$<$ R(\+Args...) const $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1return__type_3_01_r_07_args_8_8_8_08_01const_01volatile_01_4}{return\+\_\+type$<$ R(\+Args...) const volatile $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1return__type_3_01_r_07_args_8_8_8_08_01volatile_01_4}{return\+\_\+type$<$ R(\+Args...) volatile $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1return__type_3_01_r_07_args_8_8_8_08_4}{return\+\_\+type$<$ R(\+Args...)$>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1safe__signed}{safe\+\_\+signed}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1safe__signed_3_01_n_00_01std_1_1enable__if__t_3_01std_1_1is__integral_a15f839c74a7d0dde1e703ba1a7fbb75}{safe\+\_\+signed$<$ N, std\+::enable\+\_\+if\+\_\+t$<$ std\+::is\+\_\+integral$<$ N $>$\+::value, void $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1shift__mask}{shift\+\_\+mask}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1sparse__trie__map}{sparse\+\_\+trie\+\_\+map}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1sparse__trie__set}{sparse\+\_\+trie\+\_\+set}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1stack}{stack}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1state__size}{state\+\_\+size}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1state__size_3_01std_1_1discard__block__engine_3_01_engine_00_01_p_00_01_r_01_4_01_4}{state\+\_\+size$<$ std\+::discard\+\_\+block\+\_\+engine$<$ Engine, P, R $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1state__size_3_01std_1_1independent__bits__engine_3_01_engine_00_01_w_00_01_u_int_type_01_4_01_4}{state\+\_\+size$<$ std\+::independent\+\_\+bits\+\_\+engine$<$ Engine, W, UInt\+Type $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1state__size_3_01std_1_1linear__congruential__engine_3_01_u_int_type_00_01a_00_01c_00_01m_01_4_01_4}{state\+\_\+size$<$ std\+::linear\+\_\+congruential\+\_\+engine$<$ UInt\+Type, a, c, m $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1state__size_3_01std_1_1mersenne__twister__engine_3_01_u_int_type_00_01cfe160021cb5dc023bdb8c8ffaa2b341}{state\+\_\+size$<$ std\+::mersenne\+\_\+twister\+\_\+engine$<$ UInt\+Type, w, n, m, r, a, u, d, s, b, t, c, l, f $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1state__size_3_01std_1_1shuffle__order__engine_3_01_engine_00_01_k_01_4_01_4}{state\+\_\+size$<$ std\+::shuffle\+\_\+order\+\_\+engine$<$ Engine, K $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1state__size_3_01std_1_1subtract__with__carry__engine_3_01_u_int_type_00_01w_00_01s_00_01r_01_4_01_4}{state\+\_\+size$<$ std\+::subtract\+\_\+with\+\_\+carry\+\_\+engine$<$ UInt\+Type, w, s, r $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1state__size_3_01transform__engine_3_01_engine_00_01_transform_01_4_01_4}{state\+\_\+size$<$ transform\+\_\+engine$<$ Engine, Transform $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1to__pointer__impl}{to\+\_\+pointer\+\_\+impl}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1to__pointer__impl_3_01_t_01_5_01_4}{to\+\_\+pointer\+\_\+impl$<$ T $\ast$ $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__engine}{transform\+\_\+engine}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{transform\+\_\+iterator}}
\begin{DoxyCompactList}\small\item\em An Input\+Iterator that applies a transformation to the elements of the range. \end{DoxyCompactList}\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1trie}{trie}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1trie_3_01_key_elem_00_01_t_00_01_extractor_00_01false_01_4}{trie$<$ Key\+Elem, T, Extractor, false $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1trie_3_01_key_elem_0f_0e_00_01_t_00_01_extractor_00_01false_01_4}{trie$<$ Key\+Elem\mbox{[}$\,$\mbox{]}, T, Extractor, false $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1trie__map}{trie\+\_\+map}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1trie__qmap}{trie\+\_\+qmap}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1trie__qset}{trie\+\_\+qset}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1trie__set}{trie\+\_\+set}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1trivial__array}{trivial\+\_\+array}}
\begin{DoxyCompactList}\small\item\em std\+::array isn\textquotesingle{}t constexpr enough in C++14, so a dedicated array class is needed for constexpr functions. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1trivial__pair}{trivial\+\_\+pair}}
\begin{DoxyCompactList}\small\item\em std\+::pair isn\textquotesingle{}t constexpr enough, so I\textquotesingle{}m stuck with this. All I use it for is removing a temporary variable from \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1f193cfd181f4fe369fe2bee65f5d129}{calc\+\_\+fib\+\_\+size()}}. \end{DoxyCompactList}\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1trivial__seed__seq}{trivial\+\_\+seed\+\_\+seq}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1type__constant}{type\+\_\+constant}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1unicode__widen}{unicode\+\_\+widen}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1unicode__widen_3_01char16__t_00_01char32__t_01_4}{unicode\+\_\+widen$<$ char16\+\_\+t, char32\+\_\+t $>$}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1union__pun}{union\+\_\+pun}}
\item 
class \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1union__pun_3_01_type_0f_n_0e_00_01_storage_01_4}{union\+\_\+pun$<$ Type\mbox{[}\+N\mbox{]}, Storage $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1value__detected}{value\+\_\+detected}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1value__detected_3_01_t_00_01void__t_3_01typename_01_t_1_1value__type_01_4_01_4}{value\+\_\+detected$<$ T, void\+\_\+t$<$ typename T\+::value\+\_\+type $>$ $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1value__type__linear}{value\+\_\+type\+\_\+linear}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1value__type__linear_3_01_container_00_01false_00_01typename_01_container_1_1value__type_01_4}{value\+\_\+type\+\_\+linear$<$ Container, false, typename Container\+::value\+\_\+type $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1visitor}{visitor}}
\begin{DoxyCompactList}\small\item\em Helper class for std\+::visiting a std\+::variant. \end{DoxyCompactList}\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1void__if}{void\+\_\+if}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1void__if_3_01true_01_4}{void\+\_\+if$<$ true $>$}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1zip__iterator}{zip\+\_\+iterator}}
\item 
struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1zip__iterator_3_01_it1_00_01_it1_00_01_it2_01_4}{zip\+\_\+iterator$<$ It1, It1, It2 $>$}}
\end{DoxyCompactItemize}
\doxysubsection*{Typedefs}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$bool B, typename T  = void$>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}} = typename std\+::enable\+\_\+if$<$ B, T $>$\+::type
\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9ca62d3247bc9fffca3c56a197833f09}{decay\+\_\+t}} = typename std\+::decay$<$ T $>$\+::type
\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a98c871b73b590b089f642ee077b87f1e}{remove\+\_\+cvref\+\_\+t}} = typename std\+::remove\+\_\+reference$<$ typename std\+::remove\+\_\+cv$<$ T $>$\+::type $>$\+::type
\item 
{\footnotesize template$<$bool v$>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac8f388d87596921ece55f638526fe2cf}{bool\+\_\+constant}} = std\+::integral\+\_\+constant$<$ bool, v $>$
\item 
{\footnotesize template$<$typename... Ts$>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1a16fc0dc51875287e1283418bdce309}{meta\+\_\+type\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1meta__type}{meta\+\_\+type}}$<$ Ts... $>$\+::type
\item 
{\footnotesize template$<$bool b$>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0091fb16bc1767a3e5e1cff5aa8dff53}{void\+\_\+if\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1void__if}{void\+\_\+if}}$<$ b $>$\+::type
\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac2296caf0179b2d4fa39e2cf451e0406}{metafunction\+\_\+value\+\_\+t}} = std\+::integral\+\_\+constant$<$ decltype(T\+::value), T\+::value $>$
\item 
{\footnotesize template$<$bool V, typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}{return\+\_\+assert\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1return__assert}{return\+\_\+assert}}$<$ V, T $>$\+::type
\item 
{\footnotesize template$<$typename N $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a91a41b470a640f9d17fee50cfdd2fadb}{safe\+\_\+signed\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1safe__signed}{safe\+\_\+signed}}$<$ N $>$\+::type
\item 
{\footnotesize template$<$typename C , typename V $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a04784aad6b67bfd042b6047e3fb249c2}{copy\+\_\+const\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1copy__const}{copy\+\_\+const}}$<$ C, V $>$\+::type
\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a50c93c7b2ebacfc3a249f7a3734e703f}{value\+\_\+detected\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1value__detected}{value\+\_\+detected}}$<$ T $>$\+::type
\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aac113d3112d84af6e32d19d5a7f890c0}{key\+\_\+detected\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1key__detected}{key\+\_\+detected}}$<$ T $>$\+::type
\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a027411aa833d3ac81da4ba8c121a97a4}{mapped\+\_\+detected\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1mapped__detected}{mapped\+\_\+detected}}$<$ T $>$\+::type
\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab1ff4774485d301335864418e11d23b3}{hash\+\_\+detected\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1hash__detected}{hash\+\_\+detected}}$<$ T $>$\+::type
\item 
{\footnotesize template$<$typename Container $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aea5c475c5fb0f416b30f5825af77348b}{value\+\_\+type\+\_\+linear\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1value__type__linear}{value\+\_\+type\+\_\+linear}}$<$ Container $>$\+::type
\item 
{\footnotesize template$<$typename Container $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8905d58cb8a629b4855c025d5d776d10}{key\+\_\+type\+\_\+setlike\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1key__type__setlike}{key\+\_\+type\+\_\+setlike}}$<$ Container $>$\+::type
\item 
{\footnotesize template$<$typename Key $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0baf7f273d11c50bb2196f65613ca4c4}{FNV32\+\_\+hash}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}$<$ Key, std\+::uint32\+\_\+t $>$
\item 
{\footnotesize template$<$typename Key , typename Value $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a453846898a9637e1a2078a0cc4e67ab3}{hash\+\_\+map}} = std\+::unordered\+\_\+map$<$ Key, Value, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}$<$$>$, std\+::equal\+\_\+to$<$$>$ $>$
\item 
{\footnotesize template$<$typename Key , typename Value $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a623ae888d36f9df8bdf8df7b969a4ff1}{hash\+\_\+multimap}} = std\+::unordered\+\_\+multimap$<$ Key, Value, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}$<$$>$, std\+::equal\+\_\+to$<$$>$ $>$
\item 
{\footnotesize template$<$typename T , typename Hash\+Int $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a91b42f72534f684c16e3ad9f6a7e5873}{hash\+\_\+set}} = std\+::unordered\+\_\+set$<$ T, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}$<$$>$, std\+::equal\+\_\+to$<$$>$ $>$
\item 
{\footnotesize template$<$typename T , typename Hash\+Int $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_acd4f5597b05e84fe51b7a4a0722c023a}{hash\+\_\+multiset}} = std\+::unordered\+\_\+set$<$ T, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}$<$$>$, std\+::equal\+\_\+to$<$$>$ $>$
\item 
{\footnotesize template$<$typename Obj $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a110c552938ea9c6316853a0e993f8863}{move\+\_\+only\+\_\+traits}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1poly__obj__traits}{poly\+\_\+obj\+\_\+traits}}$<$ Obj, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea3734a903022249b3010be1897042568e}{construct\+\_\+type\+::move}} $>$
\item 
{\footnotesize template$<$typename Obj $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a308d6ba5cd981f47a8f926d1afe17c5e}{no\+\_\+move\+\_\+traits}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1poly__obj__traits}{poly\+\_\+obj\+\_\+traits}}$<$ Obj, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea334c4a4c42fdb79d7ebc3e73b517e6f8}{construct\+\_\+type\+::none}} $>$
\item 
{\footnotesize template$<$typename UInt\+Type , UInt\+Type a, UInt\+Type c, UInt\+Type b$>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_a16d9cea77b91d5d13d5f37561a878bbc}{lcg\+\_\+p2}} = std\+::linear\+\_\+congruential\+\_\+engine$<$ UInt\+Type, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a228a6004801f23e3746cd67df6bcbeb6}{a}}, c, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae3666c3da5e91fbec62c284b7b5cae03}{ipow2}}(b)$>$
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1common__lcgs_a31b9a2b76d61323a713bd63ac4f06cf1}{rand48}} = \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__engine}{transform\+\_\+engine}}$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_a16d9cea77b91d5d13d5f37561a878bbc}{lcg\+\_\+p2}}$<$ std\+::uint\+\_\+fast64\+\_\+t, 25214903917u, 11u, 48u $>$, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1shift__mask}{shift\+\_\+mask}}$<$ std\+::uint\+\_\+fast32\+\_\+t, 16u $>$ $>$
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1common__lcgs_a4a5a39a88db74a7d3074130e2acc6150}{java\+\_\+rand}} = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1common__lcgs_a31b9a2b76d61323a713bd63ac4f06cf1}{rand48}}
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1common__lcgs_a6608a6aef4514d7e09f1ce3456c9d8ad}{glibc\+\_\+rand0}} = \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__engine}{transform\+\_\+engine}}$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_a16d9cea77b91d5d13d5f37561a878bbc}{lcg\+\_\+p2}}$<$ std\+::uint\+\_\+fast32\+\_\+t, 1103515245, 12345, 31u $>$, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1shift__mask}{shift\+\_\+mask}}$<$ std\+::uint\+\_\+fast32\+\_\+t, 0, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae3666c3da5e91fbec62c284b7b5cae03}{ipow2}}(30) -\/ 1 $>$ $>$
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1common__lcgs_a9c2299f34e04975908100024ead9913d}{ansic\+\_\+rand}} = \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__engine}{transform\+\_\+engine}}$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_a16d9cea77b91d5d13d5f37561a878bbc}{lcg\+\_\+p2}}$<$ std\+::uint\+\_\+fast32\+\_\+t, 1103515245, 12345, 31u $>$, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1shift__mask}{shift\+\_\+mask}}$<$ std\+::uint\+\_\+fast32\+\_\+t, 16, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae3666c3da5e91fbec62c284b7b5cae03}{ipow2}}(14) -\/ 1 $>$ $>$
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1common__lcgs_ab784f3c15c01533b260cd824bb93f1ba}{knuth\+\_\+lcg}} = std\+::linear\+\_\+congruential\+\_\+engine$<$ uint64\+\_\+t, 6364136223846793005U, 1442695040888963407U, 0U $>$
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1best__lcgs_a4f895c24c45f959d19c97987d31ec954}{lcg32}} = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_a16d9cea77b91d5d13d5f37561a878bbc}{lcg\+\_\+p2}}$<$ std\+::uint\+\_\+fast32\+\_\+t, 0xa13fc965u, 1u, 32u $>$
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1best__lcgs_ad0cd98de0d92e70a8ea93ef9bfd86670}{mcg32}} = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_a16d9cea77b91d5d13d5f37561a878bbc}{lcg\+\_\+p2}}$<$ std\+::uint\+\_\+fast32\+\_\+t, 0x93d765ddu, 0u, 32u $>$
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1best__lcgs_ad0372e22f6a1d79da47d627e324d5250}{lcg48}} = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_a16d9cea77b91d5d13d5f37561a878bbc}{lcg\+\_\+p2}}$<$ std\+::uint\+\_\+fast64\+\_\+t, 0xb67a49a5466du, 1u, 48u $>$
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1best__lcgs_a58a6d8cf0f93748aa0fec694ffde00cb}{mcg48}} = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_a16d9cea77b91d5d13d5f37561a878bbc}{lcg\+\_\+p2}}$<$ std\+::uint\+\_\+fast64\+\_\+t, 0xbdcdbb079f8du, 0u, 48u $>$
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1best__lcgs_a2d9e5b53552e4666b4ab86c6559cd6c7}{lcg64}} = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_a16d9cea77b91d5d13d5f37561a878bbc}{lcg\+\_\+p2}}$<$ std\+::uint\+\_\+fast64\+\_\+t, 0xaf251af3b0f025b5u, 1u, 64u $>$
\item 
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_1_1best__lcgs_a6c6bfe1e6bf942fb51f48876636892de}{mcg64}} = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1lcgs_a16d9cea77b91d5d13d5f37561a878bbc}{lcg\+\_\+p2}}$<$ std\+::uint\+\_\+fast64\+\_\+t, 0xf1357aea2e62a9c5u, 0u, 64u $>$
\item 
{\footnotesize template$<$std\+::uintmax\+\_\+t I$>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa726cc2b355d8730e22e4e299ba3517b}{uint\+\_\+smallest}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1first__bigger__than}{first\+\_\+bigger\+\_\+than}}$<$ 1+\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6d8b22c40c02b17c6613fecdab5e9224}{filg2}}(I)/CHAR\+\_\+\+BIT, unsigned char, unsigned short, unsigned int, unsigned long, unsigned long long, std\+::uintmax\+\_\+t $>$\+::type
\item 
{\footnotesize template$<$std\+::uintmax\+\_\+t I$>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab029267427cb2d9df9424940c35197f5}{int\+\_\+smallest}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1first__bigger__than}{first\+\_\+bigger\+\_\+than}}$<$ 1+(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6d8b22c40c02b17c6613fecdab5e9224}{filg2}}(I)+1)/CHAR\+\_\+\+BIT, signed char, signed short, signed int, signed long, signed long long, std\+::uintmax\+\_\+t $>$\+::type
\item 
{\footnotesize template$<$std\+::uintmax\+\_\+t I$>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8077c993a23167a9bb59fa731fcb8b9e}{uint\+\_\+smallest\+\_\+t}} = typename \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa726cc2b355d8730e22e4e299ba3517b}{uint\+\_\+smallest}}$<$ I $>$\+::type
\item 
{\footnotesize template$<$std\+::uintmax\+\_\+t I$>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9c8bd9fdb65a7d842fb948f8e14090e7}{int\+\_\+smallest\+\_\+t}} = typename \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab029267427cb2d9df9424940c35197f5}{int\+\_\+smallest}}$<$ I $>$\+::type
\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abb0512894a5edc47918561c7c5185210}{alias}} = T
\begin{DoxyCompactList}\small\item\em A simple identity alias for simplifying some compound type declarations, such as function pointers. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename U , typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a12b5ffbb1ba36b917437285c8df9c4fc}{ignore\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1ignore}{ignore}}$<$ U, T $>$\+::type
\begin{DoxyCompactList}\small\item\em An alias for \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1ignore_ad823ada323dba191a1d1e9ecedf004c8}{ignore$<$\+U, T$>$\+::type}}. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a107dab7f8237c8700709e455c12c6ad7}{class\+\_\+of\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1class__of}{class\+\_\+of}}$<$ T $>$\+::type
\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7b2c7852f91faa3b4b8e273b38ff3414}{member\+\_\+of\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1member__of}{member\+\_\+of}}$<$ T $>$\+::type
\item 
{\footnotesize template$<$typename Range $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}{iterator\+\_\+type\+\_\+for\+\_\+t}} = typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1iterator__type__for}{iterator\+\_\+type\+\_\+for}}$<$ Range $>$\+::type
\item 
{\footnotesize template$<$typename T $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa9ba0966f8f5a91828c50546834bf1ee}{remove\+\_\+reference\+\_\+t}} = typename std\+::remove\+\_\+reference$<$ T $>$\+::type
\begin{DoxyCompactList}\small\item\em Abbreviated name for std\+::remove\+\_\+reference$<$\+T$>$\+::type for C++14. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container $>$ }\\using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abfee15df2202cbc4e8fcc10c713fbb56}{default\+\_\+extractor\+\_\+t}} = typename std\+::conditional$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1extractor__policy__for}{extractor\+\_\+policy\+\_\+for}}$<$ Container $>$\+::value==\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715ea298bbb8f070170fc998ccac67856211b}{extractor\+\_\+policy\+::random\+\_\+access}}, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1indexer__extractor}{indexer\+\_\+extractor}}$<$ Container $>$, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1iterator__extractor}{iterator\+\_\+extractor}}$<$ Container $>$ $>$\+::type
\end{DoxyCompactItemize}
\doxysubsection*{Enumerations}
\begin{DoxyCompactItemize}
\item 
enum class \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}} \+: unsigned \{ \newline
\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea334c4a4c42fdb79d7ebc3e73b517e6f8}{none}} = 0
, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea849f12a705c6dbc3ff5da992d47a9982}{copy\+\_\+only}} = 1
, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea3734a903022249b3010be1897042568e}{move}} = 2
, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8eaf6cb3e816496528d4187db53bc66567f}{both}} = 3
, \newline
\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea04d3c750404e3d492d5d7d920189aa52}{throw\+\_\+move}} = 4
, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8eab009e0a1fa84b4e6e58f4ea7acba9712}{both\+\_\+throw}} = 5
 \}
\item 
enum class \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1}{endian}} \{ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1aad921d60486366258809553a3db49a4a}{unknown}}
, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1aaae6635e044ac56046b2893a529b5114}{little}}
, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1ad861877da56b8b4ceb35c8cbfdf65bb4}{big}}
, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1a498c381ba18fc1be2160719e3e0a7c45}{weird}}
 \}
\item 
enum class \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715e}{extractor\+\_\+policy}} \{ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715ea982690af3684bc526ae7a353bc6ef61e}{forward\+\_\+iteration}}
, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715ea298bbb8f070170fc998ccac67856211b}{random\+\_\+access}}
 \}
\end{DoxyCompactItemize}
\doxysubsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Callable $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a77513f07af0f3ac69df7106123d43a7e}{repeat}} (std\+::size\+\_\+t N, Callable func) noexcept(noexcept(func())) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}{return\+\_\+assert\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fakestd_1_1is__invocable}{is\+\_\+invocable}}$<$ Callable $>$\+::value, void $>$
\begin{DoxyCompactList}\small\item\em Invoke a function N times. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Elem $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af24b9b768975292caa9e33ba4931263a}{erase}} (Container \&c, const Elem \&val) noexcept(noexcept(c.\+erase(std\+::remove(c.\+begin(), c.\+end(), val), c.\+end()))) -\/$>$ void
\begin{DoxyCompactList}\small\item\em Abbreviation of the erase-\/remove idiom as a free function. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a133bb5131fb05e574cc981321ceb6f7c}{erase\+\_\+if}} (Container \&c, Unary\+Predicate p) noexcept(noexcept(c.\+erase(std\+::remove\+\_\+if(c.\+begin(), c.\+end(), std\+::ref(p)), c.\+end()))) -\/$>$ void
\begin{DoxyCompactList}\small\item\em Abbreviation of the erase-\/remove idiom as a free function. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Obj $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a119ddac7711a98a66c29e9cb8b62f30a}{equals}} (const Obj \&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a228a6004801f23e3746cd67df6bcbeb6}{a}}, const Obj \&b) noexcept(noexcept(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a228a6004801f23e3746cd67df6bcbeb6}{a}}$<$ b)) -\/$>$ bool
\begin{DoxyCompactList}\small\item\em Synthesize an equivalence relation from \texorpdfstring{$<$}{<}. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Obj , typename Compare $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a10ae3dc42098d5ddc13a68f7fc40ac48}{equals}} (const Obj \&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a228a6004801f23e3746cd67df6bcbeb6}{a}}, const Obj \&b, Compare comp) noexcept(noexcept(comp(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a228a6004801f23e3746cd67df6bcbeb6}{a}}, b))) -\/$>$ bool
\begin{DoxyCompactList}\small\item\em Synthesize an equivalence relation from comp. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8fa705a689ce27f32b438c80bf1682e4}{accumulate}} (Input\+It first, Input\+It last, T init) -\/$>$ T
\begin{DoxyCompactList}\small\item\em A constexpr version of std\+::accumulate. \end{DoxyCompactList}\item 
{\footnotesize template$<$class Input\+It , class T , class Binary\+Operation $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a806f9e3164b3d004bb1300a3951720b0}{accumulate}} (Input\+It first, Input\+It last, T init, Binary\+Operation op) -\/$>$ T
\begin{DoxyCompactList}\small\item\em A constexpr version of std\+::accumulate. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a5d48b1cec61b0ac320ba5522476da644}{sum}} (Input\+It first, Input\+It last) -\/$>$ std\+::decay\+\_\+t$<$ decltype($\ast$first)$>$
\begin{DoxyCompactList}\small\item\em Sum a range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename Binary\+Operation $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a146482c2a0c53da5fe57eed6e0c9040e}{sum}} (Input\+It first, Input\+It last, Binary\+Operation op) -\/$>$ std\+::decay\+\_\+t$<$ decltype($\ast$first)$>$
\begin{DoxyCompactList}\small\item\em Fold a range over an operation. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Range $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6a38ad93575187b89e5cd84e78abaf15}{sum}} (Range \&\&r) -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Sum a range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename Output\+It , typename T , typename Binary\+Accumulation , typename Unary\+Transform $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae0cfc3f04e375d11b53fe0ac7273a6df}{transform\+\_\+exclusive\+\_\+scan}} (Input\+It first, End\+It last, Output\+It d\+\_\+first, T init, Binary\+Accumulation accum, Unary\+Transform proj) -\/$>$ Output\+It
\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Elem $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1b371704f5fe368fd747c6b39b712b0e}{find}} (Forward\+It begin, End\+It end, const Elem \&value) noexcept(noexcept($\ast$begin==value)) -\/$>$ Forward\+It
\begin{DoxyCompactList}\small\item\em Finds a value in range \mbox{[}begin, end). If not found, returns end. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Elem , typename Comp $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab598258691c5d6db7f4834e72b0ba48a}{find}} (Forward\+It begin, End\+It end, const Elem \&value, Comp \&\&comp) noexcept(noexcept(comp($\ast$begin, value))) -\/$>$ Forward\+It
\begin{DoxyCompactList}\small\item\em Finds a value in range \mbox{[}begin, end). If not found, returns end. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af881ba9efd10b46a2c1e5af03cbc863c}{find\+\_\+if}} (Forward\+It begin, End\+It end, Unary\+Predicate \&\&pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$begin))) -\/$>$ Forward\+It
\begin{DoxyCompactList}\small\item\em Finds the first value in range \mbox{[}begin, end) for which pred returns true. If not found, returns end. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abd5ee6f314e18478c56920d3c7e44f12}{find\+\_\+if\+\_\+not}} (Forward\+It begin, End\+It end, Unary\+Predicate \&\&pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$begin))) -\/$>$ Forward\+It
\begin{DoxyCompactList}\small\item\em Finds the first value in range \mbox{[}begin, end) for which pred returns false. If not found, returns end. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Elem $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2480d244f4b70ac9c8e4121dbeb567e7}{find\+\_\+last}} (Forward\+It begin, End\+It end, const Elem \&value) noexcept(noexcept($\ast$begin==value)) -\/$>$ Forward\+It
\begin{DoxyCompactList}\small\item\em Searches a range for the last occurence of a match, and returns an iterator to it. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aed549300c926555a57e3b6f94a4210f6}{find\+\_\+last\+\_\+if}} (Forward\+It begin, End\+It end, Unary\+Predicate pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$begin))) -\/$>$ Forward\+It
\begin{DoxyCompactList}\small\item\em Searches a range for the last element on which a predicate returns true. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a944b52fe15f517de5a28a7489c069aed}{find\+\_\+last\+\_\+if\+\_\+not}} (Forward\+It begin, End\+It end, Unary\+Predicate pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$begin))) -\/$>$ Forward\+It
\begin{DoxyCompactList}\small\item\em Searches a range for the last element on which a predicate returns false. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Elem $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4c94ada1643743e3446527183d63fd27}{find\+\_\+in}} (Forward\+It begin, End\+It end, const Elem \&value) noexcept(noexcept($\ast$begin==value)) -\/$>$ size\+\_\+t
\begin{DoxyCompactList}\small\item\em Find the offset of the first ocurrence of v in a range from the beginning. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae408943e86a7c20b360c60ab896dce68}{find\+\_\+in\+\_\+if}} (Forward\+It begin, End\+It end, Unary\+Predicate pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$begin))) -\/$>$ size\+\_\+t
\begin{DoxyCompactList}\small\item\em Find the offset of the first element for which p returns true. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa78cb738c35166ad527997636f0308c3}{find\+\_\+in\+\_\+if\+\_\+not}} (Forward\+It begin, End\+It end, Unary\+Predicate pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$begin))) -\/$>$ size\+\_\+t
\begin{DoxyCompactList}\small\item\em Find the offset of the first element for which p returns false. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Elem $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a70f6eb60ca2411cea0bb5a3b30ed3a6d}{find\+\_\+last\+\_\+in}} (Forward\+It begin, End\+It end, const Elem \&value) noexcept(noexcept($\ast$begin==value)) -\/$>$ size\+\_\+t
\begin{DoxyCompactList}\small\item\em Find the offset of the last ocurrence of v in a range from the beginning. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad88aeb9508fdd0cf27e227803426fff6}{find\+\_\+last\+\_\+in\+\_\+if}} (Forward\+It begin, End\+It end, Unary\+Predicate pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$begin))) -\/$>$ size\+\_\+t
\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a39aac3fa0c92f5fe0d7c308f05a6164a}{find\+\_\+last\+\_\+in\+\_\+if\+\_\+not}} (Forward\+It begin, End\+It end, Unary\+Predicate pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$begin))) -\/$>$ size\+\_\+t
\begin{DoxyCompactList}\small\item\em Find the offset of the last element for which p returns false. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a25abbc78ac92a8aa83f15107b0cdbf1a}{find\+\_\+in}} (const Container \&c, const T \&value) noexcept(noexcept($\ast$std\+::declval$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}{iterator\+\_\+type\+\_\+for\+\_\+t}}$<$ const Container $>$ \& $>$()==value)) -\/$>$ size\+\_\+t
\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 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a302815dcc914c42a780153b88f388744}{find\+\_\+in\+\_\+if}} (const Container \&c, Unary\+Predicate pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$std\+::declval$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}{iterator\+\_\+type\+\_\+for\+\_\+t}}$<$ const Container $>$ \& $>$()))) -\/$>$ size\+\_\+t
\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 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a63375b36bfee215035ef586234228d43}{find\+\_\+in\+\_\+if\+\_\+not}} (const Container \&c, Unary\+Predicate pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$std\+::declval$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}{iterator\+\_\+type\+\_\+for\+\_\+t}}$<$ const Container $>$ \& $>$()))) -\/$>$ size\+\_\+t
\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 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3ed00b1116a7c99900949cdb4015414c}{find\+\_\+last\+\_\+in}} (const Container \&c, const T \&value) noexcept(noexcept($\ast$std\+::declval$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}{iterator\+\_\+type\+\_\+for\+\_\+t}}$<$ const Container $>$ \& $>$()==value)) -\/$>$ size\+\_\+t
\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 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9e2a3db73a52b15f61658212102647a4}{find\+\_\+last\+\_\+in\+\_\+if}} (const Container \&c, Unary\+Predicate pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$std\+::declval$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}{iterator\+\_\+type\+\_\+for\+\_\+t}}$<$ const Container $>$ \& $>$()))) -\/$>$ size\+\_\+t
\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 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a611e38267ef1238f155b21b300fbf511}{find\+\_\+last\+\_\+in\+\_\+if\+\_\+not}} (const Container \&c, Unary\+Predicate pred) noexcept(noexcept(kblib\+::invoke(pred, $\ast$std\+::declval$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}{iterator\+\_\+type\+\_\+for\+\_\+t}}$<$ const Container $>$ \& $>$()))) -\/$>$ size\+\_\+t
\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 Input\+It1 , typename End\+It1 , typename Input\+It2 , typename Binary\+Predicate  = std\+::equal\+\_\+to$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7d74acf6df0eb6421a1411d2d2b95ee7}{find\+\_\+match}} (Input\+It1 begin1, End\+It1 end1, Input\+It2 begin2, Binary\+Predicate cmp) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It1 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It2 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fakestd_1_1is__invocable}{is\+\_\+invocable}}$<$ Binary\+Predicate, decltype($\ast$begin1), decltype($\ast$begin2)$>$\+::value, std\+::pair$<$ Input\+It1, Input\+It2 $>$ $>$
\item 
{\footnotesize template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename End\+It2 , typename Binary\+Predicate  = std\+::equal\+\_\+to$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a94512ed952a332ce3ed37d64f41e8104}{find\+\_\+match}} (Input\+It1 begin1, End\+It1 end1, Input\+It2 begin2, End\+It2 end2, Binary\+Predicate cmp) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It1 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It2 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fakestd_1_1is__invocable}{is\+\_\+invocable}}$<$ Binary\+Predicate, decltype($\ast$begin1), decltype($\ast$begin2)$>$\+::value, std\+::pair$<$ Input\+It1, Input\+It2 $>$ $>$
\item 
{\footnotesize template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename End\+It2 , typename Binary\+Pred $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a038b8f8a29c08c5e8abf893bed3d6942}{starts\+\_\+with}} (Input\+It1 begin1, End\+It1 end1, Input\+It2 begin2, End\+It2 end2, Binary\+Pred pred) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a547a1e7930fbf709bb1b79b40f482566}{is\+\_\+input\+\_\+iterator\+\_\+v}}$<$ Input\+It1 $>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a547a1e7930fbf709bb1b79b40f482566}{is\+\_\+input\+\_\+iterator\+\_\+v}}$<$ Input\+It2 $>$) and not(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$ Input\+It1 $>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$ Input\+It2 $>$), bool $>$
\begin{DoxyCompactList}\small\item\em Checks if a given range starts with a particular subrange. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Random\+Access\+It1 , typename Random\+Access\+It2 , typename Binary\+Pred  = std\+::equal\+\_\+to$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a218af9c4eaab5cc0d407c8e1546fa75b}{starts\+\_\+with}} (Random\+Access\+It1 begin1, Random\+Access\+It1 end1, Random\+Access\+It2 begin2, Random\+Access\+It2 end2, Binary\+Pred pred=\{\}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$ Random\+Access\+It1 $>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$ Random\+Access\+It2 $>$, bool $>$
\begin{DoxyCompactList}\small\item\em Checks if a given range starts with a particular subrange. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Bidir\+It1 , typename Bidir\+It2 , typename Binary\+Pred  = std\+::equal\+\_\+to$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_acc271f74ef547ac8181b0bd434ed5e66}{ends\+\_\+with}} (Bidir\+It1 begin1, Bidir\+It1 end1, Bidir\+It2 begin2, Bidir\+It2 end2, Binary\+Pred pred=\{\}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9b0f47dcb794a46a80201a97520e9423}{is\+\_\+bidirectional\+\_\+iterator\+\_\+v}}$<$ Bidir\+It1 $>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9b0f47dcb794a46a80201a97520e9423}{is\+\_\+bidirectional\+\_\+iterator\+\_\+v}}$<$ Bidir\+It2 $>$) and not(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$ Bidir\+It1 $>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$ Bidir\+It2 $>$), bool $>$
\begin{DoxyCompactList}\small\item\em Checks if a given range ends with a particular subrange. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Random\+Access\+It1 , typename Random\+Access\+It2 , typename Binary\+Pred  = std\+::equal\+\_\+to$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_afe69ce73c3d68767258431f75f41848d}{ends\+\_\+with}} (Random\+Access\+It1 begin1, Random\+Access\+It1 end1, Random\+Access\+It2 begin2, Random\+Access\+It2 end2, Binary\+Pred pred=\{\}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$ Random\+Access\+It1 $>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$ Random\+Access\+It2 $>$, bool $>$
\begin{DoxyCompactList}\small\item\em Checks if a given range ends with a particular subrange. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename T , typename Unary\+Transform $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a919627898c324974068a6d2ef7bed995}{first\+\_\+result}} (Input\+It begin, End\+It end, T def, Unary\+Transform op) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It $>$\+::value, std\+::decay\+\_\+t$<$ decltype(op($\ast$begin))$>$ $>$
\item 
{\footnotesize template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename T , typename Binary\+Transform $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a33f4a56bcc2ff338cee41b057a8f2286}{first\+\_\+result}} (Input\+It1 begin1, End\+It1 end1, Input\+It2 begin2, T def, Binary\+Transform op) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It1 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It2 $>$\+::value, std\+::decay\+\_\+t$<$ decltype(op($\ast$begin1, $\ast$begin2))$>$ $>$
\item 
{\footnotesize template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename End\+It2 , typename T , typename Binary\+Transform $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab599de18b69a0f7118610d6258fd2efb}{first\+\_\+result}} (Input\+It1 begin1, End\+It1 end1, Input\+It2 begin2, End\+It2 end2, T def, Binary\+Transform op) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It1 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It2 $>$\+::value, std\+::decay\+\_\+t$<$ decltype(op($\ast$begin1, $\ast$begin2))$>$ $>$
\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename T , typename Unary\+Transform , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af307bcafc7d275f274678f57149948c4}{first\+\_\+result\+\_\+if}} (Input\+It begin, End\+It end, T def, Unary\+Transform op, Unary\+Predicate ch) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It $>$\+::value, decltype(op($\ast$begin))$>$
\item 
{\footnotesize template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename T , typename Binary\+Transform , typename Binary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a49b00e1cc37a530bf915891ec3db6e8a}{first\+\_\+result\+\_\+if}} (Input\+It1 begin1, End\+It1 end1, Input\+It2 begin2, T def, Binary\+Transform op, Binary\+Predicate ch) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It1 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It2 $>$\+::value, decltype(op($\ast$begin1, $\ast$begin2))$>$
\item 
{\footnotesize template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename End\+It2 , typename T , typename Binary\+Transform , typename Binary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a09ec8bf519253c73bb25f14914c35fab}{first\+\_\+result\+\_\+if}} (Input\+It1 begin1, End\+It1 end1, Input\+It2 begin2, End\+It2 end2, T def, Binary\+Transform op, Binary\+Predicate ch) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It1 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It2 $>$\+::value, decltype(op($\ast$begin1, $\ast$begin2))$>$
\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename T , typename Unary\+Transform $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7d8e444ca9a68ffefb42047b3284804b}{first\+\_\+result\+\_\+opt}} (Input\+It begin, End\+It end, T def, Unary\+Transform op) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It $>$\+::value, std\+::decay\+\_\+t$<$ decltype(op($\ast$begin))$>$ $>$
\item 
{\footnotesize template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename T , typename Binary\+Transform $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad86cf6f0fadb1b56df704cf0379bfa21}{first\+\_\+result\+\_\+opt}} (Input\+It1 begin1, End\+It1 end1, Input\+It2 begin2, T def, Binary\+Transform op) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It1 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It2 $>$\+::value, std\+::decay\+\_\+t$<$ decltype(op($\ast$begin1, $\ast$begin2))$>$ $>$
\item 
{\footnotesize template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename End\+It2 , typename T , typename Binary\+Transform $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa0a57d4a98f80781d52cd6c440f7d7d2}{first\+\_\+result\+\_\+opt}} (Input\+It1 begin1, End\+It1 end1, Input\+It2 begin2, End\+It2 end2, T def, Binary\+Transform op) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It1 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It2 $>$\+::value, std\+::decay\+\_\+t$<$ decltype(op($\ast$begin1, $\ast$begin2))$>$ $>$
\item 
{\footnotesize template$<$typename Input\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a149cd5eab1761c864eb12fae95a20ce9}{all\+\_\+of}} (Input\+It begin, Input\+It end, Unary\+Predicate pred) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It $>$\+::value, bool $>$
\begin{DoxyCompactList}\small\item\em Determine if pred is true for every element of the range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Range , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a18f8fa4996e526b73efe4804679eff98}{all\+\_\+of}} (Range \&\&rng, Unary\+Predicate pred) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$ Range $>$\+::value, bool $>$
\begin{DoxyCompactList}\small\item\em Determine if pred is true for every element of the range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af77c19627d6b1eb24ee5a7ccd91d8364}{none\+\_\+of}} (Input\+It begin, Input\+It end, Unary\+Predicate pred) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It $>$\+::value, bool $>$
\begin{DoxyCompactList}\small\item\em Determine if pred is false for every element of the range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Range , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aca6380b0d9da9e9ee69bf74978f1997c}{none\+\_\+of}} (Range \&\&rng, Unary\+Predicate pred) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$ Range $>$\+::value, bool $>$
\begin{DoxyCompactList}\small\item\em Determine if pred is true for every element of the range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab0a01c9347f7340bb6764cbc6e5900d6}{any\+\_\+of}} (Input\+It begin, Input\+It end, Unary\+Predicate pred) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It $>$\+::value, bool $>$
\begin{DoxyCompactList}\small\item\em Determine if pred is true for at least one element of the range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Range , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a88cbbd105c4fb60ec348931328f14fde}{any\+\_\+of}} (Range \&\&rng, Unary\+Predicate pred) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$ Range $>$\+::value, bool $>$
\begin{DoxyCompactList}\small\item\em Determine if pred is true for every element of the range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename Value $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a358d34dbabdd3fcfcdda5b016787cbd8}{contains}} (Input\+It begin, Input\+It end, const Value \&val) noexcept(noexcept($\ast$begin==val)) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It $>$\+::value, bool $>$
\begin{DoxyCompactList}\small\item\em Determine if a range contains a value. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Set , typename Value $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4b44d5f8e34227d50f29b2e52fd1a686}{contains}} (const Set \&set, const Value \&val) noexcept(noexcept($\ast$std\+::declval$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}{iterator\+\_\+type\+\_\+for\+\_\+t}}$<$ const Set $>$ \& $>$()==val)) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$ Set $>$\+::value, bool $>$
\begin{DoxyCompactList}\small\item\em Determine if a range contains a value. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It1 , typename Input\+It2 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab85668b5bdd0e9a64926ea04903d8463}{contains\+\_\+any}} (Input\+It1 begin, Input\+It1 end, Input\+It2 n\+\_\+begin, Input\+It2 n\+\_\+end) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It1 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It2 $>$\+::value, bool $>$
\item 
{\footnotesize template$<$typename Input\+It , typename Range2 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a31dab78c615cff330867eeeedc2de845}{contains\+\_\+any}} (Input\+It begin, Input\+It end, Range2 \&\&needle) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$ Input\+It $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$ Range2 $>$\+::value, bool $>$
\item 
{\footnotesize template$<$typename Range1 , typename Range2 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3ffee002592c9af376e17c42a0f76463}{contains\+\_\+any}} (Range1 \&\&haystack, Range2 \&\&needle) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$ Range1 $>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$ Range2 $>$\+::value, bool $>$
\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Compare  = std\+::less$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a072a171e88da5f45556a48c3570ab51d}{max\+\_\+element}} (Forward\+It first, End\+It last, Compare comp=\{\}) -\/$>$ Forward\+It
\item 
{\footnotesize template$<$typename Sequence\+Container , typename Comp  = std\+::less$<$$>$, typename It , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ is\+\_\+linear\+\_\+container\+\_\+v$<$ Sequence\+Container $>$, int $>$  = 0$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abc60c7cf0cf6519d875cce892fc03589}{get\+\_\+max\+\_\+n\+\_\+old}} (It first, It last, std\+::size\+\_\+t count, Comp cmp=\{\}) -\/$>$ Sequence\+Container
\begin{DoxyCompactList}\small\item\em Returns a container of the greatest count elements according to cmp of the range \mbox{[}first, last), in arbitrary order. This overload works for linear containers. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Sequence\+Container , typename Comp  = std\+::less$<$$>$, typename It , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ is\+\_\+linear\+\_\+container\+\_\+v$<$ Sequence\+Container $>$, int $>$  = 0$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af9ddb02938da5e8e7628accbec90f272}{get\+\_\+max\+\_\+n}} (It first, It last, std\+::size\+\_\+t count, Comp cmp=\{\}) -\/$>$ Sequence\+Container
\begin{DoxyCompactList}\small\item\em Returns a container of the greatest count elements according to cmp of the range \mbox{[}first, last), in descending order. This overload works for linear containers. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Comp  = std\+::less$<$$>$, typename Input\+It , typename Output\+It , typename Elem  = typename std\+::iterator\+\_\+traits$<$\+Input\+It$>$\+::value\+\_\+type$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6f34329432db49c238fe9c3484a5be35}{get\+\_\+max\+\_\+n}} (Input\+It first, Input\+It last, Output\+It d\+\_\+begin, std\+::size\+\_\+t count, Comp cmp=\{\}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}{return\+\_\+assert\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__output__iterator__for}{is\+\_\+output\+\_\+iterator\+\_\+for}}$<$ Output\+It, Elem $>$\+::value, Output\+It $>$
\begin{DoxyCompactList}\small\item\em Copies the count greatest elements according to cmp of the range \mbox{[}first, last) to the range beginning at d\+\_\+begin. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename End\+It , typename Forward\+It2 , typename Binary\+Function $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3c071760ec3d5f8b33ace9646e3ed830}{for\+\_\+each}} (Forward\+It first, End\+It last, Forward\+It2 second, Binary\+Function f) -\/$>$ Binary\+Function
\begin{DoxyCompactList}\small\item\em Applies a binary operation to each pair of corresponding elements in two input ranges. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename Forward\+It2 , typename Size , typename Binary\+Function $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a302ab480723d5c251ecbc137767d8fa7}{for\+\_\+each\+\_\+n}} (Forward\+It first, Size n, Forward\+It2 second, Binary\+Function f) -\/$>$ std\+::pair$<$ Forward\+It, Forward\+It2 $>$
\begin{DoxyCompactList}\small\item\em Applies a binary operation to each pair of corresponding elements in two input ranges. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename Output\+It $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a33c820207dbcb1c0be9e457dc7ac7764}{copy}} (Input\+It first, End\+It last, Output\+It out) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em Copies all elements of \mbox{[}{\ttfamily first}, {\ttfamily last}) to out. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename Output\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a591af4d692a54e6bf17ad42f7e26021a}{copy\+\_\+if}} (Input\+It first, End\+It last, Output\+It out, Unary\+Predicate pred) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em Copies those elements of \mbox{[}{\ttfamily first}, {\ttfamily last}) which satisfy pred to out. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename Size , typename Output\+It $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae6c3d856c6a4d29c61810eb86980eb25}{copy\+\_\+n}} (Input\+It first, Size count, Output\+It out) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em Copies all elements of \mbox{[}{\ttfamily first}, {\ttfamily std\+::advance(first, n)}) to out. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename Size , typename Output\+It , typename Unary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab42fc398e2312bcfb746a35849ac42b5}{copy\+\_\+n\+\_\+if}} (Input\+It first, Size count, Output\+It out, Unary\+Predicate pred) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em Copies those elements of \mbox{[}{\ttfamily first}, {\ttfamily std\+::advance(first, n)}) which satisfy pred to out. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename Output\+It , typename Unary\+Predicate , typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a010dc9df3a70eb8fe35947438a6d2b9f}{replace\+\_\+copy\+\_\+if}} (Input\+It first, End\+It last, Output\+It out, Unary\+Predicate pred, const T \&new\+\_\+value) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em Copies an input range, but every element for which pred is true is replaced by new\+\_\+value. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename Size , typename Output\+It , typename Unary\+Predicate , typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a5cc109a4e42962baf40f85ec206a08a9}{replace\+\_\+copy\+\_\+n\+\_\+if}} (Input\+It first, Size count, Output\+It out, Unary\+Predicate pred, const T \&new\+\_\+value) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em Copies an input range, but every element for which pred is true is replaced by new\+\_\+value. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It1 , typename Forward\+It2 , typename Forward\+It3 , typename Output\+It , typename Binary\+Predicate  = std\+::equal\+\_\+to$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a04033b7ccfc7b2b090ca65bf83ef0e1f}{search\+\_\+replace\+\_\+copy}} (Forward\+It1 h\+\_\+begin, Forward\+It1 h\+\_\+end, Forward\+It2 n\+\_\+begin, Forward\+It2 n\+\_\+end, Forward\+It3 r\+\_\+begin, Forward\+It3 r\+\_\+end, Output\+It d\+\_\+begin, Binary\+Predicate Compare=\{\}) -\/$>$ Output\+It
\item 
{\footnotesize template$<$typename Haystack , typename Needle , typename Replacement , typename Output\+It , typename Binary\+Predicate  = std\+::equal\+\_\+to$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a70bdc9035068b4d6b9753b3e9b539012}{search\+\_\+replace\+\_\+copy}} (Haystack \&\&haystack, Needle \&\&needle, Replacement \&\&replacement, Output\+It d\+\_\+begin, Binary\+Predicate compare=\{\})
\item 
{\footnotesize template$<$class Forward\+It $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_afebb3d0b21df34d91af0be476f922437}{rotate}} (Forward\+It first, Forward\+It n\+\_\+first, Forward\+It last) noexcept(noexcept(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4ca198c8b213042d9bd7437a34e18476}{swap}}($\ast$first, $\ast$first))) -\/$>$ Forward\+It
\begin{DoxyCompactList}\small\item\em Rotates the input range. This is just a constexpr-\/in-\/\+C++14 version of std\+::rotate. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Output\+It , typename End\+It , typename Generator $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a612055bb1a634762caa8dd618c2953db}{generate}} (Output\+It first, End\+It last, Generator g) noexcept(noexcept($\ast$++first=g())) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em Like std\+::generate except that it returns the output iterator at the end. It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Output\+It , typename Size , typename Generator $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a5903e8e7c1f64ca8e42eb3dc5399f5c0}{generate\+\_\+n}} (Output\+It first, Size count, Generator g) noexcept(noexcept($\ast$first++=g())) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em Like std\+::generate\+\_\+n except that it is constexpr. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It , typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2aceba7673f47ae35012ec554dc14696}{iota}} (Forward\+It first, Forward\+It last, T value) noexcept(noexcept($\ast$first++=value) and noexcept(++value)) -\/$>$ void
\item 
{\footnotesize template$<$typename Forward\+It , typename T , typename Unary\+Operation $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_afa2976f014d8f4178eb722ab90c30d70}{iota}} (Forward\+It first, Forward\+It last, T value, Unary\+Operation unary\+\_\+op) noexcept(noexcept($\ast$first++=value) and noexcept(kblib\+::invoke(unary\+\_\+op, std\+::move(value)))) -\/$>$ void
\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename... Params$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a33ce91bc17a06635cc52820462d22e36}{call\+\_\+each}} (Input\+It first, End\+It last, Params \&\&... params) noexcept(noexcept(kblib\+::invoke($\ast$first++, std\+::forward$<$ Params $>$(params)...))) -\/$>$ Input\+It
\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename Output\+It , typename Unary\+Operation $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a776689bdcc9e3aa8017448393fe85f3a}{transform}} (Input\+It first, End\+It last, Output\+It d\+\_\+first, Unary\+Operation unary\+\_\+op) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em transform applies the given function to a range and stores the result in another range, beginning at d\+\_\+first. The unary operation unary\+\_\+op is applied to the range defined by \mbox{[}first1, last1). It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename Input\+It2 , typename Output\+It , typename Binary\+Operation $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a53a44bde2b2b3a7f6f3c037148856981}{transform}} (Input\+It first, End\+It last, Input\+It first2, Output\+It d\+\_\+first, Binary\+Operation binary\+\_\+op) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em transform applies the given function to a range and stores the result in another range, beginning at d\+\_\+first. The unary operation unary\+\_\+op is applied to the range defined by \mbox{[}first1, last1). It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Input\+It , typename End\+It , typename Output\+It , typename Unary\+Predicate , typename Unary\+Operation $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aed7ba033d733e8a9a07b5fa2215b6988}{transform\+\_\+if}} (Input\+It first, End\+It last, Output\+It d\+\_\+first, Unary\+Predicate pred, Unary\+Operation unary\+\_\+op) -\/$>$ Output\+It
\begin{DoxyCompactList}\small\item\em transform applies the given function to a range and stores the result in another range, beginning at d\+\_\+first. The unary operation unary\+\_\+op is applied to the range defined by \mbox{[}first1, last1). It also allows for a sentinel end iterator. \end{DoxyCompactList}\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad3e2bf738427c97401eef1241e24e858}{memswap}} (unsigned char $\ast$A, unsigned char $\ast$B, std\+::size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4c92ee94a7a250948d44a29b0e7b3e78}{size}}) noexcept -\/$>$ void
\begin{DoxyCompactList}\small\item\em Swaps memory ranges. \end{DoxyCompactList}\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6a8616c9dc6ca09e609d2c2a4b7f910b}{memswap}} (void $\ast$A, void $\ast$B, std\+::size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4c92ee94a7a250948d44a29b0e7b3e78}{size}}) noexcept -\/$>$ void
\begin{DoxyCompactList}\small\item\em Swaps memory ranges. \end{DoxyCompactList}\item 
{\footnotesize template$<$std\+::size\+\_\+t I, typename... Types$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af860681f5cf19cd64006f9e71aae5de9}{get}} (\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1punner}{punner}}$<$ Types... $>$ \&p) noexcept -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$std\+::size\+\_\+t I, typename... Types$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_afaef1b8bd63b77ba2182309130f72caf}{get}} (const \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1punner}{punner}}$<$ Types... $>$ \&p) noexcept -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$std\+::size\+\_\+t I, typename... Types$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1600b5da6d6ce91713c9743d803860ba}{get}} (\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1punner}{punner}}$<$ Types... $>$ \&\&p) noexcept -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$std\+::size\+\_\+t I, typename... Types$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab2ceadc87bff23b01f43a9f834659563}{get}} (const \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1punner}{punner}}$<$ Types... $>$ \&\&p) noexcept -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Unary\+Function $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9e9b509402d267bd4e15457afa90adf6}{build}} (Input\+It first, Input\+It last, Unary\+Function f, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\}) -\/$>$ Container
\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 $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3bf1d079411a3ce6d087913af6df265c}{build}} (Input\+It first, Input\+It last, Input\+It2 first2, Binary\+Function f, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\}) -\/$>$ Container
\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 , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Array $>$, int $>$  = 0$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a498d41b3457871cd8fe125facf1dbf3d}{build}} (Input\+It first, Input\+It last, Unary\+Function f) -\/$>$ Array
\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 , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Array $>$, int $>$  = 0$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9b853354dedfe1e1635a39f25cea7d9c}{build}} (Input\+It first, Input\+It last, Input\+It2 first2, Binary\+Function f) -\/$>$ Array
\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 $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a619e6e0af476e47808647b3a1e2c249e}{build}} (Functor f, size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4c92ee94a7a250948d44a29b0e7b3e78}{size}}, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\}) -\/$>$ Container
\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 , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Array $>$, int $>$  = 0$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3be00284a2be9099527297be55ef38b6}{build}} (Functor f, size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4c92ee94a7a250948d44a29b0e7b3e78}{size}}=std\+::tuple\+\_\+size$<$ Array $>$\+::value) -\/$>$ Array
\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 $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aecc2a3777f0d4cfd3d4a43ec60bac1a5}{build\+\_\+dy}} (Input\+It first, Input\+It last, Unary\+Function f) -\/$>$ Container
\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 $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a42182f108ce703f570a5830c4b2c885b}{build\+\_\+dy}} (Input\+It first, Input\+It last, Input\+It2 first2, Binary\+Function f) -\/$>$ Container
\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 $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6b9f0c5e489c3fc4efd4837bb77ebd0c}{build\+\_\+dy}} (Functor f, size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4c92ee94a7a250948d44a29b0e7b3e78}{size}}) -\/$>$ Container
\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 Range , typename Unary\+Function , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a50ae6a19ed6bb7485d75f5ae4196fd61}{build\+\_\+dy}} (Range \&\&r, Unary\+Function f) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container , typename... Args$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae0b64235d95f71241847eb753c7cb665}{buildiota}} (Args \&\&... args) -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Builds a container of increasing values. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Input\+It $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae51d75ec2dc90a6c693d4405dd79f018}{build\+\_\+copy}} (Input\+It first, Input\+It last, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\}) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container , typename Range , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab487dbac3c31dbe0553edfb81e689c8f}{build\+\_\+copy}} (Range \&\&r) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container , typename Range $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a878b4f9c69954df818a60f7cab057d6c}{build\+\_\+copy}} (Range \&\&r, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\}) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container , typename Input\+It , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a58f54ca57daf5262f55c4a0e36c0f6e3}{build\+\_\+copy}} (Input\+It first, Input\+It last) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container , typename Range , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ace040c630f62919bff8eace542d663d8}{build\+\_\+copy}} (Range \&\&r) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container , typename Input\+It , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad64907ca0131820d186891a11038f985}{build\+\_\+copy}} (Input\+It first, Input\+It last, std\+::size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4c92ee94a7a250948d44a29b0e7b3e78}{size}}) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container , typename Range , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2eb3a98b275315ea0f26ba0163a718a1}{build\+\_\+copy}} (Range \&\&r, std\+::size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4c92ee94a7a250948d44a29b0e7b3e78}{size}}) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Predicate $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad4beb3c0548fe89150e6bd3301b16e4e}{build\+\_\+copy\+\_\+if}} (Input\+It first, Input\+It last, Predicate f, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\}) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Size $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1220fd7f4afaa179253ad2d8cf5bf8b8}{build\+\_\+copy\+\_\+n}} (Input\+It first, Size count, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\}) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container , typename Input\+It , typename Size , typename Predicate $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a93a76da83cdca6ba43ec7c734ff1e936}{build\+\_\+copy\+\_\+n\+\_\+if}} (Input\+It first, Size count, Predicate f, typename Container\+::allocator\+\_\+type allocator=typename Container\+::allocator\+\_\+type\{\}) -\/$>$ Container
\item 
{\footnotesize template$<$typename C $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a81275204aa40536f10bc83aebcb414b4}{pop}} (C \&s) -\/$>$ typename C\+::value\+\_\+type
\item 
{\footnotesize template$<$class C , typename K , typename V $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8115aa411def81992e39af8b24a597c0}{get\+\_\+or}} (const C \&m, const K \&key, const V \&defval) -\/$>$ typename C\+::mapped\+\_\+type
\item 
{\footnotesize template$<$typename Map , typename Key $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a02dd4f161e175a64e0cb6556ad8104d9}{try\+\_\+get}} (Map \&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6dba339947eb5129b3d519cf492305a6}{map}}, Key \&\&key) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a04784aad6b67bfd042b6047e3fb249c2}{copy\+\_\+const\+\_\+t}}$<$ Map, typename Map\+::mapped\+\_\+type $>$ $\ast$
\item 
{\footnotesize template$<$typename M , typename K $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a108b96be4f7cd2e9c6bc27c068e4b276}{get\+\_\+check}} (M \&\&m, const K \&key) noexcept(noexcept(m.\+find(key) !=m.\+end())) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1exists__t}{exists\+\_\+t}}$<$ decltype(m.\+find(key))$>$
\item 
{\footnotesize template$<$typename V $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_afa151cd6cf7b51b2807c1d37ae19f962}{force\+\_\+shrink\+\_\+to\+\_\+fit}} (V \&vec) -\/$>$ void
\begin{DoxyCompactList}\small\item\em std\+::vector\+::shrink\+\_\+to\+\_\+fit is non-\/binding, which means that there is no guaranteed way to shrink a vector via its API. This function is a roundabout way of doing that without relying on the sanity of the implementation (except that it assumes that a vector won\textquotesingle{}t significantly over-\/allocate on sized construction). \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Range $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a22c160ee1cec6fd1c9df4d8ed06cf378}{construct\+\_\+from\+\_\+range}} (Range \&\&r) -\/$>$ Container
\begin{DoxyCompactList}\small\item\em Allows for constructing a container of a specified type from a range object. Copy elision means that this does not result in any extra copies. \end{DoxyCompactList}\item 
{\footnotesize template$<$int base, typename Int $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a637c9698ae9288ff611e9547a7905f76}{to\+\_\+string}} (Int num) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename Int $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3d3c76ec1770949fd16862b9fffe15dd}{to\+\_\+string}} (Int num, int base) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename Result $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4839df47e63e88adecc02f638233a88f}{parse\+\_\+integer}} (const char $\ast$begin, const char $\ast$end, int base=0) -\/$>$ Result
\item 
{\footnotesize template$<$typename Result , std\+::size\+\_\+t N$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_adaf093e4e11530699a34b7d030cd2c3f}{parse\+\_\+integer}} (const char(\&in)\mbox{[}N\mbox{]}, int base=0) -\/$>$ Result
\item 
{\footnotesize template$<$typename Result $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9be37ddba09fe1930179587b0ca87622}{parse\+\_\+integer}} (const std\+::string \&in, int base=0) -\/$>$ Result
\item 
{\footnotesize template$<$typename Result $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4bf68a0cb2e3357d4c22bb08695aba46}{parse\+\_\+integer}} (std\+::string\+\_\+view in, int base=0) -\/$>$ Result
\item 
{\footnotesize template$<$char... Cs$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1literals_af191c4109ee3f843cf725161e78af2b1}{operator\char`\"{}\char`\"{}\+\_\+c}} ()
\item 
{\footnotesize template$<$char... Cs$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1literals_a51096858879a92f295cb881e47f61eda}{operator\char`\"{}\char`\"{}\+\_\+cu}} ()
\item 
{\footnotesize template$<$typename E , typename  = typename std\+::enable\+\_\+if$<$std\+::is\+\_\+enum$<$\+E$>$\+::value$>$\+::type$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4d05938ed841428194ece30e10f89623}{etoi}} (E \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab201870fcd6e784f6927f15ad256cd18}{e}}) -\/$>$ auto
\item 
{\footnotesize template$<$int max\+Buf\+Len = 4096, typename clock , typename duration $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae21ed944a75d48c221481f4c6937b34c}{time\+\_\+to\+\_\+str}} (std\+::chrono\+::time\+\_\+point$<$ clock, duration $>$ \&tp, const std\+::string \&fmt=\char`\"{}\%F \%T\char`\"{}) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename Rep , typename Ratio , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1detail__units_1_1is__si__ratio}{detail\+\_\+units\+::is\+\_\+si\+\_\+ratio}}$<$ typename Ratio\+::type $>$\+::value $>$ $\ast$  = 0$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae2bcc0520aee3ea417a1d16ae77e318b}{duration\+\_\+to\+\_\+str}} (std\+::chrono\+::duration$<$ Rep, Ratio $>$ \&d) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename Rep $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_adf1e223f4be11bf2dadea1215c40dfef}{duration\+\_\+to\+\_\+str}} (std\+::chrono\+::duration$<$ Rep, std\+::ratio$<$ 60 $>$ $>$ d) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename Rep $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1575f6eda9991fd978d519232ffe15e1}{duration\+\_\+to\+\_\+str}} (std\+::chrono\+::duration$<$ Rep, std\+::ratio$<$ 3600 $>$ $>$ d) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa1ee4e576884b82bfa4338ee175eeac5}{url\+\_\+encode}} (const string \&value) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0f5d7b0d504a25bcafeb406666c9b53f}{html\+\_\+encode}} (const string \&data) -\/$>$ std\+::string
\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa66d576e4db615a16008862386102393}{escapify}} (char c) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7d14b3211b4b94cca162f9f7cc68e902}{escapify}} (const string \&value) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_acdf3414ebaef2bc632182f09831f4953}{calculate\+\_\+translated\+\_\+index}} (string \&\&value, const char $\ast$p) -\/$>$ std\+::ptrdiff\+\_\+t
\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a38e776bebcf320cdc4fbe2f28bcceef0}{calculate\+\_\+translated\+\_\+index}} (const char $\ast$value, const char $\ast$p) -\/$>$ std\+::ptrdiff\+\_\+t
\item 
{\footnotesize template$<$typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af129a587bdaf7d9ccb7f0c7395202d86}{quoted}} (string \&\&in) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3f39491493e5be735e95d23736c563c4}{from\+Str}} (const std\+::string \&val, const char $\ast$type=typeid(T).name()) -\/$>$ T
\item 
template$<$$>$ auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6696f1778e72416eb867888d4fea61a5}{from\+Str}} (const std\+::string \&val, const char $\ast$) -\/$>$ std\+::string
\item 
template$<$$>$ auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a03447c78b380cf781fc013cf614c7175}{from\+Str}} (const std\+::string \&val, const char $\ast$type) -\/$>$ bool
\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7ac03c4c18ea3b809711a57d06d39fca}{from\+Str}} (std\+::string \&\&val, const char $\ast$type=typeid(T).name()) -\/$>$ T
\item 
template$<$$>$ auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a46ec9825a8b00ab4ad0ec8cb2a60ae84}{from\+Str}} (std\+::string \&\&val, const char $\ast$) -\/$>$ std\+::string
\item 
template$<$$>$ auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3cf0f36c982e7d47d732d8fbb510a32d}{from\+Str}} (std\+::string \&\&val, const char $\ast$type) -\/$>$ bool
\item 
template$<$$>$ auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a17c280a89bb09bcbd37ee32416ed9689}{from\+Str}} (const std\+::string \&val, const char $\ast$) -\/$>$ std\+::string\+\_\+view
\item 
template$<$$>$ auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a287fe99f0ef28039e5634b7f1b9c7914}{from\+Str}} (std\+::string \&\&, const char $\ast$) -\/$>$ std\+::string\+\_\+view=delete
\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_acd010b9513921e8ae3d401b1d8cd0de1}{from\+Str}} (std\+::string\+\_\+view val, const char $\ast$type=typeid(T).name()) -\/$>$ T
\item 
template$<$$>$ auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aaf3955d727d1acafa039ffdf4b469c02}{from\+Str}} (std\+::string\+\_\+view val, const char $\ast$) -\/$>$ std\+::string\+\_\+view
\item 
template$<$$>$ auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa6e272cde4df4fa43377752f4d227c85}{from\+Str}} (std\+::string\+\_\+view val, const char $\ast$) -\/$>$ std\+::string
\item 
template$<$$>$ auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a126336c47fe275c31620b77381671daa}{from\+Str}} (std\+::string\+\_\+view val, const char $\ast$type) -\/$>$ bool
\item 
{\footnotesize template$<$typename To , std\+::size\+\_\+t N$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a48406ee96a15c1c584fc94efe8253210}{from\+Str}} (const char(\&val)\mbox{[}N\mbox{]}, const char $\ast$type=typeid(To).name()) -\/$>$ To
\item 
{\footnotesize template$<$typename To , typename \+\_\+ $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0ad26f81eb26067326d49bf820470cd5}{from\+Str}} (const char $\ast$val, const char $\ast$type=typeid(To).name(), \+\_\+=0) -\/$>$ To
\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a92acbb9bb7f69027f4404fd26724f6a3}{to\+Str}} (T val) -\/$>$ std\+::string
\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a592ba900c4c004025d90eed8ea6f23e7}{to\+Str}} (std\+::string val) -\/$>$ std\+::string
\item 
{\footnotesize template$<$typename To , typename From $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aba294c76c6015b7fab99a74894843a9c}{lexical\+\_\+cast}} (const From \&val, const char $\ast$type=typeid(To).name()) -\/$>$ To
\item 
{\footnotesize template$<$typename Range $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3ab4475226febb01518ca82d6eea9283}{cry\+\_\+enumerate}} (Range \&\&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}}) -\/$>$ auto
\item 
{\footnotesize template$<$typename Range $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac9b89d52e383d30ea2f5230790cff648}{enumerate}} (Range \&\&r) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1enumerate__t}{enumerate\+\_\+t}}$<$ Range \&\& $>$
\begin{DoxyCompactList}\small\item\em Allow access to indexes while using range-\/based for loops. Safe to use with rvalues. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename EIt $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a192a71e3c07c20435638b9fd2d226a41}{enumerate}} (It begin, EIt end) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1enumerate__t}{enumerate\+\_\+t}}$<$ It, EIt $>$
\begin{DoxyCompactList}\small\item\em Allow access to indexes while using range-\/based for loops. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename F , typename... Args$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac77017275583c324e324d9b85b8467d6}{invoke}} (F \&\&f, Args \&\&... args) noexcept(noexcept(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail_ac992e4a88d3dffba45f75f3912cb44d4}{detail\+::do\+\_\+invoke}}(std\+::forward$<$ F $>$(f), std\+::forward$<$ Args $>$(args)...))) -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$typename F , typename Arg $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa3de5af57edb5703269d1685c9ce723f}{apply}} (F \&\&f, Arg \&\&arg) noexcept(noexcept(\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1detail_1_1apply__impl}{detail\+::apply\+\_\+impl}}$<$ F, Arg $>$\+::do\+\_\+apply(std\+::forward$<$ F $>$(f), std\+::forward$<$ Arg $>$(arg), std\+::index\+\_\+sequence$<$ std\+::tuple\+\_\+size$<$ Arg $>$\+::value $>$\{\}))) -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4c1ba1ef4c78ce0f5dba55945d70c8a5}{to\+\_\+unique}} (gsl\+::owner$<$ T $\ast$ $>$ p) -\/$>$ std\+::unique\+\_\+ptr$<$ T $>$
\item 
{\footnotesize template$<$typename T , typename D $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a546cfb179cb6d14095e3da0271e4df91}{to\+\_\+unique}} (gsl\+::owner$<$ T $\ast$ $>$ p, D \&\&d) -\/$>$ std\+::unique\+\_\+ptr$<$ T, D $>$
\item 
{\footnotesize template$<$typename I $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a95c6c350179360eac5f4f1b01eff86b3}{to\+\_\+unsigned}} (I x) -\/$>$ std\+::make\+\_\+unsigned\+\_\+t$<$ I $>$
\begin{DoxyCompactList}\small\item\em Cast integral argument to corresponding unsigned type. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename I $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0bf6727ccda28bc596400a97e889b630}{to\+\_\+signed}} (I x) -\/$>$ std\+::make\+\_\+signed\+\_\+t$<$ I $>$
\begin{DoxyCompactList}\small\item\em Cast integral argument to corresponding signed type. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename A , typename F $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_acafe999611405acc2872d13bfc08a83c}{signed\+\_\+cast}} (F x) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ std\+::is\+\_\+integral$<$ A $>$\+::value and std\+::is\+\_\+integral$<$ F $>$\+::value and std\+::is\+\_\+signed$<$ A $>$\+::value, std\+::make\+\_\+signed\+\_\+t$<$ F $>$ $>$
\begin{DoxyCompactList}\small\item\em Cast argument to equivalently-\/sized type with the same signednessas the template parameter. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T , typename U  = T$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a109743fe0c56374c34c372b790aadffd}{exchange}} (T \&obj, U \&\&new\+\_\+value) -\/$>$ T
\item 
{\footnotesize template$<$typename N $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a95fa42737c2d8ccb47d4ed980458732b}{signed\+\_\+promote}} (N x) noexcept -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a91a41b470a640f9d17fee50cfdd2fadb}{safe\+\_\+signed\+\_\+t}}$<$ N $>$
\item 
{\footnotesize template$<$class Input\+It1 , class Input\+It2 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6a4271b484be2977a39a761f9f4e814a}{equal}} (Input\+It1 first1, Input\+It1 last1, Input\+It2 first2) -\/$>$ bool
\item 
{\footnotesize template$<$typename Input\+It1 , typename Input\+It2 , typename Binary\+Predicate , typename kblib\+::enable\+\_\+if\+\_\+t$<$ not std\+::is\+\_\+same$<$ Input\+It2, Binary\+Predicate $>$\+::value, int $>$  = 0$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab743d1f4424feb9975355cdcc32637e4}{equal}} (Input\+It1 first1, Input\+It1 last1, Input\+It2 first2, Binary\+Predicate p) -\/$>$ bool
\item 
{\footnotesize template$<$class Random\+It1 , class Random\+It2 , typename kblib\+::enable\+\_\+if\+\_\+t$<$ std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Random\+It1 $>$\+::iterator\+\_\+category $>$\+::value and std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Random\+It2 $>$\+::iterator\+\_\+category $>$\+::value, int $>$  = 0$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a10c4176bbae0101aacbfc7df5239718d}{equal}} (Random\+It1 first1, Random\+It1 last1, Random\+It2 first2, Random\+It2 last2) -\/$>$ bool
\item 
{\footnotesize template$<$class Random\+It1 , class Random\+It2 , typename Binary\+Predicate , typename kblib\+::enable\+\_\+if\+\_\+t$<$ std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Random\+It1 $>$\+::iterator\+\_\+category $>$\+::value and std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Random\+It2 $>$\+::iterator\+\_\+category $>$\+::value, int $>$  = 0$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_afd54ef7c7ec0132feaa622ee5a388dd1}{equal}} (Random\+It1 first1, Random\+It1 last1, Random\+It2 first2, Random\+It2 last2, Binary\+Predicate p) -\/$>$ bool
\item 
{\footnotesize template$<$class Input\+It1 , class Input\+It2 , typename kblib\+::enable\+\_\+if\+\_\+t$<$ not std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Input\+It1 $>$\+::iterator\+\_\+category $>$\+::value or not std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Input\+It2 $>$\+::iterator\+\_\+category $>$\+::value, int $>$  = 0$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab038d3d7a299691611fa65c53fbb90df}{equal}} (Input\+It1 first1, Input\+It1 last1, Input\+It2 first2, Input\+It2 last2) -\/$>$ bool
\item 
{\footnotesize template$<$typename Input\+It1 , typename Input\+It2 , typename Binary\+Predicate , typename kblib\+::enable\+\_\+if\+\_\+t$<$ not std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Input\+It1 $>$\+::iterator\+\_\+category $>$\+::value or not std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Input\+It2 $>$\+::iterator\+\_\+category $>$\+::value, int $>$  = 0$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8193764ad56ec2c12891e6e3fd774e39}{equal}} (Input\+It1 first1, Input\+It1 last1, Input\+It2 first2, Input\+It2 last2, Binary\+Predicate p) -\/$>$ bool
\item 
{\footnotesize template$<$typename C $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4c92ee94a7a250948d44a29b0e7b3e78}{size}} (const C \&c) -\/$>$ decltype(c.\+size())
\item 
{\footnotesize template$<$typename T , std\+::size\+\_\+t N$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a06822247967e4520d9e8e2725fa4e2d4}{size}} (const T(\&)\mbox{[}N\mbox{]}) noexcept -\/$>$ std\+::size\+\_\+t
\item 
{\footnotesize template$<$class Input\+It1 , class Input\+It2 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6704bbcd16607765acc713c6012b4ccf}{lexicographical\+\_\+compare}} (Input\+It1 first1, Input\+It1 last1, Input\+It2 first2, Input\+It2 last2) -\/$>$ bool
\item 
{\footnotesize template$<$typename Number $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7db189e751eea6b94eb2748e3639e634}{count\+\_\+digits}} (Number val) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ std\+::is\+\_\+floating\+\_\+point$<$ Number $>$\+::value, int $>$
\begin{DoxyCompactList}\small\item\em Calculates the number of decimal digits needed to represent a number, plus one for negative numbers. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Number $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9eb453834f5eea578e625d582e5a1f12}{count\+\_\+digits}} (Number val, int base) -\/$>$ int
\begin{DoxyCompactList}\small\item\em Calculates the number of digits needed to represent a number in a given base, plus one for negative numbers. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af04902ef70cd4a8ade17bfe77f189bd5}{max\+\_\+count\+\_\+digits}} (Forward\+It first, Forward\+It last) -\/$>$ int
\begin{DoxyCompactList}\small\item\em Returns the necessary number of digits to represent the largest value in an input range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Forward\+It $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aecc5d7469f00a291f59932d007b8cfa1}{max\+\_\+count\+\_\+digits}} (Forward\+It first, Forward\+It last, int base) -\/$>$ int
\begin{DoxyCompactList}\small\item\em Returns the necessary number of digits to represent the largest value in an input range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Integral , typename CharT $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7bfbd64c936a402d66726e9aba676304}{to\+\_\+bytes\+\_\+le}} (Integral ival, CharT(\&dest)\mbox{[}sizeof(Integral)\mbox{]}) noexcept -\/$>$ void
\item 
{\footnotesize template$<$typename Integral , typename CharT $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aee9cc4f92a7ea3ca84f35e51b24d8785}{to\+\_\+bytes\+\_\+be}} (Integral ival, CharT(\&dest)\mbox{[}sizeof(Integral)\mbox{]}) noexcept -\/$>$ void
\item 
{\footnotesize template$<$typename Integral , typename CharT $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae1e351b026f08dd5504d72f4f253b0bb}{to\+\_\+bytes}} (Integral val, CharT(\&dest)\mbox{[}sizeof(Integral)\mbox{]}) noexcept -\/$>$ void
\item 
{\footnotesize template$<$typename Hash\+Int , typename Span $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af0747d9c8141b019ddd78e233333f34e}{FNVa}} (Span \&\&s, Hash\+Int hval=\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$ Hash\+Int $>$\+::value) noexcept -\/$>$ Hash\+Int
\begin{DoxyCompactList}\small\item\em A templatized generic FNVa hash function. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Hash\+Int , typename CharT , std\+::size\+\_\+t N$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6eba4b743d45ca972613d388984d603f}{FNVa\+\_\+a}} (const CharT(\&s)\mbox{[}N\mbox{]}, Hash\+Int hval=\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$ Hash\+Int $>$\+::value) noexcept -\/$>$ Hash\+Int
\begin{DoxyCompactList}\small\item\em A templatized FNVa hash function, for raw character arrays, such as string literals. \end{DoxyCompactList}\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aab79de4eda0bb13b69e09af3b77a19a4}{FNV32a}} (std\+::string\+\_\+view s, std\+::uint32\+\_\+t hval=\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$ std\+::uint32\+\_\+t $>$\+::value) noexcept -\/$>$ std\+::uint32\+\_\+t
\begin{DoxyCompactList}\small\item\em A standard FNV32a hash function, for string\+\_\+views. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Hash\+Int $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa8ad42dbe9a4d629bacbe52fd216a284}{FNVa\+\_\+s}} (const char $\ast$begin, std\+::size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6a72a1bd0fc23633f0c0abd639c512f9}{length}}, Hash\+Int hval=\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$ Hash\+Int $>$\+::value) noexcept -\/$>$ Hash\+Int
\item 
{\footnotesize template$<$std\+::size\+\_\+t N$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aaa66ede3e055ed8b1e4995ae3a47c3ea}{FNV32a\+\_\+a}} (const char(\&s)\mbox{[}N\mbox{]}, std\+::uint32\+\_\+t hval=\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$ std\+::uint32\+\_\+t $>$\+::value) noexcept -\/$>$ std\+::uint32\+\_\+t
\begin{DoxyCompactList}\small\item\em A standard FNV32a hash function, for raw character arrays, such as string literals. \end{DoxyCompactList}\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a76885646ab4fe31f867c160702821734}{FNV32a\+\_\+s}} (const char $\ast$begin, std\+::size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6a72a1bd0fc23633f0c0abd639c512f9}{length}}, uint32\+\_\+t hval=\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$ std\+::uint32\+\_\+t $>$\+::value) noexcept -\/$>$ std\+::uint32\+\_\+t
\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1literals_a55a0e2bfcd60e804aec7b48dbbdc5c41}{operator\char`\"{}\char`\"{}\+\_\+fnv32}} (const char $\ast$str, std\+::size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6a72a1bd0fc23633f0c0abd639c512f9}{length}}) noexcept -\/$>$ std\+::uint32\+\_\+t
\begin{DoxyCompactList}\small\item\em A literal suffix that produces the FNV32a hash of a string literal. \end{DoxyCompactList}\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1literals_a34ba561395fd891823e7bd4707d1709e}{operator\char`\"{}\char`\"{}\+\_\+fnv64}} (const char $\ast$str, std\+::size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6a72a1bd0fc23633f0c0abd639c512f9}{length}}) noexcept -\/$>$ std\+::uint64\+\_\+t
\begin{DoxyCompactList}\small\item\em A literal suffix that produces the FNV64a hash of a string literal. \end{DoxyCompactList}\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1literals_a3ebd9008e4e79aed79e8860134b45832}{operator\char`\"{}\char`\"{}\+\_\+fnv32}} (unsigned long long val) -\/$>$ std\+::uint32\+\_\+t
\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1literals_a6c16b3df392bb362782a3dca425fab90}{operator\char`\"{}\char`\"{}\+\_\+fnv64}} (unsigned long long val) -\/$>$ std\+::uint64\+\_\+t
\item 
{\footnotesize template$<$typename string  = std\+::string$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7d320f31c75223f38b8e90d2da1f783c}{to\+UTF8}} (const icu\+::\+Unicode\+String \&s) -\/$>$ string
\begin{DoxyCompactList}\small\item\em Convert a Unicode\+String to a UTF-\/8 string. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8db3286ffbdbe00e0fbab7ea663fe726}{from\+UTF8}} (string s) -\/$>$ icu\+::\+Unicode\+String
\begin{DoxyCompactList}\small\item\em Convert a UTF-\/8 string into a Unicode\+String. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename string  = std\+::u32string$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a98dc7e3e80286bed68984415ee11b417}{to\+UTF32}} (const icu\+::\+Unicode\+String \&s) -\/$>$ string
\begin{DoxyCompactList}\small\item\em Converts a Unicode\+String to UTF-\/32. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af80748de88bdb05d72a06e9e07141d6b}{from\+UTF32}} (string s) -\/$>$ icu\+::\+Unicode\+String
\begin{DoxyCompactList}\small\item\em Converts a UTF-\/32 string into a Unicode\+String. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a532bcd325109f07bdd0e1e0fc4153a17}{from\+Str}} (const icu\+::\+Unicode\+String \&val, const char $\ast$type=typeid(T).name()) -\/$>$ T
\begin{DoxyCompactList}\small\item\em Reencodes val to UTF-\/8 and then converts it to T using the primary overload. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename D  = std\+::string, typename std\+::enable\+\_\+if\+\_\+t$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2530a939dc0029a61d40e4b71d24a326}{is\+\_\+contiguous\+\_\+v}}$<$ D $>$, int $>$  = 0$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_afd071cc902b09eb4ad7d10d5a6633726}{get\+\_\+contents}} (std\+::istream \&in, D \&out) -\/$>$ auto
\item 
{\footnotesize template$<$typename D  = std\+::string, typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aba04cedec1ef721c75a36dce689da437}{get\+\_\+file\+\_\+contents}} (const string \&filename) -\/$>$ std\+::optional$<$ D $>$
\begin{DoxyCompactList}\small\item\em Read the entire contents of a file into a container, such as std\+::string or std\+::vector$<$char$>$. Note that it will be most efficient to read into contiguous containers, as opposed to non-\/contiguous containers. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename D  = std\+::string, typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a741c72809e4611dfb92f9673f91956bf}{try\+\_\+get\+\_\+file\+\_\+contents}} (const string \&filename) -\/$>$ D
\begin{DoxyCompactList}\small\item\em Read the entire contents of a file into a container, such as std\+::string or std\+::vector$<$char$>$. Note that it will be most efficient to read into contiguous containers, as opposed to non-\/contiguous containers. \end{DoxyCompactList}\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae3ad2bb9713e61ded6ca8a8847de38e1}{getline}} (std\+::istream \&is) -\/$>$ std\+::string
\begin{DoxyCompactList}\small\item\em By-\/value std\+::getline wrapper. \end{DoxyCompactList}\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af4060fe62c919395b7d5ef32a5491035}{eat\+\_\+word}} (std\+::istream \&is) -\/$>$ std\+::istream \&
\begin{DoxyCompactList}\small\item\em Consume all non-\/spaces to first break, then eat that, too. \end{DoxyCompactList}\item 
std\+::istream \& \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a98e37fd1c2d8758f7446f74f63f867c6}{eat\+\_\+space}} (std\+::istream \&is)
\begin{DoxyCompactList}\small\item\em Eat spaces, don\textquotesingle{}t eat an extra. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename CharT , typename Traits $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a62b47d136874314a9d04bbed61b1ba75}{nl}} (std\+::basic\+\_\+istream$<$ CharT, Traits $>$ \&is) -\/$>$ std\+::basic\+\_\+istream$<$ CharT, Traits $>$ \&
\begin{DoxyCompactList}\small\item\em Read in spaces until the end of the line is found. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename CharT $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7d4b1043680d2f53765ea2468267c864}{unformatted\+\_\+expect}} (CharT c) -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Read a character from an input stream only if it equals c. Acts as an Unformatted\+Input\+Operation, that is, it will not ignore any leading whitespace. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename CharT $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad195459d063b294e19432ed1842d803d}{expect}} (CharT c) -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Read a character from an input stream only if it equals c. Acts as a Formatted\+Input\+Operation, that is, leading whitespace is ignored. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename CharT , typename... O, template$<$ typename, typename... $>$ class string$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2e695575cd5559244934def460f26371}{get\+\_\+line}} (string$<$ CharT, O... $>$ \&str) -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Read a whole line into a std\+::basic\+\_\+string-\/like class template. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename CharT , typename... O, template$<$ typename, typename... $>$ class string$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af66d5ff3fbe72d06b07aab4964fdf5e2}{get\+\_\+line}} (string$<$ CharT, O... $>$ \&str, CharT delim) -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Read a delimited string into a std\+::basic\+\_\+string-\/like class template. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename F , typename CharT , typename Tr $>$ }\\std\+::basic\+\_\+istream$<$ CharT, Tr $>$ \& \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab9f34cf1a63aa6d243a55cbc4b08324e}{operator$>$$>$}} (std\+::basic\+\_\+istream$<$ CharT, Tr $>$ \&is, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1get__manip}{get\+\_\+manip}}$<$ F $>$ func)
\begin{DoxyCompactList}\small\item\em Actually calls the manipulator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename F , typename CharT , typename Tr $>$ }\\std\+::basic\+\_\+ostream$<$ CharT, Tr $>$ \& \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac88add2cb257f548e6c81cc017ebb753}{operator$<$$<$}} (std\+::basic\+\_\+ostream$<$ CharT, Tr $>$ \&is, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1get__manip}{get\+\_\+manip}}$<$ F $>$ func)
\begin{DoxyCompactList}\small\item\em Actually calls the manipulator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename StreamA , typename StreamB $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9e10baddbb022f5427515e33ba089c18}{tee}} (StreamA \&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a228a6004801f23e3746cd67df6bcbeb6}{a}}, StreamB \&b) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1basic__teestream}{basic\+\_\+teestream}}$<$ StreamA, StreamB $>$
\item 
{\footnotesize template$<$typename File  = std\+::fstream$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad5ef83609d07ad762d095145857fb5c3}{scoped\+\_\+file}} (const std\+::filesystem\+::path \&path, std\+::ios\+\_\+base\+::openmode mode=std\+::ios\+\_\+base\+::in$\vert$std\+::ios\+\_\+base\+::out)
\item 
{\footnotesize template$<$typename File  = std\+::fstream$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8f69a38c346e76844a7f85a37f739710}{tmpfile}} (const std\+::filesystem\+::path \&path, std\+::ios\+\_\+base\+::openmode mode=std\+::ios\+\_\+base\+::in$\vert$std\+::ios\+\_\+base\+::out)
\item 
{\footnotesize template$<$typename P $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a74ab3a9d881e3fcf4f4f081292fea57c}{to\+\_\+pointer}} (P \&\&p) noexcept -\/$>$ auto $\ast$
\begin{DoxyCompactList}\small\item\em Gets a raw pointer out of any smart pointer or iterator you might pass in, without dereferencing it or relying on a \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af860681f5cf19cd64006f9e71aae5de9}{get()}} method. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Comp  = std\+::less$<$value\+\_\+type\+\_\+linear\+\_\+t$<$\+Container$>$$>$$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a72d7009703fc6e22a52183cea35f225e}{max\+\_\+element}} (Container \&c, Comp comp) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aea5c475c5fb0f416b30f5825af77348b}{value\+\_\+type\+\_\+linear\+\_\+t}}$<$ Container $>$ $\ast$
\item 
{\footnotesize template$<$typename C $>$ }\\\mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1counting__back__insert__iterator}{counting\+\_\+back\+\_\+insert\+\_\+iterator}}$<$ C $>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a17b4229f4bbaf304d7f6b25db0c7f3c4}{counting\+\_\+back\+\_\+inserter}} (C \&c, std\+::size\+\_\+t count=0)
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a34900758f0b3419169cd357ad94cc97d}{operator+}} (T val, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1adjuster}{adjuster}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a228a6004801f23e3746cd67df6bcbeb6}{a}}) noexcept -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1detail__iterators_1_1is__addable}{detail\+\_\+iterators\+::is\+\_\+addable}}$<$ T, std\+::ptrdiff\+\_\+t $>$\+::value, decltype(std\+::advance(val, a.\+adj))$>$
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa3bf951ff79680bc749976235d79d060}{operator+}} (T val, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1incrementer}{incrementer}}) -\/$>$ T
\begin{DoxyCompactList}\small\item\em Increments val. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a5df4f2aa0383bc09929f80ebbf43145c}{operator+}} (T val, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1decrementer}{decrementer}}) -\/$>$ T
\begin{DoxyCompactList}\small\item\em Decrements val. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Value , typename Delta  = int$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}} (Value \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1nums_ac73062a0b718117734c8b40eafb4589e}{min}}, Value \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1nums_a8f5e5a9f72912486d090c7f2727d2ca0}{max}}, Delta step=0) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1range__t}{range\+\_\+t}}$<$ Value, Delta $>$
\begin{DoxyCompactList}\small\item\em Constructs a range from beginning, end, and step amount. The range is half-\/open, that is min is in the range but max is not. If unspecified, the step is automatically either 1 or -\/1, depending on whether max \texorpdfstring{$>$}{>} min. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Value $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a745c618407d81dee275529800bac2cde}{range}} (Value \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1nums_a8f5e5a9f72912486d090c7f2727d2ca0}{max}}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1range__t}{range\+\_\+t}}$<$ Value, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1incrementer}{incrementer}} $>$
\begin{DoxyCompactList}\small\item\em Constructs a half-\/open range \mbox{[}0, max). The step is automatically determined based on the sign of max. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Value , typename Delta  = int$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a896c8dd73cc288a6e4e3019a30691528}{irange}} (Value, Value, Delta=0)
\item 
{\footnotesize template$<$std\+::size\+\_\+t I, typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2e5b4f458eeec06c6eeda37fb35a18f}{get}} (\mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumeration}{enumeration}}$<$ T $>$ \&\&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab201870fcd6e784f6927f15ad256cd18}{e}}) -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$std\+::size\+\_\+t I, typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae923e695f4780fd2e69c574be26d54ab}{get}} (const \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumeration}{enumeration}}$<$ T $>$ \&\&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab201870fcd6e784f6927f15ad256cd18}{e}}) -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$std\+::size\+\_\+t I, typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa37ef0e45738b6d686cbaaa768851a01}{get}} (volatile \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumeration}{enumeration}}$<$ T $>$ \&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab201870fcd6e784f6927f15ad256cd18}{e}}) -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$std\+::size\+\_\+t I, typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_afd76863f7b74e75212aa6fb592dcbbf9}{get}} (const volatile \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumeration}{enumeration}}$<$ T $>$ \&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab201870fcd6e784f6927f15ad256cd18}{e}}) -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$typename It , typename EIt $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a23d3833a48cfd8540b34c5fae8f9ba54}{magic\+\_\+enumerate}} (It begin, EIt end) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumerator__t}{enumerator\+\_\+t}}$<$ It, EIt $>$
\begin{DoxyCompactList}\small\item\em Allow access to indexes while using range-\/based for loops. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Range $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae36551c05b2fbb28f58a337ab9bcb891}{magic\+\_\+enumerate}} (Range \&\&r) -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Allow access to indexes while using range-\/based for loops. Safe to use with rvalues. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Iter1 , typename Iter2 $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac590b27c7b66c8f9b075971cfb973368}{indirect}} (Iter1 begin, Iter2 end) noexcept(noexcept(\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1indirect__range}{indirect\+\_\+range}}$<$ Iter1, Iter2 $>$\{begin, end\})) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1indirect__range}{indirect\+\_\+range}}$<$ Iter1, Iter2 $>$
\begin{DoxyCompactList}\small\item\em Create a range from an iterator pair. Primarily useful for range-\/for loops. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Iter1 , typename Iter2 $>$ }\\\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a71ae1d12df8f19b95f83f385a4afa2f5}{indirect\+\_\+range}} (Iter1, Iter2) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1indirect__range}{indirect\+\_\+range}}$<$ Iter1, Iter2 $>$
\item 
{\footnotesize template$<$typename Iter1 , typename Iter2 $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ace7f2fbc3da892054770143cf07dff48}{cry\+\_\+enumerate}} (Iter1 begin, Iter2 end) -\/$>$ auto
\item 
{\footnotesize template$<$typename It , typename operation $>$ }\\\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a854750da58a40d155e5ec67c6ab3bb6a}{transform\+\_\+iterator}} (It, operation) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{transform\+\_\+iterator}}$<$ It, operation $>$
\item 
{\footnotesize template$<$typename base\+\_\+iterator , typename operation $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae9ae81f88d9fa4ae4cf5d349cd2aef6c}{make\+\_\+transform\+\_\+iterator}} (base\+\_\+iterator it, operation op) noexcept(noexcept(\mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{transform\+\_\+iterator}}$<$ base\+\_\+iterator, operation $>$\{ it, std\+::move(op)\})) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{transform\+\_\+iterator}}$<$ base\+\_\+iterator, operation $>$
\begin{DoxyCompactList}\small\item\em Factory function to make transform\+\_\+iterators. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename base\+\_\+iterator , typename operation $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af82c660d05b18b8d626ed30bcfddd764}{transformer}} (base\+\_\+iterator it, operation op) noexcept(noexcept(\mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{transform\+\_\+iterator}}$<$ base\+\_\+iterator, operation $>$\{it, std\+::move(op)\})) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{transform\+\_\+iterator}}$<$ base\+\_\+iterator, operation $>$
\begin{DoxyCompactList}\small\item\em Factory function to make transform\+\_\+iterators. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename It , typename End\+It , typename operation $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1961ed6dd7c57f8638b6d35b03589a70}{transform\+\_\+range}} (It begin, End\+It end, operation op) noexcept(noexcept(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac590b27c7b66c8f9b075971cfb973368}{indirect}}(\mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{transform\+\_\+iterator}}\{begin, op\}, end))) -\/$>$ auto
\item 
{\footnotesize template$<$typename Input\+It1 , typename End\+It , typename Input\+It2 $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6d9b27640c095aa2fd137687619565a2}{zip}} (Input\+It1 begin1, End\+It end1, Input\+It2 begin2) noexcept(\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1zip__iterator}{zip\+\_\+iterator}}$<$ Input\+It1, End\+It, Input\+It2 $>$\+::is\+\_\+nothrow\+\_\+copyable) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1zip__iterator}{zip\+\_\+iterator}}$<$ Input\+It1, End\+It, Input\+It2 $>$
\begin{DoxyCompactList}\small\item\em Iterate over two ranges in lockstep, like Python\textquotesingle{}s zip. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Range1 , typename Range2 $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af9fd8e067453b5a2073c406585a24eb2}{zip}} (Range1 \&\&r1, Range2 \&\&r2) noexcept(\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1zip__iterator}{zip\+\_\+iterator}}$<$ decltype(begin(r1)), decltype(end(r1)), decltype(begin(r2))$>$\+::is\+\_\+nothrow\+\_\+copyable) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1zip__iterator}{zip\+\_\+iterator}}$<$ decltype(begin(r1)), decltype(end(r1)), decltype(begin(r2))$>$
\begin{DoxyCompactList}\small\item\em Iterate over two ranges in lockstep, like Python\textquotesingle{}s zip. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename F $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_adba96aa24ce8e12f9c035b38684e6862}{consumer}} (F f) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1consume__iterator}{consume\+\_\+iterator}}$<$ F $>$
\begin{DoxyCompactList}\small\item\em Creates a \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1consume__iterator}{consume\+\_\+iterator}} of deduced type F. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T , typename Deleter $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad1160b93fc900fcb5008eda4720b9f25}{make\+\_\+cond\+\_\+ptr}} (std\+::unique\+\_\+ptr$<$ T, Deleter $>$ \&\&arg) noexcept -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1cond__ptr}{cond\+\_\+ptr}}$<$ T, Deleter $>$
\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac86846919817ae6ff8195380bfe255da}{make\+\_\+cond\+\_\+ptr}} (T $\ast$arg, bool owner=false) noexcept -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1cond__ptr}{cond\+\_\+ptr}}$<$ T $>$
\item 
{\footnotesize template$<$typename T , typename Deleter $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a54bb697f9f1932f21d57c5dd5a225864}{make\+\_\+cond\+\_\+ptr}} (T $\ast$arg, Deleter del) noexcept -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1cond__ptr}{cond\+\_\+ptr}}$<$ T, Deleter $>$
\item 
{\footnotesize template$<$typename T , typename Deleter $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1535ccc487bac70a3febdf24d877d818}{make\+\_\+cond\+\_\+ptr}} (T $\ast$arg, bool owner, Deleter del) noexcept -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1cond__ptr}{cond\+\_\+ptr}}$<$ T, Deleter $>$
\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9427109650f0884de2084903c79d1923}{operator$\vert$}} (\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}} l, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}} r) noexcept -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}}
\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a5813ed369e8ea6b6d3451b3eac0d7853}{operator\&}} (\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}} l, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}} r) noexcept -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}}
\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a78ee879418158c092d08d68b737e695d}{operator$\ast$}} (\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}} l, bool r) noexcept -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}}
\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9eaca960eeb679008dfc52be3f1bbab2}{noop}} (void $\ast$, const T $\ast$) -\/$>$ T $\ast$
\begin{DoxyCompactList}\small\item\em Does nothing; matches the copy construction signature. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T , bool nothrow$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2888809b9f43c09b46a401fdb02e49a9}{noop}} (void $\ast$, T $\ast$) noexcept(nothrow) -\/$>$ T $\ast$
\begin{DoxyCompactList}\small\item\em Does nothing; matches the move construction signature. \end{DoxyCompactList}\item 
{\footnotesize template$<$bool warn$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae2dd41c896b1e979fa511e09a7a22df5}{poly\+\_\+warn\+\_\+if}} () -\/$>$ std\+::nullptr\+\_\+t
\item 
template$<$$>$ constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac3d2bcadd8c9085766710f3af39342b7}{poly\+\_\+warn\+\_\+if$<$ true $>$}} () -\/$>$ std\+::nullptr\+\_\+t
\item 
{\footnotesize template$<$typename Array , typename Random\+Generator , typename freqtype  = double$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a954b78fde1565b7306b2fe1964d02cfc}{choose\+Categorical}} (Array \&\&cats, Random\+Generator \&r) -\/$>$ decltype(cats.\+size())
\begin{DoxyCompactList}\small\item\em Given a categorical distribution cats, selects one category. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Gen , typename Source $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a37ea952337d919c7a9594ad5629681e9}{seeded}} (Source \&\&s) -\/$>$ Gen
\item 
{\footnotesize template$<$typename Gen $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a13a73ff3876a67a71aef1d4470e9152b}{seeded}} () -\/$>$ Gen
\item 
{\footnotesize template$<$typename UInt\+Type $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae3666c3da5e91fbec62c284b7b5cae03}{ipow2}} (UInt\+Type b) noexcept -\/$>$ UInt\+Type
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab0a6f69c300d7cdf4d0af8c9e053610a}{in\+\_\+range}} (const T \&v, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1detail__simple_1_1simple__range}{detail\+\_\+simple\+::simple\+\_\+range}}$<$ T $>$ r)
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_acf7d0f0c1c27274cff17a76eb01d7471}{in\+\_\+range\+\_\+i}} (const T \&v, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1detail__simple_1_1simple__range}{detail\+\_\+simple\+::simple\+\_\+range}}$<$ T $>$ r)
\item 
{\footnotesize template$<$typename F , typename... T$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6dba339947eb5129b3d519cf492305a6}{map}} (F f, T \&\&... t) noexcept(noexcept(std\+::tuple\{ kblib\+::apply(f, std\+::forward$<$ T $>$(t))...\})) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1b7771329ad37243c15c9ef44dfa1902}{any\+\_\+void}}$<$ decltype(kblib\+::apply(f, std\+::forward$<$ T $>$(t)))... $>$, decltype(std\+::tuple\{kblib\+::apply(f, std\+::forward$<$ T $>$(t))...\})$>$
\item 
{\footnotesize template$<$typename F $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a941d60de9144c06e348bb874f625f1a9}{defer}} (F f)
\item 
{\footnotesize template$<$typename Binary\+Operation $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad06792c706d96d62d9d33d197ed31cba}{flip}} () -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Transforms a stateless binary operation into one which takes reversed arguments. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Binary\+Operation $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4546b777ad26d8727ad959e42e90348b}{flip}} (Binary\+Operation op) -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Transforms a binary operation into one which takes reversed arguments. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T , std\+::size\+\_\+t N$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6eb0a94f4d90a18f521124b70da10267}{is\+\_\+consecutive}} (const T(\&array)\mbox{[}N\mbox{]}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ std\+::is\+\_\+integral$<$ T $>$\+::value, bool $>$
\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6d8b22c40c02b17c6613fecdab5e9224}{filg2}} (const std\+::bitset$<$ std\+::numeric\+\_\+limits$<$ std\+::uintmax\+\_\+t $>$\+::digits $>$ val) noexcept -\/$>$ int
\begin{DoxyCompactList}\small\item\em Floored integer binary logarithm. Returns floor(lb(val)). \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aab3310632bd16a3a0a340194213964c1}{safe\+\_\+auto}} (T \&\&in) -\/$>$ T
\begin{DoxyCompactList}\small\item\em Safely propagate an xvalue or lvalue without dangling references. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2aba0058576819b12818438dadcfcf06}{safe\+\_\+auto}} (T \&in) -\/$>$ T \&
\begin{DoxyCompactList}\small\item\em Safely propagate an xvalue or lvalue without dangling references. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Left\+Container , typename Right\+Container $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a28652b426f35cf1445da9fbca3f7e629}{arraycat}} (Left\+Container A, Right\+Container \&\&B) noexcept(noexcept(A.\+insert(A.\+end(), B.\+begin(), B.\+end())) and std\+::is\+\_\+nothrow\+\_\+move\+\_\+constructible$<$ Left\+Container $>$\+::value) -\/$>$ Left\+Container
\begin{DoxyCompactList}\small\item\em Concatenate two dynamic containers together. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a228a6004801f23e3746cd67df6bcbeb6}{a}} (const std\+::initializer\+\_\+list$<$ T $>$ \&a) -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Index an array literal without naming its type. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Random\+Access\+It , typename Compare  = std\+::less$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a69412d3b7e960740e59abbc2b4cf741a}{insertion\+\_\+sort}} (const Random\+Access\+It begin, const Random\+Access\+It end, Compare \&\&compare=\{\}) noexcept(noexcept(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4ca198c8b213042d9bd7437a34e18476}{swap}}($\ast$begin, $\ast$begin)) and noexcept(compare($\ast$begin, $\ast$begin))) -\/$>$ void
\begin{DoxyCompactList}\small\item\em In-\/place insertion sort. As is usual, it is stable. Provides as a guarantee that it will perform no moves on sorted input. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Random\+Access\+It , typename Random\+Access\+It2 , typename Compare  = std\+::less$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abf8f5997817981a12eb9f782b1f921b0}{insertion\+\_\+sort\+\_\+copy}} (const Random\+Access\+It begin, const Random\+Access\+It end, const Random\+Access\+It2 d\+\_\+begin, const Random\+Access\+It2 d\+\_\+end, Compare \&\&compare=\{\}) noexcept(noexcept(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__algorithm_a85921b9111a9f887950a920b552e7d4a}{detail\+\_\+algorithm\+::shift\+\_\+backward}}(d\+\_\+begin, d\+\_\+begin, d\+\_\+end)) and noexcept($\ast$d\+\_\+begin= $\ast$begin)) -\/$>$ void
\begin{DoxyCompactList}\small\item\em Out-\/of-\/place insertion sort, which does not modify the input. Provides as a guarantee that it will perform no moves on sorted input. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Random\+Access\+It , typename Random\+Access\+It2 , typename Compare  = std\+::less$<$$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7d9e472664bb54c7492246525b3d9046}{adaptive\+\_\+insertion\+\_\+sort\+\_\+copy}} (const Random\+Access\+It begin, const Random\+Access\+It end, const Random\+Access\+It2 d\+\_\+begin, const Random\+Access\+It2 d\+\_\+end, Compare \&\&compare=\{\}) noexcept(noexcept(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail__algorithm_a85921b9111a9f887950a920b552e7d4a}{detail\+\_\+algorithm\+::shift\+\_\+backward}}(d\+\_\+begin, d\+\_\+begin, d\+\_\+end)) and noexcept($\ast$d\+\_\+begin= $\ast$begin)) -\/$>$ void
\begin{DoxyCompactList}\small\item\em An adaptive sort which, at the cost of some additional work (time complexity Θ(sqrt(n))), avoids quadratic behavior for reverse-\/sorted inputs (and, in fact, handles them in optimal time). It\textquotesingle{}s still possible to fool it, but it requires a staggered input, which is a highly unlikely shape for random data. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac407c37897dbba453180c260a14f793f}{byte\+\_\+count}} (T) noexcept -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ std\+::is\+\_\+integral$<$ T $>$\+::value, std\+::size\+\_\+t $>$
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8d6c07ac59c352d602973136fab7a491}{byte\+\_\+count}} (T $\ast$) noexcept -\/$>$ std\+::size\+\_\+t
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a566d119d647550949517a8ef5c4ec931}{byte\+\_\+count}} (const std\+::unique\+\_\+ptr$<$ T $>$ \&) noexcept -\/$>$ std\+::size\+\_\+t
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a5ee1f8c82b92d53a4a1d05e1e19fc3d0}{byte\+\_\+count}} (const T \&x) noexcept -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ is\+\_\+linear\+\_\+container\+\_\+v$<$ T $>$ and(std\+::is\+\_\+integral$<$ typename T\+::value\+\_\+type $>$\+::value or \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a50124a019a763aa533428f9bb73754c6}{is\+\_\+byte\+\_\+v}}$<$ T $>$) and sizeof(typename T\+::value\+\_\+type)==1, std\+::size\+\_\+t $>$
\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa362dc8d17673963fd10f7daf9945872}{byte\+\_\+count}} (...) -\/$>$ void=delete
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4b62a75396110b0508551695d3942dd9}{get\+\_\+byte\+\_\+index}} (T x, std\+::size\+\_\+t idx) noexcept -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ std\+::is\+\_\+integral$<$ T $>$\+::value, unsigned char $>$
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3ff0abf4a62bba732550cebc00e9d627}{get\+\_\+byte\+\_\+index}} (const T \&x, std\+::size\+\_\+t idx) noexcept -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ std\+::is\+\_\+enum$<$ T $>$\+::value, unsigned char $>$
\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ade0bfb558c64d64baebf8403d543ef7e}{get\+\_\+byte\+\_\+index}} (T $\ast$x, std\+::size\+\_\+t idx) noexcept -\/$>$ unsigned char
\item 
{\footnotesize template$<$typename T $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a921a1defcfee6373bc3438e48723d43c}{get\+\_\+byte\+\_\+index}} (const std\+::unique\+\_\+ptr$<$ T $>$ \&x, std\+::size\+\_\+t idx) noexcept -\/$>$ unsigned char
\item 
{\footnotesize template$<$typename Random\+Access\+It , typename Unary\+Operation , typename Binary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a65c6022b6e9095d1f743f7a3938ac2be}{sort\+\_\+transform}} (Random\+Access\+It begin, Random\+Access\+It end, Unary\+Operation \&\&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a776689bdcc9e3aa8017448393fe85f3a}{transform}}, Binary\+Predicate \&\&compare) -\/$>$ void
\begin{DoxyCompactList}\small\item\em Sorts a range after applying a transformation. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Random\+Access\+It , typename Unary\+Operation $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a739b00ac6efec5a41e399bca46d1e6fd}{sort\+\_\+transform}} (Random\+Access\+It begin, Random\+Access\+It end, Unary\+Operation \&\&\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a776689bdcc9e3aa8017448393fe85f3a}{transform}}) -\/$>$ void
\item 
{\footnotesize template$<$typename Random\+Access\+It , typename Binary\+Predicate $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa7efdb907743a191fc52f3517a0f0175}{sort}} (Random\+Access\+It begin, Random\+Access\+It end, Binary\+Predicate \&\&compare) -\/$>$ void
\begin{DoxyCompactList}\small\item\em Sorts a range. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Random\+Access\+It $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a40b7b1fff3942578fe0f6490cadec47e}{sort}} (Random\+Access\+It begin, Random\+Access\+It end) -\/$>$ void
\item 
{\footnotesize template$<$typename T , typename U $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7ee01e52a61bc482ffbade1b76984426}{div}} (T num, U den) noexcept -\/$>$ decltype(std\+::div(num, den))
\item 
{\footnotesize template$<$typename U $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1f193cfd181f4fe369fe2bee65f5d129}{calc\+\_\+fib\+\_\+size}} () noexcept -\/$>$ std\+::size\+\_\+t
\begin{DoxyCompactList}\small\item\em Calculate the index of the largest fibonacci number that can be represented by a given unsigned integral type. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename U , std\+::size\+\_\+t N = calc\+\_\+fib\+\_\+size$<$\+U$>$() + 1$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a18e31f0c0ba3d5a0486323e7b78d2cf8}{make\+\_\+fib\+\_\+arr}} () noexcept -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1trivial__array}{trivial\+\_\+array}}$<$ U, N $>$
\begin{DoxyCompactList}\small\item\em Generates the first N values of the fibonacci sequence. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename U  = std\+::uintmax\+\_\+t$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aeecdd0cbb5d0bba19abcde780fcb9e12}{fibonacci}} (int n) noexcept -\/$>$ U
\begin{DoxyCompactList}\small\item\em Compile-\/time table fibonacci function. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T  = double$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3963afc371f605af54da0a8ff1fdb567}{pi}} () -\/$>$ T
\item 
{\footnotesize template$<$typename T  = double$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a5649fc2cd5d97c7cfbfe2fc8b6abe394}{tau}} () -\/$>$ T
\item 
{\footnotesize template$<$typename T  = double$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab201870fcd6e784f6927f15ad256cd18}{e}} () -\/$>$ T
\item 
{\footnotesize template$<$typename T  = double$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab543086d96131814403ccda4ee06a44e}{root\+\_\+2}} () -\/$>$ T
\item 
{\footnotesize template$<$typename T  = double$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aef797bc7219be065bda6759e2b87b563}{phi}} () -\/$>$ T
\item 
{\footnotesize template$<$typename A , typename F $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aae4b6d6cd09943101cf3c90c64ca6f6d}{saturating\+\_\+cast}} (F x) noexcept -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ std\+::is\+\_\+integral$<$ A $>$\+::value and std\+::is\+\_\+integral$<$ F $>$\+::value and std\+::is\+\_\+unsigned$<$ A $>$\+::value, A $>$
\item 
{\footnotesize template$<$typename T , typename F $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_acbd04ed4ac7b170b334da5f21ad3b3f9}{quantize\+\_\+step}} (F low, F delta, F val) noexcept -\/$>$ T
\begin{DoxyCompactList}\small\item\em Quantize a real-\/valued value into a discrete integer. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T , typename F $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabdcf98294bd3aba6969bb89fb5399e5}{quantize\+\_\+range}} (F low, F high, F val) noexcept -\/$>$ T
\begin{DoxyCompactList}\small\item\em Quantize a real-\/valued value into a discrete integer. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Str $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2f65579e911e295dca39a7770c22f022}{strsize}} (Str \&\&str) -\/$>$ std\+::size\+\_\+t
\begin{DoxyCompactList}\small\item\em Determines the size in characters of any valid argument to concat or append. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename CharT $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6a72a1bd0fc23633f0c0abd639c512f9}{length}} (const CharT $\ast$str) noexcept -\/$>$ std\+::size\+\_\+t
\item 
{\footnotesize template$<$typename string , typename F , typename... S$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6ccc6538ad29e35063e1eb7ecfae58c4}{append}} (string \&\&out, F \&\&f, S \&\&... tail) -\/$>$ void
\begin{DoxyCompactList}\small\item\em Given an object out of resizable stringlike type string, appends all other arguments to it. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename string  = std\+::string, typename F , typename... S$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aaa2785d00ba0a708990c2e6d53de6598}{concat}} (F \&\&f, S \&\&... ins) -\/$>$ string
\begin{DoxyCompactList}\small\item\em Returns a string consisting of the concatenation of all arguments. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename string  = std\+::string, typename str $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab43fe5e6cef0ef3f226528d496c03475}{concat}} (std\+::initializer\+\_\+list$<$ str $>$ ins) -\/$>$ string
\begin{DoxyCompactList}\small\item\em Returns a string consisting of the concatenation of all elements of an initializer list. \end{DoxyCompactList}\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2378652ba1b1c18873c837b0782c2d0e}{isspace}} (char c) -\/$>$ bool
\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab7b97f0140dd3ab51f209d74d276c776}{isspace}} (wchar\+\_\+t c) -\/$>$ bool
\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa634d9eca37bf3010c9193ff0e29568d}{is\+Aspace}} (char c) -\/$>$ bool
\item 
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7a1d2ceb3c0b626bcfebdaf956d0f608}{is\+Aspace}} (wchar\+\_\+t c) -\/$>$ bool
\item 
{\footnotesize template$<$typename \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}} , typename string  = std\+::string$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a812a994881599a717cb23d262957b7fa}{join}} (const \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}} \&in, const string \&joiner=\char`\"{}\char`\"{})
\begin{DoxyCompactList}\small\item\em Concatenates all elements of a range together with an optional joiner. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename Predicate , typename String $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a5adc721af48c3d00ebd2070dc186e3e9}{split\+\_\+tokens}} (const String \&in, Predicate spacer) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}{return\+\_\+assert\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__callable}{is\+\_\+callable}}$<$ Predicate, typename Container\+::value\+\_\+type\+::value\+\_\+type $>$\+::value, Container $>$
\begin{DoxyCompactList}\small\item\em Split a string on all condensed delimiters. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename String $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6b9b38fb6375a44de7228d43f3910d78}{split\+\_\+tokens}} (const String \&in) -\/$>$ Container
\begin{DoxyCompactList}\small\item\em Split a string on all instances of whitespace. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename String $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab09517fa04150ca420cca2c02b842419}{split\+\_\+tokens}} (const String \&in, typename Container\+::value\+\_\+type\+::value\+\_\+type delim) -\/$>$ Container
\begin{DoxyCompactList}\small\item\em Split a string on all instances of a delimiter. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename String $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9c77e4e62b94152a2fdd7003ed2eb06c}{kbsplit2}} (const String \&in, char delim=\textquotesingle{} \textquotesingle{}) -\/$>$ Container
\item 
{\footnotesize template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename String $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae8eaf5b12b06c932a12825d061884eab}{split\+\_\+dsv}} (const String \&str, char delim) -\/$>$ Container
\begin{DoxyCompactList}\small\item\em Split a string on all instances of delim. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename String , typename Predicate $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9788c388a6be1d255a51a85269cf693d}{split\+\_\+dsv}} (const String \&str, Predicate delim) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}{return\+\_\+assert\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__callable}{is\+\_\+callable}}$<$ Predicate, typename Container\+::value\+\_\+type\+::value\+\_\+type $>$\+::value, Container $>$
\begin{DoxyCompactList}\small\item\em Split a string on all instances of delim. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a758c1217ec1632ac03b50aecdb92fc5b}{reverse\+\_\+str}} (string val) -\/$>$ string
\begin{DoxyCompactList}\small\item\em Reverses all the elements of its input. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename string $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af4da1056b52c74075982b32b83e10460}{tolower}} (string str) -\/$>$ string
\begin{DoxyCompactList}\small\item\em Folds all characters in a string using the default execution character set to lowercase. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6342518049abc9aa1ee5d0309eabbf38}{toupper}} (string str) -\/$>$ string
\begin{DoxyCompactList}\small\item\em Folds all characters in a string using the default execution character set to uppercase. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename string $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a059167dadeec66edfae81dc9e86348ca}{repeat}} (string val, std\+::size\+\_\+t count) -\/$>$ string
\begin{DoxyCompactList}\small\item\em Construct a string consisting of count copies of val concatenated together. \end{DoxyCompactList}\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a851a902d0ad2b43995b4d35bb7ed5762}{repeat}} (char val, std\+::size\+\_\+t count) -\/$>$ std\+::string
\begin{DoxyCompactList}\small\item\em Construct a string consisting of count copies of val. \end{DoxyCompactList}\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad3effaa7d10875cac1da148d682fcc35}{ends\+\_\+with}} (std\+::string\+\_\+view haystack, std\+::string\+\_\+view needle) -\/$>$ bool
\begin{DoxyCompactList}\small\item\em Checks if a given string ends with a particular string. \end{DoxyCompactList}\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aac47fa307bf4298640545dec121ff144}{ends\+\_\+with}} (std\+::string\+\_\+view haystack, char needle) -\/$>$ bool
\begin{DoxyCompactList}\small\item\em Checks if a given string ends with a particular string. \end{DoxyCompactList}\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a71bf9af47d341a1091715059f7befb1a}{starts\+\_\+with}} (std\+::string\+\_\+view haystack, std\+::string\+\_\+view needle) -\/$>$ bool
\begin{DoxyCompactList}\small\item\em Checks if a given string starts with a particular string. \end{DoxyCompactList}\item 
auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0e4a14d283de53aadad3f0152a289b71}{starts\+\_\+with}} (std\+::string\+\_\+view haystack, char needle) -\/$>$ bool
\begin{DoxyCompactList}\small\item\em Checks if a given string starts with a particular string. \end{DoxyCompactList}\item 
{\footnotesize template$<$int trim, typename T , int N, typename Indices  = std\+::make\+\_\+integer\+\_\+sequence$<$int, N -\/ trim$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7ce3c29a812049a41491b64b679c63b0}{trim\+\_\+array}} (const T(\&arr)\mbox{[}N\mbox{]}) -\/$>$ std\+::array$<$ T, N -\/ trim $>$
\begin{DoxyCompactList}\small\item\em Truncates the last trim elements from an array. \end{DoxyCompactList}\item 
{\footnotesize template$<$int N, typename Indices  = std\+::make\+\_\+integer\+\_\+sequence$<$int, N -\/ 1$>$$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae2c40df6afb11bbcf00518ff4ab90334}{remove\+\_\+null\+\_\+terminator}} (const char(\&arr)\mbox{[}N\mbox{]}) -\/$>$ std\+::array$<$ char, N -\/ 1 $>$
\begin{DoxyCompactList}\small\item\em Creates an array of only the meaningful characters in a string literal, and not the null terminator. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T , typename F $>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0aedecf6740f35fb61cd5bc85cfd00e6}{byte\+\_\+cast}} (F v) noexcept -\/$>$ T
\begin{DoxyCompactList}\small\item\em Creates a T with the same object representation as the given F. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename C , typename std\+::enable\+\_\+if$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a55198f023deee0c3ff0009ee698d0fc0}{has\+\_\+reserve\+\_\+v}}$<$ C $>$, int $>$\+::type  = 0$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab192185efddea3b03e734c39ef6c9051}{try\+\_\+reserve}} (C \&c, std\+::size\+\_\+t s) noexcept(noexcept(c.\+reserve(s))) -\/$>$ void
\begin{DoxyCompactList}\small\item\em Attempt to reserve capacity in a container. No-\/op if unsupported. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename To , typename... Ts$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8bc9a7fc2ab24ae197119582e92c08ac}{coerce}} (const std\+::variant$<$ Ts... $>$ \&v) -\/$>$ To
\begin{DoxyCompactList}\small\item\em Lexically converts the value of v (no matter its type) to type To. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename To , typename... Ts$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a05212882618e578a8d6f9999f2967c25}{static\+\_\+coerce}} (const std\+::variant$<$ Ts... $>$ \&v) -\/$>$ To
\begin{DoxyCompactList}\small\item\em static\+\_\+casts the value of v (no matter its type) to type To. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename To , typename... Ts$>$ }\\auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae3839286a1c0d4b6fa5afb27d954527b}{lexical\+\_\+coerce}} (const std\+::variant$<$ Ts... $>$ \&v) -\/$>$ To
\begin{DoxyCompactList}\small\item\em Lexically converts the value of v (no matter its type) to type To. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename... Ts$>$ }\\\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a308892140c15cc0c3dacf95054c5bc38}{visitor}} (Ts...) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1visitor}{visitor}}$<$ Ts... $>$
\item 
{\footnotesize template$<$char... Cs$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1literals_a240ec45225b586d4fe729ab9221c0c10}{operator\char`\"{}\char`\"{}\+\_\+vi}} ()
\item 
{\footnotesize template$<$typename Variant , typename... Fs$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac0ef79b1174e241dede98314e8484e63}{visit\+\_\+indexed}} (Variant \&\&variant, Fs \&\&... fs) -\/$>$ decltype(auto)
\begin{DoxyCompactList}\small\item\em Visit a variant, but pass the index (as an integral\+\_\+constant) to the visitor. This allows for a visitor of a variant with duplicated types to maintain index information. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename To , typename From $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad71a34434026400dcbb8b1392299d733}{variant\+\_\+cast}} (From \&\&v) -\/$>$ To
\begin{DoxyCompactList}\small\item\em Promotes an input variant to a super-\/variant. That is, one which provides at least the same set of types. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename V , typename F , typename... Fs$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a49bfcf40f9c0a41a7b2f356e299ae450}{visit}} (V \&\&v, F \&\&f, Fs \&\&... fs) -\/$>$ decltype(auto)
\begin{DoxyCompactList}\small\item\em Wraps std\+::visit to provide an interface taking one variant and any number of functors providing an overload set. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename V , typename F , typename... Fs$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9d4940990e9591fd7f4270e3e77502da}{visit2}} (V \&\&v, F \&\&f, Fs \&\&... fs) -\/$>$ decltype(auto)
\item 
{\footnotesize template$<$typename V , typename F , typename... Fs$>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a5d2ab261affe206adbd984f89b167fac}{visit2\+\_\+nop}} (V \&\&v, F \&\&f, Fs \&\&... fs) -\/$>$ void
\item 
{\footnotesize template$<$typename V $>$ }\\constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1be42ea0b4b20e53d446abb929c116ba}{visit}} (V \&v) -\/$>$ auto
\begin{DoxyCompactList}\small\item\em Two-\/step visiting interface. Takes a variant, and returns an object which can be called with any number of callable arguments, builds an overload set from them, and visits the variant. \end{DoxyCompactList}\end{DoxyCompactItemize}
\doxysubsection*{Variables}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Int $>$ }\\constexpr int \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abf777dbb6730c5e4c446d676a438677b}{bits\+\_\+of}} = std\+::numeric\+\_\+limits$<$Int$>$\+::digits
\item 
constexpr struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1build__end__t}{KBLIB\+\_\+\+NS\+::build\+\_\+end\+\_\+t}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a713ffad77fec82960b5b4df868afeb6d}{build\+\_\+end}}
\item 
\begin{tabbing}
xx\=xx\=xx\=xx\=xx\=xx\=xx\=xx\=xx\=\kill
struct \{\\
\} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a4ca198c8b213042d9bd7437a34e18476}{swap}}\\

\end{tabbing}\item 
{\footnotesize template$<$typename T $>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a02befc3759ed0939086821b3a53b82e1}{value\+\_\+detected\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1value__detected}{value\+\_\+detected}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae4d168e52ff97267c89c7f25c1303d13}{key\+\_\+detected\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1key__detected}{key\+\_\+detected}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab1669a40c383aea13c09c3083244d28a}{mapped\+\_\+detected\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1mapped__detected}{mapped\+\_\+detected}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a134f651b2d497fa4e25a2169b27ba21a}{hash\+\_\+detected\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1hash__detected}{hash\+\_\+detected}}$<$T$>$\+::value
\item 
constexpr struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1in__place__agg__t}{KBLIB\+\_\+\+NS\+::in\+\_\+place\+\_\+agg\+\_\+t}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0136c0689dddfe6c52a67392b45a586c}{in\+\_\+place\+\_\+agg}}
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr int \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abc6d2d019fe4d5366d476f8ab43b0e5a}{padding\+\_\+bits\+\_\+v}}
\begin{DoxyCompactList}\small\item\em Get the number of padding bits in an integral type. \end{DoxyCompactList}\item 
template$<$$>$ constexpr int \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af0c852a6f506fd89424502edf9cf707f}{padding\+\_\+bits\+\_\+v$<$ void $>$}} = 0
\item 
{\footnotesize template$<$typename Key $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a5c6ead81a6fc54203d729f6d2c3080a0}{is\+\_\+hashable\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__hashable}{is\+\_\+hashable}}$<$Key$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab285613a76758ad7a7693b5562101634}{is\+\_\+trivially\+\_\+hashable\+\_\+v}}
\item 
{\footnotesize template$<$bool A, bool B$>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa2f89ee505b39584b766194bc6949fa8}{implies\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1implies}{implies}}$<$A, B$>$\+::value
\item 
{\footnotesize template$<$bool... args$>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2f8cb693187964dd1f1c2b89bdca2357}{conjunction\+\_\+v}} = (args and ...)
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr std\+::size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a3c73283c42fa767d04476fe249aab299}{state\+\_\+size\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1state__size}{state\+\_\+size}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T , typename  = void$>$ }\\constexpr std\+::size\+\_\+t \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aaaae1f4f59791e7522360aba8a02ad04}{seed\+\_\+discard\+\_\+v}} = 0
\item 
{\footnotesize template$<$typename... Ts$>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1b7771329ad37243c15c9ef44dfa1902}{any\+\_\+void}} = (std\+::is\+\_\+void\+\_\+v$<$Ts$>$ or ...)
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aaba14e673821b31ca6d7fad5f06a9296}{is\+\_\+radix\+\_\+sortable\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__radix__sortable}{is\+\_\+radix\+\_\+sortable}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a50124a019a763aa533428f9bb73754c6}{is\+\_\+byte\+\_\+v}} = false
\item 
constexpr struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1nums_1_1max__t}{KBLIB\+\_\+\+NS\+::nums\+::max\+\_\+t}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1nums_a8f5e5a9f72912486d090c7f2727d2ca0}{max}}
\item 
constexpr struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1nums_1_1min__t}{KBLIB\+\_\+\+NS\+::nums\+::min\+\_\+t}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1nums_ac73062a0b718117734c8b40eafb4589e}{min}}
\item 
{\footnotesize template$<$typename C $>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac0ed725ba5e07193afa00d4e7b46bf63}{is\+\_\+character\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__character}{is\+\_\+character}}$<$C$>$\+::value
\begin{DoxyCompactList}\small\item\em Equivalent to is\+\_\+character$<$\+C$>$\+::value. \end{DoxyCompactList}\item 
constexpr \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1}{endian}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0678ff217e6fea1ec2bfe2286356b045}{system\+\_\+endian}} = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1aad921d60486366258809553a3db49a4a}{endian\+::unknown}}
\item 
constexpr \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1}{endian}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a416add1e204cea4ba163d0b152cb7023}{hash\+\_\+order}} = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail_a62231f99aa3fe4d8f764afe5f78d6c06}{detail\+::get\+\_\+hash\+\_\+order}}()
\item 
{\footnotesize template$<$typename... Ts$>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa1b0ee551189bad056eb650c6b18e230}{contains\+\_\+type\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__type}{contains\+\_\+type}}$<$Ts...$>$\+::value
\item 
{\footnotesize template$<$typename... Ts$>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab554d81133be98603522c9dcbcc5f507}{contains\+\_\+types\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__types}{contains\+\_\+types}}$<$Ts...$>$\+::value
\item 
{\footnotesize template$<$typename C $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}} = decltype(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail_a917b16b05f6a6e67dd5bde48eefa05a1}{detail\+::calc\+\_\+resizable}}$<$C$>$(0))\+::value
\item 
{\footnotesize template$<$typename C , typename  = void$>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a55198f023deee0c3ff0009ee698d0fc0}{has\+\_\+reserve\+\_\+v}} = false
\item 
{\footnotesize template$<$typename C , typename  = void$>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2530a939dc0029a61d40e4b71d24a326}{is\+\_\+contiguous\+\_\+v}} = false
\begin{DoxyCompactList}\small\item\em Type trait to determine if a container is contiguous. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a547a1e7930fbf709bb1b79b40f482566}{is\+\_\+input\+\_\+iterator\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aec264a886c8a43f4d14983878b22d254}{is\+\_\+forward\+\_\+iterator\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__forward__iterator}{is\+\_\+forward\+\_\+iterator}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9b0f47dcb794a46a80201a97520e9423}{is\+\_\+bidirectional\+\_\+iterator\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__bidirectional__iterator}{is\+\_\+bidirectional\+\_\+iterator}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__random__access__iterator}{is\+\_\+random\+\_\+access\+\_\+iterator}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a96b3971b86941f98762c8da07b60f105}{is\+\_\+iterable\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a93341c873e1c1744c353cc37872997db}{is\+\_\+iterator\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterator}{is\+\_\+iterator}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abf2986560eafaec6880b49a93d3443ec}{is\+\_\+reference\+\_\+v}} = std\+::is\+\_\+reference$<$T$>$\+::value
\begin{DoxyCompactList}\small\item\em Abbreviated name for std\+::is\+\_\+reference$<$\+T$>$\+::value for C++14. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename CharT  = char$>$ }\\\mbox{\hyperlink{tdecl_8h_a35b356d58929dd3ae764e8291838f5be}{KBLIB\+\_\+\+CONSTANT}} auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae5c97637c46ccfb5caa3fdb73bca3aa7}{eof}} = std\+::char\+\_\+traits$<$CharT$>$\+::eof()
\begin{DoxyCompactList}\small\item\em Names the EOF value for the given character type in std\+::char\+\_\+traits. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename T $>$ }\\\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a400d2f53ac4a3c95066b6c3330ae0400}{is\+\_\+aliasing\+\_\+type\+\_\+v}} = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__aliasing__type}{is\+\_\+aliasing\+\_\+type}}$<$T$>$\+::value
\item 
{\footnotesize template$<$typename T , typename  = void$>$ }\\constexpr bool \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac75e607e4cb117d75d16ef5d26112a7f}{is\+\_\+variant\+\_\+like\+\_\+v}} = false
\end{DoxyCompactItemize}


\doxysubsection{Typedef Documentation}
\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_abb0512894a5edc47918561c7c5185210}\label{namespace_k_b_l_i_b___n_s_abb0512894a5edc47918561c7c5185210}} 
\index{KBLIB\_NS@{KBLIB\_NS}!alias@{alias}}
\index{alias@{alias}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{alias}{alias}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abb0512894a5edc47918561c7c5185210}{KBLIB\+\_\+\+NS\+::alias}} = typedef T}



A simple identity alias for simplifying some compound type declarations, such as function pointers. 



Definition at line \mbox{\hyperlink{traits_8h_source_l00155}{155}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac8f388d87596921ece55f638526fe2cf}\label{namespace_k_b_l_i_b___n_s_ac8f388d87596921ece55f638526fe2cf}} 
\index{KBLIB\_NS@{KBLIB\_NS}!bool\_constant@{bool\_constant}}
\index{bool\_constant@{bool\_constant}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{bool\_constant}{bool\_constant}}
{\footnotesize\ttfamily template$<$bool v$>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac8f388d87596921ece55f638526fe2cf}{KBLIB\+\_\+\+NS\+::bool\+\_\+constant}} = typedef std\+::integral\+\_\+constant$<$bool, v$>$}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00064}{64}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a107dab7f8237c8700709e455c12c6ad7}\label{namespace_k_b_l_i_b___n_s_a107dab7f8237c8700709e455c12c6ad7}} 
\index{KBLIB\_NS@{KBLIB\_NS}!class\_of\_t@{class\_of\_t}}
\index{class\_of\_t@{class\_of\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{class\_of\_t}{class\_of\_t}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a107dab7f8237c8700709e455c12c6ad7}{KBLIB\+\_\+\+NS\+::class\+\_\+of\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1class__of}{class\+\_\+of}}$<$T$>$\+::type}



Definition at line \mbox{\hyperlink{traits_8h_source_l00279}{279}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a04784aad6b67bfd042b6047e3fb249c2}\label{namespace_k_b_l_i_b___n_s_a04784aad6b67bfd042b6047e3fb249c2}} 
\index{KBLIB\_NS@{KBLIB\_NS}!copy\_const\_t@{copy\_const\_t}}
\index{copy\_const\_t@{copy\_const\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{copy\_const\_t}{copy\_const\_t}}
{\footnotesize\ttfamily template$<$typename C , typename V $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a04784aad6b67bfd042b6047e3fb249c2}{KBLIB\+\_\+\+NS\+::copy\+\_\+const\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1copy__const}{copy\+\_\+const}}$<$C, V$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00871}{871}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9ca62d3247bc9fffca3c56a197833f09}\label{namespace_k_b_l_i_b___n_s_a9ca62d3247bc9fffca3c56a197833f09}} 
\index{KBLIB\_NS@{KBLIB\_NS}!decay\_t@{decay\_t}}
\index{decay\_t@{decay\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{decay\_t}{decay\_t}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9ca62d3247bc9fffca3c56a197833f09}{KBLIB\+\_\+\+NS\+::decay\+\_\+t}} = typedef typename std\+::decay$<$T$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00057}{57}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_abfee15df2202cbc4e8fcc10c713fbb56}\label{namespace_k_b_l_i_b___n_s_abfee15df2202cbc4e8fcc10c713fbb56}} 
\index{KBLIB\_NS@{KBLIB\_NS}!default\_extractor\_t@{default\_extractor\_t}}
\index{default\_extractor\_t@{default\_extractor\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{default\_extractor\_t}{default\_extractor\_t}}
{\footnotesize\ttfamily template$<$typename Container $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abfee15df2202cbc4e8fcc10c713fbb56}{KBLIB\+\_\+\+NS\+::default\+\_\+extractor\+\_\+t}} = typedef typename std\+::conditional$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1extractor__policy__for}{extractor\+\_\+policy\+\_\+for}}$<$Container$>$\+::value == \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715ea298bbb8f070170fc998ccac67856211b}{extractor\+\_\+policy\+::random\+\_\+access}}, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1indexer__extractor}{indexer\+\_\+extractor}}$<$Container$>$, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1iterator__extractor}{iterator\+\_\+extractor}}$<$Container$>$ $>$\+::type}



Definition at line \mbox{\hyperlink{trie_8h_source_l00086}{86}} of file \mbox{\hyperlink{trie_8h_source}{trie.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}\label{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}} 
\index{KBLIB\_NS@{KBLIB\_NS}!enable\_if\_t@{enable\_if\_t}}
\index{enable\_if\_t@{enable\_if\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{enable\_if\_t}{enable\_if\_t}}
{\footnotesize\ttfamily template$<$bool B, typename T  = void$>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{KBLIB\+\_\+\+NS\+::enable\+\_\+if\+\_\+t}} = typedef typename std\+::enable\+\_\+if$<$B, T$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00054}{54}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a0baf7f273d11c50bb2196f65613ca4c4}\label{namespace_k_b_l_i_b___n_s_a0baf7f273d11c50bb2196f65613ca4c4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!FNV32\_hash@{FNV32\_hash}}
\index{FNV32\_hash@{FNV32\_hash}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{FNV32\_hash}{FNV32\_hash}}
{\footnotesize\ttfamily template$<$typename Key $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0baf7f273d11c50bb2196f65613ca4c4}{KBLIB\+\_\+\+NS\+::\+FNV32\+\_\+hash}} = typedef \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}$<$Key, std\+::uint32\+\_\+t$>$}



Definition at line \mbox{\hyperlink{hash_8h_source_l00353}{353}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab1ff4774485d301335864418e11d23b3}\label{namespace_k_b_l_i_b___n_s_ab1ff4774485d301335864418e11d23b3}} 
\index{KBLIB\_NS@{KBLIB\_NS}!hash\_detected\_t@{hash\_detected\_t}}
\index{hash\_detected\_t@{hash\_detected\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{hash\_detected\_t}{hash\_detected\_t}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab1ff4774485d301335864418e11d23b3}{KBLIB\+\_\+\+NS\+::hash\+\_\+detected\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1hash__detected}{hash\+\_\+detected}}$<$T$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00923}{923}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a453846898a9637e1a2078a0cc4e67ab3}\label{namespace_k_b_l_i_b___n_s_a453846898a9637e1a2078a0cc4e67ab3}} 
\index{KBLIB\_NS@{KBLIB\_NS}!hash\_map@{hash\_map}}
\index{hash\_map@{hash\_map}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{hash\_map}{hash\_map}}
{\footnotesize\ttfamily template$<$typename Key , typename Value $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a453846898a9637e1a2078a0cc4e67ab3}{KBLIB\+\_\+\+NS\+::hash\+\_\+map}} = typedef std\+::unordered\+\_\+map$<$Key, Value, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}$<$$>$, std\+::equal\+\_\+to$<$$>$ $>$}



Definition at line \mbox{\hyperlink{hash_8h_source_l00764}{764}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a623ae888d36f9df8bdf8df7b969a4ff1}\label{namespace_k_b_l_i_b___n_s_a623ae888d36f9df8bdf8df7b969a4ff1}} 
\index{KBLIB\_NS@{KBLIB\_NS}!hash\_multimap@{hash\_multimap}}
\index{hash\_multimap@{hash\_multimap}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{hash\_multimap}{hash\_multimap}}
{\footnotesize\ttfamily template$<$typename Key , typename Value $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a623ae888d36f9df8bdf8df7b969a4ff1}{KBLIB\+\_\+\+NS\+::hash\+\_\+multimap}} = typedef std\+::unordered\+\_\+multimap$<$Key, Value, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}$<$$>$, std\+::equal\+\_\+to$<$$>$ $>$}



Definition at line \mbox{\hyperlink{hash_8h_source_l00766}{766}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_acd4f5597b05e84fe51b7a4a0722c023a}\label{namespace_k_b_l_i_b___n_s_acd4f5597b05e84fe51b7a4a0722c023a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!hash\_multiset@{hash\_multiset}}
\index{hash\_multiset@{hash\_multiset}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{hash\_multiset}{hash\_multiset}}
{\footnotesize\ttfamily template$<$typename T , typename Hash\+Int $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_acd4f5597b05e84fe51b7a4a0722c023a}{KBLIB\+\_\+\+NS\+::hash\+\_\+multiset}} = typedef std\+::unordered\+\_\+set$<$T, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}$<$$>$, std\+::equal\+\_\+to$<$$>$ $>$}



Definition at line \mbox{\hyperlink{hash_8h_source_l00771}{771}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a91b42f72534f684c16e3ad9f6a7e5873}\label{namespace_k_b_l_i_b___n_s_a91b42f72534f684c16e3ad9f6a7e5873}} 
\index{KBLIB\_NS@{KBLIB\_NS}!hash\_set@{hash\_set}}
\index{hash\_set@{hash\_set}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{hash\_set}{hash\_set}}
{\footnotesize\ttfamily template$<$typename T , typename Hash\+Int $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a91b42f72534f684c16e3ad9f6a7e5873}{KBLIB\+\_\+\+NS\+::hash\+\_\+set}} = typedef std\+::unordered\+\_\+set$<$T, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1_f_n_v__hash}{FNV\+\_\+hash}}$<$$>$, std\+::equal\+\_\+to$<$$>$ $>$}



Definition at line \mbox{\hyperlink{hash_8h_source_l00769}{769}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a12b5ffbb1ba36b917437285c8df9c4fc}\label{namespace_k_b_l_i_b___n_s_a12b5ffbb1ba36b917437285c8df9c4fc}} 
\index{KBLIB\_NS@{KBLIB\_NS}!ignore\_t@{ignore\_t}}
\index{ignore\_t@{ignore\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{ignore\_t}{ignore\_t}}
{\footnotesize\ttfamily template$<$typename U , typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a12b5ffbb1ba36b917437285c8df9c4fc}{KBLIB\+\_\+\+NS\+::ignore\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1ignore}{ignore}}$<$U, T$>$\+::type}



An alias for \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1ignore_ad823ada323dba191a1d1e9ecedf004c8}{ignore$<$\+U, T$>$\+::type}}. 



Definition at line \mbox{\hyperlink{traits_8h_source_l00169}{169}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab029267427cb2d9df9424940c35197f5}\label{namespace_k_b_l_i_b___n_s_ab029267427cb2d9df9424940c35197f5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!int\_smallest@{int\_smallest}}
\index{int\_smallest@{int\_smallest}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{int\_smallest}{int\_smallest}}
{\footnotesize\ttfamily template$<$std\+::uintmax\+\_\+t I$>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab029267427cb2d9df9424940c35197f5}{KBLIB\+\_\+\+NS\+::int\+\_\+smallest}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1first__bigger__than}{first\+\_\+bigger\+\_\+than}}$<$1 + (\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6d8b22c40c02b17c6613fecdab5e9224}{filg2}}(I) + 1) / CHAR\+\_\+\+BIT, signed char, signed short, signed int, signed long, signed long long, std\+::uintmax\+\_\+t$>$\+::type}



Definition at line \mbox{\hyperlink{simple_8h_source_l00192}{192}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9c8bd9fdb65a7d842fb948f8e14090e7}\label{namespace_k_b_l_i_b___n_s_a9c8bd9fdb65a7d842fb948f8e14090e7}} 
\index{KBLIB\_NS@{KBLIB\_NS}!int\_smallest\_t@{int\_smallest\_t}}
\index{int\_smallest\_t@{int\_smallest\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{int\_smallest\_t}{int\_smallest\_t}}
{\footnotesize\ttfamily template$<$std\+::uintmax\+\_\+t I$>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9c8bd9fdb65a7d842fb948f8e14090e7}{KBLIB\+\_\+\+NS\+::int\+\_\+smallest\+\_\+t}} = typedef typename \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab029267427cb2d9df9424940c35197f5}{int\+\_\+smallest}}$<$I$>$\+::type}



Definition at line \mbox{\hyperlink{simple_8h_source_l00201}{201}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}\label{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}} 
\index{KBLIB\_NS@{KBLIB\_NS}!iterator\_type\_for\_t@{iterator\_type\_for\_t}}
\index{iterator\_type\_for\_t@{iterator\_type\_for\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{iterator\_type\_for\_t}{iterator\_type\_for\_t}}
{\footnotesize\ttfamily template$<$typename Range $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab22e80a93b3f520181efd1cef882c241}{KBLIB\+\_\+\+NS\+::iterator\+\_\+type\+\_\+for\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1iterator__type__for}{iterator\+\_\+type\+\_\+for}}$<$Range$>$\+::type}



Definition at line \mbox{\hyperlink{traits_8h_source_l00397}{397}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aac113d3112d84af6e32d19d5a7f890c0}\label{namespace_k_b_l_i_b___n_s_aac113d3112d84af6e32d19d5a7f890c0}} 
\index{KBLIB\_NS@{KBLIB\_NS}!key\_detected\_t@{key\_detected\_t}}
\index{key\_detected\_t@{key\_detected\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{key\_detected\_t}{key\_detected\_t}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aac113d3112d84af6e32d19d5a7f890c0}{KBLIB\+\_\+\+NS\+::key\+\_\+detected\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1key__detected}{key\+\_\+detected}}$<$T$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00897}{897}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a8905d58cb8a629b4855c025d5d776d10}\label{namespace_k_b_l_i_b___n_s_a8905d58cb8a629b4855c025d5d776d10}} 
\index{KBLIB\_NS@{KBLIB\_NS}!key\_type\_setlike\_t@{key\_type\_setlike\_t}}
\index{key\_type\_setlike\_t@{key\_type\_setlike\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{key\_type\_setlike\_t}{key\_type\_setlike\_t}}
{\footnotesize\ttfamily template$<$typename Container $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8905d58cb8a629b4855c025d5d776d10}{KBLIB\+\_\+\+NS\+::key\+\_\+type\+\_\+setlike\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1key__type__setlike}{key\+\_\+type\+\_\+setlike}}$<$Container$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00952}{952}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a027411aa833d3ac81da4ba8c121a97a4}\label{namespace_k_b_l_i_b___n_s_a027411aa833d3ac81da4ba8c121a97a4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!mapped\_detected\_t@{mapped\_detected\_t}}
\index{mapped\_detected\_t@{mapped\_detected\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{mapped\_detected\_t}{mapped\_detected\_t}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a027411aa833d3ac81da4ba8c121a97a4}{KBLIB\+\_\+\+NS\+::mapped\+\_\+detected\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1mapped__detected}{mapped\+\_\+detected}}$<$T$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00910}{910}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7b2c7852f91faa3b4b8e273b38ff3414}\label{namespace_k_b_l_i_b___n_s_a7b2c7852f91faa3b4b8e273b38ff3414}} 
\index{KBLIB\_NS@{KBLIB\_NS}!member\_of\_t@{member\_of\_t}}
\index{member\_of\_t@{member\_of\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{member\_of\_t}{member\_of\_t}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a7b2c7852f91faa3b4b8e273b38ff3414}{KBLIB\+\_\+\+NS\+::member\+\_\+of\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1member__of}{member\+\_\+of}}$<$T$>$\+::type}



Definition at line \mbox{\hyperlink{traits_8h_source_l00297}{297}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a1a16fc0dc51875287e1283418bdce309}\label{namespace_k_b_l_i_b___n_s_a1a16fc0dc51875287e1283418bdce309}} 
\index{KBLIB\_NS@{KBLIB\_NS}!meta\_type\_t@{meta\_type\_t}}
\index{meta\_type\_t@{meta\_type\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{meta\_type\_t}{meta\_type\_t}}
{\footnotesize\ttfamily template$<$typename... Ts$>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1a16fc0dc51875287e1283418bdce309}{KBLIB\+\_\+\+NS\+::meta\+\_\+type\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1meta__type}{meta\+\_\+type}}$<$Ts...$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00505}{505}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac2296caf0179b2d4fa39e2cf451e0406}\label{namespace_k_b_l_i_b___n_s_ac2296caf0179b2d4fa39e2cf451e0406}} 
\index{KBLIB\_NS@{KBLIB\_NS}!metafunction\_value\_t@{metafunction\_value\_t}}
\index{metafunction\_value\_t@{metafunction\_value\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{metafunction\_value\_t}{metafunction\_value\_t}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ac2296caf0179b2d4fa39e2cf451e0406}{KBLIB\+\_\+\+NS\+::metafunction\+\_\+value\+\_\+t}} = typedef std\+::integral\+\_\+constant$<$decltype(T\+::value), T\+::value$>$}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00529}{529}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a110c552938ea9c6316853a0e993f8863}\label{namespace_k_b_l_i_b___n_s_a110c552938ea9c6316853a0e993f8863}} 
\index{KBLIB\_NS@{KBLIB\_NS}!move\_only\_traits@{move\_only\_traits}}
\index{move\_only\_traits@{move\_only\_traits}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{move\_only\_traits}{move\_only\_traits}}
{\footnotesize\ttfamily template$<$typename Obj $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a110c552938ea9c6316853a0e993f8863}{KBLIB\+\_\+\+NS\+::move\+\_\+only\+\_\+traits}} = typedef \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1poly__obj__traits}{poly\+\_\+obj\+\_\+traits}}$<$Obj, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea3734a903022249b3010be1897042568e}{construct\+\_\+type\+::move}}$>$}



Definition at line \mbox{\hyperlink{poly__obj_8h_source_l00452}{452}} of file \mbox{\hyperlink{poly__obj_8h_source}{poly\+\_\+obj.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a308d6ba5cd981f47a8f926d1afe17c5e}\label{namespace_k_b_l_i_b___n_s_a308d6ba5cd981f47a8f926d1afe17c5e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!no\_move\_traits@{no\_move\_traits}}
\index{no\_move\_traits@{no\_move\_traits}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{no\_move\_traits}{no\_move\_traits}}
{\footnotesize\ttfamily template$<$typename Obj $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a308d6ba5cd981f47a8f926d1afe17c5e}{KBLIB\+\_\+\+NS\+::no\+\_\+move\+\_\+traits}} = typedef \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1poly__obj__traits}{poly\+\_\+obj\+\_\+traits}}$<$Obj, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea334c4a4c42fdb79d7ebc3e73b517e6f8}{construct\+\_\+type\+::none}}$>$}



Definition at line \mbox{\hyperlink{poly__obj_8h_source_l00454}{454}} of file \mbox{\hyperlink{poly__obj_8h_source}{poly\+\_\+obj.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a98c871b73b590b089f642ee077b87f1e}\label{namespace_k_b_l_i_b___n_s_a98c871b73b590b089f642ee077b87f1e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!remove\_cvref\_t@{remove\_cvref\_t}}
\index{remove\_cvref\_t@{remove\_cvref\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{remove\_cvref\_t}{remove\_cvref\_t}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a98c871b73b590b089f642ee077b87f1e}{KBLIB\+\_\+\+NS\+::remove\+\_\+cvref\+\_\+t}} = typedef typename std\+::remove\+\_\+reference$<$typename std\+::remove\+\_\+cv$<$T$>$\+::type$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00060}{60}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa9ba0966f8f5a91828c50546834bf1ee}\label{namespace_k_b_l_i_b___n_s_aa9ba0966f8f5a91828c50546834bf1ee}} 
\index{KBLIB\_NS@{KBLIB\_NS}!remove\_reference\_t@{remove\_reference\_t}}
\index{remove\_reference\_t@{remove\_reference\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{remove\_reference\_t}{remove\_reference\_t}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa9ba0966f8f5a91828c50546834bf1ee}{KBLIB\+\_\+\+NS\+::remove\+\_\+reference\+\_\+t}} = typedef typename std\+::remove\+\_\+reference$<$T$>$\+::type}



Abbreviated name for std\+::remove\+\_\+reference$<$\+T$>$\+::type for C++14. 



Definition at line \mbox{\hyperlink{traits_8h_source_l00438}{438}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}\label{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}} 
\index{KBLIB\_NS@{KBLIB\_NS}!return\_assert\_t@{return\_assert\_t}}
\index{return\_assert\_t@{return\_assert\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{return\_assert\_t}{return\_assert\_t}}
{\footnotesize\ttfamily template$<$bool V, typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}{KBLIB\+\_\+\+NS\+::return\+\_\+assert\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1return__assert}{return\+\_\+assert}}$<$V, T$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00543}{543}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a91a41b470a640f9d17fee50cfdd2fadb}\label{namespace_k_b_l_i_b___n_s_a91a41b470a640f9d17fee50cfdd2fadb}} 
\index{KBLIB\_NS@{KBLIB\_NS}!safe\_signed\_t@{safe\_signed\_t}}
\index{safe\_signed\_t@{safe\_signed\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{safe\_signed\_t}{safe\_signed\_t}}
{\footnotesize\ttfamily template$<$typename N $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a91a41b470a640f9d17fee50cfdd2fadb}{KBLIB\+\_\+\+NS\+::safe\+\_\+signed\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1safe__signed}{safe\+\_\+signed}}$<$N$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00847}{847}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa726cc2b355d8730e22e4e299ba3517b}\label{namespace_k_b_l_i_b___n_s_aa726cc2b355d8730e22e4e299ba3517b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!uint\_smallest@{uint\_smallest}}
\index{uint\_smallest@{uint\_smallest}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{uint\_smallest}{uint\_smallest}}
{\footnotesize\ttfamily template$<$std\+::uintmax\+\_\+t I$>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa726cc2b355d8730e22e4e299ba3517b}{KBLIB\+\_\+\+NS\+::uint\+\_\+smallest}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1first__bigger__than}{first\+\_\+bigger\+\_\+than}}$<$1 + \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6d8b22c40c02b17c6613fecdab5e9224}{filg2}}(I) / CHAR\+\_\+\+BIT, unsigned char, unsigned short, unsigned int, unsigned long, unsigned long long, std\+::uintmax\+\_\+t$>$\+::type}



Definition at line \mbox{\hyperlink{simple_8h_source_l00186}{186}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a8077c993a23167a9bb59fa731fcb8b9e}\label{namespace_k_b_l_i_b___n_s_a8077c993a23167a9bb59fa731fcb8b9e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!uint\_smallest\_t@{uint\_smallest\_t}}
\index{uint\_smallest\_t@{uint\_smallest\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{uint\_smallest\_t}{uint\_smallest\_t}}
{\footnotesize\ttfamily template$<$std\+::uintmax\+\_\+t I$>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8077c993a23167a9bb59fa731fcb8b9e}{KBLIB\+\_\+\+NS\+::uint\+\_\+smallest\+\_\+t}} = typedef typename \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa726cc2b355d8730e22e4e299ba3517b}{uint\+\_\+smallest}}$<$I$>$\+::type}



Definition at line \mbox{\hyperlink{simple_8h_source_l00198}{198}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a50c93c7b2ebacfc3a249f7a3734e703f}\label{namespace_k_b_l_i_b___n_s_a50c93c7b2ebacfc3a249f7a3734e703f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!value\_detected\_t@{value\_detected\_t}}
\index{value\_detected\_t@{value\_detected\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{value\_detected\_t}{value\_detected\_t}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a50c93c7b2ebacfc3a249f7a3734e703f}{KBLIB\+\_\+\+NS\+::value\+\_\+detected\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1value__detected}{value\+\_\+detected}}$<$T$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00884}{884}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aea5c475c5fb0f416b30f5825af77348b}\label{namespace_k_b_l_i_b___n_s_aea5c475c5fb0f416b30f5825af77348b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!value\_type\_linear\_t@{value\_type\_linear\_t}}
\index{value\_type\_linear\_t@{value\_type\_linear\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{value\_type\_linear\_t}{value\_type\_linear\_t}}
{\footnotesize\ttfamily template$<$typename Container $>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aea5c475c5fb0f416b30f5825af77348b}{KBLIB\+\_\+\+NS\+::value\+\_\+type\+\_\+linear\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1value__type__linear}{value\+\_\+type\+\_\+linear}}$<$Container$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00934}{934}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a0091fb16bc1767a3e5e1cff5aa8dff53}\label{namespace_k_b_l_i_b___n_s_a0091fb16bc1767a3e5e1cff5aa8dff53}} 
\index{KBLIB\_NS@{KBLIB\_NS}!void\_if\_t@{void\_if\_t}}
\index{void\_if\_t@{void\_if\_t}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{void\_if\_t}{void\_if\_t}}
{\footnotesize\ttfamily template$<$bool b$>$ \\
using \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a0091fb16bc1767a3e5e1cff5aa8dff53}{KBLIB\+\_\+\+NS\+::void\+\_\+if\+\_\+t}} = typedef typename \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1void__if}{void\+\_\+if}}$<$b$>$\+::type}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00513}{513}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.



\doxysubsection{Enumeration Type Documentation}
\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}\label{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!construct\_type@{construct\_type}}
\index{construct\_type@{construct\_type}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{construct\_type}{construct\_type}}
{\footnotesize\ttfamily enum class \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{KBLIB\+\_\+\+NS\+::construct\+\_\+type}} \+: unsigned\hspace{0.3cm}{\ttfamily [strong]}}

\begin{DoxyEnumFields}{Enumerator}
\raisebox{\heightof{T}}[0pt][0pt]{\index{none@{none}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!none@{none}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea334c4a4c42fdb79d7ebc3e73b517e6f8}\label{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea334c4a4c42fdb79d7ebc3e73b517e6f8}} 
none&\\
\hline

\raisebox{\heightof{T}}[0pt][0pt]{\index{copy\_only@{copy\_only}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!copy\_only@{copy\_only}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea849f12a705c6dbc3ff5da992d47a9982}\label{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea849f12a705c6dbc3ff5da992d47a9982}} 
copy\+\_\+only&\\
\hline

\raisebox{\heightof{T}}[0pt][0pt]{\index{move@{move}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!move@{move}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea3734a903022249b3010be1897042568e}\label{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea3734a903022249b3010be1897042568e}} 
move&\\
\hline

\raisebox{\heightof{T}}[0pt][0pt]{\index{both@{both}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!both@{both}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8eaf6cb3e816496528d4187db53bc66567f}\label{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8eaf6cb3e816496528d4187db53bc66567f}} 
both&\\
\hline

\raisebox{\heightof{T}}[0pt][0pt]{\index{throw\_move@{throw\_move}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!throw\_move@{throw\_move}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea04d3c750404e3d492d5d7d920189aa52}\label{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8ea04d3c750404e3d492d5d7d920189aa52}} 
throw\+\_\+move&\\
\hline

\raisebox{\heightof{T}}[0pt][0pt]{\index{both\_throw@{both\_throw}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!both\_throw@{both\_throw}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8eab009e0a1fa84b4e6e58f4ea7acba9712}\label{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8eab009e0a1fa84b4e6e58f4ea7acba9712}} 
both\+\_\+throw&\\
\hline

\end{DoxyEnumFields}


Definition at line \mbox{\hyperlink{poly__obj_8h_source_l00040}{40}} of file \mbox{\hyperlink{poly__obj_8h_source}{poly\+\_\+obj.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1}\label{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1}} 
\index{KBLIB\_NS@{KBLIB\_NS}!endian@{endian}}
\index{endian@{endian}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{endian}{endian}}
{\footnotesize\ttfamily enum class \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1}{KBLIB\+\_\+\+NS\+::endian}}\hspace{0.3cm}{\ttfamily [strong]}}

\begin{DoxyEnumFields}{Enumerator}
\raisebox{\heightof{T}}[0pt][0pt]{\index{unknown@{unknown}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!unknown@{unknown}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1aad921d60486366258809553a3db49a4a}\label{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1aad921d60486366258809553a3db49a4a}} 
unknown&\\
\hline

\raisebox{\heightof{T}}[0pt][0pt]{\index{little@{little}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!little@{little}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1aaae6635e044ac56046b2893a529b5114}\label{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1aaae6635e044ac56046b2893a529b5114}} 
little&\\
\hline

\raisebox{\heightof{T}}[0pt][0pt]{\index{big@{big}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!big@{big}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1ad861877da56b8b4ceb35c8cbfdf65bb4}\label{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1ad861877da56b8b4ceb35c8cbfdf65bb4}} 
big&\\
\hline

\raisebox{\heightof{T}}[0pt][0pt]{\index{weird@{weird}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!weird@{weird}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1a498c381ba18fc1be2160719e3e0a7c45}\label{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1a498c381ba18fc1be2160719e3e0a7c45}} 
weird&\\
\hline

\end{DoxyEnumFields}


Definition at line \mbox{\hyperlink{tdecl_8h_source_l00194}{194}} of file \mbox{\hyperlink{tdecl_8h_source}{tdecl.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715e}\label{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!extractor\_policy@{extractor\_policy}}
\index{extractor\_policy@{extractor\_policy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{extractor\_policy}{extractor\_policy}}
{\footnotesize\ttfamily enum class \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715e}{KBLIB\+\_\+\+NS\+::extractor\+\_\+policy}}\hspace{0.3cm}{\ttfamily [strong]}}

\begin{DoxyEnumFields}{Enumerator}
\raisebox{\heightof{T}}[0pt][0pt]{\index{forward\_iteration@{forward\_iteration}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!forward\_iteration@{forward\_iteration}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715ea982690af3684bc526ae7a353bc6ef61e}\label{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715ea982690af3684bc526ae7a353bc6ef61e}} 
forward\+\_\+iteration&\\
\hline

\raisebox{\heightof{T}}[0pt][0pt]{\index{random\_access@{random\_access}!KBLIB\_NS@{KBLIB\_NS}}\index{KBLIB\_NS@{KBLIB\_NS}!random\_access@{random\_access}}}\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715ea298bbb8f070170fc998ccac67856211b}\label{namespace_k_b_l_i_b___n_s_aa1796afbf90d00f352e8d7f38f2b715ea298bbb8f070170fc998ccac67856211b}} 
random\+\_\+access&\\
\hline

\end{DoxyEnumFields}


Definition at line \mbox{\hyperlink{trie_8h_source_l00047}{47}} of file \mbox{\hyperlink{trie_8h_source}{trie.\+h}}.



\doxysubsection{Function Documentation}
\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a228a6004801f23e3746cd67df6bcbeb6}\label{namespace_k_b_l_i_b___n_s_a228a6004801f23e3746cd67df6bcbeb6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!a@{a}}
\index{a@{a}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{a()}{a()}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::a (\begin{DoxyParamCaption}\item[{const std\+::initializer\+\_\+list$<$ T $>$ \&}]{a }\end{DoxyParamCaption}) -\/$>$ auto \hspace{0.3cm}{\ttfamily [constexpr]}}



Index an array literal without naming its type. 

\begin{DoxyAttention}{Attention}
The return value must not be stored unless the argument is also stored. This is indexable because temporaries live until the end of their full-\/expression, rather than sub-\/expression
\end{DoxyAttention}

\begin{DoxyParams}{Parameters}
{\em a} & The array literal to index into. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{simple_8h_source_l00255}{255}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a8fa705a689ce27f32b438c80bf1682e4}\label{namespace_k_b_l_i_b___n_s_a8fa705a689ce27f32b438c80bf1682e4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!accumulate@{accumulate}}
\index{accumulate@{accumulate}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{accumulate()}{accumulate()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::accumulate (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{T}]{init }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}}



A constexpr version of std\+::accumulate. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00162}{162}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a806f9e3164b3d004bb1300a3951720b0}\label{namespace_k_b_l_i_b___n_s_a806f9e3164b3d004bb1300a3951720b0}} 
\index{KBLIB\_NS@{KBLIB\_NS}!accumulate@{accumulate}}
\index{accumulate@{accumulate}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{accumulate()}{accumulate()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$class Input\+It , class T , class Binary\+Operation $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::accumulate (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{T}]{init,  }\item[{Binary\+Operation}]{op }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}}



A constexpr version of std\+::accumulate. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00174}{174}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7d9e472664bb54c7492246525b3d9046}\label{namespace_k_b_l_i_b___n_s_a7d9e472664bb54c7492246525b3d9046}} 
\index{KBLIB\_NS@{KBLIB\_NS}!adaptive\_insertion\_sort\_copy@{adaptive\_insertion\_sort\_copy}}
\index{adaptive\_insertion\_sort\_copy@{adaptive\_insertion\_sort\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{adaptive\_insertion\_sort\_copy()}{adaptive\_insertion\_sort\_copy()}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It , typename Random\+Access\+It2 , typename Compare  = std\+::less$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::adaptive\+\_\+insertion\+\_\+sort\+\_\+copy (\begin{DoxyParamCaption}\item[{const Random\+Access\+It}]{begin,  }\item[{const Random\+Access\+It}]{end,  }\item[{const Random\+Access\+It2}]{d\+\_\+begin,  }\item[{const Random\+Access\+It2}]{d\+\_\+end,  }\item[{Compare \&\&}]{compare = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



An adaptive sort which, at the cost of some additional work (time complexity Θ(sqrt(n))), avoids quadratic behavior for reverse-\/sorted inputs (and, in fact, handles them in optimal time). It\textquotesingle{}s still possible to fool it, but it requires a staggered input, which is a highly unlikely shape for random data. 

\begin{DoxyRemark}{Remarks}
Complexity\+: 

Average case O(n$^\wedge$2) 

Best-\/case Θ(n + sqrt(n)) (for sorted input) 

worst-\/case O(n$^\wedge$2) (for reverse-\/sorted input)
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em begin,end} & The input range \\
\hline
{\em d\+\_\+begin,d\+\_\+end} & The output range \\
\hline
{\em compare} & The comparison predicate \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{sort_8h_source_l00178}{178}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a149cd5eab1761c864eb12fae95a20ce9}\label{namespace_k_b_l_i_b___n_s_a149cd5eab1761c864eb12fae95a20ce9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!all\_of@{all\_of}}
\index{all\_of@{all\_of}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{all\_of()}{all\_of()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::all\+\_\+of (\begin{DoxyParamCaption}\item[{Input\+It}]{begin,  }\item[{Input\+It}]{end,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It$>$\+::value, bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Determine if pred is true for every element of the range. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00970}{970}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a18f8fa4996e526b73efe4804679eff98}\label{namespace_k_b_l_i_b___n_s_a18f8fa4996e526b73efe4804679eff98}} 
\index{KBLIB\_NS@{KBLIB\_NS}!all\_of@{all\_of}}
\index{all\_of@{all\_of}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{all\_of()}{all\_of()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Range , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::all\+\_\+of (\begin{DoxyParamCaption}\item[{Range \&\&}]{rng,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$Range$>$\+::value, bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Determine if pred is true for every element of the range. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00984}{984}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab0a01c9347f7340bb6764cbc6e5900d6}\label{namespace_k_b_l_i_b___n_s_ab0a01c9347f7340bb6764cbc6e5900d6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!any\_of@{any\_of}}
\index{any\_of@{any\_of}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{any\_of()}{any\_of()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::any\+\_\+of (\begin{DoxyParamCaption}\item[{Input\+It}]{begin,  }\item[{Input\+It}]{end,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It$>$\+::value, bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Determine if pred is true for at least one element of the range. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01024}{1024}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a88cbbd105c4fb60ec348931328f14fde}\label{namespace_k_b_l_i_b___n_s_a88cbbd105c4fb60ec348931328f14fde}} 
\index{KBLIB\_NS@{KBLIB\_NS}!any\_of@{any\_of}}
\index{any\_of@{any\_of}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{any\_of()}{any\_of()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Range , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::any\+\_\+of (\begin{DoxyParamCaption}\item[{Range \&\&}]{rng,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$Range$>$\+::value, bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Determine if pred is true for every element of the range. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01038}{1038}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6ccc6538ad29e35063e1eb7ecfae58c4}\label{namespace_k_b_l_i_b___n_s_a6ccc6538ad29e35063e1eb7ecfae58c4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!append@{append}}
\index{append@{append}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{append()}{append()}}
{\footnotesize\ttfamily template$<$typename string , typename F , typename... S$>$ \\
auto KBLIB\+\_\+\+NS\+::append (\begin{DoxyParamCaption}\item[{string \&\&}]{out,  }\item[{F \&\&}]{f,  }\item[{S \&\&...}]{tail }\end{DoxyParamCaption}) -\/$>$ void }



Given an object out of resizable stringlike type string, appends all other arguments to it. 

Stringlike types and characters are simply appended, while arithmetic types are first converted to strings using std\+::to\+\_\+string.


\begin{DoxyParams}{Parameters}
{\em out} & The string to append to. \\
\hline
{\em f} & The first value to append to out. \\
\hline
{\em tail} & Any number of subsequent values to append to out. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00251}{251}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa3de5af57edb5703269d1685c9ce723f}\label{namespace_k_b_l_i_b___n_s_aa3de5af57edb5703269d1685c9ce723f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!apply@{apply}}
\index{apply@{apply}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{apply()}{apply()}}
{\footnotesize\ttfamily template$<$typename F , typename Arg $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::apply (\begin{DoxyParamCaption}\item[{F \&\&}]{f,  }\item[{Arg \&\&}]{arg }\end{DoxyParamCaption}) -\/$>$ decltype(auto) \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00562}{562}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a28652b426f35cf1445da9fbca3f7e629}\label{namespace_k_b_l_i_b___n_s_a28652b426f35cf1445da9fbca3f7e629}} 
\index{KBLIB\_NS@{KBLIB\_NS}!arraycat@{arraycat}}
\index{arraycat@{arraycat}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{arraycat()}{arraycat()}}
{\footnotesize\ttfamily template$<$typename Left\+Container , typename Right\+Container $>$ \\
auto KBLIB\+\_\+\+NS\+::arraycat (\begin{DoxyParamCaption}\item[{Left\+Container}]{A,  }\item[{Right\+Container \&\&}]{B }\end{DoxyParamCaption}) -\/$>$ Left\+Container \hspace{0.3cm}{\ttfamily [noexcept]}}



Concatenate two dynamic containers together. 


\begin{DoxyParams}{Parameters}
{\em A,B} & The containers to concatenate together. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container A container consisting of the elements of A and B in that order. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{simple_8h_source_l00237}{237}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a619e6e0af476e47808647b3a1e2c249e}\label{namespace_k_b_l_i_b___n_s_a619e6e0af476e47808647b3a1e2c249e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build@{build}}
\index{build@{build}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build()}{build()}\hspace{0.1cm}{\footnotesize\ttfamily [1/6]}}
{\footnotesize\ttfamily template$<$typename Container , typename Functor $>$ \\
auto KBLIB\+\_\+\+NS\+::build (\begin{DoxyParamCaption}\item[{Functor}]{f,  }\item[{size\+\_\+t}]{size,  }\item[{typename Container\+::allocator\+\_\+type}]{allocator = {\ttfamily typename~Container\+:\+:allocator\+\_\+type\{\}} }\end{DoxyParamCaption}) -\/$>$ Container }



Constructs a container with elements initialized by repeatedly calling a generating function. 


\begin{DoxyTemplParams}{Template Parameters}
{\em Container} & The type of container to return. Must be an Allocator\+Aware Sequence\+Container. \\
\hline
\end{DoxyTemplParams}

\begin{DoxyParams}{Parameters}
{\em f} & The functor to repeatedly invoke. \\
\hline
{\em size} & The number of times to invoke {\ttfamily f}. \\
\hline
{\em allocator} & The allocator to use for the returned container. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
A Container where each element is the result of invoking {\ttfamily f} in sequence. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00168}{168}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3be00284a2be9099527297be55ef38b6}\label{namespace_k_b_l_i_b___n_s_a3be00284a2be9099527297be55ef38b6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build@{build}}
\index{build@{build}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build()}{build()}\hspace{0.1cm}{\footnotesize\ttfamily [2/6]}}
{\footnotesize\ttfamily template$<$typename Array , typename Functor , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Array $>$, int $>$  = 0$>$ \\
auto KBLIB\+\_\+\+NS\+::build (\begin{DoxyParamCaption}\item[{Functor}]{f,  }\item[{size\+\_\+t}]{size = {\ttfamily std\+:\+:tuple\+\_\+size$<$Array$>$\+:\+:value} }\end{DoxyParamCaption}) -\/$>$ Array }



Constructs an array-\/like container with elements initialized by repeatedly calling a generating function. 

\begin{DoxyRemark}{Remarks}
Because Array is non-\/resizable, the entire Array will be default-\/constructed and then the elements assigned to, rather than copy-\/constructed.
\end{DoxyRemark}

\begin{DoxyTemplParams}{Template Parameters}
{\em Array} & The type of container to return. Must be a non-\/resizable Container similar to std\+::array. \\
\hline
\end{DoxyTemplParams}

\begin{DoxyParams}{Parameters}
{\em f} & The functor to repeatedly invoke. \\
\hline
{\em size} & The number of times to invoke {\ttfamily f}. Defaults to the size of the Container, which is usually correct. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
An Array where each element is the result of invoking {\ttfamily f} in sequence. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00195}{195}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9b853354dedfe1e1635a39f25cea7d9c}\label{namespace_k_b_l_i_b___n_s_a9b853354dedfe1e1635a39f25cea7d9c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build@{build}}
\index{build@{build}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build()}{build()}\hspace{0.1cm}{\footnotesize\ttfamily [3/6]}}
{\footnotesize\ttfamily template$<$typename Array , typename Input\+It , typename Input\+It2 , typename Binary\+Function , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Array $>$, int $>$  = 0$>$ \\
auto KBLIB\+\_\+\+NS\+::build (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{Input\+It2}]{first2,  }\item[{Binary\+Function}]{f }\end{DoxyParamCaption}) -\/$>$ Array }



Constructs an array-\/like container by applying a Binary\+Function to every pair of elements in the input ranges. 

\begin{DoxyPrecond}{Precondition}
The size of the second input range must be equal to or less than the size of the first. 
\end{DoxyPrecond}
\begin{DoxyRemark}{Remarks}
Because Array is non-\/resizable, the entire Array will be default-\/constructed and then the elements assigned to, rather than copy-\/constructed.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & Beginning of input range. \\
\hline
{\em last} & End of input range. \\
\hline
{\em first2} & Beginning of second input range \\
\hline
{\em f} & A Binary\+Function to apply to the elements of the two input ranges. \\
\hline
\end{DoxyParams}

\begin{DoxyTemplParams}{Template Parameters}
{\em Array} & The type of container to return. Must be a non-\/resizable Container similar to std\+::array. \\
\hline
\end{DoxyTemplParams}
\begin{DoxyReturn}{Returns}
An Array where each element is generated from a corresponding pair of elements in the input ranges. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00148}{148}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3bf1d079411a3ce6d087913af6df265c}\label{namespace_k_b_l_i_b___n_s_a3bf1d079411a3ce6d087913af6df265c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build@{build}}
\index{build@{build}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build()}{build()}\hspace{0.1cm}{\footnotesize\ttfamily [4/6]}}
{\footnotesize\ttfamily template$<$typename Container , typename Input\+It , typename Input\+It2 , typename Binary\+Function $>$ \\
auto KBLIB\+\_\+\+NS\+::build (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{Input\+It2}]{first2,  }\item[{Binary\+Function}]{f,  }\item[{typename Container\+::allocator\+\_\+type}]{allocator = {\ttfamily typename~Container\+:\+:allocator\+\_\+type\{\}} }\end{DoxyParamCaption}) -\/$>$ Container }



Constructs a container by applying a Binary\+Function to every pair of elements in the input ranges. 

\begin{DoxyPrecond}{Precondition}
The size of the second input range must be equal to or less than the size of the first.
\end{DoxyPrecond}

\begin{DoxyParams}{Parameters}
{\em first} & Beginning of input range. \\
\hline
{\em last} & End of input range. \\
\hline
{\em first2} & Beginning of second input range \\
\hline
{\em f} & A Binary\+Function to apply to the elements of the two input ranges. \\
\hline
\end{DoxyParams}

\begin{DoxyTemplParams}{Template Parameters}
{\em Container} & The type of container to return. Must be an Allocator\+Aware Sequence\+Container. \\
\hline
\end{DoxyTemplParams}

\begin{DoxyParams}{Parameters}
{\em allocator} & The allocator to use for the returned container. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
A Container where each element is generated from a corresponding pair of elements in the input ranges. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00092}{92}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a498d41b3457871cd8fe125facf1dbf3d}\label{namespace_k_b_l_i_b___n_s_a498d41b3457871cd8fe125facf1dbf3d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build@{build}}
\index{build@{build}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build()}{build()}\hspace{0.1cm}{\footnotesize\ttfamily [5/6]}}
{\footnotesize\ttfamily template$<$typename Array , typename Input\+It , typename Unary\+Function , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Array $>$, int $>$  = 0$>$ \\
auto KBLIB\+\_\+\+NS\+::build (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{Unary\+Function}]{f }\end{DoxyParamCaption}) -\/$>$ Array }



Constructs an array-\/like container by applying a Unary\+Function to every element of an input range. 

\begin{DoxyPrecond}{Precondition}
The size of the input range must be equal to or less than the size of Container. 
\end{DoxyPrecond}
\begin{DoxyRemark}{Remarks}
Because Array is non-\/resizable, the entire Array will be default-\/constructed and then the elements assigned to, rather than copy-\/constructed.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & Beginning of input range. \\
\hline
{\em last} & End of input range. \\
\hline
{\em f} & A Unary\+Function to apply to each element of the input range. \\
\hline
\end{DoxyParams}

\begin{DoxyTemplParams}{Template Parameters}
{\em Array} & The type of container to return. Must be a non-\/resizable Container similar to std\+::array. \\
\hline
\end{DoxyTemplParams}
\begin{DoxyReturn}{Returns}
An Array where each element is a transformed element of the input range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00121}{121}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9e9b509402d267bd4e15457afa90adf6}\label{namespace_k_b_l_i_b___n_s_a9e9b509402d267bd4e15457afa90adf6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build@{build}}
\index{build@{build}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build()}{build()}\hspace{0.1cm}{\footnotesize\ttfamily [6/6]}}
{\footnotesize\ttfamily template$<$typename Container , typename Input\+It , typename Unary\+Function $>$ \\
auto KBLIB\+\_\+\+NS\+::build (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{Unary\+Function}]{f,  }\item[{typename Container\+::allocator\+\_\+type}]{allocator = {\ttfamily typename~Container\+:\+:allocator\+\_\+type\{\}} }\end{DoxyParamCaption}) -\/$>$ Container }



Constructs a container by applying a Unary\+Function to every element of an input range. 


\begin{DoxyParams}{Parameters}
{\em first} & Beginning of input range. \\
\hline
{\em last} & End of input range. \\
\hline
{\em f} & A Unary\+Function to apply to each element of the input range. \\
\hline
\end{DoxyParams}

\begin{DoxyTemplParams}{Template Parameters}
{\em Container} & The type of container to return. Must be an Allocator\+Aware Sequence\+Container. \\
\hline
\end{DoxyTemplParams}

\begin{DoxyParams}{Parameters}
{\em allocator} & The allocator to use for the returned container. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
A Container where each element is a transformed element of the input range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00066}{66}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a58f54ca57daf5262f55c4a0e36c0f6e3}\label{namespace_k_b_l_i_b___n_s_a58f54ca57daf5262f55c4a0e36c0f6e3}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_copy@{build\_copy}}
\index{build\_copy@{build\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_copy()}{build\_copy()}\hspace{0.1cm}{\footnotesize\ttfamily [1/7]}}
{\footnotesize\ttfamily template$<$typename Container , typename Input\+It , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::build\+\_\+copy (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last }\end{DoxyParamCaption}) -\/$>$ Container \hspace{0.3cm}{\ttfamily [constexpr]}}


\begin{DoxyParams}{Parameters}
{\em first} & \\
\hline
{\em last} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00491}{491}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad64907ca0131820d186891a11038f985}\label{namespace_k_b_l_i_b___n_s_ad64907ca0131820d186891a11038f985}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_copy@{build\_copy}}
\index{build\_copy@{build\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_copy()}{build\_copy()}\hspace{0.1cm}{\footnotesize\ttfamily [2/7]}}
{\footnotesize\ttfamily template$<$typename Container , typename Input\+It , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+copy (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{std\+::size\+\_\+t}]{size }\end{DoxyParamCaption}) -\/$>$ Container }


\begin{DoxyParams}{Parameters}
{\em first} & \\
\hline
{\em last} & \\
\hline
{\em size} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00532}{532}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae51d75ec2dc90a6c693d4405dd79f018}\label{namespace_k_b_l_i_b___n_s_ae51d75ec2dc90a6c693d4405dd79f018}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_copy@{build\_copy}}
\index{build\_copy@{build\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_copy()}{build\_copy()}\hspace{0.1cm}{\footnotesize\ttfamily [3/7]}}
{\footnotesize\ttfamily template$<$typename Container , typename Input\+It $>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+copy (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{typename Container\+::allocator\+\_\+type}]{allocator = {\ttfamily typename~Container\+:\+:allocator\+\_\+type\{\}} }\end{DoxyParamCaption}) -\/$>$ Container }


\begin{DoxyParams}{Parameters}
{\em first} & \\
\hline
{\em last} & \\
\hline
{\em allocator} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00439}{439}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab487dbac3c31dbe0553edfb81e689c8f}\label{namespace_k_b_l_i_b___n_s_ab487dbac3c31dbe0553edfb81e689c8f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_copy@{build\_copy}}
\index{build\_copy@{build\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_copy()}{build\_copy()}\hspace{0.1cm}{\footnotesize\ttfamily [4/7]}}
{\footnotesize\ttfamily template$<$typename Container , typename Range , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+copy (\begin{DoxyParamCaption}\item[{Range \&\&}]{r }\end{DoxyParamCaption}) -\/$>$ Container }


\begin{DoxyParams}{Parameters}
{\em r} & \\
\hline
{\em allocator} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00457}{457}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ace040c630f62919bff8eace542d663d8}\label{namespace_k_b_l_i_b___n_s_ace040c630f62919bff8eace542d663d8}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_copy@{build\_copy}}
\index{build\_copy@{build\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_copy()}{build\_copy()}\hspace{0.1cm}{\footnotesize\ttfamily [5/7]}}
{\footnotesize\ttfamily template$<$typename Container , typename Range , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::build\+\_\+copy (\begin{DoxyParamCaption}\item[{Range \&\&}]{r }\end{DoxyParamCaption}) -\/$>$ Container \hspace{0.3cm}{\ttfamily [constexpr]}}


\begin{DoxyParams}{Parameters}
{\em r} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00510}{510}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a2eb3a98b275315ea0f26ba0163a718a1}\label{namespace_k_b_l_i_b___n_s_a2eb3a98b275315ea0f26ba0163a718a1}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_copy@{build\_copy}}
\index{build\_copy@{build\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_copy()}{build\_copy()}\hspace{0.1cm}{\footnotesize\ttfamily [6/7]}}
{\footnotesize\ttfamily template$<$typename Container , typename Range , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+copy (\begin{DoxyParamCaption}\item[{Range \&\&}]{r,  }\item[{std\+::size\+\_\+t}]{size }\end{DoxyParamCaption}) -\/$>$ Container }


\begin{DoxyParams}{Parameters}
{\em r} & \\
\hline
{\em size} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00553}{553}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a878b4f9c69954df818a60f7cab057d6c}\label{namespace_k_b_l_i_b___n_s_a878b4f9c69954df818a60f7cab057d6c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_copy@{build\_copy}}
\index{build\_copy@{build\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_copy()}{build\_copy()}\hspace{0.1cm}{\footnotesize\ttfamily [7/7]}}
{\footnotesize\ttfamily template$<$typename Container , typename Range $>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+copy (\begin{DoxyParamCaption}\item[{Range \&\&}]{r,  }\item[{typename Container\+::allocator\+\_\+type}]{allocator = {\ttfamily typename~Container\+:\+:allocator\+\_\+type\{\}} }\end{DoxyParamCaption}) -\/$>$ Container }


\begin{DoxyParams}{Parameters}
{\em r} & \\
\hline
{\em allocator} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00473}{473}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad4beb3c0548fe89150e6bd3301b16e4e}\label{namespace_k_b_l_i_b___n_s_ad4beb3c0548fe89150e6bd3301b16e4e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_copy\_if@{build\_copy\_if}}
\index{build\_copy\_if@{build\_copy\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_copy\_if()}{build\_copy\_if()}}
{\footnotesize\ttfamily template$<$typename Container , typename Input\+It , typename Predicate $>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+copy\+\_\+if (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{Predicate}]{f,  }\item[{typename Container\+::allocator\+\_\+type}]{allocator = {\ttfamily typename~Container\+:\+:allocator\+\_\+type\{\}} }\end{DoxyParamCaption}) -\/$>$ Container }


\begin{DoxyParams}{Parameters}
{\em first} & \\
\hline
{\em last} & \\
\hline
{\em f} & \\
\hline
{\em allocator} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00576}{576}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a1220fd7f4afaa179253ad2d8cf5bf8b8}\label{namespace_k_b_l_i_b___n_s_a1220fd7f4afaa179253ad2d8cf5bf8b8}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_copy\_n@{build\_copy\_n}}
\index{build\_copy\_n@{build\_copy\_n}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_copy\_n()}{build\_copy\_n()}}
{\footnotesize\ttfamily template$<$typename Container , typename Input\+It , typename Size $>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+copy\+\_\+n (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Size}]{count,  }\item[{typename Container\+::allocator\+\_\+type}]{allocator = {\ttfamily typename~Container\+:\+:allocator\+\_\+type\{\}} }\end{DoxyParamCaption}) -\/$>$ Container }


\begin{DoxyParams}{Parameters}
{\em first} & \\
\hline
{\em count} & \\
\hline
{\em allocator} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00594}{594}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a93a76da83cdca6ba43ec7c734ff1e936}\label{namespace_k_b_l_i_b___n_s_a93a76da83cdca6ba43ec7c734ff1e936}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_copy\_n\_if@{build\_copy\_n\_if}}
\index{build\_copy\_n\_if@{build\_copy\_n\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_copy\_n\_if()}{build\_copy\_n\_if()}}
{\footnotesize\ttfamily template$<$typename Container , typename Input\+It , typename Size , typename Predicate $>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+copy\+\_\+n\+\_\+if (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Size}]{count,  }\item[{Predicate}]{f,  }\item[{typename Container\+::allocator\+\_\+type}]{allocator = {\ttfamily typename~Container\+:\+:allocator\+\_\+type\{\}} }\end{DoxyParamCaption}) -\/$>$ Container }


\begin{DoxyParams}{Parameters}
{\em first} & \\
\hline
{\em count} & \\
\hline
{\em f} & \\
\hline
{\em allocator} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00614}{614}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6b9f0c5e489c3fc4efd4837bb77ebd0c}\label{namespace_k_b_l_i_b___n_s_a6b9f0c5e489c3fc4efd4837bb77ebd0c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_dy@{build\_dy}}
\index{build\_dy@{build\_dy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_dy()}{build\_dy()}\hspace{0.1cm}{\footnotesize\ttfamily [1/4]}}
{\footnotesize\ttfamily template$<$typename Container , typename Functor $>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+dy (\begin{DoxyParamCaption}\item[{Functor}]{f,  }\item[{size\+\_\+t}]{size }\end{DoxyParamCaption}) -\/$>$ Container }



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). 


\begin{DoxyParams}{Parameters}
{\em f} & The functor to repeatedly invoke. \\
\hline
{\em size} & The number of times to invoke {\ttfamily f}. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
A Container where each element is the result of invoking {\ttfamily f} in sequence. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00260}{260}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a42182f108ce703f570a5830c4b2c885b}\label{namespace_k_b_l_i_b___n_s_a42182f108ce703f570a5830c4b2c885b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_dy@{build\_dy}}
\index{build\_dy@{build\_dy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_dy()}{build\_dy()}\hspace{0.1cm}{\footnotesize\ttfamily [2/4]}}
{\footnotesize\ttfamily template$<$typename Container , typename Input\+It , typename Input\+It2 , typename Binary\+Function $>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+dy (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{Input\+It2}]{first2,  }\item[{Binary\+Function}]{f }\end{DoxyParamCaption}) -\/$>$ Container }



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). 

\begin{DoxyPrecond}{Precondition}
The size of the second input range must be equal to or less than the size of the first.
\end{DoxyPrecond}

\begin{DoxyParams}{Parameters}
{\em first} & Beginning of input range. \\
\hline
{\em last} & End of input range. \\
\hline
{\em first2} & Beginning of second input range \\
\hline
{\em f} & A Binary\+Function to apply to the elements of the two input ranges. \\
\hline
\end{DoxyParams}

\begin{DoxyTemplParams}{Template Parameters}
{\em Container} & The type of container to return. Must be a resizable Sequence\+Container. \\
\hline
\end{DoxyTemplParams}
\begin{DoxyReturn}{Returns}
A Container where each element is generated from a corresponding pair of elements in the input ranges. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00242}{242}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aecc2a3777f0d4cfd3d4a43ec60bac1a5}\label{namespace_k_b_l_i_b___n_s_aecc2a3777f0d4cfd3d4a43ec60bac1a5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_dy@{build\_dy}}
\index{build\_dy@{build\_dy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_dy()}{build\_dy()}\hspace{0.1cm}{\footnotesize\ttfamily [3/4]}}
{\footnotesize\ttfamily template$<$typename Container , typename Input\+It , typename Unary\+Function $>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+dy (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{Unary\+Function}]{f }\end{DoxyParamCaption}) -\/$>$ Container }



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). 


\begin{DoxyParams}{Parameters}
{\em first} & Beginning of input range. \\
\hline
{\em last} & End of input range. \\
\hline
{\em f} & A Unary\+Function to apply to each element of the input range. \\
\hline
\end{DoxyParams}

\begin{DoxyTemplParams}{Template Parameters}
{\em Container} & The type of container to return. Must be a resizable Sequence\+Container. \\
\hline
\end{DoxyTemplParams}
\begin{DoxyReturn}{Returns}
A Container where each element is a transformed element of the input range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00218}{218}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a50ae6a19ed6bb7485d75f5ae4196fd61}\label{namespace_k_b_l_i_b___n_s_a50ae6a19ed6bb7485d75f5ae4196fd61}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_dy@{build\_dy}}
\index{build\_dy@{build\_dy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_dy()}{build\_dy()}\hspace{0.1cm}{\footnotesize\ttfamily [4/4]}}
{\footnotesize\ttfamily template$<$typename Container , typename Range , typename Unary\+Function , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}{is\+\_\+resizable\+\_\+v}}$<$ Container $>$, int $>$  = 0$>$ \\
auto KBLIB\+\_\+\+NS\+::build\+\_\+dy (\begin{DoxyParamCaption}\item[{Range \&\&}]{r,  }\item[{Unary\+Function}]{f }\end{DoxyParamCaption}) -\/$>$ Container }


\begin{DoxyParams}{Parameters}
{\em r} & \\
\hline
{\em allocator} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{build_8h_source_l00276}{276}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae0b64235d95f71241847eb753c7cb665}\label{namespace_k_b_l_i_b___n_s_ae0b64235d95f71241847eb753c7cb665}} 
\index{KBLIB\_NS@{KBLIB\_NS}!buildiota@{buildiota}}
\index{buildiota@{buildiota}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{buildiota()}{buildiota()}}
{\footnotesize\ttfamily template$<$typename Container , typename... Args$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::buildiota (\begin{DoxyParamCaption}\item[{Args \&\&...}]{args }\end{DoxyParamCaption}) -\/$>$ auto \hspace{0.3cm}{\ttfamily [constexpr]}}



Builds a container of increasing values. 


\begin{DoxyTemplParams}{Template Parameters}
{\em Container} & Either a resizable (like std\+::vector) or non-\/resizable (like std\+::array) Container. \\
\hline
\end{DoxyTemplParams}
\begin{DoxyRemark}{Remarks}
If Container is non-\/resizable, then elements are first value-\/initialized and then assigned to, otherwise values are inserted directly. 
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em args} & If Container is resizable, the first argument is the size of container to return, otherwise there is no size argument. The next argument is always the starting value. Optionally, an increment may be specified as a final argument. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{build_8h_source_l00425}{425}} of file \mbox{\hyperlink{build_8h_source}{build.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a0aedecf6740f35fb61cd5bc85cfd00e6}\label{namespace_k_b_l_i_b___n_s_a0aedecf6740f35fb61cd5bc85cfd00e6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!byte\_cast@{byte\_cast}}
\index{byte\_cast@{byte\_cast}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{byte\_cast()}{byte\_cast()}}
{\footnotesize\ttfamily template$<$typename T , typename F $>$ \\
auto KBLIB\+\_\+\+NS\+::byte\+\_\+cast (\begin{DoxyParamCaption}\item[{F}]{v }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [noexcept]}}



Creates a T with the same object representation as the given F. 

T and F must be the same size and must both be trivially copyable.

\begin{DoxyNote}{Note}
Will be fully replaceable by std\+::bit\+\_\+cast in C++20.
\end{DoxyNote}

\begin{DoxyParams}{Parameters}
{\em v} & A value to reinterpret. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
T The reinterpreted value. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{traits_8h_source_l00182}{182}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa362dc8d17673963fd10f7daf9945872}\label{namespace_k_b_l_i_b___n_s_aa362dc8d17673963fd10f7daf9945872}} 
\index{KBLIB\_NS@{KBLIB\_NS}!byte\_count@{byte\_count}}
\index{byte\_count@{byte\_count}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{byte\_count()}{byte\_count()}\hspace{0.1cm}{\footnotesize\ttfamily [1/5]}}
{\footnotesize\ttfamily constexpr auto KBLIB\+\_\+\+NS\+::byte\+\_\+count (\begin{DoxyParamCaption}\item[{}]{... }\end{DoxyParamCaption}) -\/$>$  void=delete\hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [delete]}}

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a566d119d647550949517a8ef5c4ec931}\label{namespace_k_b_l_i_b___n_s_a566d119d647550949517a8ef5c4ec931}} 
\index{KBLIB\_NS@{KBLIB\_NS}!byte\_count@{byte\_count}}
\index{byte\_count@{byte\_count}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{byte\_count()}{byte\_count()}\hspace{0.1cm}{\footnotesize\ttfamily [2/5]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::byte\+\_\+count (\begin{DoxyParamCaption}\item[{const std\+::unique\+\_\+ptr$<$ T $>$ \&}]{ }\end{DoxyParamCaption}) -\/$>$ std\+::size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{sort_8h_source_l00271}{271}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a5ee1f8c82b92d53a4a1d05e1e19fc3d0}\label{namespace_k_b_l_i_b___n_s_a5ee1f8c82b92d53a4a1d05e1e19fc3d0}} 
\index{KBLIB\_NS@{KBLIB\_NS}!byte\_count@{byte\_count}}
\index{byte\_count@{byte\_count}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{byte\_count()}{byte\_count()}\hspace{0.1cm}{\footnotesize\ttfamily [3/5]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::byte\+\_\+count (\begin{DoxyParamCaption}\item[{const T \&}]{x }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$     is\+\_\+linear\+\_\+container\+\_\+v$<$         T$>$ and (std\+::is\+\_\+integral$<$typename T\+::value\+\_\+type$>$\+::value or \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a50124a019a763aa533428f9bb73754c6}{is\+\_\+byte\+\_\+v}}$<$T$>$)         and sizeof(typename T\+::value\+\_\+type) == 1,     std\+::size\+\_\+t$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{sort_8h_source_l00276}{276}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a8d6c07ac59c352d602973136fab7a491}\label{namespace_k_b_l_i_b___n_s_a8d6c07ac59c352d602973136fab7a491}} 
\index{KBLIB\_NS@{KBLIB\_NS}!byte\_count@{byte\_count}}
\index{byte\_count@{byte\_count}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{byte\_count()}{byte\_count()}\hspace{0.1cm}{\footnotesize\ttfamily [4/5]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::byte\+\_\+count (\begin{DoxyParamCaption}\item[{T $\ast$}]{ }\end{DoxyParamCaption}) -\/$>$ std\+::size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{sort_8h_source_l00267}{267}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac407c37897dbba453180c260a14f793f}\label{namespace_k_b_l_i_b___n_s_ac407c37897dbba453180c260a14f793f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!byte\_count@{byte\_count}}
\index{byte\_count@{byte\_count}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{byte\_count()}{byte\_count()}\hspace{0.1cm}{\footnotesize\ttfamily [5/5]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::byte\+\_\+count (\begin{DoxyParamCaption}\item[{T}]{ }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$std\+::is\+\_\+integral$<$T$>$\+::value, std\+::size\+\_\+t$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{sort_8h_source_l00252}{252}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a1f193cfd181f4fe369fe2bee65f5d129}\label{namespace_k_b_l_i_b___n_s_a1f193cfd181f4fe369fe2bee65f5d129}} 
\index{KBLIB\_NS@{KBLIB\_NS}!calc\_fib\_size@{calc\_fib\_size}}
\index{calc\_fib\_size@{calc\_fib\_size}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{calc\_fib\_size()}{calc\_fib\_size()}}
{\footnotesize\ttfamily template$<$typename U $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::calc\+\_\+fib\+\_\+size (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ std\+::size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Calculate the index of the largest fibonacci number that can be represented by a given unsigned integral type. 

\begin{DoxyRemark}{Remarks}
Here is a table of the results for common bit-\/widths\+: \begin{DoxyVerb}bits  N    fibonacci(N)
--------------------------------------------------
8     13   144
16    24   28657
32    47   1836311903
64    93   7540113804746346429
128   186  205697230343233228174223751303346572685
\end{DoxyVerb}

\end{DoxyRemark}
\begin{DoxyReturn}{Returns}
std\+::size\+\_\+t 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stats_8h_source_l00132}{132}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a38e776bebcf320cdc4fbe2f28bcceef0}\label{namespace_k_b_l_i_b___n_s_a38e776bebcf320cdc4fbe2f28bcceef0}} 
\index{KBLIB\_NS@{KBLIB\_NS}!calculate\_translated\_index@{calculate\_translated\_index}}
\index{calculate\_translated\_index@{calculate\_translated\_index}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{calculate\_translated\_index()}{calculate\_translated\_index()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::calculate\+\_\+translated\+\_\+index (\begin{DoxyParamCaption}\item[{const char $\ast$}]{value,  }\item[{const char $\ast$}]{p }\end{DoxyParamCaption}) -\/$>$ std\+::ptrdiff\+\_\+t \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00591}{591}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_acdf3414ebaef2bc632182f09831f4953}\label{namespace_k_b_l_i_b___n_s_acdf3414ebaef2bc632182f09831f4953}} 
\index{KBLIB\_NS@{KBLIB\_NS}!calculate\_translated\_index@{calculate\_translated\_index}}
\index{calculate\_translated\_index@{calculate\_translated\_index}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{calculate\_translated\_index()}{calculate\_translated\_index()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::calculate\+\_\+translated\+\_\+index (\begin{DoxyParamCaption}\item[{string \&\&}]{value,  }\item[{const char $\ast$}]{p }\end{DoxyParamCaption}) -\/$>$ std\+::ptrdiff\+\_\+t }



Definition at line \mbox{\hyperlink{convert_8h_source_l00579}{579}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a33ce91bc17a06635cc52820462d22e36}\label{namespace_k_b_l_i_b___n_s_a33ce91bc17a06635cc52820462d22e36}} 
\index{KBLIB\_NS@{KBLIB\_NS}!call\_each@{call\_each}}
\index{call\_each@{call\_each}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{call\_each()}{call\_each()}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename... Params$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::call\+\_\+each (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Params \&\&...}]{params }\end{DoxyParamCaption}) -\/$>$ Input\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01603}{1603}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a954b78fde1565b7306b2fe1964d02cfc}\label{namespace_k_b_l_i_b___n_s_a954b78fde1565b7306b2fe1964d02cfc}} 
\index{KBLIB\_NS@{KBLIB\_NS}!chooseCategorical@{chooseCategorical}}
\index{chooseCategorical@{chooseCategorical}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{chooseCategorical()}{chooseCategorical()}}
{\footnotesize\ttfamily template$<$typename Array , typename Random\+Generator , typename freqtype  = double$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::choose\+Categorical (\begin{DoxyParamCaption}\item[{Array \&\&}]{cats,  }\item[{Random\+Generator \&}]{r }\end{DoxyParamCaption}) -\/$>$ decltype(cats.\+size()) \hspace{0.3cm}{\ttfamily [constexpr]}}



Given a categorical distribution cats, selects one category. 

\begin{DoxyRefDesc}{Deprecated}
\item[\mbox{\hyperlink{deprecated__deprecated000003}{Deprecated}}]std\+::discrete\+\_\+distribution provides the same functionality, with a worse name. Because it exists, there is no reason to use this function.\end{DoxyRefDesc}



\begin{DoxyParams}{Parameters}
{\em cats} & A sequence of category weights \\
\hline
{\em r} & A $<$random$>$-\/compatible Random\+Generator \\
\hline
\end{DoxyParams}
\begin{DoxyRefDesc}{Todo}
\item[\mbox{\hyperlink{todo__todo000001}{Todo}}]Refactor to remove the ugly unreachable stuff. \end{DoxyRefDesc}


Definition at line \mbox{\hyperlink{random_8h_source_l00065}{65}} of file \mbox{\hyperlink{random_8h_source}{random.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a8bc9a7fc2ab24ae197119582e92c08ac}\label{namespace_k_b_l_i_b___n_s_a8bc9a7fc2ab24ae197119582e92c08ac}} 
\index{KBLIB\_NS@{KBLIB\_NS}!coerce@{coerce}}
\index{coerce@{coerce}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{coerce()}{coerce()}}
{\footnotesize\ttfamily template$<$typename To , typename... Ts$>$ \\
auto KBLIB\+\_\+\+NS\+::coerce (\begin{DoxyParamCaption}\item[{const std\+::variant$<$ Ts... $>$ \&}]{v }\end{DoxyParamCaption}) -\/$>$ To }



Lexically converts the value of v (no matter its type) to type To. 

\begin{DoxyRefDesc}{Deprecated}
\item[\mbox{\hyperlink{deprecated__deprecated000004}{Deprecated}}]Use lexical\+\_\+coerce instead, as it more clearly expresses intent.\end{DoxyRefDesc}



\begin{DoxyParams}{Parameters}
{\em v} & A variant to coerce. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
To The type to coerce to. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{variant_8h_source_l00067}{67}} of file \mbox{\hyperlink{variant_8h_source}{variant.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aaa2785d00ba0a708990c2e6d53de6598}\label{namespace_k_b_l_i_b___n_s_aaa2785d00ba0a708990c2e6d53de6598}} 
\index{KBLIB\_NS@{KBLIB\_NS}!concat@{concat}}
\index{concat@{concat}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{concat()}{concat()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename string  = std\+::string, typename F , typename... S$>$ \\
auto KBLIB\+\_\+\+NS\+::concat (\begin{DoxyParamCaption}\item[{F \&\&}]{f,  }\item[{S \&\&...}]{ins }\end{DoxyParamCaption}) -\/$>$ string }



Returns a string consisting of the concatenation of all arguments. 

Arithmetic types are first converted by calling std\+::to\+\_\+string.


\begin{DoxyParams}{Parameters}
{\em f} & The first argument to concatenate. \\
\hline
{\em ins} & Any number of arguments to concatenate onto f. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
string A string containing the concatenated values of all the arguments. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00305}{305}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab43fe5e6cef0ef3f226528d496c03475}\label{namespace_k_b_l_i_b___n_s_ab43fe5e6cef0ef3f226528d496c03475}} 
\index{KBLIB\_NS@{KBLIB\_NS}!concat@{concat}}
\index{concat@{concat}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{concat()}{concat()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename string  = std\+::string, typename str $>$ \\
auto KBLIB\+\_\+\+NS\+::concat (\begin{DoxyParamCaption}\item[{std\+::initializer\+\_\+list$<$ str $>$}]{ins }\end{DoxyParamCaption}) -\/$>$ string }



Returns a string consisting of the concatenation of all elements of an initializer list. 


\begin{DoxyParams}{Parameters}
{\em ins} & A series of values to concatenate together. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
string A string containing the concatenated values of all the arguments. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00319}{319}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a22c160ee1cec6fd1c9df4d8ed06cf378}\label{namespace_k_b_l_i_b___n_s_a22c160ee1cec6fd1c9df4d8ed06cf378}} 
\index{KBLIB\_NS@{KBLIB\_NS}!construct\_from\_range@{construct\_from\_range}}
\index{construct\_from\_range@{construct\_from\_range}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{construct\_from\_range()}{construct\_from\_range()}}
{\footnotesize\ttfamily template$<$typename Container , typename Range $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::construct\+\_\+from\+\_\+range (\begin{DoxyParamCaption}\item[{Range \&\&}]{r }\end{DoxyParamCaption}) -\/$>$ Container \hspace{0.3cm}{\ttfamily [constexpr]}}



Allows for constructing a container of a specified type from a range object. Copy elision means that this does not result in any extra copies. 


\begin{DoxyTemplParams}{Template Parameters}
{\em Container} & The container type to construct an object of. \\
\hline
\end{DoxyTemplParams}

\begin{DoxyParams}{Parameters}
{\em r} & The range to construct the returned container from. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container Container\{begin(r), end(r)\}; 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{containers_8h_source_l00152}{152}} of file \mbox{\hyperlink{containers_8h_source}{containers.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_adba96aa24ce8e12f9c035b38684e6862}\label{namespace_k_b_l_i_b___n_s_adba96aa24ce8e12f9c035b38684e6862}} 
\index{KBLIB\_NS@{KBLIB\_NS}!consumer@{consumer}}
\index{consumer@{consumer}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{consumer()}{consumer()}}
{\footnotesize\ttfamily template$<$typename F $>$ \\
auto KBLIB\+\_\+\+NS\+::consumer (\begin{DoxyParamCaption}\item[{F}]{f }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1consume__iterator}{consume\+\_\+iterator}}$<$F$>$ }



Creates a \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1consume__iterator}{consume\+\_\+iterator}} of deduced type F. 

This could be a deduction guide, if kblib didn\textquotesingle{}t also support C++14. Thus, the old style is used for compatibility.


\begin{DoxyParams}{Parameters}
{\em f} & A functor to call on assignment. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
consume\+\_\+iterator$<$\+F$>$ 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{iterators_8h_source_l01614}{1614}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a4b44d5f8e34227d50f29b2e52fd1a686}\label{namespace_k_b_l_i_b___n_s_a4b44d5f8e34227d50f29b2e52fd1a686}} 
\index{KBLIB\_NS@{KBLIB\_NS}!contains@{contains}}
\index{contains@{contains}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{contains()}{contains()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Set , typename Value $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::contains (\begin{DoxyParamCaption}\item[{const Set \&}]{set,  }\item[{const Value \&}]{val }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$Set$>$\+::value, bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Determine if a range contains a value. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01063}{1063}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a358d34dbabdd3fcfcdda5b016787cbd8}\label{namespace_k_b_l_i_b___n_s_a358d34dbabdd3fcfcdda5b016787cbd8}} 
\index{KBLIB\_NS@{KBLIB\_NS}!contains@{contains}}
\index{contains@{contains}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{contains()}{contains()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename Value $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::contains (\begin{DoxyParamCaption}\item[{Input\+It}]{begin,  }\item[{Input\+It}]{end,  }\item[{const Value \&}]{val }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It$>$\+::value, bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Determine if a range contains a value. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01052}{1052}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a31dab78c615cff330867eeeedc2de845}\label{namespace_k_b_l_i_b___n_s_a31dab78c615cff330867eeeedc2de845}} 
\index{KBLIB\_NS@{KBLIB\_NS}!contains\_any@{contains\_any}}
\index{contains\_any@{contains\_any}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{contains\_any()}{contains\_any()}\hspace{0.1cm}{\footnotesize\ttfamily [1/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename Range2 $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::contains\+\_\+any (\begin{DoxyParamCaption}\item[{Input\+It}]{begin,  }\item[{Input\+It}]{end,  }\item[{Range2 \&\&}]{needle }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$Range2$>$\+::value,                    bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01087}{1087}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab85668b5bdd0e9a64926ea04903d8463}\label{namespace_k_b_l_i_b___n_s_ab85668b5bdd0e9a64926ea04903d8463}} 
\index{KBLIB\_NS@{KBLIB\_NS}!contains\_any@{contains\_any}}
\index{contains\_any@{contains\_any}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{contains\_any()}{contains\_any()}\hspace{0.1cm}{\footnotesize\ttfamily [2/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename Input\+It2 $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::contains\+\_\+any (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin,  }\item[{Input\+It1}]{end,  }\item[{Input\+It2}]{n\+\_\+begin,  }\item[{Input\+It2}]{n\+\_\+end }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It1$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It2$>$\+::value,                    bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01076}{1076}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3ffee002592c9af376e17c42a0f76463}\label{namespace_k_b_l_i_b___n_s_a3ffee002592c9af376e17c42a0f76463}} 
\index{KBLIB\_NS@{KBLIB\_NS}!contains\_any@{contains\_any}}
\index{contains\_any@{contains\_any}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{contains\_any()}{contains\_any()}\hspace{0.1cm}{\footnotesize\ttfamily [3/3]}}
{\footnotesize\ttfamily template$<$typename Range1 , typename Range2 $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::contains\+\_\+any (\begin{DoxyParamCaption}\item[{Range1 \&\&}]{haystack,  }\item[{Range2 \&\&}]{needle }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$Range1$>$\+::value and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$Range2$>$\+::value,                    bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01098}{1098}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a33c820207dbcb1c0be9e457dc7ac7764}\label{namespace_k_b_l_i_b___n_s_a33c820207dbcb1c0be9e457dc7ac7764}} 
\index{KBLIB\_NS@{KBLIB\_NS}!copy@{copy}}
\index{copy@{copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{copy()}{copy()}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename Output\+It $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::copy (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Output\+It}]{out }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



Copies all elements of \mbox{[}{\ttfamily first}, {\ttfamily last}) to out. It also allows for a sentinel end iterator. 

\begin{DoxyRemark}{Remarks}
This function is {\ttfamily constexpr} in C++14.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the input range \\
\hline
{\em last} & The end of the input range \\
\hline
{\em out} & The beginning of the output range \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Output\+It An iterator to past the last element written 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01322}{1322}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a591af4d692a54e6bf17ad42f7e26021a}\label{namespace_k_b_l_i_b___n_s_a591af4d692a54e6bf17ad42f7e26021a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!copy\_if@{copy\_if}}
\index{copy\_if@{copy\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{copy\_if()}{copy\_if()}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename Output\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::copy\+\_\+if (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Output\+It}]{out,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



Copies those elements of \mbox{[}{\ttfamily first}, {\ttfamily last}) which satisfy pred to out. It also allows for a sentinel end iterator. 

\begin{DoxyRemark}{Remarks}
This function is {\ttfamily constexpr} in C++14.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the input range \\
\hline
{\em last} & The end of the input range \\
\hline
{\em out} & The beginning of the output range \\
\hline
{\em pred} & The predicate to apply \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Output\+It An iterator to past the last element written 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01343}{1343}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae6c3d856c6a4d29c61810eb86980eb25}\label{namespace_k_b_l_i_b___n_s_ae6c3d856c6a4d29c61810eb86980eb25}} 
\index{KBLIB\_NS@{KBLIB\_NS}!copy\_n@{copy\_n}}
\index{copy\_n@{copy\_n}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{copy\_n()}{copy\_n()}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename Size , typename Output\+It $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::copy\+\_\+n (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Size}]{count,  }\item[{Output\+It}]{out }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



Copies all elements of \mbox{[}{\ttfamily first}, {\ttfamily std\+::advance(first, n)}) to out. 

\begin{DoxyRemark}{Remarks}
This function is {\ttfamily constexpr} in C++14.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the input range. \\
\hline
{\em count} & The number of elements in the input range. \\
\hline
{\em out} & The output range. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Output\+It Output\+It An iterator to past the last element written 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01365}{1365}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab42fc398e2312bcfb746a35849ac42b5}\label{namespace_k_b_l_i_b___n_s_ab42fc398e2312bcfb746a35849ac42b5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!copy\_n\_if@{copy\_n\_if}}
\index{copy\_n\_if@{copy\_n\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{copy\_n\_if()}{copy\_n\_if()}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename Size , typename Output\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::copy\+\_\+n\+\_\+if (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Size}]{count,  }\item[{Output\+It}]{out,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



Copies those elements of \mbox{[}{\ttfamily first}, {\ttfamily std\+::advance(first, n)}) which satisfy pred to out. 

\begin{DoxyRemark}{Remarks}
This function is {\ttfamily constexpr} in C++14.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the input range. \\
\hline
{\em count} & The number of elements in the input range. \\
\hline
{\em out} & The output range. \\
\hline
{\em pred} & The predicate to apply. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Output\+It Output\+It An iterator to past the last element written 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01386}{1386}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7db189e751eea6b94eb2748e3639e634}\label{namespace_k_b_l_i_b___n_s_a7db189e751eea6b94eb2748e3639e634}} 
\index{KBLIB\_NS@{KBLIB\_NS}!count\_digits@{count\_digits}}
\index{count\_digits@{count\_digits}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{count\_digits()}{count\_digits()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Number $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::count\+\_\+digits (\begin{DoxyParamCaption}\item[{Number}]{val }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$std\+::is\+\_\+floating\+\_\+point$<$Number$>$\+::value, int$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Calculates the number of decimal digits needed to represent a number, plus one for negative numbers. 

Calculates the number of decimal digits needed to represent a number.


\begin{DoxyParams}{Parameters}
{\em val} & The number to be checked. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
int The number of digits needed to represent a number. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{format_8h_source_l00050}{50}} of file \mbox{\hyperlink{format_8h_source}{format.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9eb453834f5eea578e625d582e5a1f12}\label{namespace_k_b_l_i_b___n_s_a9eb453834f5eea578e625d582e5a1f12}} 
\index{KBLIB\_NS@{KBLIB\_NS}!count\_digits@{count\_digits}}
\index{count\_digits@{count\_digits}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{count\_digits()}{count\_digits()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Number $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::count\+\_\+digits (\begin{DoxyParamCaption}\item[{Number}]{val,  }\item[{int}]{base }\end{DoxyParamCaption}) -\/$>$ int \hspace{0.3cm}{\ttfamily [constexpr]}}



Calculates the number of digits needed to represent a number in a given base, plus one for negative numbers. 


\begin{DoxyParams}{Parameters}
{\em val} & The number to be checked. \\
\hline
{\em base} & The base to be used for calculation. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
int The number of digits needed to represent a number. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{format_8h_source_l00107}{107}} of file \mbox{\hyperlink{format_8h_source}{format.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a17b4229f4bbaf304d7f6b25db0c7f3c4}\label{namespace_k_b_l_i_b___n_s_a17b4229f4bbaf304d7f6b25db0c7f3c4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!counting\_back\_inserter@{counting\_back\_inserter}}
\index{counting\_back\_inserter@{counting\_back\_inserter}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{counting\_back\_inserter()}{counting\_back\_inserter()}}
{\footnotesize\ttfamily template$<$typename C $>$ \\
\mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1counting__back__insert__iterator}{counting\+\_\+back\+\_\+insert\+\_\+iterator}}$<$ C $>$ KBLIB\+\_\+\+NS\+::counting\+\_\+back\+\_\+inserter (\begin{DoxyParamCaption}\item[{C \&}]{c,  }\item[{std\+::size\+\_\+t}]{count = {\ttfamily 0} }\end{DoxyParamCaption})}



Definition at line \mbox{\hyperlink{iterators_8h_source_l00203}{203}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ace7f2fbc3da892054770143cf07dff48}\label{namespace_k_b_l_i_b___n_s_ace7f2fbc3da892054770143cf07dff48}} 
\index{KBLIB\_NS@{KBLIB\_NS}!cry\_enumerate@{cry\_enumerate}}
\index{cry\_enumerate@{cry\_enumerate}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{cry\_enumerate()}{cry\_enumerate()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Iter1 , typename Iter2 $>$ \\
auto KBLIB\+\_\+\+NS\+::cry\+\_\+enumerate (\begin{DoxyParamCaption}\item[{Iter1}]{begin,  }\item[{Iter2}]{end }\end{DoxyParamCaption}) -\/$>$ auto }



Definition at line \mbox{\hyperlink{iterators_8h_source_l01071}{1071}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3ab4475226febb01518ca82d6eea9283}\label{namespace_k_b_l_i_b___n_s_a3ab4475226febb01518ca82d6eea9283}} 
\index{KBLIB\_NS@{KBLIB\_NS}!cry\_enumerate@{cry\_enumerate}}
\index{cry\_enumerate@{cry\_enumerate}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{cry\_enumerate()}{cry\_enumerate()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Range $>$ \\
auto KBLIB\+\_\+\+NS\+::cry\+\_\+enumerate (\begin{DoxyParamCaption}\item[{Range \&\&}]{range }\end{DoxyParamCaption}) -\/$>$ auto }

\begin{DoxyAuthor}{Author}
Krystian Stasiowski, killerbee 
\end{DoxyAuthor}
\begin{DoxyDate}{Date}
2020 
\end{DoxyDate}


Definition at line \mbox{\hyperlink{enumerate-contrib-cry_8h_source_l00186}{186}} of file \mbox{\hyperlink{enumerate-contrib-cry_8h_source}{enumerate-\/contrib-\/cry.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a941d60de9144c06e348bb874f625f1a9}\label{namespace_k_b_l_i_b___n_s_a941d60de9144c06e348bb874f625f1a9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!defer@{defer}}
\index{defer@{defer}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{defer()}{defer()}}
{\footnotesize\ttfamily template$<$typename F $>$ \\
auto KBLIB\+\_\+\+NS\+::defer (\begin{DoxyParamCaption}\item[{F}]{f }\end{DoxyParamCaption})}



Definition at line \mbox{\hyperlink{simple_8h_source_l00108}{108}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7ee01e52a61bc482ffbade1b76984426}\label{namespace_k_b_l_i_b___n_s_a7ee01e52a61bc482ffbade1b76984426}} 
\index{KBLIB\_NS@{KBLIB\_NS}!div@{div}}
\index{div@{div}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{div()}{div()}}
{\footnotesize\ttfamily template$<$typename T , typename U $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::div (\begin{DoxyParamCaption}\item[{T}]{num,  }\item[{U}]{den }\end{DoxyParamCaption}) -\/$>$ decltype(std\+::div(num, den)) \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{stats_8h_source_l00048}{48}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae2bcc0520aee3ea417a1d16ae77e318b}\label{namespace_k_b_l_i_b___n_s_ae2bcc0520aee3ea417a1d16ae77e318b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!duration\_to\_str@{duration\_to\_str}}
\index{duration\_to\_str@{duration\_to\_str}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{duration\_to\_str()}{duration\_to\_str()}\hspace{0.1cm}{\footnotesize\ttfamily [1/3]}}
{\footnotesize\ttfamily template$<$typename Rep , typename Ratio , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1detail__units_1_1is__si__ratio}{detail\+\_\+units\+::is\+\_\+si\+\_\+ratio}}$<$ typename Ratio\+::type $>$\+::value $>$ $\ast$  = 0$>$ \\
auto KBLIB\+\_\+\+NS\+::duration\+\_\+to\+\_\+str (\begin{DoxyParamCaption}\item[{std\+::chrono\+::duration$<$ Rep, Ratio $>$ \&}]{d }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00466}{466}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a1575f6eda9991fd978d519232ffe15e1}\label{namespace_k_b_l_i_b___n_s_a1575f6eda9991fd978d519232ffe15e1}} 
\index{KBLIB\_NS@{KBLIB\_NS}!duration\_to\_str@{duration\_to\_str}}
\index{duration\_to\_str@{duration\_to\_str}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{duration\_to\_str()}{duration\_to\_str()}\hspace{0.1cm}{\footnotesize\ttfamily [2/3]}}
{\footnotesize\ttfamily template$<$typename Rep $>$ \\
auto KBLIB\+\_\+\+NS\+::duration\+\_\+to\+\_\+str (\begin{DoxyParamCaption}\item[{std\+::chrono\+::duration$<$ Rep, std\+::ratio$<$ 3600 $>$ $>$}]{d }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00492}{492}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_adf1e223f4be11bf2dadea1215c40dfef}\label{namespace_k_b_l_i_b___n_s_adf1e223f4be11bf2dadea1215c40dfef}} 
\index{KBLIB\_NS@{KBLIB\_NS}!duration\_to\_str@{duration\_to\_str}}
\index{duration\_to\_str@{duration\_to\_str}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{duration\_to\_str()}{duration\_to\_str()}\hspace{0.1cm}{\footnotesize\ttfamily [3/3]}}
{\footnotesize\ttfamily template$<$typename Rep $>$ \\
auto KBLIB\+\_\+\+NS\+::duration\+\_\+to\+\_\+str (\begin{DoxyParamCaption}\item[{std\+::chrono\+::duration$<$ Rep, std\+::ratio$<$ 60 $>$ $>$}]{d }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00487}{487}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab201870fcd6e784f6927f15ad256cd18}\label{namespace_k_b_l_i_b___n_s_ab201870fcd6e784f6927f15ad256cd18}} 
\index{KBLIB\_NS@{KBLIB\_NS}!e@{e}}
\index{e@{e}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{e()}{e()}}
{\footnotesize\ttfamily template$<$typename T  = double$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::e (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{stats_8h_source_l00468}{468}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a98e37fd1c2d8758f7446f74f63f867c6}\label{namespace_k_b_l_i_b___n_s_a98e37fd1c2d8758f7446f74f63f867c6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!eat\_space@{eat\_space}}
\index{eat\_space@{eat\_space}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{eat\_space()}{eat\_space()}}
{\footnotesize\ttfamily std\+::istream \& KBLIB\+\_\+\+NS\+::eat\+\_\+space (\begin{DoxyParamCaption}\item[{std\+::istream \&}]{is }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Eat spaces, don\textquotesingle{}t eat an extra. 

\begin{DoxyRefDesc}{Deprecated}
\item[\mbox{\hyperlink{deprecated__deprecated000001}{Deprecated}}]Use std\+::ws instead.\end{DoxyRefDesc}



\begin{DoxyParams}{Parameters}
{\em is} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
std\+::istream 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{io_8h_source_l00173}{173}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af4060fe62c919395b7d5ef32a5491035}\label{namespace_k_b_l_i_b___n_s_af4060fe62c919395b7d5ef32a5491035}} 
\index{KBLIB\_NS@{KBLIB\_NS}!eat\_word@{eat\_word}}
\index{eat\_word@{eat\_word}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{eat\_word()}{eat\_word()}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::eat\+\_\+word (\begin{DoxyParamCaption}\item[{std\+::istream \&}]{is }\end{DoxyParamCaption}) -\/$>$ std\+::istream\& \hspace{0.3cm}{\ttfamily [inline]}}



Consume all non-\/spaces to first break, then eat that, too. 


\begin{DoxyParams}{Parameters}
{\em is} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
std\+::istream 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{io_8h_source_l00158}{158}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_acc271f74ef547ac8181b0bd434ed5e66}\label{namespace_k_b_l_i_b___n_s_acc271f74ef547ac8181b0bd434ed5e66}} 
\index{KBLIB\_NS@{KBLIB\_NS}!ends\_with@{ends\_with}}
\index{ends\_with@{ends\_with}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{ends\_with()}{ends\_with()}\hspace{0.1cm}{\footnotesize\ttfamily [1/4]}}
{\footnotesize\ttfamily template$<$typename Bidir\+It1 , typename Bidir\+It2 , typename Binary\+Pred  = std\+::equal\+\_\+to$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::ends\+\_\+with (\begin{DoxyParamCaption}\item[{Bidir\+It1}]{begin1,  }\item[{Bidir\+It1}]{end1,  }\item[{Bidir\+It2}]{begin2,  }\item[{Bidir\+It2}]{end2,  }\item[{Binary\+Pred}]{pred = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$         (\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9b0f47dcb794a46a80201a97520e9423}{is\+\_\+bidirectional\+\_\+iterator\+\_\+v}}$<$Bidir\+It1$>$                and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a9b0f47dcb794a46a80201a97520e9423}{is\+\_\+bidirectional\+\_\+iterator\+\_\+v}}$<$Bidir\+It2$>$)          and not (\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$                      Bidir\+It1$>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$Bidir\+It2$>$),         bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Checks if a given range ends with a particular subrange. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00781}{781}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_afe69ce73c3d68767258431f75f41848d}\label{namespace_k_b_l_i_b___n_s_afe69ce73c3d68767258431f75f41848d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!ends\_with@{ends\_with}}
\index{ends\_with@{ends\_with}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{ends\_with()}{ends\_with()}\hspace{0.1cm}{\footnotesize\ttfamily [2/4]}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It1 , typename Random\+Access\+It2 , typename Binary\+Pred  = std\+::equal\+\_\+to$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::ends\+\_\+with (\begin{DoxyParamCaption}\item[{Random\+Access\+It1}]{begin1,  }\item[{Random\+Access\+It1}]{end1,  }\item[{Random\+Access\+It2}]{begin2,  }\item[{Random\+Access\+It2}]{end2,  }\item[{Binary\+Pred}]{pred = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$         \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$             Random\+Access\+It1$>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$Random\+Access\+It2$>$,         bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Checks if a given range ends with a particular subrange. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00803}{803}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aac47fa307bf4298640545dec121ff144}\label{namespace_k_b_l_i_b___n_s_aac47fa307bf4298640545dec121ff144}} 
\index{KBLIB\_NS@{KBLIB\_NS}!ends\_with@{ends\_with}}
\index{ends\_with@{ends\_with}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{ends\_with()}{ends\_with()}\hspace{0.1cm}{\footnotesize\ttfamily [3/4]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::ends\+\_\+with (\begin{DoxyParamCaption}\item[{std\+::string\+\_\+view}]{haystack,  }\item[{char}]{needle }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}}



Checks if a given string ends with a particular string. 


\begin{DoxyParams}{Parameters}
{\em haystack} & The string to be checked. \\
\hline
{\em needle} & The suffix to check for. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
bool If haystack ends with needle. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00665}{665}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad3effaa7d10875cac1da148d682fcc35}\label{namespace_k_b_l_i_b___n_s_ad3effaa7d10875cac1da148d682fcc35}} 
\index{KBLIB\_NS@{KBLIB\_NS}!ends\_with@{ends\_with}}
\index{ends\_with@{ends\_with}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{ends\_with()}{ends\_with()}\hspace{0.1cm}{\footnotesize\ttfamily [4/4]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::ends\+\_\+with (\begin{DoxyParamCaption}\item[{std\+::string\+\_\+view}]{haystack,  }\item[{std\+::string\+\_\+view}]{needle }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}}



Checks if a given string ends with a particular string. 


\begin{DoxyParams}{Parameters}
{\em haystack} & The string to be checked. \\
\hline
{\em needle} & The suffix to check for. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
bool If haystack ends with needle. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00651}{651}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a192a71e3c07c20435638b9fd2d226a41}\label{namespace_k_b_l_i_b___n_s_a192a71e3c07c20435638b9fd2d226a41}} 
\index{KBLIB\_NS@{KBLIB\_NS}!enumerate@{enumerate}}
\index{enumerate@{enumerate}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{enumerate()}{enumerate()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename It , typename EIt $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::enumerate (\begin{DoxyParamCaption}\item[{It}]{begin,  }\item[{EIt}]{end }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1enumerate__t}{enumerate\+\_\+t}}$<$It, EIt$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Allow access to indexes while using range-\/based for loops. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The input range. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{enumerate-contrib-tw_8h_source_l00169}{169}} of file \mbox{\hyperlink{enumerate-contrib-tw_8h_source}{enumerate-\/contrib-\/tw.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac9b89d52e383d30ea2f5230790cff648}\label{namespace_k_b_l_i_b___n_s_ac9b89d52e383d30ea2f5230790cff648}} 
\index{KBLIB\_NS@{KBLIB\_NS}!enumerate@{enumerate}}
\index{enumerate@{enumerate}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{enumerate()}{enumerate()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Range $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::enumerate (\begin{DoxyParamCaption}\item[{Range \&\&}]{r }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1enumerate__t}{enumerate\+\_\+t}}$<$Range\&\&$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Allow access to indexes while using range-\/based for loops. Safe to use with rvalues. 


\begin{DoxyParams}{Parameters}
{\em r} & A range to iterate over. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{enumerate-contrib-tw_8h_source_l00159}{159}} of file \mbox{\hyperlink{enumerate-contrib-tw_8h_source}{enumerate-\/contrib-\/tw.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6a4271b484be2977a39a761f9f4e814a}\label{namespace_k_b_l_i_b___n_s_a6a4271b484be2977a39a761f9f4e814a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!equal@{equal}}
\index{equal@{equal}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{equal()}{equal()}\hspace{0.1cm}{\footnotesize\ttfamily [1/6]}}
{\footnotesize\ttfamily template$<$class Input\+It1 , class Input\+It2 $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::equal (\begin{DoxyParamCaption}\item[{Input\+It1}]{first1,  }\item[{Input\+It1}]{last1,  }\item[{Input\+It2}]{first2 }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00960}{960}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab743d1f4424feb9975355cdcc32637e4}\label{namespace_k_b_l_i_b___n_s_ab743d1f4424feb9975355cdcc32637e4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!equal@{equal}}
\index{equal@{equal}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{equal()}{equal()}\hspace{0.1cm}{\footnotesize\ttfamily [2/6]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename Input\+It2 , typename Binary\+Predicate , typename kblib\+::enable\+\_\+if\+\_\+t$<$ not std\+::is\+\_\+same$<$ Input\+It2, Binary\+Predicate $>$\+::value, int $>$  = 0$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::equal (\begin{DoxyParamCaption}\item[{Input\+It1}]{first1,  }\item[{Input\+It1}]{last1,  }\item[{Input\+It2}]{first2,  }\item[{Binary\+Predicate}]{p }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00973}{973}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab038d3d7a299691611fa65c53fbb90df}\label{namespace_k_b_l_i_b___n_s_ab038d3d7a299691611fa65c53fbb90df}} 
\index{KBLIB\_NS@{KBLIB\_NS}!equal@{equal}}
\index{equal@{equal}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{equal()}{equal()}\hspace{0.1cm}{\footnotesize\ttfamily [3/6]}}
{\footnotesize\ttfamily template$<$class Input\+It1 , class Input\+It2 , typename kblib\+::enable\+\_\+if\+\_\+t$<$ not std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Input\+It1 $>$\+::iterator\+\_\+category $>$\+::value or not std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Input\+It2 $>$\+::iterator\+\_\+category $>$\+::value, int $>$  = 0$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::equal (\begin{DoxyParamCaption}\item[{Input\+It1}]{first1,  }\item[{Input\+It1}]{last1,  }\item[{Input\+It2}]{first2,  }\item[{Input\+It2}]{last2 }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l01038}{1038}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a8193764ad56ec2c12891e6e3fd774e39}\label{namespace_k_b_l_i_b___n_s_a8193764ad56ec2c12891e6e3fd774e39}} 
\index{KBLIB\_NS@{KBLIB\_NS}!equal@{equal}}
\index{equal@{equal}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{equal()}{equal()}\hspace{0.1cm}{\footnotesize\ttfamily [4/6]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename Input\+It2 , typename Binary\+Predicate , typename kblib\+::enable\+\_\+if\+\_\+t$<$ not std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Input\+It1 $>$\+::iterator\+\_\+category $>$\+::value or not std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Input\+It2 $>$\+::iterator\+\_\+category $>$\+::value, int $>$  = 0$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::equal (\begin{DoxyParamCaption}\item[{Input\+It1}]{first1,  }\item[{Input\+It1}]{last1,  }\item[{Input\+It2}]{first2,  }\item[{Input\+It2}]{last2,  }\item[{Binary\+Predicate}]{p }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l01058}{1058}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a10c4176bbae0101aacbfc7df5239718d}\label{namespace_k_b_l_i_b___n_s_a10c4176bbae0101aacbfc7df5239718d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!equal@{equal}}
\index{equal@{equal}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{equal()}{equal()}\hspace{0.1cm}{\footnotesize\ttfamily [5/6]}}
{\footnotesize\ttfamily template$<$class Random\+It1 , class Random\+It2 , typename kblib\+::enable\+\_\+if\+\_\+t$<$ std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Random\+It1 $>$\+::iterator\+\_\+category $>$\+::value and std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Random\+It2 $>$\+::iterator\+\_\+category $>$\+::value, int $>$  = 0$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::equal (\begin{DoxyParamCaption}\item[{Random\+It1}]{first1,  }\item[{Random\+It1}]{last1,  }\item[{Random\+It2}]{first2,  }\item[{Random\+It2}]{last2 }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00992}{992}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_afd54ef7c7ec0132feaa622ee5a388dd1}\label{namespace_k_b_l_i_b___n_s_afd54ef7c7ec0132feaa622ee5a388dd1}} 
\index{KBLIB\_NS@{KBLIB\_NS}!equal@{equal}}
\index{equal@{equal}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{equal()}{equal()}\hspace{0.1cm}{\footnotesize\ttfamily [6/6]}}
{\footnotesize\ttfamily template$<$class Random\+It1 , class Random\+It2 , typename Binary\+Predicate , typename kblib\+::enable\+\_\+if\+\_\+t$<$ std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Random\+It1 $>$\+::iterator\+\_\+category $>$\+::value and std\+::is\+\_\+base\+\_\+of$<$ std\+::random\+\_\+access\+\_\+iterator\+\_\+tag, typename std\+::iterator\+\_\+traits$<$ Random\+It2 $>$\+::iterator\+\_\+category $>$\+::value, int $>$  = 0$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::equal (\begin{DoxyParamCaption}\item[{Random\+It1}]{first1,  }\item[{Random\+It1}]{last1,  }\item[{Random\+It2}]{first2,  }\item[{Random\+It2}]{last2,  }\item[{Binary\+Predicate}]{p }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l01015}{1015}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a119ddac7711a98a66c29e9cb8b62f30a}\label{namespace_k_b_l_i_b___n_s_a119ddac7711a98a66c29e9cb8b62f30a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!equals@{equals}}
\index{equals@{equals}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{equals()}{equals()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Obj $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::equals (\begin{DoxyParamCaption}\item[{const Obj \&}]{a,  }\item[{const Obj \&}]{b }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Synthesize an equivalence relation from \texorpdfstring{$<$}{<}. 

\begin{DoxyReturn}{Returns}
bool Whether a is equivalent under \texorpdfstring{$<$}{<} to b. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00094}{94}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a10ae3dc42098d5ddc13a68f7fc40ac48}\label{namespace_k_b_l_i_b___n_s_a10ae3dc42098d5ddc13a68f7fc40ac48}} 
\index{KBLIB\_NS@{KBLIB\_NS}!equals@{equals}}
\index{equals@{equals}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{equals()}{equals()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Obj , typename Compare $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::equals (\begin{DoxyParamCaption}\item[{const Obj \&}]{a,  }\item[{const Obj \&}]{b,  }\item[{Compare}]{comp }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Synthesize an equivalence relation from comp. 

\begin{DoxyReturn}{Returns}
bool Whether a is equivalent under comp to b. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00106}{106}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af24b9b768975292caa9e33ba4931263a}\label{namespace_k_b_l_i_b___n_s_af24b9b768975292caa9e33ba4931263a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!erase@{erase}}
\index{erase@{erase}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{erase()}{erase()}}
{\footnotesize\ttfamily template$<$typename Container , typename Elem $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::erase (\begin{DoxyParamCaption}\item[{Container \&}]{c,  }\item[{const Elem \&}]{val }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Abbreviation of the erase-\/remove idiom as a free function. 


\begin{DoxyParams}{Parameters}
{\em c} & The container to erase from. \\
\hline
{\em val} & The value to remove. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00068}{68}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a133bb5131fb05e574cc981321ceb6f7c}\label{namespace_k_b_l_i_b___n_s_a133bb5131fb05e574cc981321ceb6f7c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!erase\_if@{erase\_if}}
\index{erase\_if@{erase\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{erase\_if()}{erase\_if()}}
{\footnotesize\ttfamily template$<$typename Container , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::erase\+\_\+if (\begin{DoxyParamCaption}\item[{Container \&}]{c,  }\item[{Unary\+Predicate}]{p }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Abbreviation of the erase-\/remove idiom as a free function. 


\begin{DoxyParams}{Parameters}
{\em c} & The container to erase from. \\
\hline
{\em p} & Erase all elements on which p returns true. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00081}{81}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa66d576e4db615a16008862386102393}\label{namespace_k_b_l_i_b___n_s_aa66d576e4db615a16008862386102393}} 
\index{KBLIB\_NS@{KBLIB\_NS}!escapify@{escapify}}
\index{escapify@{escapify}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{escapify()}{escapify()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::escapify (\begin{DoxyParamCaption}\item[{char}]{c }\end{DoxyParamCaption}) -\/$>$ std\+::string \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00548}{548}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7d14b3211b4b94cca162f9f7cc68e902}\label{namespace_k_b_l_i_b___n_s_a7d14b3211b4b94cca162f9f7cc68e902}} 
\index{KBLIB\_NS@{KBLIB\_NS}!escapify@{escapify}}
\index{escapify@{escapify}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{escapify()}{escapify()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::escapify (\begin{DoxyParamCaption}\item[{const string \&}]{value }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00564}{564}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a4d05938ed841428194ece30e10f89623}\label{namespace_k_b_l_i_b___n_s_a4d05938ed841428194ece30e10f89623}} 
\index{KBLIB\_NS@{KBLIB\_NS}!etoi@{etoi}}
\index{etoi@{etoi}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{etoi()}{etoi()}}
{\footnotesize\ttfamily template$<$typename E , typename  = typename std\+::enable\+\_\+if$<$std\+::is\+\_\+enum$<$\+E$>$\+::value$>$\+::type$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::etoi (\begin{DoxyParamCaption}\item[{E}]{e }\end{DoxyParamCaption}) -\/$>$ auto \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00244}{244}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a109743fe0c56374c34c372b790aadffd}\label{namespace_k_b_l_i_b___n_s_a109743fe0c56374c34c372b790aadffd}} 
\index{KBLIB\_NS@{KBLIB\_NS}!exchange@{exchange}}
\index{exchange@{exchange}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{exchange()}{exchange()}}
{\footnotesize\ttfamily template$<$typename T , typename U  = T$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::exchange (\begin{DoxyParamCaption}\item[{T \&}]{obj,  }\item[{U \&\&}]{new\+\_\+value }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00719}{719}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad195459d063b294e19432ed1842d803d}\label{namespace_k_b_l_i_b___n_s_ad195459d063b294e19432ed1842d803d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!expect@{expect}}
\index{expect@{expect}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{expect()}{expect()}}
{\footnotesize\ttfamily template$<$typename CharT $>$ \\
auto KBLIB\+\_\+\+NS\+::expect (\begin{DoxyParamCaption}\item[{CharT}]{c }\end{DoxyParamCaption}) -\/$>$ auto }



Read a character from an input stream only if it equals c. Acts as a Formatted\+Input\+Operation, that is, leading whitespace is ignored. 



Definition at line \mbox{\hyperlink{io_8h_source_l00321}{321}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aeecdd0cbb5d0bba19abcde780fcb9e12}\label{namespace_k_b_l_i_b___n_s_aeecdd0cbb5d0bba19abcde780fcb9e12}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fibonacci@{fibonacci}}
\index{fibonacci@{fibonacci}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fibonacci()}{fibonacci()}}
{\footnotesize\ttfamily template$<$typename U  = std\+::uintmax\+\_\+t$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::fibonacci (\begin{DoxyParamCaption}\item[{int}]{n }\end{DoxyParamCaption}) -\/$>$ U \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Compile-\/time table fibonacci function. 

\begin{DoxyPrecond}{Precondition}
n \texorpdfstring{$<$}{<}= \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1f193cfd181f4fe369fe2bee65f5d129}{calc\+\_\+fib\+\_\+size$<$\+U$>$()}}
\end{DoxyPrecond}
\begin{DoxyReturn}{Returns}
The nth fibonacci number. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stats_8h_source_l00177}{177}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6d8b22c40c02b17c6613fecdab5e9224}\label{namespace_k_b_l_i_b___n_s_a6d8b22c40c02b17c6613fecdab5e9224}} 
\index{KBLIB\_NS@{KBLIB\_NS}!filg2@{filg2}}
\index{filg2@{filg2}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{filg2()}{filg2()}}
{\footnotesize\ttfamily constexpr auto KBLIB\+\_\+\+NS\+::filg2 (\begin{DoxyParamCaption}\item[{const std\+::bitset$<$ std\+::numeric\+\_\+limits$<$ std\+::uintmax\+\_\+t $>$\+::digits $>$}]{val }\end{DoxyParamCaption}) -\/$>$ int \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Floored integer binary logarithm. Returns floor(lb(val)). 

Returns the number of significant bits in the given integer. 

Definition at line \mbox{\hyperlink{simple_8h_source_l00166}{166}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a1b371704f5fe368fd747c6b39b712b0e}\label{namespace_k_b_l_i_b___n_s_a1b371704f5fe368fd747c6b39b712b0e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find@{find}}
\index{find@{find}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find()}{find()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Elem $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{const Elem \&}]{value }\end{DoxyParamCaption}) -\/$>$ Forward\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Finds a value in range \mbox{[}begin, end). If not found, returns end. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em value} & The value to search for \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
It Either the position of the found value, or end if not found 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00290}{290}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab598258691c5d6db7f4834e72b0ba48a}\label{namespace_k_b_l_i_b___n_s_ab598258691c5d6db7f4834e72b0ba48a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find@{find}}
\index{find@{find}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find()}{find()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Elem , typename Comp $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{const Elem \&}]{value,  }\item[{Comp \&\&}]{comp }\end{DoxyParamCaption}) -\/$>$ Forward\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Finds a value in range \mbox{[}begin, end). If not found, returns end. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em value} & The value to search for \\
\hline
{\em comp} & The comparison function \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
It Either the position of the found value, or end if not found 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00309}{309}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af881ba9efd10b46a2c1e5af03cbc863c}\label{namespace_k_b_l_i_b___n_s_af881ba9efd10b46a2c1e5af03cbc863c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_if@{find\_if}}
\index{find\_if@{find\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_if()}{find\_if()}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+if (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{Unary\+Predicate \&\&}]{pred }\end{DoxyParamCaption}) -\/$>$ Forward\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Finds the first value in range \mbox{[}begin, end) for which pred returns true. If not found, returns end. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em pred} & The predicate to scan with \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
It Either the position of the found value, or end if not found 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00327}{327}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_abd5ee6f314e18478c56920d3c7e44f12}\label{namespace_k_b_l_i_b___n_s_abd5ee6f314e18478c56920d3c7e44f12}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_if\_not@{find\_if\_not}}
\index{find\_if\_not@{find\_if\_not}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_if\_not()}{find\_if\_not()}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+if\+\_\+not (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{Unary\+Predicate \&\&}]{pred }\end{DoxyParamCaption}) -\/$>$ Forward\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Finds the first value in range \mbox{[}begin, end) for which pred returns false. If not found, returns end. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em pred} & The predicate to scan with \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
It Either the position of the found value, or end if not found 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00346}{346}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a25abbc78ac92a8aa83f15107b0cdbf1a}\label{namespace_k_b_l_i_b___n_s_a25abbc78ac92a8aa83f15107b0cdbf1a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_in@{find\_in}}
\index{find\_in@{find\_in}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_in()}{find\_in()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Container , typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+in (\begin{DoxyParamCaption}\item[{const Container \&}]{c,  }\item[{const T \&}]{value }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the first element in c equal to v and return the position. 

Equivalent to find\+\_\+in(begin(c), end(c), v)


\begin{DoxyParams}{Parameters}
{\em c} & The container to search. \\
\hline
{\em value} & The value to search for. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The position of the element found, or size(c) if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00559}{559}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a4c94ada1643743e3446527183d63fd27}\label{namespace_k_b_l_i_b___n_s_a4c94ada1643743e3446527183d63fd27}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_in@{find\_in}}
\index{find\_in@{find\_in}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_in()}{find\_in()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Elem $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+in (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{const Elem \&}]{value }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the offset of the first ocurrence of v in a range from the beginning. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em value} & The value to search for. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The offset from begin of the first element equal to v, or distance(begin, end) if not found. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00458}{458}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a302815dcc914c42a780153b88f388744}\label{namespace_k_b_l_i_b___n_s_a302815dcc914c42a780153b88f388744}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_in\_if@{find\_in\_if}}
\index{find\_in\_if@{find\_in\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_in\_if()}{find\_in\_if()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Container , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+in\+\_\+if (\begin{DoxyParamCaption}\item[{const Container \&}]{c,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the first element in c for which p returns true and return the position. 

Equivalent to find\+\_\+in\+\_\+if(begin(c), end(c), p)


\begin{DoxyParams}{Parameters}
{\em c} & The container to search in. \\
\hline
{\em pred} & The predicate to check. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The position of the element found, or size(c) if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00585}{585}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae408943e86a7c20b360c60ab896dce68}\label{namespace_k_b_l_i_b___n_s_ae408943e86a7c20b360c60ab896dce68}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_in\_if@{find\_in\_if}}
\index{find\_in\_if@{find\_in\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_in\_if()}{find\_in\_if()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+in\+\_\+if (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the offset of the first element for which p returns true. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em pred} & The predicate to check. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The offset from begin of the element found, or distance(begin, end) if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00474}{474}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a63375b36bfee215035ef586234228d43}\label{namespace_k_b_l_i_b___n_s_a63375b36bfee215035ef586234228d43}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_in\_if\_not@{find\_in\_if\_not}}
\index{find\_in\_if\_not@{find\_in\_if\_not}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_in\_if\_not()}{find\_in\_if\_not()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Container , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+in\+\_\+if\+\_\+not (\begin{DoxyParamCaption}\item[{const Container \&}]{c,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the first element in c for which p returns false and return the position. 

Equivalent to find\+\_\+in\+\_\+if\+\_\+not(begin(c), end(c), p)


\begin{DoxyParams}{Parameters}
{\em c} & The container to search in. \\
\hline
{\em pred} & The predicate to check. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The position of the element found, or size(c) if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00607}{607}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa78cb738c35166ad527997636f0308c3}\label{namespace_k_b_l_i_b___n_s_aa78cb738c35166ad527997636f0308c3}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_in\_if\_not@{find\_in\_if\_not}}
\index{find\_in\_if\_not@{find\_in\_if\_not}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_in\_if\_not()}{find\_in\_if\_not()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+in\+\_\+if\+\_\+not (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the offset of the first element for which p returns false. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em pred} & The predicate to check. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The offset from begin of the element found, or distance(begin, end) if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00490}{490}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a2480d244f4b70ac9c8e4121dbeb567e7}\label{namespace_k_b_l_i_b___n_s_a2480d244f4b70ac9c8e4121dbeb567e7}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_last@{find\_last}}
\index{find\_last@{find\_last}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_last()}{find\_last()}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Elem $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+last (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{const Elem \&}]{value }\end{DoxyParamCaption}) -\/$>$ Forward\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Searches a range for the last occurence of a match, and returns an iterator to it. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em value} & The value to find \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
It Iterator to the last element equal to v, or end if no such element. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00366}{366}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aed549300c926555a57e3b6f94a4210f6}\label{namespace_k_b_l_i_b___n_s_aed549300c926555a57e3b6f94a4210f6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_last\_if@{find\_last\_if}}
\index{find\_last\_if@{find\_last\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_last\_if()}{find\_last\_if()}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+last\+\_\+if (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ Forward\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Searches a range for the last element on which a predicate returns true. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em pred} & The predicate for comparison \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
It Iterator to the last element for which p returned true, or end if no such element. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00396}{396}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a944b52fe15f517de5a28a7489c069aed}\label{namespace_k_b_l_i_b___n_s_a944b52fe15f517de5a28a7489c069aed}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_last\_if\_not@{find\_last\_if\_not}}
\index{find\_last\_if\_not@{find\_last\_if\_not}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_last\_if\_not()}{find\_last\_if\_not()}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+last\+\_\+if\+\_\+not (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ Forward\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Searches a range for the last element on which a predicate returns false. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em pred} & The predicate for comparison \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
It Iterator to the last element for which p returned false, or end if no such element. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00427}{427}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3ed00b1116a7c99900949cdb4015414c}\label{namespace_k_b_l_i_b___n_s_a3ed00b1116a7c99900949cdb4015414c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_last\_in@{find\_last\_in}}
\index{find\_last\_in@{find\_last\_in}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_last\_in()}{find\_last\_in()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Container , typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+last\+\_\+in (\begin{DoxyParamCaption}\item[{const Container \&}]{c,  }\item[{const T \&}]{value }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the last element in c equal to v and return the position. 

Equivalent to find\+\_\+last\+\_\+in(std\+::begin(c), std\+::end(c), v)


\begin{DoxyParams}{Parameters}
{\em c} & The container to search. \\
\hline
{\em value} & The value to search for. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The position of the element found, or \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1fakestd_a0deab00201ce3a6a7fd28a63dea6a612}{c.\+size()}} if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00645}{645}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a70f6eb60ca2411cea0bb5a3b30ed3a6d}\label{namespace_k_b_l_i_b___n_s_a70f6eb60ca2411cea0bb5a3b30ed3a6d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_last\_in@{find\_last\_in}}
\index{find\_last\_in@{find\_last\_in}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_last\_in()}{find\_last\_in()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Elem $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+last\+\_\+in (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{const Elem \&}]{value }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the offset of the last ocurrence of v in a range from the beginning. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em value} & The value to search for. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The offset from begin of the element found, or distance(begin, end) if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00510}{510}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9e2a3db73a52b15f61658212102647a4}\label{namespace_k_b_l_i_b___n_s_a9e2a3db73a52b15f61658212102647a4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_last\_in\_if@{find\_last\_in\_if}}
\index{find\_last\_in\_if@{find\_last\_in\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_last\_in\_if()}{find\_last\_in\_if()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Container , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+last\+\_\+in\+\_\+if (\begin{DoxyParamCaption}\item[{const Container \&}]{c,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the last element in c for which p returns true and return the position. 

Equivalent to find\+\_\+last\+\_\+in\+\_\+if(std\+::begin(c), std\+::end(c), p)


\begin{DoxyParams}{Parameters}
{\em c} & The container to search in. \\
\hline
{\em pred} & The predicate to check. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The position of the element found, or \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1fakestd_a0deab00201ce3a6a7fd28a63dea6a612}{c.\+size()}} if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00664}{664}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad88aeb9508fdd0cf27e227803426fff6}\label{namespace_k_b_l_i_b___n_s_ad88aeb9508fdd0cf27e227803426fff6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_last\_in\_if@{find\_last\_in\_if}}
\index{find\_last\_in\_if@{find\_last\_in\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_last\_in\_if()}{find\_last\_in\_if()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+last\+\_\+in\+\_\+if (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in\\
\hline
{\em begin,end} & The range to search in \\
\hline
{\em pred} & The predicate to check. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The offset from begin of the element found, or distance(begin, end) if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00525}{525}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a611e38267ef1238f155b21b300fbf511}\label{namespace_k_b_l_i_b___n_s_a611e38267ef1238f155b21b300fbf511}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_last\_in\_if\_not@{find\_last\_in\_if\_not}}
\index{find\_last\_in\_if\_not@{find\_last\_in\_if\_not}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_last\_in\_if\_not()}{find\_last\_in\_if\_not()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Container , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+last\+\_\+in\+\_\+if\+\_\+not (\begin{DoxyParamCaption}\item[{const Container \&}]{c,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the last element in c for which p returns true and return the position. 

Equivalent to find\+\_\+last\+\_\+in\+\_\+if\+\_\+not(std\+::begin(c), std\+::end(c), p)


\begin{DoxyParams}{Parameters}
{\em c} & The container to search in. \\
\hline
{\em pred} & The predicate to check. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The position of the element found, or \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1fakestd_a0deab00201ce3a6a7fd28a63dea6a612}{c.\+size()}} if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00686}{686}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a39aac3fa0c92f5fe0d7c308f05a6164a}\label{namespace_k_b_l_i_b___n_s_a39aac3fa0c92f5fe0d7c308f05a6164a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_last\_in\_if\_not@{find\_last\_in\_if\_not}}
\index{find\_last\_in\_if\_not@{find\_last\_in\_if\_not}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_last\_in\_if\_not()}{find\_last\_in\_if\_not()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+last\+\_\+in\+\_\+if\+\_\+not (\begin{DoxyParamCaption}\item[{Forward\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Find the offset of the last element for which p returns false. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to search in \\
\hline
{\em pred} & The predicate to check. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
size\+\_\+t The offset from begin of the element found, or distance(begin, end) if not. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00541}{541}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7d74acf6df0eb6421a1411d2d2b95ee7}\label{namespace_k_b_l_i_b___n_s_a7d74acf6df0eb6421a1411d2d2b95ee7}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_match@{find\_match}}
\index{find\_match@{find\_match}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_match()}{find\_match()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename Binary\+Predicate  = std\+::equal\+\_\+to$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+match (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin1,  }\item[{End\+It1}]{end1,  }\item[{Input\+It2}]{begin2,  }\item[{Binary\+Predicate}]{cmp }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It1$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It2$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fakestd_1_1is__invocable}{is\+\_\+invocable}}$<$Binary\+Predicate, decltype($\ast$begin1),                                         decltype($\ast$begin2)$>$\+::value,                    std\+::pair$<$Input\+It1, Input\+It2$>$$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00701}{701}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a94512ed952a332ce3ed37d64f41e8104}\label{namespace_k_b_l_i_b___n_s_a94512ed952a332ce3ed37d64f41e8104}} 
\index{KBLIB\_NS@{KBLIB\_NS}!find\_match@{find\_match}}
\index{find\_match@{find\_match}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{find\_match()}{find\_match()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename End\+It2 , typename Binary\+Predicate  = std\+::equal\+\_\+to$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::find\+\_\+match (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin1,  }\item[{End\+It1}]{end1,  }\item[{Input\+It2}]{begin2,  }\item[{End\+It2}]{end2,  }\item[{Binary\+Predicate}]{cmp }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It1$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It2$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fakestd_1_1is__invocable}{is\+\_\+invocable}}$<$Binary\+Predicate, decltype($\ast$begin1),                                         decltype($\ast$begin2)$>$\+::value,                    std\+::pair$<$Input\+It1, Input\+It2$>$$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00717}{717}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a919627898c324974068a6d2ef7bed995}\label{namespace_k_b_l_i_b___n_s_a919627898c324974068a6d2ef7bed995}} 
\index{KBLIB\_NS@{KBLIB\_NS}!first\_result@{first\_result}}
\index{first\_result@{first\_result}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{first\_result()}{first\_result()}\hspace{0.1cm}{\footnotesize\ttfamily [1/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename T , typename Unary\+Transform $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::first\+\_\+result (\begin{DoxyParamCaption}\item[{Input\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{T}]{def,  }\item[{Unary\+Transform}]{op }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It$>$\+::value,                    std\+::decay\+\_\+t$<$decltype(op($\ast$begin))$>$$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00821}{821}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab599de18b69a0f7118610d6258fd2efb}\label{namespace_k_b_l_i_b___n_s_ab599de18b69a0f7118610d6258fd2efb}} 
\index{KBLIB\_NS@{KBLIB\_NS}!first\_result@{first\_result}}
\index{first\_result@{first\_result}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{first\_result()}{first\_result()}\hspace{0.1cm}{\footnotesize\ttfamily [2/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename End\+It2 , typename T , typename Binary\+Transform $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::first\+\_\+result (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin1,  }\item[{End\+It1}]{end1,  }\item[{Input\+It2}]{begin2,  }\item[{End\+It2}]{end2,  }\item[{T}]{def,  }\item[{Binary\+Transform}]{op }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It1$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It2$>$\+::value,                    std\+::decay\+\_\+t$<$decltype(op($\ast$begin1, $\ast$begin2))$>$$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00851}{851}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a33f4a56bcc2ff338cee41b057a8f2286}\label{namespace_k_b_l_i_b___n_s_a33f4a56bcc2ff338cee41b057a8f2286}} 
\index{KBLIB\_NS@{KBLIB\_NS}!first\_result@{first\_result}}
\index{first\_result@{first\_result}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{first\_result()}{first\_result()}\hspace{0.1cm}{\footnotesize\ttfamily [3/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename T , typename Binary\+Transform $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::first\+\_\+result (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin1,  }\item[{End\+It1}]{end1,  }\item[{Input\+It2}]{begin2,  }\item[{T}]{def,  }\item[{Binary\+Transform}]{op }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It1$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It2$>$\+::value,                    std\+::decay\+\_\+t$<$decltype(op($\ast$begin1, $\ast$begin2))$>$$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00835}{835}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af307bcafc7d275f274678f57149948c4}\label{namespace_k_b_l_i_b___n_s_af307bcafc7d275f274678f57149948c4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!first\_result\_if@{first\_result\_if}}
\index{first\_result\_if@{first\_result\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{first\_result\_if()}{first\_result\_if()}\hspace{0.1cm}{\footnotesize\ttfamily [1/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename T , typename Unary\+Transform , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::first\+\_\+result\+\_\+if (\begin{DoxyParamCaption}\item[{Input\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{T}]{def,  }\item[{Unary\+Transform}]{op,  }\item[{Unary\+Predicate}]{ch }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It$>$\+::value, decltype(op($\ast$begin))$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00868}{868}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a09ec8bf519253c73bb25f14914c35fab}\label{namespace_k_b_l_i_b___n_s_a09ec8bf519253c73bb25f14914c35fab}} 
\index{KBLIB\_NS@{KBLIB\_NS}!first\_result\_if@{first\_result\_if}}
\index{first\_result\_if@{first\_result\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{first\_result\_if()}{first\_result\_if()}\hspace{0.1cm}{\footnotesize\ttfamily [2/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename End\+It2 , typename T , typename Binary\+Transform , typename Binary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::first\+\_\+result\+\_\+if (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin1,  }\item[{End\+It1}]{end1,  }\item[{Input\+It2}]{begin2,  }\item[{End\+It2}]{end2,  }\item[{T}]{def,  }\item[{Binary\+Transform}]{op,  }\item[{Binary\+Predicate}]{ch }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It1$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It2$>$\+::value,                    decltype(op($\ast$begin1, $\ast$begin2))$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00898}{898}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a49b00e1cc37a530bf915891ec3db6e8a}\label{namespace_k_b_l_i_b___n_s_a49b00e1cc37a530bf915891ec3db6e8a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!first\_result\_if@{first\_result\_if}}
\index{first\_result\_if@{first\_result\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{first\_result\_if()}{first\_result\_if()}\hspace{0.1cm}{\footnotesize\ttfamily [3/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename T , typename Binary\+Transform , typename Binary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::first\+\_\+result\+\_\+if (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin1,  }\item[{End\+It1}]{end1,  }\item[{Input\+It2}]{begin2,  }\item[{T}]{def,  }\item[{Binary\+Transform}]{op,  }\item[{Binary\+Predicate}]{ch }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It1$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It2$>$\+::value,                    decltype(op($\ast$begin1, $\ast$begin2))$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00881}{881}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7d8e444ca9a68ffefb42047b3284804b}\label{namespace_k_b_l_i_b___n_s_a7d8e444ca9a68ffefb42047b3284804b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!first\_result\_opt@{first\_result\_opt}}
\index{first\_result\_opt@{first\_result\_opt}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{first\_result\_opt()}{first\_result\_opt()}\hspace{0.1cm}{\footnotesize\ttfamily [1/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename T , typename Unary\+Transform $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::first\+\_\+result\+\_\+opt (\begin{DoxyParamCaption}\item[{Input\+It}]{begin,  }\item[{End\+It}]{end,  }\item[{T}]{def,  }\item[{Unary\+Transform}]{op }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It$>$\+::value,                    std\+::decay\+\_\+t$<$decltype(op($\ast$begin))$>$$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00920}{920}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa0a57d4a98f80781d52cd6c440f7d7d2}\label{namespace_k_b_l_i_b___n_s_aa0a57d4a98f80781d52cd6c440f7d7d2}} 
\index{KBLIB\_NS@{KBLIB\_NS}!first\_result\_opt@{first\_result\_opt}}
\index{first\_result\_opt@{first\_result\_opt}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{first\_result\_opt()}{first\_result\_opt()}\hspace{0.1cm}{\footnotesize\ttfamily [2/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename End\+It2 , typename T , typename Binary\+Transform $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::first\+\_\+result\+\_\+opt (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin1,  }\item[{End\+It1}]{end1,  }\item[{Input\+It2}]{begin2,  }\item[{End\+It2}]{end2,  }\item[{T}]{def,  }\item[{Binary\+Transform}]{op }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It1$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It2$>$\+::value,                    std\+::decay\+\_\+t$<$decltype(op($\ast$begin1, $\ast$begin2))$>$$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00950}{950}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad86cf6f0fadb1b56df704cf0379bfa21}\label{namespace_k_b_l_i_b___n_s_ad86cf6f0fadb1b56df704cf0379bfa21}} 
\index{KBLIB\_NS@{KBLIB\_NS}!first\_result\_opt@{first\_result\_opt}}
\index{first\_result\_opt@{first\_result\_opt}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{first\_result\_opt()}{first\_result\_opt()}\hspace{0.1cm}{\footnotesize\ttfamily [3/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename T , typename Binary\+Transform $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::first\+\_\+result\+\_\+opt (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin1,  }\item[{End\+It1}]{end1,  }\item[{Input\+It2}]{begin2,  }\item[{T}]{def,  }\item[{Binary\+Transform}]{op }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It1$>$\+::value                        and \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It2$>$\+::value,                    std\+::decay\+\_\+t$<$decltype(op($\ast$begin1, $\ast$begin2))$>$$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00934}{934}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad06792c706d96d62d9d33d197ed31cba}\label{namespace_k_b_l_i_b___n_s_ad06792c706d96d62d9d33d197ed31cba}} 
\index{KBLIB\_NS@{KBLIB\_NS}!flip@{flip}}
\index{flip@{flip}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{flip()}{flip()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Binary\+Operation $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::flip (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ auto \hspace{0.3cm}{\ttfamily [constexpr]}}



Transforms a stateless binary operation into one which takes reversed arguments. 

For example, \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ad06792c706d96d62d9d33d197ed31cba}{kblib\+::flip$<$std\+::minus$<$$>$$>$()}} returns a function object which subtracts its first argument from its second.


\begin{DoxyTemplParams}{Template Parameters}
{\em Binary\+Operation} & The operation to reverse. \\
\hline
\end{DoxyTemplParams}


Definition at line \mbox{\hyperlink{simple_8h_source_l00122}{122}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a4546b777ad26d8727ad959e42e90348b}\label{namespace_k_b_l_i_b___n_s_a4546b777ad26d8727ad959e42e90348b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!flip@{flip}}
\index{flip@{flip}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{flip()}{flip()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Binary\+Operation $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::flip (\begin{DoxyParamCaption}\item[{Binary\+Operation}]{op }\end{DoxyParamCaption}) -\/$>$ auto \hspace{0.3cm}{\ttfamily [constexpr]}}



Transforms a binary operation into one which takes reversed arguments. 

For example, kblib\+::flip(std\+::minus$<$$>$\{\}) returns a function object which subtracts its first argument from its second.


\begin{DoxyParams}{Parameters}
{\em op} & The operation to reverse. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{simple_8h_source_l00138}{138}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aab79de4eda0bb13b69e09af3b77a19a4}\label{namespace_k_b_l_i_b___n_s_aab79de4eda0bb13b69e09af3b77a19a4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!FNV32a@{FNV32a}}
\index{FNV32a@{FNV32a}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{FNV32a()}{FNV32a()}}
{\footnotesize\ttfamily constexpr auto KBLIB\+\_\+\+NS\+::\+FNV32a (\begin{DoxyParamCaption}\item[{std\+::string\+\_\+view}]{s,  }\item[{std\+::uint32\+\_\+t}]{hval = {\ttfamily \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$std\+:\+:uint32\+\_\+t$>$\+:\+:value} }\end{DoxyParamCaption}) -\/$>$ std\+::uint32\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



A standard FNV32a hash function, for string\+\_\+views. 


\begin{DoxyParams}{Parameters}
{\em s} & The data to hash. \\
\hline
{\em hval} & The initial value for the hash accumulator. Pass in another hash value to create a hash of the concatenation of the two ranges. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
std\+::uint32\+\_\+t The FNV32a hash of the input range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{hash_8h_source_l00194}{194}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aaa66ede3e055ed8b1e4995ae3a47c3ea}\label{namespace_k_b_l_i_b___n_s_aaa66ede3e055ed8b1e4995ae3a47c3ea}} 
\index{KBLIB\_NS@{KBLIB\_NS}!FNV32a\_a@{FNV32a\_a}}
\index{FNV32a\_a@{FNV32a\_a}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{FNV32a\_a()}{FNV32a\_a()}}
{\footnotesize\ttfamily template$<$std\+::size\+\_\+t N$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::\+FNV32a\+\_\+a (\begin{DoxyParamCaption}\item[{const char(\&)}]{s\mbox{[}\+N\mbox{]},  }\item[{std\+::uint32\+\_\+t}]{hval = {\ttfamily \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$std\+:\+:uint32\+\_\+t$>$\+:\+:value} }\end{DoxyParamCaption}) -\/$>$ std\+::uint32\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



A standard FNV32a hash function, for raw character arrays, such as string literals. 


\begin{DoxyParams}{Parameters}
{\em s} & The data to hash. \\
\hline
{\em hval} & The initial value for the hash accumulator. Pass in another hash value to create a hash of the concatenation of the two ranges. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Hash\+Int The FNV32a hash of the input range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{hash_8h_source_l00233}{233}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a76885646ab4fe31f867c160702821734}\label{namespace_k_b_l_i_b___n_s_a76885646ab4fe31f867c160702821734}} 
\index{KBLIB\_NS@{KBLIB\_NS}!FNV32a\_s@{FNV32a\_s}}
\index{FNV32a\_s@{FNV32a\_s}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{FNV32a\_s()}{FNV32a\_s()}}
{\footnotesize\ttfamily constexpr auto KBLIB\+\_\+\+NS\+::\+FNV32a\+\_\+s (\begin{DoxyParamCaption}\item[{const char $\ast$}]{begin,  }\item[{std\+::size\+\_\+t}]{length,  }\item[{uint32\+\_\+t}]{hval = {\ttfamily \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$std\+:\+:uint32\+\_\+t$>$\+:\+:value} }\end{DoxyParamCaption}) -\/$>$ std\+::uint32\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{hash_8h_source_l00245}{245}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af0747d9c8141b019ddd78e233333f34e}\label{namespace_k_b_l_i_b___n_s_af0747d9c8141b019ddd78e233333f34e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!FNVa@{FNVa}}
\index{FNVa@{FNVa}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{FNVa()}{FNVa()}}
{\footnotesize\ttfamily template$<$typename Hash\+Int , typename Span $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::\+FNVa (\begin{DoxyParamCaption}\item[{Span \&\&}]{s,  }\item[{Hash\+Int}]{hval = {\ttfamily \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$HashInt$>$\+:\+:value} }\end{DoxyParamCaption}) -\/$>$ Hash\+Int \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



A templatized generic FNVa hash function. 


\begin{DoxyTemplParams}{Template Parameters}
{\em Hash\+Int} & The unsigned integer type to use as the hash result. Must be either std\+::uint32\+\_\+t or std\+::uint64\+\_\+t. \\
\hline
\end{DoxyTemplParams}

\begin{DoxyParams}{Parameters}
{\em s} & The data to hash. Any range-\/for-\/iterable span of char-\/like objects. \\
\hline
{\em hval} & The initial value for the hash accumulator. Pass in another hash value to create a hash of the concatenation of the two ranges. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Hash\+Int The FNVa hash of the input range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{hash_8h_source_l00147}{147}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6eba4b743d45ca972613d388984d603f}\label{namespace_k_b_l_i_b___n_s_a6eba4b743d45ca972613d388984d603f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!FNVa\_a@{FNVa\_a}}
\index{FNVa\_a@{FNVa\_a}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{FNVa\_a()}{FNVa\_a()}}
{\footnotesize\ttfamily template$<$typename Hash\+Int , typename CharT , std\+::size\+\_\+t N$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::\+FNVa\+\_\+a (\begin{DoxyParamCaption}\item[{const CharT(\&)}]{s\mbox{[}\+N\mbox{]},  }\item[{Hash\+Int}]{hval = {\ttfamily \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$HashInt$>$\+:\+:value} }\end{DoxyParamCaption}) -\/$>$ Hash\+Int \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



A templatized FNVa hash function, for raw character arrays, such as string literals. 


\begin{DoxyTemplParams}{Template Parameters}
{\em Hash\+Int} & The unsigned integer type to use as the hash result. Must be either std\+::uint32\+\_\+t or std\+::uint64\+\_\+t. \\
\hline
\end{DoxyTemplParams}

\begin{DoxyParams}{Parameters}
{\em s} & The data to hash. A raw array of char-\/like objects. \\
\hline
{\em hval} & The initial value for the hash accumulator. Pass in another hash value to create a hash of the concatenation of the two ranges. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Hash\+Int The FNVa hash of the input range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{hash_8h_source_l00173}{173}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa8ad42dbe9a4d629bacbe52fd216a284}\label{namespace_k_b_l_i_b___n_s_aa8ad42dbe9a4d629bacbe52fd216a284}} 
\index{KBLIB\_NS@{KBLIB\_NS}!FNVa\_s@{FNVa\_s}}
\index{FNVa\_s@{FNVa\_s}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{FNVa\_s()}{FNVa\_s()}}
{\footnotesize\ttfamily template$<$typename Hash\+Int $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::\+FNVa\+\_\+s (\begin{DoxyParamCaption}\item[{const char $\ast$}]{begin,  }\item[{std\+::size\+\_\+t}]{length,  }\item[{Hash\+Int}]{hval = {\ttfamily \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fnv_1_1fnv__offset}{fnv\+::fnv\+\_\+offset}}$<$HashInt$>$\+:\+:value} }\end{DoxyParamCaption}) -\/$>$ Hash\+Int \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{hash_8h_source_l00208}{208}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3c071760ec3d5f8b33ace9646e3ed830}\label{namespace_k_b_l_i_b___n_s_a3c071760ec3d5f8b33ace9646e3ed830}} 
\index{KBLIB\_NS@{KBLIB\_NS}!for\_each@{for\_each}}
\index{for\_each@{for\_each}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{for\_each()}{for\_each()}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Forward\+It2 , typename Binary\+Function $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::for\+\_\+each (\begin{DoxyParamCaption}\item[{Forward\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Forward\+It2}]{second,  }\item[{Binary\+Function}]{f }\end{DoxyParamCaption}) -\/$>$ Binary\+Function \hspace{0.3cm}{\ttfamily [constexpr]}}



Applies a binary operation to each pair of corresponding elements in two input ranges. It also allows for a sentinel end iterator. 

In the style of $<$algorithm$>$ algorithms, the second range is simply assumed to be at least as large as the first.


\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the first input range. \\
\hline
{\em last} & The end of the first input range. \\
\hline
{\em second} & The beginning of the second input range. \\
\hline
{\em f} & The operation to apply. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Binary\+Function f 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01280}{1280}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a302ab480723d5c251ecbc137767d8fa7}\label{namespace_k_b_l_i_b___n_s_a302ab480723d5c251ecbc137767d8fa7}} 
\index{KBLIB\_NS@{KBLIB\_NS}!for\_each\_n@{for\_each\_n}}
\index{for\_each\_n@{for\_each\_n}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{for\_each\_n()}{for\_each\_n()}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename Forward\+It2 , typename Size , typename Binary\+Function $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::for\+\_\+each\+\_\+n (\begin{DoxyParamCaption}\item[{Forward\+It}]{first,  }\item[{Size}]{n,  }\item[{Forward\+It2}]{second,  }\item[{Binary\+Function}]{f }\end{DoxyParamCaption}) -\/$>$ std\+::pair$<$Forward\+It, Forward\+It2$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Applies a binary operation to each pair of corresponding elements in two input ranges. 


\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the first input range. \\
\hline
{\em n} & The number of elements to operate on in each input range. \\
\hline
{\em second} & The beginning of the second input range. \\
\hline
{\em f} & The operation to apply. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
std\+::pair$<$\+Forward\+It, Forward\+It2$>$ Equivalent to {\ttfamily \{std\+::advance(first, n), std\+::advance(second, n)\}} 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01301}{1301}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_afa151cd6cf7b51b2807c1d37ae19f962}\label{namespace_k_b_l_i_b___n_s_afa151cd6cf7b51b2807c1d37ae19f962}} 
\index{KBLIB\_NS@{KBLIB\_NS}!force\_shrink\_to\_fit@{force\_shrink\_to\_fit}}
\index{force\_shrink\_to\_fit@{force\_shrink\_to\_fit}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{force\_shrink\_to\_fit()}{force\_shrink\_to\_fit()}}
{\footnotesize\ttfamily template$<$typename V $>$ \\
auto KBLIB\+\_\+\+NS\+::force\+\_\+shrink\+\_\+to\+\_\+fit (\begin{DoxyParamCaption}\item[{V \&}]{vec }\end{DoxyParamCaption}) -\/$>$ void }



std\+::vector\+::shrink\+\_\+to\+\_\+fit is non-\/binding, which means that there is no guaranteed way to shrink a vector via its API. This function is a roundabout way of doing that without relying on the sanity of the implementation (except that it assumes that a vector won\textquotesingle{}t significantly over-\/allocate on sized construction). 

This function explicitly constructs a new vector and moves into it, before overwriting the old vector with the new one, meaning that the vector is forced to forget its capacity.

This function provides the strong exception guarantee.


\begin{DoxyParams}{Parameters}
{\em vec} & The vector to force-\/shrink. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{containers_8h_source_l00116}{116}} of file \mbox{\hyperlink{containers_8h_source}{containers.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a0ad26f81eb26067326d49bf820470cd5}\label{namespace_k_b_l_i_b___n_s_a0ad26f81eb26067326d49bf820470cd5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [1/15]}}
{\footnotesize\ttfamily template$<$typename To , typename \+\_\+ $>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{const char $\ast$}]{val,  }\item[{const char $\ast$}]{type = {\ttfamily typeid(To).name()},  }\item[{\+\_\+}]{ = {\ttfamily 0} }\end{DoxyParamCaption}) -\/$>$ To }



Definition at line \mbox{\hyperlink{convert_8h_source_l00736}{736}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a48406ee96a15c1c584fc94efe8253210}\label{namespace_k_b_l_i_b___n_s_a48406ee96a15c1c584fc94efe8253210}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [2/15]}}
{\footnotesize\ttfamily template$<$typename To , std\+::size\+\_\+t N$>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{const char(\&)}]{val\mbox{[}\+N\mbox{]},  }\item[{const char $\ast$}]{type = {\ttfamily typeid(To).name()} }\end{DoxyParamCaption}) -\/$>$ To }



Definition at line \mbox{\hyperlink{convert_8h_source_l00729}{729}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a532bcd325109f07bdd0e1e0fc4153a17}\label{namespace_k_b_l_i_b___n_s_a532bcd325109f07bdd0e1e0fc4153a17}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [3/15]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{const icu\+::\+Unicode\+String \&}]{val,  }\item[{const char $\ast$}]{type = {\ttfamily typeid(T).name()} }\end{DoxyParamCaption}) -\/$>$ T }



Reencodes val to UTF-\/8 and then converts it to T using the primary overload. 


\begin{DoxyParams}{Parameters}
{\em val} & A string holding data to convert. \\
\hline
{\em type} & A type name to be used in error messages. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
T The converted value. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{icu_8h_source_l00149}{149}} of file \mbox{\hyperlink{icu_8h_source}{icu.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6696f1778e72416eb867888d4fea61a5}\label{namespace_k_b_l_i_b___n_s_a6696f1778e72416eb867888d4fea61a5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [4/15]}}
{\footnotesize\ttfamily template$<$$>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{const std\+::string \&}]{val,  }\item[{const char $\ast$}]{ }\end{DoxyParamCaption}) -\/$>$ std\+::string \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00641}{641}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a17c280a89bb09bcbd37ee32416ed9689}\label{namespace_k_b_l_i_b___n_s_a17c280a89bb09bcbd37ee32416ed9689}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [5/15]}}
{\footnotesize\ttfamily template$<$$>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{const std\+::string \&}]{val,  }\item[{const char $\ast$}]{ }\end{DoxyParamCaption}) -\/$>$ std\+::string\+\_\+view \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00688}{688}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a03447c78b380cf781fc013cf614c7175}\label{namespace_k_b_l_i_b___n_s_a03447c78b380cf781fc013cf614c7175}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [6/15]}}
{\footnotesize\ttfamily template$<$$>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{const std\+::string \&}]{val,  }\item[{const char $\ast$}]{type }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00646}{646}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3f39491493e5be735e95d23736c563c4}\label{namespace_k_b_l_i_b___n_s_a3f39491493e5be735e95d23736c563c4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [7/15]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{const std\+::string \&}]{val,  }\item[{const char $\ast$}]{type = {\ttfamily typeid(T).name()} }\end{DoxyParamCaption}) -\/$>$ T }



Definition at line \mbox{\hyperlink{convert_8h_source_l00630}{630}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a287fe99f0ef28039e5634b7f1b9c7914}\label{namespace_k_b_l_i_b___n_s_a287fe99f0ef28039e5634b7f1b9c7914}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [8/15]}}
{\footnotesize\ttfamily template$<$$>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{std\+::string \&\&}]{val,  }\item[{const char $\ast$}]{type }\end{DoxyParamCaption}) -\/$>$  std\+::string\+\_\+view=delete\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [delete]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00669}{669}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a46ec9825a8b00ab4ad0ec8cb2a60ae84}\label{namespace_k_b_l_i_b___n_s_a46ec9825a8b00ab4ad0ec8cb2a60ae84}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [9/15]}}
{\footnotesize\ttfamily template$<$$>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{std\+::string \&\&}]{val,  }\item[{const char $\ast$}]{ }\end{DoxyParamCaption}) -\/$>$ std\+::string \hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [delete]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00669}{669}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3cf0f36c982e7d47d732d8fbb510a32d}\label{namespace_k_b_l_i_b___n_s_a3cf0f36c982e7d47d732d8fbb510a32d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [10/15]}}
{\footnotesize\ttfamily template$<$$>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{std\+::string \&\&}]{val,  }\item[{const char $\ast$}]{type }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [delete]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00674}{674}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7ac03c4c18ea3b809711a57d06d39fca}\label{namespace_k_b_l_i_b___n_s_a7ac03c4c18ea3b809711a57d06d39fca}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [11/15]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{std\+::string \&\&}]{val,  }\item[{const char $\ast$}]{type = {\ttfamily typeid(T).name()} }\end{DoxyParamCaption}) -\/$>$ T }



Definition at line \mbox{\hyperlink{convert_8h_source_l00658}{658}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa6e272cde4df4fa43377752f4d227c85}\label{namespace_k_b_l_i_b___n_s_aa6e272cde4df4fa43377752f4d227c85}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [12/15]}}
{\footnotesize\ttfamily template$<$$>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{std\+::string\+\_\+view}]{val,  }\item[{const char $\ast$}]{ }\end{DoxyParamCaption}) -\/$>$ std\+::string \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00712}{712}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aaf3955d727d1acafa039ffdf4b469c02}\label{namespace_k_b_l_i_b___n_s_aaf3955d727d1acafa039ffdf4b469c02}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [13/15]}}
{\footnotesize\ttfamily template$<$$>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{std\+::string\+\_\+view}]{val,  }\item[{const char $\ast$}]{ }\end{DoxyParamCaption}) -\/$>$ std\+::string\+\_\+view \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00707}{707}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a126336c47fe275c31620b77381671daa}\label{namespace_k_b_l_i_b___n_s_a126336c47fe275c31620b77381671daa}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [14/15]}}
{\footnotesize\ttfamily template$<$$>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{std\+::string\+\_\+view}]{val,  }\item[{const char $\ast$}]{type }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00717}{717}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_acd010b9513921e8ae3d401b1d8cd0de1}\label{namespace_k_b_l_i_b___n_s_acd010b9513921e8ae3d401b1d8cd0de1}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromStr@{fromStr}}
\index{fromStr@{fromStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromStr()}{fromStr()}\hspace{0.1cm}{\footnotesize\ttfamily [15/15]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::from\+Str (\begin{DoxyParamCaption}\item[{std\+::string\+\_\+view}]{val,  }\item[{const char $\ast$}]{type = {\ttfamily typeid(T).name()} }\end{DoxyParamCaption}) -\/$>$ T }



Definition at line \mbox{\hyperlink{convert_8h_source_l00696}{696}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af80748de88bdb05d72a06e9e07141d6b}\label{namespace_k_b_l_i_b___n_s_af80748de88bdb05d72a06e9e07141d6b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromUTF32@{fromUTF32}}
\index{fromUTF32@{fromUTF32}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromUTF32()}{fromUTF32()}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::from\+UTF32 (\begin{DoxyParamCaption}\item[{string}]{s }\end{DoxyParamCaption}) -\/$>$ icu\+::\+Unicode\+String }



Converts a UTF-\/32 string into a Unicode\+String. 

This functionality is present in ICU, and is only provided here for consistency with the above.


\begin{DoxyParams}{Parameters}
{\em s} & The string to convert. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
icu\+::\+Unicode\+String The re-\/encoded result. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{icu_8h_source_l00099}{99}} of file \mbox{\hyperlink{icu_8h_source}{icu.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a8db3286ffbdbe00e0fbab7ea663fe726}\label{namespace_k_b_l_i_b___n_s_a8db3286ffbdbe00e0fbab7ea663fe726}} 
\index{KBLIB\_NS@{KBLIB\_NS}!fromUTF8@{fromUTF8}}
\index{fromUTF8@{fromUTF8}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{fromUTF8()}{fromUTF8()}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::from\+UTF8 (\begin{DoxyParamCaption}\item[{string}]{s }\end{DoxyParamCaption}) -\/$>$ icu\+::\+Unicode\+String }



Convert a UTF-\/8 string into a Unicode\+String. 

This functionality is present in ICU, and is only provided here for consistency with the above.


\begin{DoxyParams}{Parameters}
{\em s} & The string to convert. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
icu\+::\+Unicode\+String The re-\/encoded result. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{icu_8h_source_l00067}{67}} of file \mbox{\hyperlink{icu_8h_source}{icu.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a612055bb1a634762caa8dd618c2953db}\label{namespace_k_b_l_i_b___n_s_a612055bb1a634762caa8dd618c2953db}} 
\index{KBLIB\_NS@{KBLIB\_NS}!generate@{generate}}
\index{generate@{generate}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{generate()}{generate()}}
{\footnotesize\ttfamily template$<$typename Output\+It , typename End\+It , typename Generator $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::generate (\begin{DoxyParamCaption}\item[{Output\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Generator}]{g }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Like std\+::generate except that it returns the output iterator at the end. It also allows for a sentinel end iterator. 


\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the ouput range. \\
\hline
{\em last} & The end of the output range. \\
\hline
{\em g} & A generator to repeatedly call and assign the return values to the elements of the output range. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Forward\+It The iterator pointing past the last element written. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01545}{1545}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a5903e8e7c1f64ca8e42eb3dc5399f5c0}\label{namespace_k_b_l_i_b___n_s_a5903e8e7c1f64ca8e42eb3dc5399f5c0}} 
\index{KBLIB\_NS@{KBLIB\_NS}!generate\_n@{generate\_n}}
\index{generate\_n@{generate\_n}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{generate\_n()}{generate\_n()}}
{\footnotesize\ttfamily template$<$typename Output\+It , typename Size , typename Generator $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::generate\+\_\+n (\begin{DoxyParamCaption}\item[{Output\+It}]{first,  }\item[{Size}]{count,  }\item[{Generator}]{g }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Like std\+::generate\+\_\+n except that it is constexpr. 


\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the ouput range. \\
\hline
{\em count} & The number of elements to generate. \\
\hline
{\em g} & A generator to repeatedly call and assign the return values to the elements of the output range. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Forward\+It The iterator pointing past the last element written. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01565}{1565}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae923e695f4780fd2e69c574be26d54ab}\label{namespace_k_b_l_i_b___n_s_ae923e695f4780fd2e69c574be26d54ab}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get@{get}}
\index{get@{get}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get()}{get()}\hspace{0.1cm}{\footnotesize\ttfamily [1/8]}}
{\footnotesize\ttfamily template$<$std\+::size\+\_\+t I, typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::get (\begin{DoxyParamCaption}\item[{const \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumeration}{enumeration}}$<$ T $>$ \&\&}]{e }\end{DoxyParamCaption}) -\/$>$ decltype(auto) }



Definition at line \mbox{\hyperlink{iterators_8h_source_l00834}{834}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab2ceadc87bff23b01f43a9f834659563}\label{namespace_k_b_l_i_b___n_s_ab2ceadc87bff23b01f43a9f834659563}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get@{get}}
\index{get@{get}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get()}{get()}\hspace{0.1cm}{\footnotesize\ttfamily [2/8]}}
{\footnotesize\ttfamily template$<$std\+::size\+\_\+t I, typename... Types$>$ \\
auto KBLIB\+\_\+\+NS\+::get (\begin{DoxyParamCaption}\item[{const \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1punner}{punner}}$<$ Types... $>$ \&\&}]{p }\end{DoxyParamCaption}) -\/$>$ decltype(auto) \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{bits_8h_source_l00749}{749}} of file \mbox{\hyperlink{bits_8h_source}{bits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_afaef1b8bd63b77ba2182309130f72caf}\label{namespace_k_b_l_i_b___n_s_afaef1b8bd63b77ba2182309130f72caf}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get@{get}}
\index{get@{get}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get()}{get()}\hspace{0.1cm}{\footnotesize\ttfamily [3/8]}}
{\footnotesize\ttfamily template$<$std\+::size\+\_\+t I, typename... Types$>$ \\
auto KBLIB\+\_\+\+NS\+::get (\begin{DoxyParamCaption}\item[{const \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1punner}{punner}}$<$ Types... $>$ \&}]{p }\end{DoxyParamCaption}) -\/$>$ decltype(auto) \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{bits_8h_source_l00741}{741}} of file \mbox{\hyperlink{bits_8h_source}{bits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_afd76863f7b74e75212aa6fb592dcbbf9}\label{namespace_k_b_l_i_b___n_s_afd76863f7b74e75212aa6fb592dcbbf9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get@{get}}
\index{get@{get}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get()}{get()}\hspace{0.1cm}{\footnotesize\ttfamily [4/8]}}
{\footnotesize\ttfamily template$<$std\+::size\+\_\+t I, typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::get (\begin{DoxyParamCaption}\item[{const volatile \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumeration}{enumeration}}$<$ T $>$ \&}]{e }\end{DoxyParamCaption}) -\/$>$ decltype(auto) }



Definition at line \mbox{\hyperlink{iterators_8h_source_l00855}{855}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af2e5b4f458eeec06c6eeda37fb35a18f}\label{namespace_k_b_l_i_b___n_s_af2e5b4f458eeec06c6eeda37fb35a18f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get@{get}}
\index{get@{get}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get()}{get()}\hspace{0.1cm}{\footnotesize\ttfamily [5/8]}}
{\footnotesize\ttfamily template$<$std\+::size\+\_\+t I, typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::get (\begin{DoxyParamCaption}\item[{\mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumeration}{enumeration}}$<$ T $>$ \&\&}]{e }\end{DoxyParamCaption}) -\/$>$ decltype(auto) }



Definition at line \mbox{\hyperlink{iterators_8h_source_l00825}{825}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a1600b5da6d6ce91713c9743d803860ba}\label{namespace_k_b_l_i_b___n_s_a1600b5da6d6ce91713c9743d803860ba}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get@{get}}
\index{get@{get}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get()}{get()}\hspace{0.1cm}{\footnotesize\ttfamily [6/8]}}
{\footnotesize\ttfamily template$<$std\+::size\+\_\+t I, typename... Types$>$ \\
auto KBLIB\+\_\+\+NS\+::get (\begin{DoxyParamCaption}\item[{\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1punner}{punner}}$<$ Types... $>$ \&\&}]{p }\end{DoxyParamCaption}) -\/$>$ decltype(auto) \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{bits_8h_source_l00745}{745}} of file \mbox{\hyperlink{bits_8h_source}{bits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af860681f5cf19cd64006f9e71aae5de9}\label{namespace_k_b_l_i_b___n_s_af860681f5cf19cd64006f9e71aae5de9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get@{get}}
\index{get@{get}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get()}{get()}\hspace{0.1cm}{\footnotesize\ttfamily [7/8]}}
{\footnotesize\ttfamily template$<$std\+::size\+\_\+t I, typename... Types$>$ \\
auto KBLIB\+\_\+\+NS\+::get (\begin{DoxyParamCaption}\item[{\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1punner}{punner}}$<$ Types... $>$ \&}]{p }\end{DoxyParamCaption}) -\/$>$ decltype(auto) \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{bits_8h_source_l00737}{737}} of file \mbox{\hyperlink{bits_8h_source}{bits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa37ef0e45738b6d686cbaaa768851a01}\label{namespace_k_b_l_i_b___n_s_aa37ef0e45738b6d686cbaaa768851a01}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get@{get}}
\index{get@{get}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get()}{get()}\hspace{0.1cm}{\footnotesize\ttfamily [8/8]}}
{\footnotesize\ttfamily template$<$std\+::size\+\_\+t I, typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::get (\begin{DoxyParamCaption}\item[{volatile \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumeration}{enumeration}}$<$ T $>$ \&}]{e }\end{DoxyParamCaption}) -\/$>$ decltype(auto) }



Definition at line \mbox{\hyperlink{iterators_8h_source_l00845}{845}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a921a1defcfee6373bc3438e48723d43c}\label{namespace_k_b_l_i_b___n_s_a921a1defcfee6373bc3438e48723d43c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_byte\_index@{get\_byte\_index}}
\index{get\_byte\_index@{get\_byte\_index}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_byte\_index()}{get\_byte\_index()}\hspace{0.1cm}{\footnotesize\ttfamily [1/4]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::get\+\_\+byte\+\_\+index (\begin{DoxyParamCaption}\item[{const std\+::unique\+\_\+ptr$<$ T $>$ \&}]{x,  }\item[{std\+::size\+\_\+t}]{idx }\end{DoxyParamCaption}) -\/$>$ unsigned char \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{sort_8h_source_l00317}{317}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3ff0abf4a62bba732550cebc00e9d627}\label{namespace_k_b_l_i_b___n_s_a3ff0abf4a62bba732550cebc00e9d627}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_byte\_index@{get\_byte\_index}}
\index{get\_byte\_index@{get\_byte\_index}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_byte\_index()}{get\_byte\_index()}\hspace{0.1cm}{\footnotesize\ttfamily [2/4]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::get\+\_\+byte\+\_\+index (\begin{DoxyParamCaption}\item[{const T \&}]{x,  }\item[{std\+::size\+\_\+t}]{idx }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$std\+::is\+\_\+enum$<$T$>$\+::value, unsigned char$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{sort_8h_source_l00304}{304}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ade0bfb558c64d64baebf8403d543ef7e}\label{namespace_k_b_l_i_b___n_s_ade0bfb558c64d64baebf8403d543ef7e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_byte\_index@{get\_byte\_index}}
\index{get\_byte\_index@{get\_byte\_index}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_byte\_index()}{get\_byte\_index()}\hspace{0.1cm}{\footnotesize\ttfamily [3/4]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::get\+\_\+byte\+\_\+index (\begin{DoxyParamCaption}\item[{T $\ast$}]{x,  }\item[{std\+::size\+\_\+t}]{idx }\end{DoxyParamCaption}) -\/$>$ unsigned char \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{sort_8h_source_l00312}{312}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a4b62a75396110b0508551695d3942dd9}\label{namespace_k_b_l_i_b___n_s_a4b62a75396110b0508551695d3942dd9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_byte\_index@{get\_byte\_index}}
\index{get\_byte\_index@{get\_byte\_index}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_byte\_index()}{get\_byte\_index()}\hspace{0.1cm}{\footnotesize\ttfamily [4/4]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::get\+\_\+byte\+\_\+index (\begin{DoxyParamCaption}\item[{T}]{x,  }\item[{std\+::size\+\_\+t}]{idx }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$std\+::is\+\_\+integral$<$T$>$\+::value, unsigned char$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{sort_8h_source_l00299}{299}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a108b96be4f7cd2e9c6bc27c068e4b276}\label{namespace_k_b_l_i_b___n_s_a108b96be4f7cd2e9c6bc27c068e4b276}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_check@{get\_check}}
\index{get\_check@{get\_check}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_check()}{get\_check()}}
{\footnotesize\ttfamily template$<$typename M , typename K $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::get\+\_\+check (\begin{DoxyParamCaption}\item[{M \&\&}]{m,  }\item[{const K \&}]{key }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1exists__t}{exists\+\_\+t}}$<$decltype(m.\+find(key))$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{containers_8h_source_l00094}{94}} of file \mbox{\hyperlink{containers_8h_source}{containers.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_afd071cc902b09eb4ad7d10d5a6633726}\label{namespace_k_b_l_i_b___n_s_afd071cc902b09eb4ad7d10d5a6633726}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_contents@{get\_contents}}
\index{get\_contents@{get\_contents}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_contents()}{get\_contents()}}
{\footnotesize\ttfamily template$<$typename D  = std\+::string, typename std\+::enable\+\_\+if\+\_\+t$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a2530a939dc0029a61d40e4b71d24a326}{is\+\_\+contiguous\+\_\+v}}$<$ D $>$, int $>$  = 0$>$ \\
auto KBLIB\+\_\+\+NS\+::get\+\_\+contents (\begin{DoxyParamCaption}\item[{std\+::istream \&}]{in,  }\item[{D \&}]{out }\end{DoxyParamCaption}) -\/$>$ auto }



Definition at line \mbox{\hyperlink{io_8h_source_l00064}{64}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aba04cedec1ef721c75a36dce689da437}\label{namespace_k_b_l_i_b___n_s_aba04cedec1ef721c75a36dce689da437}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_file\_contents@{get\_file\_contents}}
\index{get\_file\_contents@{get\_file\_contents}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_file\_contents()}{get\_file\_contents()}}
{\footnotesize\ttfamily template$<$typename D  = std\+::string, typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::get\+\_\+file\+\_\+contents (\begin{DoxyParamCaption}\item[{const string \&}]{filename }\end{DoxyParamCaption}) -\/$>$ std\+::optional$<$D$>$ }



Read the entire contents of a file into a container, such as std\+::string or std\+::vector$<$char$>$. Note that it will be most efficient to read into contiguous containers, as opposed to non-\/contiguous containers. 


\begin{DoxyParams}{Parameters}
{\em filename} & The filename to open. \\
\hline
\end{DoxyParams}

\begin{DoxyTemplParams}{Template Parameters}
{\em D} & A contiguous sequence container, which will be created and filled with the contents of the file to be read. \\
\hline
\end{DoxyTemplParams}
\begin{DoxyReturn}{Returns}
std\+::optional$<$\+D$>$ The contents of the file, if reading was successful. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{io_8h_source_l00097}{97}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a2e695575cd5559244934def460f26371}\label{namespace_k_b_l_i_b___n_s_a2e695575cd5559244934def460f26371}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_line@{get\_line}}
\index{get\_line@{get\_line}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_line()}{get\_line()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename CharT , typename... O, template$<$ typename, typename... $>$ class string$>$ \\
auto KBLIB\+\_\+\+NS\+::get\+\_\+line (\begin{DoxyParamCaption}\item[{string$<$ CharT, O... $>$ \&}]{str }\end{DoxyParamCaption}) -\/$>$ auto \hspace{0.3cm}{\ttfamily [inline]}}



Read a whole line into a std\+::basic\+\_\+string-\/like class template. 

When used like os \texorpdfstring{$>$}{>}\texorpdfstring{$>$}{>} get\+\_\+line(str); for a std\+::ostream\& os and std\+::string str, reads a full line into str instead of just a single word.


\begin{DoxyParams}{Parameters}
{\em str} & The string to read a line into. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{io_8h_source_l00340}{340}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af66d5ff3fbe72d06b07aab4964fdf5e2}\label{namespace_k_b_l_i_b___n_s_af66d5ff3fbe72d06b07aab4964fdf5e2}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_line@{get\_line}}
\index{get\_line@{get\_line}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_line()}{get\_line()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename CharT , typename... O, template$<$ typename, typename... $>$ class string$>$ \\
auto KBLIB\+\_\+\+NS\+::get\+\_\+line (\begin{DoxyParamCaption}\item[{string$<$ CharT, O... $>$ \&}]{str,  }\item[{CharT}]{delim }\end{DoxyParamCaption}) -\/$>$ auto \hspace{0.3cm}{\ttfamily [inline]}}



Read a delimited string into a std\+::basic\+\_\+string-\/like class template. 

When used like os \texorpdfstring{$>$}{>}\texorpdfstring{$>$}{>} get\+\_\+line(str, \textquotesingle{}~\newline
\textquotesingle{}); for a std\+::ostream\& os and std\+::string str, reads a full line into str instead of just a single word.


\begin{DoxyParams}{Parameters}
{\em str} & The string to read into. \\
\hline
{\em delim} & The delimiter at which to stop reading text. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{io_8h_source_l00361}{361}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6f34329432db49c238fe9c3484a5be35}\label{namespace_k_b_l_i_b___n_s_a6f34329432db49c238fe9c3484a5be35}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_max\_n@{get\_max\_n}}
\index{get\_max\_n@{get\_max\_n}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_max\_n()}{get\_max\_n()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Comp  = std\+::less$<$$>$, typename Input\+It , typename Output\+It , typename Elem  = typename std\+::iterator\+\_\+traits$<$\+Input\+It$>$\+::value\+\_\+type$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::get\+\_\+max\+\_\+n (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{Output\+It}]{d\+\_\+begin,  }\item[{std\+::size\+\_\+t}]{count,  }\item[{Comp}]{cmp = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}{return\+\_\+assert\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__output__iterator__for}{is\+\_\+output\+\_\+iterator\+\_\+for}}$<$Output\+It, Elem$>$\+::value,                        Output\+It$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Copies the count greatest elements according to cmp of the range \mbox{[}first, last) to the range beginning at d\+\_\+begin. 

Note that this function uses O(count) extra memory to store a mutable range for sorting. Directly calling std\+::partial\+\_\+sort\+\_\+copy with a properly sized container will be more efficient than this function because it avoids allocating extra working memory. This function should rather be used for non-\/random-\/access output ranges.


\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the range. \\
\hline
{\em last} & One past the end of the range. \\
\hline
{\em d\+\_\+begin} & The beginning of the output range. \\
\hline
{\em count} & The number of elements to copy out of the range. \\
\hline
{\em cmp} & The comparison function to use. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Output\+It An iterator to past the last element written. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01257}{1257}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af9ddb02938da5e8e7628accbec90f272}\label{namespace_k_b_l_i_b___n_s_af9ddb02938da5e8e7628accbec90f272}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_max\_n@{get\_max\_n}}
\index{get\_max\_n@{get\_max\_n}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_max\_n()}{get\_max\_n()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Sequence\+Container , typename Comp  = std\+::less$<$$>$, typename It , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ is\+\_\+linear\+\_\+container\+\_\+v$<$ Sequence\+Container $>$, int $>$  = 0$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::get\+\_\+max\+\_\+n (\begin{DoxyParamCaption}\item[{It}]{first,  }\item[{It}]{last,  }\item[{std\+::size\+\_\+t}]{count,  }\item[{Comp}]{cmp = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ Sequence\+Container \hspace{0.3cm}{\ttfamily [constexpr]}}



Returns a container of the greatest count elements according to cmp of the range \mbox{[}first, last), in descending order. This overload works for linear containers. 

Returns a container of the greatest count elements according to cmp of the range \mbox{[}first, last). This overload works for set-\/like containers.


\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the range. \\
\hline
{\em last} & One past the end of the range. \\
\hline
{\em count} & The number of elements to copy out of the range. \\
\hline
{\em cmp} & The comparison function to use. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Sequence\+Container The greatest count elements of the range, in arbitrary order.
\end{DoxyReturn}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the range. \\
\hline
{\em last} & One past the end of the range. \\
\hline
{\em count} & The number of elements to copy out of the range. \\
\hline
{\em cmp} & The comparison function to use. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Setlike\+Container The greatest count elements of the range, in arbitrary order. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01203}{1203}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_abc60c7cf0cf6519d875cce892fc03589}\label{namespace_k_b_l_i_b___n_s_abc60c7cf0cf6519d875cce892fc03589}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_max\_n\_old@{get\_max\_n\_old}}
\index{get\_max\_n\_old@{get\_max\_n\_old}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_max\_n\_old()}{get\_max\_n\_old()}}
{\footnotesize\ttfamily template$<$typename Sequence\+Container , typename Comp  = std\+::less$<$$>$, typename It , \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$ is\+\_\+linear\+\_\+container\+\_\+v$<$ Sequence\+Container $>$, int $>$  = 0$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::get\+\_\+max\+\_\+n\+\_\+old (\begin{DoxyParamCaption}\item[{It}]{first,  }\item[{It}]{last,  }\item[{std\+::size\+\_\+t}]{count,  }\item[{Comp}]{cmp = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ Sequence\+Container \hspace{0.3cm}{\ttfamily [constexpr]}}



Returns a container of the greatest count elements according to cmp of the range \mbox{[}first, last), in arbitrary order. This overload works for linear containers. 

Returns a container of the greatest count elements according to cmp of the range \mbox{[}first, last). This overload works for set-\/like types.

This function is included because its performance is sometimes better than the new version, and additionally, it does not rely on default-\/constructibility for the value type.

\begin{DoxyAttention}{Attention}
The returned container will not be sorted, unless it is something like std\+::multiset which will use the other overload.
\end{DoxyAttention}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the range. \\
\hline
{\em last} & One past the end of the range. \\
\hline
{\em count} & The number of elements to copy out of the range. \\
\hline
{\em cmp} & The comparison function to use. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Sequence\+Container The greatest count elements of the range, in arbitrary order.
\end{DoxyReturn}
This function is included because its performance is sometimes better than the new version, and additionally, it does not rely on default-\/constructibility for the value type.


\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the range. \\
\hline
{\em first} & One past the end of the range. \\
\hline
{\em count} & The number of elements to copy out of the range. \\
\hline
{\em cmp} & The comparison function to use. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Setlike\+Container The greatest count elements of the range, in arbitrary order. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01146}{1146}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a8115aa411def81992e39af8b24a597c0}\label{namespace_k_b_l_i_b___n_s_a8115aa411def81992e39af8b24a597c0}} 
\index{KBLIB\_NS@{KBLIB\_NS}!get\_or@{get\_or}}
\index{get\_or@{get\_or}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{get\_or()}{get\_or()}}
{\footnotesize\ttfamily template$<$class C , typename K , typename V $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::get\+\_\+or (\begin{DoxyParamCaption}\item[{const C \&}]{m,  }\item[{const K \&}]{key,  }\item[{const V \&}]{defval }\end{DoxyParamCaption}) -\/$>$ typename C\+::mapped\+\_\+type \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{containers_8h_source_l00057}{57}} of file \mbox{\hyperlink{containers_8h_source}{containers.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae3ad2bb9713e61ded6ca8a8847de38e1}\label{namespace_k_b_l_i_b___n_s_ae3ad2bb9713e61ded6ca8a8847de38e1}} 
\index{KBLIB\_NS@{KBLIB\_NS}!getline@{getline}}
\index{getline@{getline}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{getline()}{getline()}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::getline (\begin{DoxyParamCaption}\item[{std\+::istream \&}]{is }\end{DoxyParamCaption}) -\/$>$ std\+::string \hspace{0.3cm}{\ttfamily [inline]}}



By-\/value std\+::getline wrapper. 


\begin{DoxyParams}{Parameters}
{\em is} & The stream to extract from. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
std\+::string A single line of text from the stream. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{io_8h_source_l00146}{146}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a0f5d7b0d504a25bcafeb406666c9b53f}\label{namespace_k_b_l_i_b___n_s_a0f5d7b0d504a25bcafeb406666c9b53f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!html\_encode@{html\_encode}}
\index{html\_encode@{html\_encode}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{html\_encode()}{html\_encode()}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::html\+\_\+encode (\begin{DoxyParamCaption}\item[{const string \&}]{data }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00519}{519}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab0a6f69c300d7cdf4d0af8c9e053610a}\label{namespace_k_b_l_i_b___n_s_ab0a6f69c300d7cdf4d0af8c9e053610a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!in\_range@{in\_range}}
\index{in\_range@{in\_range}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{in\_range()}{in\_range()}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::in\+\_\+range (\begin{DoxyParamCaption}\item[{const T \&}]{v,  }\item[{\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1detail__simple_1_1simple__range}{detail\+\_\+simple\+::simple\+\_\+range}}$<$ T $>$}]{r }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{simple_8h_source_l00061}{61}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_acf7d0f0c1c27274cff17a76eb01d7471}\label{namespace_k_b_l_i_b___n_s_acf7d0f0c1c27274cff17a76eb01d7471}} 
\index{KBLIB\_NS@{KBLIB\_NS}!in\_range\_i@{in\_range\_i}}
\index{in\_range\_i@{in\_range\_i}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{in\_range\_i()}{in\_range\_i()}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::in\+\_\+range\+\_\+i (\begin{DoxyParamCaption}\item[{const T \&}]{v,  }\item[{\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1detail__simple_1_1simple__range}{detail\+\_\+simple\+::simple\+\_\+range}}$<$ T $>$}]{r }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{simple_8h_source_l00065}{65}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac590b27c7b66c8f9b075971cfb973368}\label{namespace_k_b_l_i_b___n_s_ac590b27c7b66c8f9b075971cfb973368}} 
\index{KBLIB\_NS@{KBLIB\_NS}!indirect@{indirect}}
\index{indirect@{indirect}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{indirect()}{indirect()}}
{\footnotesize\ttfamily template$<$typename Iter1 , typename Iter2 $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::indirect (\begin{DoxyParamCaption}\item[{Iter1}]{begin,  }\item[{Iter2}]{end }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1indirect__range}{indirect\+\_\+range}}$<$Iter1, Iter2$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Create a range from an iterator pair. Primarily useful for range-\/for loops. 


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to wrap. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{iterators_8h_source_l01060}{1060}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a71ae1d12df8f19b95f83f385a4afa2f5}\label{namespace_k_b_l_i_b___n_s_a71ae1d12df8f19b95f83f385a4afa2f5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!indirect\_range@{indirect\_range}}
\index{indirect\_range@{indirect\_range}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{indirect\_range()}{indirect\_range()}}
{\footnotesize\ttfamily template$<$typename Iter1 , typename Iter2 $>$ \\
\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1indirect__range}{KBLIB\+\_\+\+NS\+::indirect\+\_\+range}} (\begin{DoxyParamCaption}\item[{Iter1}]{,  }\item[{Iter2}]{ }\end{DoxyParamCaption}) -\/$>$  \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1indirect__range}{indirect\+\_\+range}}$<$ Iter1, Iter2 $>$}

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a69412d3b7e960740e59abbc2b4cf741a}\label{namespace_k_b_l_i_b___n_s_a69412d3b7e960740e59abbc2b4cf741a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!insertion\_sort@{insertion\_sort}}
\index{insertion\_sort@{insertion\_sort}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{insertion\_sort()}{insertion\_sort()}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It , typename Compare  = std\+::less$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::insertion\+\_\+sort (\begin{DoxyParamCaption}\item[{const Random\+Access\+It}]{begin,  }\item[{const Random\+Access\+It}]{end,  }\item[{Compare \&\&}]{compare = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



In-\/place insertion sort. As is usual, it is stable. Provides as a guarantee that it will perform no moves on sorted input. 

\begin{DoxyRemark}{Remarks}
Complexity\+: 

Average case O(n$^\wedge$2) 

Best-\/case Θ(n) (for sorted input) 

worst-\/case O(n$^\wedge$2) (for reverse-\/sorted input)
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to sort \\
\hline
{\em compare} & The comparison predicate \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{sort_8h_source_l00057}{57}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_abf8f5997817981a12eb9f782b1f921b0}\label{namespace_k_b_l_i_b___n_s_abf8f5997817981a12eb9f782b1f921b0}} 
\index{KBLIB\_NS@{KBLIB\_NS}!insertion\_sort\_copy@{insertion\_sort\_copy}}
\index{insertion\_sort\_copy@{insertion\_sort\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{insertion\_sort\_copy()}{insertion\_sort\_copy()}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It , typename Random\+Access\+It2 , typename Compare  = std\+::less$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::insertion\+\_\+sort\+\_\+copy (\begin{DoxyParamCaption}\item[{const Random\+Access\+It}]{begin,  }\item[{const Random\+Access\+It}]{end,  }\item[{const Random\+Access\+It2}]{d\+\_\+begin,  }\item[{const Random\+Access\+It2}]{d\+\_\+end,  }\item[{Compare \&\&}]{compare = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Out-\/of-\/place insertion sort, which does not modify the input. Provides as a guarantee that it will perform no moves on sorted input. 

\begin{DoxyRemark}{Remarks}
Complexity\+: 

Average case O(n$^\wedge$2) 

Best-\/case Θ(n) (for sorted input) 

worst-\/case O(n$^\wedge$2) (for reverse-\/sorted input)
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em begin,end} & The input range \\
\hline
{\em d\+\_\+begin,d\+\_\+end} & The output range \\
\hline
{\em compare} & The comparison predicate \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{sort_8h_source_l00093}{93}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac77017275583c324e324d9b85b8467d6}\label{namespace_k_b_l_i_b___n_s_ac77017275583c324e324d9b85b8467d6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!invoke@{invoke}}
\index{invoke@{invoke}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{invoke()}{invoke()}}
{\footnotesize\ttfamily template$<$typename F , typename... Args$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::invoke (\begin{DoxyParamCaption}\item[{F \&\&}]{f,  }\item[{Args \&\&...}]{args }\end{DoxyParamCaption}) -\/$>$ decltype(auto) \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00131}{131}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a2aceba7673f47ae35012ec554dc14696}\label{namespace_k_b_l_i_b___n_s_a2aceba7673f47ae35012ec554dc14696}} 
\index{KBLIB\_NS@{KBLIB\_NS}!iota@{iota}}
\index{iota@{iota}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{iota()}{iota()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::iota (\begin{DoxyParamCaption}\item[{Forward\+It}]{first,  }\item[{Forward\+It}]{last,  }\item[{T}]{value }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01575}{1575}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_afa2976f014d8f4178eb722ab90c30d70}\label{namespace_k_b_l_i_b___n_s_afa2976f014d8f4178eb722ab90c30d70}} 
\index{KBLIB\_NS@{KBLIB\_NS}!iota@{iota}}
\index{iota@{iota}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{iota()}{iota()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename T , typename Unary\+Operation $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::iota (\begin{DoxyParamCaption}\item[{Forward\+It}]{first,  }\item[{Forward\+It}]{last,  }\item[{T}]{value,  }\item[{Unary\+Operation}]{unary\+\_\+op }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01587}{1587}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae3666c3da5e91fbec62c284b7b5cae03}\label{namespace_k_b_l_i_b___n_s_ae3666c3da5e91fbec62c284b7b5cae03}} 
\index{KBLIB\_NS@{KBLIB\_NS}!ipow2@{ipow2}}
\index{ipow2@{ipow2}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{ipow2()}{ipow2()}}
{\footnotesize\ttfamily template$<$typename UInt\+Type $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::ipow2 (\begin{DoxyParamCaption}\item[{UInt\+Type}]{b }\end{DoxyParamCaption}) -\/$>$ UInt\+Type \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{random_8h_source_l00319}{319}} of file \mbox{\hyperlink{random_8h_source}{random.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a896c8dd73cc288a6e4e3019a30691528}\label{namespace_k_b_l_i_b___n_s_a896c8dd73cc288a6e4e3019a30691528}} 
\index{KBLIB\_NS@{KBLIB\_NS}!irange@{irange}}
\index{irange@{irange}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{irange()}{irange()}}
{\footnotesize\ttfamily template$<$typename Value , typename Delta  = int$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::irange (\begin{DoxyParamCaption}\item[{Value}]{,  }\item[{Value}]{,  }\item[{Delta}]{ = {\ttfamily 0} }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{iterators_8h_source_l00660}{660}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6eb0a94f4d90a18f521124b70da10267}\label{namespace_k_b_l_i_b___n_s_a6eb0a94f4d90a18f521124b70da10267}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_consecutive@{is\_consecutive}}
\index{is\_consecutive@{is\_consecutive}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_consecutive()}{is\_consecutive()}}
{\footnotesize\ttfamily template$<$typename T , std\+::size\+\_\+t N$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::is\+\_\+consecutive (\begin{DoxyParamCaption}\item[{const T(\&)}]{array\mbox{[}\+N\mbox{]} }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$std\+::is\+\_\+integral$<$T$>$\+::value, bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{simple_8h_source_l00145}{145}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa634d9eca37bf3010c9193ff0e29568d}\label{namespace_k_b_l_i_b___n_s_aa634d9eca37bf3010c9193ff0e29568d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!isAspace@{isAspace}}
\index{isAspace@{isAspace}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{isAspace()}{isAspace()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily constexpr auto KBLIB\+\_\+\+NS\+::is\+Aspace (\begin{DoxyParamCaption}\item[{char}]{c }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{stringops_8h_source_l00343}{343}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7a1d2ceb3c0b626bcfebdaf956d0f608}\label{namespace_k_b_l_i_b___n_s_a7a1d2ceb3c0b626bcfebdaf956d0f608}} 
\index{KBLIB\_NS@{KBLIB\_NS}!isAspace@{isAspace}}
\index{isAspace@{isAspace}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{isAspace()}{isAspace()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily constexpr auto KBLIB\+\_\+\+NS\+::is\+Aspace (\begin{DoxyParamCaption}\item[{wchar\+\_\+t}]{c }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{stringops_8h_source_l00351}{351}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a2378652ba1b1c18873c837b0782c2d0e}\label{namespace_k_b_l_i_b___n_s_a2378652ba1b1c18873c837b0782c2d0e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!isspace@{isspace}}
\index{isspace@{isspace}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{isspace()}{isspace()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::isspace (\begin{DoxyParamCaption}\item[{char}]{c }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{stringops_8h_source_l00331}{331}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab7b97f0140dd3ab51f209d74d276c776}\label{namespace_k_b_l_i_b___n_s_ab7b97f0140dd3ab51f209d74d276c776}} 
\index{KBLIB\_NS@{KBLIB\_NS}!isspace@{isspace}}
\index{isspace@{isspace}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{isspace()}{isspace()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::isspace (\begin{DoxyParamCaption}\item[{wchar\+\_\+t}]{c }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{stringops_8h_source_l00334}{334}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a812a994881599a717cb23d262957b7fa}\label{namespace_k_b_l_i_b___n_s_a812a994881599a717cb23d262957b7fa}} 
\index{KBLIB\_NS@{KBLIB\_NS}!join@{join}}
\index{join@{join}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{join()}{join()}}
{\footnotesize\ttfamily template$<$typename \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}} , typename string  = std\+::string$>$ \\
auto KBLIB\+\_\+\+NS\+::join (\begin{DoxyParamCaption}\item[{const \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}} \&}]{in,  }\item[{const string \&}]{joiner = {\ttfamily \char`\"{}\char`\"{}} }\end{DoxyParamCaption})}



Concatenates all elements of a range together with an optional joiner. 

range must support iteration and be supported by \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1fakestd_a0deab00201ce3a6a7fd28a63dea6a612}{fakestd\+::size()}}.


\begin{DoxyParams}{Parameters}
{\em in} & A sequence of strings to concatenate. \\
\hline
{\em joiner} & A string which will be inserted between every element of in. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
string The joined string. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00370}{370}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9c77e4e62b94152a2fdd7003ed2eb06c}\label{namespace_k_b_l_i_b___n_s_a9c77e4e62b94152a2fdd7003ed2eb06c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!kbsplit2@{kbsplit2}}
\index{kbsplit2@{kbsplit2}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{kbsplit2()}{kbsplit2()}}
{\footnotesize\ttfamily template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename String $>$ \\
auto KBLIB\+\_\+\+NS\+::kbsplit2 (\begin{DoxyParamCaption}\item[{const String \&}]{in,  }\item[{char}]{delim = {\ttfamily \textquotesingle{}~\textquotesingle{}} }\end{DoxyParamCaption}) -\/$>$ Container }



Definition at line \mbox{\hyperlink{stringops_8h_source_l00474}{474}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6a72a1bd0fc23633f0c0abd639c512f9}\label{namespace_k_b_l_i_b___n_s_a6a72a1bd0fc23633f0c0abd639c512f9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!length@{length}}
\index{length@{length}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{length()}{length()}}
{\footnotesize\ttfamily template$<$typename CharT $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::length (\begin{DoxyParamCaption}\item[{const CharT $\ast$}]{str }\end{DoxyParamCaption}) -\/$>$ std\+::size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{stringops_8h_source_l00234}{234}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aba294c76c6015b7fab99a74894843a9c}\label{namespace_k_b_l_i_b___n_s_aba294c76c6015b7fab99a74894843a9c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!lexical\_cast@{lexical\_cast}}
\index{lexical\_cast@{lexical\_cast}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{lexical\_cast()}{lexical\_cast()}}
{\footnotesize\ttfamily template$<$typename To , typename From $>$ \\
auto KBLIB\+\_\+\+NS\+::lexical\+\_\+cast (\begin{DoxyParamCaption}\item[{const From \&}]{val,  }\item[{const char $\ast$}]{type = {\ttfamily typeid(To).name()} }\end{DoxyParamCaption}) -\/$>$ To }



Definition at line \mbox{\hyperlink{convert_8h_source_l00836}{836}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae3839286a1c0d4b6fa5afb27d954527b}\label{namespace_k_b_l_i_b___n_s_ae3839286a1c0d4b6fa5afb27d954527b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!lexical\_coerce@{lexical\_coerce}}
\index{lexical\_coerce@{lexical\_coerce}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{lexical\_coerce()}{lexical\_coerce()}}
{\footnotesize\ttfamily template$<$typename To , typename... Ts$>$ \\
auto KBLIB\+\_\+\+NS\+::lexical\+\_\+coerce (\begin{DoxyParamCaption}\item[{const std\+::variant$<$ Ts... $>$ \&}]{v }\end{DoxyParamCaption}) -\/$>$ To }



Lexically converts the value of v (no matter its type) to type To. 


\begin{DoxyParams}{Parameters}
{\em v} & A variant to coerce. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
To The type to coerce to. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{variant_8h_source_l00091}{91}} of file \mbox{\hyperlink{variant_8h_source}{variant.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6704bbcd16607765acc713c6012b4ccf}\label{namespace_k_b_l_i_b___n_s_a6704bbcd16607765acc713c6012b4ccf}} 
\index{KBLIB\_NS@{KBLIB\_NS}!lexicographical\_compare@{lexicographical\_compare}}
\index{lexicographical\_compare@{lexicographical\_compare}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{lexicographical\_compare()}{lexicographical\_compare()}}
{\footnotesize\ttfamily template$<$class Input\+It1 , class Input\+It2 $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::lexicographical\+\_\+compare (\begin{DoxyParamCaption}\item[{Input\+It1}]{first1,  }\item[{Input\+It1}]{last1,  }\item[{Input\+It2}]{first2,  }\item[{Input\+It2}]{last2 }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l01080}{1080}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a23d3833a48cfd8540b34c5fae8f9ba54}\label{namespace_k_b_l_i_b___n_s_a23d3833a48cfd8540b34c5fae8f9ba54}} 
\index{KBLIB\_NS@{KBLIB\_NS}!magic\_enumerate@{magic\_enumerate}}
\index{magic\_enumerate@{magic\_enumerate}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{magic\_enumerate()}{magic\_enumerate()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename It , typename EIt $>$ \\
auto KBLIB\+\_\+\+NS\+::magic\+\_\+enumerate (\begin{DoxyParamCaption}\item[{It}]{begin,  }\item[{EIt}]{end }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1enumerator__t}{enumerator\+\_\+t}}$<$It, EIt$>$ }



Allow access to indexes while using range-\/based for loops. 

The \char`\"{}magic\char`\"{} part is that 
\begin{DoxyCode}{0}
\DoxyCodeLine{\textcolor{keywordflow}{for} (\textcolor{keyword}{auto}\&\& [idx, val] : \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a23d3833a48cfd8540b34c5fae8f9ba54}{kblib::magic\_enumerate}}(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}})) \{}

\end{DoxyCode}
 captures \textquotesingle{}val\textquotesingle{} by reference, while 
\begin{DoxyCode}{0}
\DoxyCodeLine{\textcolor{keywordflow}{for} (\textcolor{keyword}{auto} [idx, val] : \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a23d3833a48cfd8540b34c5fae8f9ba54}{kblib::magic\_enumerate}}(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}})) \{}

\end{DoxyCode}
 captures \textquotesingle{}val\textquotesingle{} by value, so that the effect is similar to if you had written 
\begin{DoxyCode}{0}
\DoxyCodeLine{\textcolor{keywordflow}{for} (\textcolor{keyword}{auto} val : \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}}) \{}

\end{DoxyCode}
 and kept track of the index manually.


\begin{DoxyParams}{Parameters}
{\em begin,end} & The input range. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{iterators_8h_source_l00989}{989}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae36551c05b2fbb28f58a337ab9bcb891}\label{namespace_k_b_l_i_b___n_s_ae36551c05b2fbb28f58a337ab9bcb891}} 
\index{KBLIB\_NS@{KBLIB\_NS}!magic\_enumerate@{magic\_enumerate}}
\index{magic\_enumerate@{magic\_enumerate}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{magic\_enumerate()}{magic\_enumerate()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Range $>$ \\
auto KBLIB\+\_\+\+NS\+::magic\+\_\+enumerate (\begin{DoxyParamCaption}\item[{Range \&\&}]{r }\end{DoxyParamCaption}) -\/$>$ auto }



Allow access to indexes while using range-\/based for loops. Safe to use with rvalues. 

The \char`\"{}magic\char`\"{} part is that 
\begin{DoxyCode}{0}
\DoxyCodeLine{\textcolor{keywordflow}{for} (\textcolor{keyword}{auto}\&\& [idx, val] : \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a23d3833a48cfd8540b34c5fae8f9ba54}{kblib::magic\_enumerate}}(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}})) \{}

\end{DoxyCode}
 captures \textquotesingle{}val\textquotesingle{} by reference, while 
\begin{DoxyCode}{0}
\DoxyCodeLine{\textcolor{keywordflow}{for} (\textcolor{keyword}{auto} [idx, val] : \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a23d3833a48cfd8540b34c5fae8f9ba54}{kblib::magic\_enumerate}}(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}})) \{}

\end{DoxyCode}
 captures \textquotesingle{}val\textquotesingle{} by value, so that the effect is similar to if you had written 
\begin{DoxyCode}{0}
\DoxyCodeLine{\textcolor{keywordflow}{for} (\textcolor{keyword}{auto} val : \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}{range}}) \{}

\end{DoxyCode}
 and kept track of the index manually.


\begin{DoxyParams}{Parameters}
{\em r} & A range to iterate over. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{iterators_8h_source_l01014}{1014}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad1160b93fc900fcb5008eda4720b9f25}\label{namespace_k_b_l_i_b___n_s_ad1160b93fc900fcb5008eda4720b9f25}} 
\index{KBLIB\_NS@{KBLIB\_NS}!make\_cond\_ptr@{make\_cond\_ptr}}
\index{make\_cond\_ptr@{make\_cond\_ptr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{make\_cond\_ptr()}{make\_cond\_ptr()}\hspace{0.1cm}{\footnotesize\ttfamily [1/4]}}
{\footnotesize\ttfamily template$<$typename T , typename Deleter $>$ \\
auto KBLIB\+\_\+\+NS\+::make\+\_\+cond\+\_\+ptr (\begin{DoxyParamCaption}\item[{std\+::unique\+\_\+ptr$<$ T, Deleter $>$ \&\&}]{arg }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1cond__ptr}{cond\+\_\+ptr}}$<$T, Deleter$>$ \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{memory_8h_source_l00783}{783}} of file \mbox{\hyperlink{memory_8h_source}{memory.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a1535ccc487bac70a3febdf24d877d818}\label{namespace_k_b_l_i_b___n_s_a1535ccc487bac70a3febdf24d877d818}} 
\index{KBLIB\_NS@{KBLIB\_NS}!make\_cond\_ptr@{make\_cond\_ptr}}
\index{make\_cond\_ptr@{make\_cond\_ptr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{make\_cond\_ptr()}{make\_cond\_ptr()}\hspace{0.1cm}{\footnotesize\ttfamily [2/4]}}
{\footnotesize\ttfamily template$<$typename T , typename Deleter $>$ \\
auto KBLIB\+\_\+\+NS\+::make\+\_\+cond\+\_\+ptr (\begin{DoxyParamCaption}\item[{T $\ast$}]{arg,  }\item[{bool}]{owner,  }\item[{Deleter}]{del }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1cond__ptr}{cond\+\_\+ptr}}$<$T, Deleter$>$ \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{memory_8h_source_l00801}{801}} of file \mbox{\hyperlink{memory_8h_source}{memory.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac86846919817ae6ff8195380bfe255da}\label{namespace_k_b_l_i_b___n_s_ac86846919817ae6ff8195380bfe255da}} 
\index{KBLIB\_NS@{KBLIB\_NS}!make\_cond\_ptr@{make\_cond\_ptr}}
\index{make\_cond\_ptr@{make\_cond\_ptr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{make\_cond\_ptr()}{make\_cond\_ptr()}\hspace{0.1cm}{\footnotesize\ttfamily [3/4]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::make\+\_\+cond\+\_\+ptr (\begin{DoxyParamCaption}\item[{T $\ast$}]{arg,  }\item[{bool}]{owner = {\ttfamily false} }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1cond__ptr}{cond\+\_\+ptr}}$<$T$>$ \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{memory_8h_source_l00789}{789}} of file \mbox{\hyperlink{memory_8h_source}{memory.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a54bb697f9f1932f21d57c5dd5a225864}\label{namespace_k_b_l_i_b___n_s_a54bb697f9f1932f21d57c5dd5a225864}} 
\index{KBLIB\_NS@{KBLIB\_NS}!make\_cond\_ptr@{make\_cond\_ptr}}
\index{make\_cond\_ptr@{make\_cond\_ptr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{make\_cond\_ptr()}{make\_cond\_ptr()}\hspace{0.1cm}{\footnotesize\ttfamily [4/4]}}
{\footnotesize\ttfamily template$<$typename T , typename Deleter $>$ \\
auto KBLIB\+\_\+\+NS\+::make\+\_\+cond\+\_\+ptr (\begin{DoxyParamCaption}\item[{T $\ast$}]{arg,  }\item[{Deleter}]{del }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1cond__ptr}{cond\+\_\+ptr}}$<$T, Deleter$>$ \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{memory_8h_source_l00795}{795}} of file \mbox{\hyperlink{memory_8h_source}{memory.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a18e31f0c0ba3d5a0486323e7b78d2cf8}\label{namespace_k_b_l_i_b___n_s_a18e31f0c0ba3d5a0486323e7b78d2cf8}} 
\index{KBLIB\_NS@{KBLIB\_NS}!make\_fib\_arr@{make\_fib\_arr}}
\index{make\_fib\_arr@{make\_fib\_arr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{make\_fib\_arr()}{make\_fib\_arr()}}
{\footnotesize\ttfamily template$<$typename U , std\+::size\+\_\+t N = calc\+\_\+fib\+\_\+size$<$\+U$>$() + 1$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::make\+\_\+fib\+\_\+arr (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1trivial__array}{trivial\+\_\+array}}$<$U, N$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Generates the first N values of the fibonacci sequence. 

\begin{DoxyPrecond}{Precondition}
If N \texorpdfstring{$>$}{>} \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1f193cfd181f4fe369fe2bee65f5d129}{calc\+\_\+fib\+\_\+size$<$\+U$>$()}}, then U must be an unsigned type, and the resulting sequence is modulo 2$^\wedge$bits\+\_\+of\+\_\+U. 

N \texorpdfstring{$>$}{>}= 2
\end{DoxyPrecond}
\begin{DoxyReturn}{Returns}
trivial\+\_\+array$<$\+U, N$>$ An array containing the first N fibonacci numbers. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stats_8h_source_l00156}{156}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae9ae81f88d9fa4ae4cf5d349cd2aef6c}\label{namespace_k_b_l_i_b___n_s_ae9ae81f88d9fa4ae4cf5d349cd2aef6c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!make\_transform\_iterator@{make\_transform\_iterator}}
\index{make\_transform\_iterator@{make\_transform\_iterator}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{make\_transform\_iterator()}{make\_transform\_iterator()}}
{\footnotesize\ttfamily template$<$typename base\+\_\+iterator , typename operation $>$ \\
auto KBLIB\+\_\+\+NS\+::make\+\_\+transform\+\_\+iterator (\begin{DoxyParamCaption}\item[{base\+\_\+iterator}]{it,  }\item[{operation}]{op }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{transform\+\_\+iterator}}$<$base\+\_\+iterator, operation$>$ \hspace{0.3cm}{\ttfamily [noexcept]}}



Factory function to make transform\+\_\+iterators. 


\begin{DoxyParams}{Parameters}
{\em it} & An Input\+Iterator to a range to transform. \\
\hline
{\em op} & The transformation to apply. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
transform\+\_\+iterator$<$base\+\_\+iterator, operation$>$
\end{DoxyReturn}
\begin{DoxyRefDesc}{Deprecated}
\item[\mbox{\hyperlink{deprecated__deprecated000002}{Deprecated}}]Use transformer instead \end{DoxyRefDesc}


Definition at line \mbox{\hyperlink{iterators_8h_source_l01298}{1298}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6dba339947eb5129b3d519cf492305a6}\label{namespace_k_b_l_i_b___n_s_a6dba339947eb5129b3d519cf492305a6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!map@{map}}
\index{map@{map}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{map()}{map()}}
{\footnotesize\ttfamily template$<$typename F , typename... T$>$ \\
auto KBLIB\+\_\+\+NS\+::map (\begin{DoxyParamCaption}\item[{F}]{f,  }\item[{T \&\&...}]{t }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$         not \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a1b7771329ad37243c15c9ef44dfa1902}{any\+\_\+void}}$<$decltype(kblib\+::apply(f, std\+::forward$<$T$>$(t)))...$>$,         decltype(std\+::tuple\{kblib\+::apply(f, std\+::forward$<$T$>$(t))...\})$>$ \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{simple_8h_source_l00075}{75}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af04902ef70cd4a8ade17bfe77f189bd5}\label{namespace_k_b_l_i_b___n_s_af04902ef70cd4a8ade17bfe77f189bd5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!max\_count\_digits@{max\_count\_digits}}
\index{max\_count\_digits@{max\_count\_digits}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{max\_count\_digits()}{max\_count\_digits()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It $>$ \\
auto KBLIB\+\_\+\+NS\+::max\+\_\+count\+\_\+digits (\begin{DoxyParamCaption}\item[{Forward\+It}]{first,  }\item[{Forward\+It}]{last }\end{DoxyParamCaption}) -\/$>$ int }



Returns the necessary number of digits to represent the largest value in an input range. 


\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the input range. \\
\hline
{\em last} & The end of the input range. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
int The necessary number of digits to represent any value in the input. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{format_8h_source_l00130}{130}} of file \mbox{\hyperlink{format_8h_source}{format.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aecc5d7469f00a291f59932d007b8cfa1}\label{namespace_k_b_l_i_b___n_s_aecc5d7469f00a291f59932d007b8cfa1}} 
\index{KBLIB\_NS@{KBLIB\_NS}!max\_count\_digits@{max\_count\_digits}}
\index{max\_count\_digits@{max\_count\_digits}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{max\_count\_digits()}{max\_count\_digits()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It $>$ \\
auto KBLIB\+\_\+\+NS\+::max\+\_\+count\+\_\+digits (\begin{DoxyParamCaption}\item[{Forward\+It}]{first,  }\item[{Forward\+It}]{last,  }\item[{int}]{base }\end{DoxyParamCaption}) -\/$>$ int }



Returns the necessary number of digits to represent the largest value in an input range. 


\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the input range. \\
\hline
{\em last} & The end of the input range. \\
\hline
{\em base} & The base to be used for calculation. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
int The necessary number of digits to represent any value in the input. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{format_8h_source_l00148}{148}} of file \mbox{\hyperlink{format_8h_source}{format.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a72d7009703fc6e22a52183cea35f225e}\label{namespace_k_b_l_i_b___n_s_a72d7009703fc6e22a52183cea35f225e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!max\_element@{max\_element}}
\index{max\_element@{max\_element}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{max\_element()}{max\_element()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Container , typename Comp  = std\+::less$<$value\+\_\+type\+\_\+linear\+\_\+t$<$\+Container$>$$>$$>$ \\
auto KBLIB\+\_\+\+NS\+::max\+\_\+element (\begin{DoxyParamCaption}\item[{Container \&}]{c,  }\item[{Comp}]{comp }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aea5c475c5fb0f416b30f5825af77348b}{value\+\_\+type\+\_\+linear\+\_\+t}}$<$Container$>$$\ast$ }



Definition at line \mbox{\hyperlink{iterators_8h_source_l00078}{78}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a072a171e88da5f45556a48c3570ab51d}\label{namespace_k_b_l_i_b___n_s_a072a171e88da5f45556a48c3570ab51d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!max\_element@{max\_element}}
\index{max\_element@{max\_element}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{max\_element()}{max\_element()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It , typename End\+It , typename Compare  = std\+::less$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::max\+\_\+element (\begin{DoxyParamCaption}\item[{Forward\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Compare}]{comp = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ Forward\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01109}{1109}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad3e2bf738427c97401eef1241e24e858}\label{namespace_k_b_l_i_b___n_s_ad3e2bf738427c97401eef1241e24e858}} 
\index{KBLIB\_NS@{KBLIB\_NS}!memswap@{memswap}}
\index{memswap@{memswap}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{memswap()}{memswap()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily constexpr auto KBLIB\+\_\+\+NS\+::memswap (\begin{DoxyParamCaption}\item[{unsigned char $\ast$}]{A,  }\item[{unsigned char $\ast$}]{B,  }\item[{std\+::size\+\_\+t}]{size }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Swaps memory ranges. 

\begin{DoxyPrecond}{Precondition}
A and B must not be null. 

$\ast$A and $\ast$B must not overlap.
\end{DoxyPrecond}

\begin{DoxyParams}{Parameters}
{\em A} & A pointer to memory to swap with $\ast$B. \\
\hline
{\em B} & A pointer to memory to swap with $\ast$A. \\
\hline
{\em size} & The number of bytes to swap between $\ast$A and $\ast$B. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{bits_8h_source_l00394}{394}} of file \mbox{\hyperlink{bits_8h_source}{bits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6a8616c9dc6ca09e609d2c2a4b7f910b}\label{namespace_k_b_l_i_b___n_s_a6a8616c9dc6ca09e609d2c2a4b7f910b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!memswap@{memswap}}
\index{memswap@{memswap}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{memswap()}{memswap()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::memswap (\begin{DoxyParamCaption}\item[{void $\ast$}]{A,  }\item[{void $\ast$}]{B,  }\item[{std\+::size\+\_\+t}]{size }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [noexcept]}}



Swaps memory ranges. 

\begin{DoxyPrecond}{Precondition}
A and B must not be null. 

$\ast$A and $\ast$B must not overlap.
\end{DoxyPrecond}

\begin{DoxyParams}{Parameters}
{\em A} & A pointer to memory to swap with $\ast$B. \\
\hline
{\em B} & A pointer to memory to swap with $\ast$A. \\
\hline
{\em size} & The number of bytes to swap between $\ast$A and $\ast$B. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{bits_8h_source_l00412}{412}} of file \mbox{\hyperlink{bits_8h_source}{bits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a62b47d136874314a9d04bbed61b1ba75}\label{namespace_k_b_l_i_b___n_s_a62b47d136874314a9d04bbed61b1ba75}} 
\index{KBLIB\_NS@{KBLIB\_NS}!nl@{nl}}
\index{nl@{nl}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{nl()}{nl()}}
{\footnotesize\ttfamily template$<$typename CharT , typename Traits $>$ \\
auto KBLIB\+\_\+\+NS\+::nl (\begin{DoxyParamCaption}\item[{std\+::basic\+\_\+istream$<$ CharT, Traits $>$ \&}]{is }\end{DoxyParamCaption}) -\/$>$ std\+::basic\+\_\+istream$<$CharT, Traits$>$\& }



Read in spaces until the end of the line is found. 

nl may be used to consume whitespace left over after a formatted input operation before doing an unformatted input operation (such as std\+::getline).

\begin{DoxyRemark}{Remarks}
Example usage\+: 
\begin{DoxyCode}{0}
\DoxyCodeLine{\textcolor{keywordtype}{int} x\{\};}
\DoxyCodeLine{std::cout << \textcolor{stringliteral}{"{}Enter a number: "{}};}
\DoxyCodeLine{std::cin >> x; \textcolor{comment}{// potentially leaves a new line in the stream}}
\DoxyCodeLine{std::cout << \textcolor{stringliteral}{"{}Got "{}} << x << \textcolor{charliteral}{'\(\backslash\)n'};}
\DoxyCodeLine{std::string str;}
\DoxyCodeLine{std::cout << \textcolor{stringliteral}{"{}Enter a line of text: "{}};}
\DoxyCodeLine{\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae3ad2bb9713e61ded6ca8a8847de38e1}{std::getline}}(std::cin >> \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a62b47d136874314a9d04bbed61b1ba75}{kblib::nl}}, str);}
\DoxyCodeLine{std::cout << \textcolor{stringliteral}{"{}Got "{}} << \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af129a587bdaf7d9ccb7f0c7395202d86}{std::quoted}}(str) << \textcolor{charliteral}{'\(\backslash\)n'};}

\end{DoxyCode}

\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em is} & The stream to read from. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
std\+::istream\& is. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{io_8h_source_l00212}{212}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af77c19627d6b1eb24ee5a7ccd91d8364}\label{namespace_k_b_l_i_b___n_s_af77c19627d6b1eb24ee5a7ccd91d8364}} 
\index{KBLIB\_NS@{KBLIB\_NS}!none\_of@{none\_of}}
\index{none\_of@{none\_of}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{none\_of()}{none\_of()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::none\+\_\+of (\begin{DoxyParamCaption}\item[{Input\+It}]{begin,  }\item[{Input\+It}]{end,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$Input\+It$>$\+::value, bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Determine if pred is false for every element of the range. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00997}{997}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aca6380b0d9da9e9ee69bf74978f1997c}\label{namespace_k_b_l_i_b___n_s_aca6380b0d9da9e9ee69bf74978f1997c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!none\_of@{none\_of}}
\index{none\_of@{none\_of}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{none\_of()}{none\_of()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Range , typename Unary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::none\+\_\+of (\begin{DoxyParamCaption}\item[{Range \&\&}]{rng,  }\item[{Unary\+Predicate}]{pred }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$Range$>$\+::value, bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Determine if pred is true for every element of the range. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01011}{1011}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9eaca960eeb679008dfc52be3f1bbab2}\label{namespace_k_b_l_i_b___n_s_a9eaca960eeb679008dfc52be3f1bbab2}} 
\index{KBLIB\_NS@{KBLIB\_NS}!noop@{noop}}
\index{noop@{noop}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{noop()}{noop()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::noop (\begin{DoxyParamCaption}\item[{void $\ast$}]{,  }\item[{const T $\ast$}]{ }\end{DoxyParamCaption}) -\/$>$ T$\ast$ \hspace{0.3cm}{\ttfamily [inline]}}



Does nothing; matches the copy construction signature. 



Definition at line \mbox{\hyperlink{poly__obj_8h_source_l00247}{247}} of file \mbox{\hyperlink{poly__obj_8h_source}{poly\+\_\+obj.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a2888809b9f43c09b46a401fdb02e49a9}\label{namespace_k_b_l_i_b___n_s_a2888809b9f43c09b46a401fdb02e49a9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!noop@{noop}}
\index{noop@{noop}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{noop()}{noop()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename T , bool nothrow$>$ \\
auto KBLIB\+\_\+\+NS\+::noop (\begin{DoxyParamCaption}\item[{void $\ast$}]{,  }\item[{T $\ast$}]{ }\end{DoxyParamCaption}) -\/$>$ T$\ast$ \hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [noexcept]}}



Does nothing; matches the move construction signature. 



Definition at line \mbox{\hyperlink{poly__obj_8h_source_l00252}{252}} of file \mbox{\hyperlink{poly__obj_8h_source}{poly\+\_\+obj.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a5813ed369e8ea6b6d3451b3eac0d7853}\label{namespace_k_b_l_i_b___n_s_a5813ed369e8ea6b6d3451b3eac0d7853}} 
\index{KBLIB\_NS@{KBLIB\_NS}!operator\&@{operator\&}}
\index{operator\&@{operator\&}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{operator\&()}{operator\&()}}
{\footnotesize\ttfamily constexpr auto KBLIB\+\_\+\+NS\+::operator\& (\begin{DoxyParamCaption}\item[{\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}}}]{l,  }\item[{\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}}}]{r }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}} \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{poly__obj_8h_source_l00054}{54}} of file \mbox{\hyperlink{poly__obj_8h_source}{poly\+\_\+obj.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a78ee879418158c092d08d68b737e695d}\label{namespace_k_b_l_i_b___n_s_a78ee879418158c092d08d68b737e695d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!operator$\ast$@{operator$\ast$}}
\index{operator$\ast$@{operator$\ast$}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{operator$\ast$()}{operator*()}}
{\footnotesize\ttfamily constexpr auto KBLIB\+\_\+\+NS\+::operator$\ast$ (\begin{DoxyParamCaption}\item[{\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}}}]{l,  }\item[{bool}]{r }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}} \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{poly__obj_8h_source_l00060}{60}} of file \mbox{\hyperlink{poly__obj_8h_source}{poly\+\_\+obj.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a34900758f0b3419169cd357ad94cc97d}\label{namespace_k_b_l_i_b___n_s_a34900758f0b3419169cd357ad94cc97d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!operator+@{operator+}}
\index{operator+@{operator+}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{operator+()}{operator+()}\hspace{0.1cm}{\footnotesize\ttfamily [1/3]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::operator+ (\begin{DoxyParamCaption}\item[{T}]{val,  }\item[{\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1adjuster}{adjuster}}}]{a }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$not \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1detail__iterators_1_1is__addable}{detail\+\_\+iterators\+::is\+\_\+addable}}$<$T, std\+::ptrdiff\+\_\+t$>$\+::value,                    decltype(std\+::advance(val, a.\+adj))$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{iterators_8h_source_l00553}{553}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a5df4f2aa0383bc09929f80ebbf43145c}\label{namespace_k_b_l_i_b___n_s_a5df4f2aa0383bc09929f80ebbf43145c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!operator+@{operator+}}
\index{operator+@{operator+}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{operator+()}{operator+()}\hspace{0.1cm}{\footnotesize\ttfamily [2/3]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::operator+ (\begin{DoxyParamCaption}\item[{T}]{val,  }\item[{\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1decrementer}{decrementer}}}]{ }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}}



Decrements val. 



Definition at line \mbox{\hyperlink{iterators_8h_source_l00606}{606}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa3bf951ff79680bc749976235d79d060}\label{namespace_k_b_l_i_b___n_s_aa3bf951ff79680bc749976235d79d060}} 
\index{KBLIB\_NS@{KBLIB\_NS}!operator+@{operator+}}
\index{operator+@{operator+}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{operator+()}{operator+()}\hspace{0.1cm}{\footnotesize\ttfamily [3/3]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::operator+ (\begin{DoxyParamCaption}\item[{T}]{val,  }\item[{\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1incrementer}{incrementer}}}]{ }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}}



Increments val. 



Definition at line \mbox{\hyperlink{iterators_8h_source_l00581}{581}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac88add2cb257f548e6c81cc017ebb753}\label{namespace_k_b_l_i_b___n_s_ac88add2cb257f548e6c81cc017ebb753}} 
\index{KBLIB\_NS@{KBLIB\_NS}!operator$<$$<$@{operator$<$$<$}}
\index{operator$<$$<$@{operator$<$$<$}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{operator$<$$<$()}{operator<<()}}
{\footnotesize\ttfamily template$<$typename F , typename CharT , typename Tr $>$ \\
std\+::basic\+\_\+ostream$<$ CharT, Tr $>$ \& KBLIB\+\_\+\+NS\+::operator$<$$<$ (\begin{DoxyParamCaption}\item[{std\+::basic\+\_\+ostream$<$ CharT, Tr $>$ \&}]{is,  }\item[{\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1get__manip}{get\+\_\+manip}}$<$ F $>$}]{func }\end{DoxyParamCaption})}



Actually calls the manipulator. 



Definition at line \mbox{\hyperlink{io_8h_source_l00373}{373}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab9f34cf1a63aa6d243a55cbc4b08324e}\label{namespace_k_b_l_i_b___n_s_ab9f34cf1a63aa6d243a55cbc4b08324e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!operator$>$$>$@{operator$>$$>$}}
\index{operator$>$$>$@{operator$>$$>$}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{operator$>$$>$()}{operator>>()}}
{\footnotesize\ttfamily template$<$typename F , typename CharT , typename Tr $>$ \\
std\+::basic\+\_\+istream$<$ CharT, Tr $>$ \& KBLIB\+\_\+\+NS\+::operator$>$$>$ (\begin{DoxyParamCaption}\item[{std\+::basic\+\_\+istream$<$ CharT, Tr $>$ \&}]{is,  }\item[{\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1get__manip}{get\+\_\+manip}}$<$ F $>$}]{func }\end{DoxyParamCaption})}



Actually calls the manipulator. 



Definition at line \mbox{\hyperlink{io_8h_source_l00373}{373}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9427109650f0884de2084903c79d1923}\label{namespace_k_b_l_i_b___n_s_a9427109650f0884de2084903c79d1923}} 
\index{KBLIB\_NS@{KBLIB\_NS}!operator\texttt{"|}@{operator\texttt{"|}}}
\index{operator\texttt{"|}@{operator\texttt{"|}}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{operator\texttt{"|}()}{operator|()}}
{\footnotesize\ttfamily constexpr auto KBLIB\+\_\+\+NS\+::operator$\vert$ (\begin{DoxyParamCaption}\item[{\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}}}]{l,  }\item[{\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}}}]{r }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ab80deb5b155636cc83afb4be1f83ae8e}{construct\+\_\+type}} \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{poly__obj_8h_source_l00048}{48}} of file \mbox{\hyperlink{poly__obj_8h_source}{poly\+\_\+obj.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a4839df47e63e88adecc02f638233a88f}\label{namespace_k_b_l_i_b___n_s_a4839df47e63e88adecc02f638233a88f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!parse\_integer@{parse\_integer}}
\index{parse\_integer@{parse\_integer}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{parse\_integer()}{parse\_integer()}\hspace{0.1cm}{\footnotesize\ttfamily [1/4]}}
{\footnotesize\ttfamily template$<$typename Result $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::parse\+\_\+integer (\begin{DoxyParamCaption}\item[{const char $\ast$}]{begin,  }\item[{const char $\ast$}]{end,  }\item[{int}]{base = {\ttfamily 0} }\end{DoxyParamCaption}) -\/$>$ Result \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00148}{148}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_adaf093e4e11530699a34b7d030cd2c3f}\label{namespace_k_b_l_i_b___n_s_adaf093e4e11530699a34b7d030cd2c3f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!parse\_integer@{parse\_integer}}
\index{parse\_integer@{parse\_integer}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{parse\_integer()}{parse\_integer()}\hspace{0.1cm}{\footnotesize\ttfamily [2/4]}}
{\footnotesize\ttfamily template$<$typename Result , std\+::size\+\_\+t N$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::parse\+\_\+integer (\begin{DoxyParamCaption}\item[{const char(\&)}]{in\mbox{[}\+N\mbox{]},  }\item[{int}]{base = {\ttfamily 0} }\end{DoxyParamCaption}) -\/$>$ Result \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00194}{194}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9be37ddba09fe1930179587b0ca87622}\label{namespace_k_b_l_i_b___n_s_a9be37ddba09fe1930179587b0ca87622}} 
\index{KBLIB\_NS@{KBLIB\_NS}!parse\_integer@{parse\_integer}}
\index{parse\_integer@{parse\_integer}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{parse\_integer()}{parse\_integer()}\hspace{0.1cm}{\footnotesize\ttfamily [3/4]}}
{\footnotesize\ttfamily template$<$typename Result $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::parse\+\_\+integer (\begin{DoxyParamCaption}\item[{const std\+::string \&}]{in,  }\item[{int}]{base = {\ttfamily 0} }\end{DoxyParamCaption}) -\/$>$ Result \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00202}{202}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a4bf68a0cb2e3357d4c22bb08695aba46}\label{namespace_k_b_l_i_b___n_s_a4bf68a0cb2e3357d4c22bb08695aba46}} 
\index{KBLIB\_NS@{KBLIB\_NS}!parse\_integer@{parse\_integer}}
\index{parse\_integer@{parse\_integer}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{parse\_integer()}{parse\_integer()}\hspace{0.1cm}{\footnotesize\ttfamily [4/4]}}
{\footnotesize\ttfamily template$<$typename Result $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::parse\+\_\+integer (\begin{DoxyParamCaption}\item[{std\+::string\+\_\+view}]{in,  }\item[{int}]{base = {\ttfamily 0} }\end{DoxyParamCaption}) -\/$>$ Result \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00211}{211}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aef797bc7219be065bda6759e2b87b563}\label{namespace_k_b_l_i_b___n_s_aef797bc7219be065bda6759e2b87b563}} 
\index{KBLIB\_NS@{KBLIB\_NS}!phi@{phi}}
\index{phi@{phi}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{phi()}{phi()}}
{\footnotesize\ttfamily template$<$typename T  = double$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::phi (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{stats_8h_source_l00476}{476}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3963afc371f605af54da0a8ff1fdb567}\label{namespace_k_b_l_i_b___n_s_a3963afc371f605af54da0a8ff1fdb567}} 
\index{KBLIB\_NS@{KBLIB\_NS}!pi@{pi}}
\index{pi@{pi}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{pi()}{pi()}}
{\footnotesize\ttfamily template$<$typename T  = double$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::pi (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{stats_8h_source_l00460}{460}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae2dd41c896b1e979fa511e09a7a22df5}\label{namespace_k_b_l_i_b___n_s_ae2dd41c896b1e979fa511e09a7a22df5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!poly\_warn\_if@{poly\_warn\_if}}
\index{poly\_warn\_if@{poly\_warn\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{poly\_warn\_if()}{poly\_warn\_if()}}
{\footnotesize\ttfamily template$<$bool warn$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::poly\+\_\+warn\+\_\+if (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ std\+::nullptr\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{poly__obj_8h_source_l01084}{1084}} of file \mbox{\hyperlink{poly__obj_8h_source}{poly\+\_\+obj.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac3d2bcadd8c9085766710f3af39342b7}\label{namespace_k_b_l_i_b___n_s_ac3d2bcadd8c9085766710f3af39342b7}} 
\index{KBLIB\_NS@{KBLIB\_NS}!poly\_warn\_if$<$ true $>$@{poly\_warn\_if$<$ true $>$}}
\index{poly\_warn\_if$<$ true $>$@{poly\_warn\_if$<$ true $>$}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{poly\_warn\_if$<$ true $>$()}{poly\_warn\_if< true >()}}
{\footnotesize\ttfamily template$<$$>$ \\
constexpr auto \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_ae2dd41c896b1e979fa511e09a7a22df5}{KBLIB\+\_\+\+NS\+::poly\+\_\+warn\+\_\+if}}$<$ true $>$ (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ std\+::nullptr\+\_\+t \hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{poly__obj_8h_source_l01091}{1091}} of file \mbox{\hyperlink{poly__obj_8h_source}{poly\+\_\+obj.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a81275204aa40536f10bc83aebcb414b4}\label{namespace_k_b_l_i_b___n_s_a81275204aa40536f10bc83aebcb414b4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!pop@{pop}}
\index{pop@{pop}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{pop()}{pop()}}
{\footnotesize\ttfamily template$<$typename C $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::pop (\begin{DoxyParamCaption}\item[{C \&}]{s }\end{DoxyParamCaption}) -\/$>$ typename C\+::value\+\_\+type \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{containers_8h_source_l00050}{50}} of file \mbox{\hyperlink{containers_8h_source}{containers.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aabdcf98294bd3aba6969bb89fb5399e5}\label{namespace_k_b_l_i_b___n_s_aabdcf98294bd3aba6969bb89fb5399e5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!quantize\_range@{quantize\_range}}
\index{quantize\_range@{quantize\_range}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{quantize\_range()}{quantize\_range()}}
{\footnotesize\ttfamily template$<$typename T , typename F $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::quantize\+\_\+range (\begin{DoxyParamCaption}\item[{F}]{low,  }\item[{F}]{high,  }\item[{F}]{val }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Quantize a real-\/valued value into a discrete integer. 


\begin{DoxyTemplParams}{Template Parameters}
{\em T} & An unsigned integral type. \\
\hline
\end{DoxyTemplParams}

\begin{DoxyParams}{Parameters}
{\em min} & The real value corresponding to min in the output. \\
\hline
{\em max} & The real value corresponding to max in the output. \\
\hline
{\em val} & The input value. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The quantized value of the input. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stats_8h_source_l00553}{553}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_acbd04ed4ac7b170b334da5f21ad3b3f9}\label{namespace_k_b_l_i_b___n_s_acbd04ed4ac7b170b334da5f21ad3b3f9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!quantize\_step@{quantize\_step}}
\index{quantize\_step@{quantize\_step}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{quantize\_step()}{quantize\_step()}}
{\footnotesize\ttfamily template$<$typename T , typename F $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::quantize\+\_\+step (\begin{DoxyParamCaption}\item[{F}]{low,  }\item[{F}]{delta,  }\item[{F}]{val }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Quantize a real-\/valued value into a discrete integer. 

TODO(killerbee13)\+: write tests and fix style issues for quantization functions


\begin{DoxyTemplParams}{Template Parameters}
{\em T} & An unsigned integral type. \\
\hline
\end{DoxyTemplParams}

\begin{DoxyParams}{Parameters}
{\em min} & The real value corresponding to 0 in the output. \\
\hline
{\em delta} & The difference between quantization steps. \\
\hline
{\em val} & The input value. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The quantized value of the input. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stats_8h_source_l00537}{537}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af129a587bdaf7d9ccb7f0c7395202d86}\label{namespace_k_b_l_i_b___n_s_af129a587bdaf7d9ccb7f0c7395202d86}} 
\index{KBLIB\_NS@{KBLIB\_NS}!quoted@{quoted}}
\index{quoted@{quoted}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{quoted()}{quoted()}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::quoted (\begin{DoxyParamCaption}\item[{string \&\&}]{in }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00609}{609}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a745c618407d81dee275529800bac2cde}\label{namespace_k_b_l_i_b___n_s_a745c618407d81dee275529800bac2cde}} 
\index{KBLIB\_NS@{KBLIB\_NS}!range@{range}}
\index{range@{range}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{range()}{range()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Value $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::range (\begin{DoxyParamCaption}\item[{Value}]{max }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1range__t}{range\+\_\+t}}$<$Value, \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1incrementer}{incrementer}}$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Constructs a half-\/open range \mbox{[}0, max). The step is automatically determined based on the sign of max. 


\begin{DoxyParams}{Parameters}
{\em max} & The first value not in the produced range. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
range\+\_\+t$<$\+Value, int$>$ An iterable range \mbox{[}0, max). 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{iterators_8h_source_l00642}{642}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}\label{namespace_k_b_l_i_b___n_s_a6adbe653b83d357b9dfa6a1d18395aec}} 
\index{KBLIB\_NS@{KBLIB\_NS}!range@{range}}
\index{range@{range}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{range()}{range()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Value , typename Delta  = int$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::range (\begin{DoxyParamCaption}\item[{Value}]{min,  }\item[{Value}]{max,  }\item[{Delta}]{step = {\ttfamily 0} }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1range__t}{range\+\_\+t}}$<$Value, Delta$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Constructs a range from beginning, end, and step amount. The range is half-\/open, that is min is in the range but max is not. If unspecified, the step is automatically either 1 or -\/1, depending on whether max \texorpdfstring{$>$}{>} min. 


\begin{DoxyParams}{Parameters}
{\em min} & The first value in the produced range. \\
\hline
{\em max} & The first value not in the produced range. \\
\hline
{\em step} & The difference between values in the produced range. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
range\+\_\+t$<$\+Value, Delta$>$ An iterable range \mbox{[}min, max). 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{iterators_8h_source_l00621}{621}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae2c40df6afb11bbcf00518ff4ab90334}\label{namespace_k_b_l_i_b___n_s_ae2c40df6afb11bbcf00518ff4ab90334}} 
\index{KBLIB\_NS@{KBLIB\_NS}!remove\_null\_terminator@{remove\_null\_terminator}}
\index{remove\_null\_terminator@{remove\_null\_terminator}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{remove\_null\_terminator()}{remove\_null\_terminator()}}
{\footnotesize\ttfamily template$<$int N, typename Indices  = std\+::make\+\_\+integer\+\_\+sequence$<$int, N -\/ 1$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::remove\+\_\+null\+\_\+terminator (\begin{DoxyParamCaption}\item[{const char(\&)}]{arr\mbox{[}\+N\mbox{]} }\end{DoxyParamCaption}) -\/$>$ std\+::array$<$char, N -\/ 1$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Creates an array of only the meaningful characters in a string literal, and not the null terminator. 


\begin{DoxyParams}{Parameters}
{\em arr} & A string literal to strip the null terminator from. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
std\+::array\texorpdfstring{$<$}{<}char, N -\/ 1\texorpdfstring{$>$}{>} A std\+::array of the meaningful characters of the string literal. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{traits_8h_source_l00135}{135}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a851a902d0ad2b43995b4d35bb7ed5762}\label{namespace_k_b_l_i_b___n_s_a851a902d0ad2b43995b4d35bb7ed5762}} 
\index{KBLIB\_NS@{KBLIB\_NS}!repeat@{repeat}}
\index{repeat@{repeat}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{repeat()}{repeat()}\hspace{0.1cm}{\footnotesize\ttfamily [1/3]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::repeat (\begin{DoxyParamCaption}\item[{char}]{val,  }\item[{std\+::size\+\_\+t}]{count }\end{DoxyParamCaption}) -\/$>$ std\+::string \hspace{0.3cm}{\ttfamily [inline]}}



Construct a string consisting of count copies of val. 

This function is a trivial wrapper around a constructor of std\+::string provided for symmetry with the above overload.


\begin{DoxyParams}{Parameters}
{\em val} & The character to be repeated. \\
\hline
{\em count} & The number of times to repeat val. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00639}{639}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a77513f07af0f3ac69df7106123d43a7e}\label{namespace_k_b_l_i_b___n_s_a77513f07af0f3ac69df7106123d43a7e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!repeat@{repeat}}
\index{repeat@{repeat}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{repeat()}{repeat()}\hspace{0.1cm}{\footnotesize\ttfamily [2/3]}}
{\footnotesize\ttfamily template$<$typename Callable $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::repeat (\begin{DoxyParamCaption}\item[{std\+::size\+\_\+t}]{N,  }\item[{Callable}]{func }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}{return\+\_\+assert\+\_\+t}}$<$\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1fakestd_1_1is__invocable}{is\+\_\+invocable}}$<$Callable$>$\+::value, void$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Invoke a function N times. 


\begin{DoxyParams}{Parameters}
{\em N} & The number of times to invoke func. \\
\hline
{\em func} & The function to invoke. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00053}{53}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a059167dadeec66edfae81dc9e86348ca}\label{namespace_k_b_l_i_b___n_s_a059167dadeec66edfae81dc9e86348ca}} 
\index{KBLIB\_NS@{KBLIB\_NS}!repeat@{repeat}}
\index{repeat@{repeat}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{repeat()}{repeat()}\hspace{0.1cm}{\footnotesize\ttfamily [3/3]}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::repeat (\begin{DoxyParamCaption}\item[{string}]{val,  }\item[{std\+::size\+\_\+t}]{count }\end{DoxyParamCaption}) -\/$>$ string }



Construct a string consisting of count copies of val concatenated together. 

This function currently works greedily and will be inefficient for large values of count.


\begin{DoxyParams}{Parameters}
{\em val} & \\
\hline
{\em count} & \\
\hline
\end{DoxyParams}
\begin{DoxyRefDesc}{Todo}
\item[\mbox{\hyperlink{todo__todo000002}{Todo}}]Defer constrution of a string with a class. \end{DoxyRefDesc}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00622}{622}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a010dc9df3a70eb8fe35947438a6d2b9f}\label{namespace_k_b_l_i_b___n_s_a010dc9df3a70eb8fe35947438a6d2b9f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!replace\_copy\_if@{replace\_copy\_if}}
\index{replace\_copy\_if@{replace\_copy\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{replace\_copy\_if()}{replace\_copy\_if()}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename Output\+It , typename Unary\+Predicate , typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::replace\+\_\+copy\+\_\+if (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Output\+It}]{out,  }\item[{Unary\+Predicate}]{pred,  }\item[{const T \&}]{new\+\_\+value }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



Copies an input range, but every element for which pred is true is replaced by new\+\_\+value. It also allows for a sentinel end iterator. 

\begin{DoxyRemark}{Remarks}
This function is {\ttfamily constexpr} in C++14.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the input range. \\
\hline
{\em last} & The end of the input range. \\
\hline
{\em out} & The beginning of the output range. \\
\hline
{\em pred} & The predicate to apply. \\
\hline
{\em new\+\_\+value} & The value to replace those elements for which pred is true with. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
An iterator to past the last element written. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01413}{1413}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a5cc109a4e42962baf40f85ec206a08a9}\label{namespace_k_b_l_i_b___n_s_a5cc109a4e42962baf40f85ec206a08a9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!replace\_copy\_n\_if@{replace\_copy\_n\_if}}
\index{replace\_copy\_n\_if@{replace\_copy\_n\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{replace\_copy\_n\_if()}{replace\_copy\_n\_if()}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename Size , typename Output\+It , typename Unary\+Predicate , typename T $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::replace\+\_\+copy\+\_\+n\+\_\+if (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Size}]{count,  }\item[{Output\+It}]{out,  }\item[{Unary\+Predicate}]{pred,  }\item[{const T \&}]{new\+\_\+value }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



Copies an input range, but every element for which pred is true is replaced by new\+\_\+value. 

\begin{DoxyRemark}{Remarks}
This function is {\ttfamily constexpr} in C++14.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the input range. \\
\hline
{\em count} & The number of elements to copy. \\
\hline
{\em out} & The beginning of the output range. \\
\hline
{\em pred} & The predicate to apply. \\
\hline
{\em new\+\_\+value} & The value to replace those elements for which pred is true with. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Output\+It An iterator to past the last element written. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01444}{1444}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a758c1217ec1632ac03b50aecdb92fc5b}\label{namespace_k_b_l_i_b___n_s_a758c1217ec1632ac03b50aecdb92fc5b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!reverse\_str@{reverse\_str}}
\index{reverse\_str@{reverse\_str}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{reverse\_str()}{reverse\_str()}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::reverse\+\_\+str (\begin{DoxyParamCaption}\item[{string}]{val }\end{DoxyParamCaption}) -\/$>$ string }



Reverses all the elements of its input. 

\begin{DoxyAttention}{Attention}
This function will not behave correctly with multibyte character encodings.
\end{DoxyAttention}

\begin{DoxyParams}{Parameters}
{\em val} & The string to reverse. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
string The reversed range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00552}{552}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab543086d96131814403ccda4ee06a44e}\label{namespace_k_b_l_i_b___n_s_ab543086d96131814403ccda4ee06a44e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!root\_2@{root\_2}}
\index{root\_2@{root\_2}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{root\_2()}{root\_2()}}
{\footnotesize\ttfamily template$<$typename T  = double$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::root\+\_\+2 (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{stats_8h_source_l00472}{472}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_afebb3d0b21df34d91af0be476f922437}\label{namespace_k_b_l_i_b___n_s_afebb3d0b21df34d91af0be476f922437}} 
\index{KBLIB\_NS@{KBLIB\_NS}!rotate@{rotate}}
\index{rotate@{rotate}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{rotate()}{rotate()}}
{\footnotesize\ttfamily template$<$class Forward\+It $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::rotate (\begin{DoxyParamCaption}\item[{Forward\+It}]{first,  }\item[{Forward\+It}]{n\+\_\+first,  }\item[{Forward\+It}]{last }\end{DoxyParamCaption}) -\/$>$ Forward\+It \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Rotates the input range. This is just a constexpr-\/in-\/\+C++14 version of std\+::rotate. 


\begin{DoxyParams}{Parameters}
{\em first} & \\
\hline
{\em n\+\_\+first} & \\
\hline
{\em last} & \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Forward\+It 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01509}{1509}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aab3310632bd16a3a0a340194213964c1}\label{namespace_k_b_l_i_b___n_s_aab3310632bd16a3a0a340194213964c1}} 
\index{KBLIB\_NS@{KBLIB\_NS}!safe\_auto@{safe\_auto}}
\index{safe\_auto@{safe\_auto}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{safe\_auto()}{safe\_auto()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::safe\+\_\+auto (\begin{DoxyParamCaption}\item[{T \&\&}]{in }\end{DoxyParamCaption}) -\/$>$ T }



Safely propagate an xvalue or lvalue without dangling references. 



Definition at line \mbox{\hyperlink{simple_8h_source_l00217}{217}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a2aba0058576819b12818438dadcfcf06}\label{namespace_k_b_l_i_b___n_s_a2aba0058576819b12818438dadcfcf06}} 
\index{KBLIB\_NS@{KBLIB\_NS}!safe\_auto@{safe\_auto}}
\index{safe\_auto@{safe\_auto}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{safe\_auto()}{safe\_auto()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::safe\+\_\+auto (\begin{DoxyParamCaption}\item[{T \&}]{in }\end{DoxyParamCaption}) -\/$>$ T\& }



Safely propagate an xvalue or lvalue without dangling references. 



Definition at line \mbox{\hyperlink{simple_8h_source_l00225}{225}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aae4b6d6cd09943101cf3c90c64ca6f6d}\label{namespace_k_b_l_i_b___n_s_aae4b6d6cd09943101cf3c90c64ca6f6d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!saturating\_cast@{saturating\_cast}}
\index{saturating\_cast@{saturating\_cast}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{saturating\_cast()}{saturating\_cast()}}
{\footnotesize\ttfamily template$<$typename A , typename F $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::saturating\+\_\+cast (\begin{DoxyParamCaption}\item[{F}]{x }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$std\+::is\+\_\+integral$<$A$>$\+::value and std\+::is\+\_\+integral$<$F$>$\+::value                        and std\+::is\+\_\+unsigned$<$A$>$\+::value,                    A$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{stats_8h_source_l00482}{482}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad5ef83609d07ad762d095145857fb5c3}\label{namespace_k_b_l_i_b___n_s_ad5ef83609d07ad762d095145857fb5c3}} 
\index{KBLIB\_NS@{KBLIB\_NS}!scoped\_file@{scoped\_file}}
\index{scoped\_file@{scoped\_file}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{scoped\_file()}{scoped\_file()}}
{\footnotesize\ttfamily template$<$typename File  = std\+::fstream$>$ \\
auto KBLIB\+\_\+\+NS\+::scoped\+\_\+file (\begin{DoxyParamCaption}\item[{const std\+::filesystem\+::path \&}]{path,  }\item[{std\+::ios\+\_\+base\+::openmode}]{mode = {\ttfamily std\+:\+:ios\+\_\+base\+:\+:in~$\vert$~std\+:\+:ios\+\_\+base\+:\+:out} }\end{DoxyParamCaption})}



Definition at line \mbox{\hyperlink{io_8h_source_l00555}{555}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a04033b7ccfc7b2b090ca65bf83ef0e1f}\label{namespace_k_b_l_i_b___n_s_a04033b7ccfc7b2b090ca65bf83ef0e1f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!search\_replace\_copy@{search\_replace\_copy}}
\index{search\_replace\_copy@{search\_replace\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{search\_replace\_copy()}{search\_replace\_copy()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Forward\+It1 , typename Forward\+It2 , typename Forward\+It3 , typename Output\+It , typename Binary\+Predicate  = std\+::equal\+\_\+to$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::search\+\_\+replace\+\_\+copy (\begin{DoxyParamCaption}\item[{Forward\+It1}]{h\+\_\+begin,  }\item[{Forward\+It1}]{h\+\_\+end,  }\item[{Forward\+It2}]{n\+\_\+begin,  }\item[{Forward\+It2}]{n\+\_\+end,  }\item[{Forward\+It3}]{r\+\_\+begin,  }\item[{Forward\+It3}]{r\+\_\+end,  }\item[{Output\+It}]{d\+\_\+begin,  }\item[{Binary\+Predicate}]{Compare = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01462}{1462}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a70bdc9035068b4d6b9753b3e9b539012}\label{namespace_k_b_l_i_b___n_s_a70bdc9035068b4d6b9753b3e9b539012}} 
\index{KBLIB\_NS@{KBLIB\_NS}!search\_replace\_copy@{search\_replace\_copy}}
\index{search\_replace\_copy@{search\_replace\_copy}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{search\_replace\_copy()}{search\_replace\_copy()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Haystack , typename Needle , typename Replacement , typename Output\+It , typename Binary\+Predicate  = std\+::equal\+\_\+to$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::search\+\_\+replace\+\_\+copy (\begin{DoxyParamCaption}\item[{Haystack \&\&}]{haystack,  }\item[{Needle \&\&}]{needle,  }\item[{Replacement \&\&}]{replacement,  }\item[{Output\+It}]{d\+\_\+begin,  }\item[{Binary\+Predicate}]{compare = {\ttfamily \{\}} }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l01487}{1487}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a13a73ff3876a67a71aef1d4470e9152b}\label{namespace_k_b_l_i_b___n_s_a13a73ff3876a67a71aef1d4470e9152b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!seeded@{seeded}}
\index{seeded@{seeded}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{seeded()}{seeded()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Gen $>$ \\
auto KBLIB\+\_\+\+NS\+::seeded (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ Gen }



Definition at line \mbox{\hyperlink{random_8h_source_l00213}{213}} of file \mbox{\hyperlink{random_8h_source}{random.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a37ea952337d919c7a9594ad5629681e9}\label{namespace_k_b_l_i_b___n_s_a37ea952337d919c7a9594ad5629681e9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!seeded@{seeded}}
\index{seeded@{seeded}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{seeded()}{seeded()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Gen , typename Source $>$ \\
auto KBLIB\+\_\+\+NS\+::seeded (\begin{DoxyParamCaption}\item[{Source \&\&}]{s }\end{DoxyParamCaption}) -\/$>$ Gen }



Definition at line \mbox{\hyperlink{random_8h_source_l00206}{206}} of file \mbox{\hyperlink{random_8h_source}{random.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_acafe999611405acc2872d13bfc08a83c}\label{namespace_k_b_l_i_b___n_s_acafe999611405acc2872d13bfc08a83c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!signed\_cast@{signed\_cast}}
\index{signed\_cast@{signed\_cast}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{signed\_cast()}{signed\_cast()}}
{\footnotesize\ttfamily template$<$typename A , typename F $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::signed\+\_\+cast (\begin{DoxyParamCaption}\item[{F}]{x }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$std\+::is\+\_\+integral$<$A$>$\+::value and std\+::is\+\_\+integral$<$F$>$\+::value                        and std\+::is\+\_\+signed$<$A$>$\+::value,                    std\+::make\+\_\+signed\+\_\+t$<$F$>$$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Cast argument to equivalently-\/sized type with the same signednessas the template parameter. 



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00602}{602}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a95fa42737c2d8ccb47d4ed980458732b}\label{namespace_k_b_l_i_b___n_s_a95fa42737c2d8ccb47d4ed980458732b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!signed\_promote@{signed\_promote}}
\index{signed\_promote@{signed\_promote}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{signed\_promote()}{signed\_promote()}}
{\footnotesize\ttfamily template$<$typename N $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::signed\+\_\+promote (\begin{DoxyParamCaption}\item[{N}]{x }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a91a41b470a640f9d17fee50cfdd2fadb}{safe\+\_\+signed\+\_\+t}}$<$N$>$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00850}{850}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a4c92ee94a7a250948d44a29b0e7b3e78}\label{namespace_k_b_l_i_b___n_s_a4c92ee94a7a250948d44a29b0e7b3e78}} 
\index{KBLIB\_NS@{KBLIB\_NS}!size@{size}}
\index{size@{size}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{size()}{size()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename C $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::size (\begin{DoxyParamCaption}\item[{const C \&}]{c }\end{DoxyParamCaption}) -\/$>$ decltype(c.\+size()) \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l01070}{1070}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a06822247967e4520d9e8e2725fa4e2d4}\label{namespace_k_b_l_i_b___n_s_a06822247967e4520d9e8e2725fa4e2d4}} 
\index{KBLIB\_NS@{KBLIB\_NS}!size@{size}}
\index{size@{size}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{size()}{size()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename T , std\+::size\+\_\+t N$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::size (\begin{DoxyParamCaption}\item[{const }]{T(\&)\mbox{[}\+N\mbox{]} }\end{DoxyParamCaption}) -\/$>$ std\+::size\+\_\+t \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l01075}{1075}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a40b7b1fff3942578fe0f6490cadec47e}\label{namespace_k_b_l_i_b___n_s_a40b7b1fff3942578fe0f6490cadec47e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!sort@{sort}}
\index{sort@{sort}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{sort()}{sort()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::sort (\begin{DoxyParamCaption}\item[{Random\+Access\+It}]{begin,  }\item[{Random\+Access\+It}]{end }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}}


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to sort \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{sort_8h_source_l00731}{731}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa7efdb907743a191fc52f3517a0f0175}\label{namespace_k_b_l_i_b___n_s_aa7efdb907743a191fc52f3517a0f0175}} 
\index{KBLIB\_NS@{KBLIB\_NS}!sort@{sort}}
\index{sort@{sort}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{sort()}{sort()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It , typename Binary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::sort (\begin{DoxyParamCaption}\item[{Random\+Access\+It}]{begin,  }\item[{Random\+Access\+It}]{end,  }\item[{Binary\+Predicate \&\&}]{compare }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}}



Sorts a range. 

Complexity\+: worst-\/case O(\+N log(\+N)), where N = std\+::distance(begin, end) comparisons and swaps.


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to sort\\
\hline
{\em compare} & A comparison predicate which returns true if the first argument shall be ordered before the second. Binary\+Predicate must meet the requirements of the Compare named requirement. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{sort_8h_source_l00715}{715}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a739b00ac6efec5a41e399bca46d1e6fd}\label{namespace_k_b_l_i_b___n_s_a739b00ac6efec5a41e399bca46d1e6fd}} 
\index{KBLIB\_NS@{KBLIB\_NS}!sort\_transform@{sort\_transform}}
\index{sort\_transform@{sort\_transform}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{sort\_transform()}{sort\_transform()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It , typename Unary\+Operation $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::sort\+\_\+transform (\begin{DoxyParamCaption}\item[{Random\+Access\+It}]{begin,  }\item[{Random\+Access\+It}]{end,  }\item[{Unary\+Operation \&\&}]{transform }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}}


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to sort \\
\hline
{\em transform} & The transformation to apply \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{sort_8h_source_l00691}{691}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a65c6022b6e9095d1f743f7a3938ac2be}\label{namespace_k_b_l_i_b___n_s_a65c6022b6e9095d1f743f7a3938ac2be}} 
\index{KBLIB\_NS@{KBLIB\_NS}!sort\_transform@{sort\_transform}}
\index{sort\_transform@{sort\_transform}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{sort\_transform()}{sort\_transform()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It , typename Unary\+Operation , typename Binary\+Predicate $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::sort\+\_\+transform (\begin{DoxyParamCaption}\item[{Random\+Access\+It}]{begin,  }\item[{Random\+Access\+It}]{end,  }\item[{Unary\+Operation \&\&}]{transform,  }\item[{Binary\+Predicate \&\&}]{compare }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}}



Sorts a range after applying a transformation. 

Complexity\+: worst-\/case O(\+N log(\+N)), where N = std\+::distance(begin, end) comparisons and swaps.


\begin{DoxyParams}{Parameters}
{\em begin,end} & The range to sort \\
\hline
{\em transform} & A transformer (such as unary function or pointer to member) which will be applied to each object before comparing it. A transformer may not modify the object it is called with.\\
\hline
{\em compare} & A comparison predicate which returns true if the first argument shall be ordered before the second. Binary\+Predicate must meet the requirements of the Compare named requirement. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{sort_8h_source_l00674}{674}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae8eaf5b12b06c932a12825d061884eab}\label{namespace_k_b_l_i_b___n_s_ae8eaf5b12b06c932a12825d061884eab}} 
\index{KBLIB\_NS@{KBLIB\_NS}!split\_dsv@{split\_dsv}}
\index{split\_dsv@{split\_dsv}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{split\_dsv()}{split\_dsv()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename String $>$ \\
auto KBLIB\+\_\+\+NS\+::split\+\_\+dsv (\begin{DoxyParamCaption}\item[{const String \&}]{str,  }\item[{char}]{delim }\end{DoxyParamCaption}) -\/$>$ Container }



Split a string on all instances of delim. 


\begin{DoxyParams}{Parameters}
{\em in} & The string to split \\
\hline
{\em delim} & The character to split on. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container A sequence container of all substrings in the split input. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00501}{501}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9788c388a6be1d255a51a85269cf693d}\label{namespace_k_b_l_i_b___n_s_a9788c388a6be1d255a51a85269cf693d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!split\_dsv@{split\_dsv}}
\index{split\_dsv@{split\_dsv}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{split\_dsv()}{split\_dsv()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename String , typename Predicate $>$ \\
auto KBLIB\+\_\+\+NS\+::split\+\_\+dsv (\begin{DoxyParamCaption}\item[{const String \&}]{str,  }\item[{Predicate}]{delim }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}{return\+\_\+assert\+\_\+t}}$<$         \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__callable}{is\+\_\+callable}}$<$Predicate,                     typename Container\+::value\+\_\+type\+::value\+\_\+type$>$\+::value,         Container$>$ }



Split a string on all instances of delim. 


\begin{DoxyParams}{Parameters}
{\em in} & The string to split \\
\hline
{\em delim} & A predicate for delimiters. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container A sequence container of all substrings in the split input. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00522}{522}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6b9b38fb6375a44de7228d43f3910d78}\label{namespace_k_b_l_i_b___n_s_a6b9b38fb6375a44de7228d43f3910d78}} 
\index{KBLIB\_NS@{KBLIB\_NS}!split\_tokens@{split\_tokens}}
\index{split\_tokens@{split\_tokens}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{split\_tokens()}{split\_tokens()}\hspace{0.1cm}{\footnotesize\ttfamily [1/3]}}
{\footnotesize\ttfamily template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename String $>$ \\
auto KBLIB\+\_\+\+NS\+::split\+\_\+tokens (\begin{DoxyParamCaption}\item[{const String \&}]{in }\end{DoxyParamCaption}) -\/$>$ Container }



Split a string on all instances of whitespace. 


\begin{DoxyParams}{Parameters}
{\em in} & The string to split \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container A sequence container of all substrings in the split input. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00433}{433}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a5adc721af48c3d00ebd2070dc186e3e9}\label{namespace_k_b_l_i_b___n_s_a5adc721af48c3d00ebd2070dc186e3e9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!split\_tokens@{split\_tokens}}
\index{split\_tokens@{split\_tokens}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{split\_tokens()}{split\_tokens()}\hspace{0.1cm}{\footnotesize\ttfamily [2/3]}}
{\footnotesize\ttfamily template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename Predicate , typename String $>$ \\
auto KBLIB\+\_\+\+NS\+::split\+\_\+tokens (\begin{DoxyParamCaption}\item[{const String \&}]{in,  }\item[{Predicate}]{spacer }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a8a265d663728c6ae2f255e18916ebd06}{return\+\_\+assert\+\_\+t}}$<$         \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__callable}{is\+\_\+callable}}$<$Predicate,                     typename Container\+::value\+\_\+type\+::value\+\_\+type$>$\+::value,         Container$>$ }



Split a string on all condensed delimiters. 


\begin{DoxyParams}{Parameters}
{\em in} & The string to split \\
\hline
{\em spacer} & A predicate which determines whether a character is a delimiter. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container A sequence container of all substrings in the split input. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00397}{397}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab09517fa04150ca420cca2c02b842419}\label{namespace_k_b_l_i_b___n_s_ab09517fa04150ca420cca2c02b842419}} 
\index{KBLIB\_NS@{KBLIB\_NS}!split\_tokens@{split\_tokens}}
\index{split\_tokens@{split\_tokens}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{split\_tokens()}{split\_tokens()}\hspace{0.1cm}{\footnotesize\ttfamily [3/3]}}
{\footnotesize\ttfamily template$<$typename Container  = std\+::vector$<$std\+::string$>$, typename String $>$ \\
auto KBLIB\+\_\+\+NS\+::split\+\_\+tokens (\begin{DoxyParamCaption}\item[{const String \&}]{in,  }\item[{typename Container\+::value\+\_\+type\+::value\+\_\+type}]{delim }\end{DoxyParamCaption}) -\/$>$ Container }



Split a string on all instances of a delimiter. 


\begin{DoxyParams}{Parameters}
{\em in} & The string to split \\
\hline
{\em delim} & The character to split on. A run of delimiters is condensed. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Container A sequence container of all substrings in the split input. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00445}{445}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a038b8f8a29c08c5e8abf893bed3d6942}\label{namespace_k_b_l_i_b___n_s_a038b8f8a29c08c5e8abf893bed3d6942}} 
\index{KBLIB\_NS@{KBLIB\_NS}!starts\_with@{starts\_with}}
\index{starts\_with@{starts\_with}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{starts\_with()}{starts\_with()}\hspace{0.1cm}{\footnotesize\ttfamily [1/4]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename End\+It1 , typename Input\+It2 , typename End\+It2 , typename Binary\+Pred $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::starts\+\_\+with (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin1,  }\item[{End\+It1}]{end1,  }\item[{Input\+It2}]{begin2,  }\item[{End\+It2}]{end2,  }\item[{Binary\+Pred}]{pred }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$         (\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a547a1e7930fbf709bb1b79b40f482566}{is\+\_\+input\+\_\+iterator\+\_\+v}}$<$Input\+It1$>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a547a1e7930fbf709bb1b79b40f482566}{is\+\_\+input\+\_\+iterator\+\_\+v}}$<$Input\+It2$>$)          and not (\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$                      Input\+It1$>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$Input\+It2$>$),         bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Checks if a given range starts with a particular subrange. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00738}{738}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a218af9c4eaab5cc0d407c8e1546fa75b}\label{namespace_k_b_l_i_b___n_s_a218af9c4eaab5cc0d407c8e1546fa75b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!starts\_with@{starts\_with}}
\index{starts\_with@{starts\_with}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{starts\_with()}{starts\_with()}\hspace{0.1cm}{\footnotesize\ttfamily [2/4]}}
{\footnotesize\ttfamily template$<$typename Random\+Access\+It1 , typename Random\+Access\+It2 , typename Binary\+Pred  = std\+::equal\+\_\+to$<$$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::starts\+\_\+with (\begin{DoxyParamCaption}\item[{Random\+Access\+It1}]{begin1,  }\item[{Random\+Access\+It1}]{end1,  }\item[{Random\+Access\+It2}]{begin2,  }\item[{Random\+Access\+It2}]{end2,  }\item[{Binary\+Pred}]{pred = {\ttfamily \{\}} }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a99591fc5eb07c4adb7ec5f0998edb928}{enable\+\_\+if\+\_\+t}}$<$         \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$             Random\+Access\+It1$>$ and \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}{is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v}}$<$Random\+Access\+It2$>$,         bool$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Checks if a given range starts with a particular subrange. 



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00759}{759}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a0e4a14d283de53aadad3f0152a289b71}\label{namespace_k_b_l_i_b___n_s_a0e4a14d283de53aadad3f0152a289b71}} 
\index{KBLIB\_NS@{KBLIB\_NS}!starts\_with@{starts\_with}}
\index{starts\_with@{starts\_with}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{starts\_with()}{starts\_with()}\hspace{0.1cm}{\footnotesize\ttfamily [3/4]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::starts\+\_\+with (\begin{DoxyParamCaption}\item[{std\+::string\+\_\+view}]{haystack,  }\item[{char}]{needle }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}}



Checks if a given string starts with a particular string. 


\begin{DoxyParams}{Parameters}
{\em haystack} & The string to be checked. \\
\hline
{\em needle} & The prefix to check for. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
bool If haystack starts with needle. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00688}{688}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a71bf9af47d341a1091715059f7befb1a}\label{namespace_k_b_l_i_b___n_s_a71bf9af47d341a1091715059f7befb1a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!starts\_with@{starts\_with}}
\index{starts\_with@{starts\_with}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{starts\_with()}{starts\_with()}\hspace{0.1cm}{\footnotesize\ttfamily [4/4]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::starts\+\_\+with (\begin{DoxyParamCaption}\item[{std\+::string\+\_\+view}]{haystack,  }\item[{std\+::string\+\_\+view}]{needle }\end{DoxyParamCaption}) -\/$>$ bool \hspace{0.3cm}{\ttfamily [inline]}}



Checks if a given string starts with a particular string. 


\begin{DoxyParams}{Parameters}
{\em haystack} & The string to be checked. \\
\hline
{\em needle} & The prefix to check for. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
bool If haystack starts with needle. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00676}{676}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a05212882618e578a8d6f9999f2967c25}\label{namespace_k_b_l_i_b___n_s_a05212882618e578a8d6f9999f2967c25}} 
\index{KBLIB\_NS@{KBLIB\_NS}!static\_coerce@{static\_coerce}}
\index{static\_coerce@{static\_coerce}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{static\_coerce()}{static\_coerce()}}
{\footnotesize\ttfamily template$<$typename To , typename... Ts$>$ \\
auto KBLIB\+\_\+\+NS\+::static\+\_\+coerce (\begin{DoxyParamCaption}\item[{const std\+::variant$<$ Ts... $>$ \&}]{v }\end{DoxyParamCaption}) -\/$>$ To }



static\+\_\+casts the value of v (no matter its type) to type To. 


\begin{DoxyParams}{Parameters}
{\em v} & A variant to coerce. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
To The type to coerce to. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{variant_8h_source_l00080}{80}} of file \mbox{\hyperlink{variant_8h_source}{variant.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a2f65579e911e295dca39a7770c22f022}\label{namespace_k_b_l_i_b___n_s_a2f65579e911e295dca39a7770c22f022}} 
\index{KBLIB\_NS@{KBLIB\_NS}!strsize@{strsize}}
\index{strsize@{strsize}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{strsize()}{strsize()}}
{\footnotesize\ttfamily template$<$typename Str $>$ \\
auto KBLIB\+\_\+\+NS\+::strsize (\begin{DoxyParamCaption}\item[{Str \&\&}]{str }\end{DoxyParamCaption}) -\/$>$ std\+::size\+\_\+t }



Determines the size in characters of any valid argument to concat or append. 


\begin{DoxyParams}{Parameters}
{\em str} & A value of any stringlike or arithmetic type to count the characters of. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
std\+::size\+\_\+t The number of characters needed to represent str. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00217}{217}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a5d48b1cec61b0ac320ba5522476da644}\label{namespace_k_b_l_i_b___n_s_a5d48b1cec61b0ac320ba5522476da644}} 
\index{KBLIB\_NS@{KBLIB\_NS}!sum@{sum}}
\index{sum@{sum}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{sum()}{sum()}\hspace{0.1cm}{\footnotesize\ttfamily [1/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::sum (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last }\end{DoxyParamCaption}) -\/$>$ std\+::decay\+\_\+t$<$decltype($\ast$first)$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Sum a range. 

Convenience wrapper for std\+::accumulate. For an empty range, returns a value-\/initialized temporary (usually 0). Deduces the correct type for the initializer, which reduces risk of truncation and incorrect results.


\begin{DoxyParams}[1]{Parameters}
\mbox{\texttt{ in}}  & {\em first} & Beginning of range \\
\hline
\mbox{\texttt{ in}}  & {\em last} & End of range \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The sum of the input range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00194}{194}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a146482c2a0c53da5fe57eed6e0c9040e}\label{namespace_k_b_l_i_b___n_s_a146482c2a0c53da5fe57eed6e0c9040e}} 
\index{KBLIB\_NS@{KBLIB\_NS}!sum@{sum}}
\index{sum@{sum}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{sum()}{sum()}\hspace{0.1cm}{\footnotesize\ttfamily [2/3]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename Binary\+Operation $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::sum (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{Input\+It}]{last,  }\item[{Binary\+Operation}]{op }\end{DoxyParamCaption}) -\/$>$ std\+::decay\+\_\+t$<$decltype($\ast$first)$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Fold a range over an operation. 

Convenience wrapper for std\+::accumulate. For an empty range, returns a value-\/initialized temporary (usually 0). Deduces the correct type for the initializer, which reduces risk of truncation and incorrect results.


\begin{DoxyParams}[1]{Parameters}
\mbox{\texttt{ in}}  & {\em first} & Beginning of range \\
\hline
\mbox{\texttt{ in}}  & {\em last} & End of range \\
\hline
\mbox{\texttt{ in}}  & {\em op} & The fold operation \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The sum of the input range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00216}{216}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6a38ad93575187b89e5cd84e78abaf15}\label{namespace_k_b_l_i_b___n_s_a6a38ad93575187b89e5cd84e78abaf15}} 
\index{KBLIB\_NS@{KBLIB\_NS}!sum@{sum}}
\index{sum@{sum}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{sum()}{sum()}\hspace{0.1cm}{\footnotesize\ttfamily [3/3]}}
{\footnotesize\ttfamily template$<$typename Range $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::sum (\begin{DoxyParamCaption}\item[{Range \&\&}]{r }\end{DoxyParamCaption}) -\/$>$ auto \hspace{0.3cm}{\ttfamily [constexpr]}}



Sum a range. 

Convenience wrapper for std\+::accumulate. For an empty range, returns a value-\/initialized temporary (usually 0). Deduces the correct type for the initializer, which reduces risk of truncation and incorrect results.


\begin{DoxyParams}[1]{Parameters}
\mbox{\texttt{ in}}  & {\em r} & The range to sum \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The sum of the input range. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l00237}{237}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a5649fc2cd5d97c7cfbfe2fc8b6abe394}\label{namespace_k_b_l_i_b___n_s_a5649fc2cd5d97c7cfbfe2fc8b6abe394}} 
\index{KBLIB\_NS@{KBLIB\_NS}!tau@{tau}}
\index{tau@{tau}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{tau()}{tau()}}
{\footnotesize\ttfamily template$<$typename T  = double$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::tau (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) -\/$>$ T \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{stats_8h_source_l00464}{464}} of file \mbox{\hyperlink{stats_8h_source}{stats.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9e10baddbb022f5427515e33ba089c18}\label{namespace_k_b_l_i_b___n_s_a9e10baddbb022f5427515e33ba089c18}} 
\index{KBLIB\_NS@{KBLIB\_NS}!tee@{tee}}
\index{tee@{tee}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{tee()}{tee()}}
{\footnotesize\ttfamily template$<$typename StreamA , typename StreamB $>$ \\
auto KBLIB\+\_\+\+NS\+::tee (\begin{DoxyParamCaption}\item[{StreamA \&}]{a,  }\item[{StreamB \&}]{b }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1basic__teestream}{basic\+\_\+teestream}}$<$StreamA, StreamB$>$ }



Definition at line \mbox{\hyperlink{io_8h_source_l00525}{525}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae21ed944a75d48c221481f4c6937b34c}\label{namespace_k_b_l_i_b___n_s_ae21ed944a75d48c221481f4c6937b34c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!time\_to\_str@{time\_to\_str}}
\index{time\_to\_str@{time\_to\_str}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{time\_to\_str()}{time\_to\_str()}}
{\footnotesize\ttfamily template$<$int max\+Buf\+Len = 4096, typename clock , typename duration $>$ \\
auto KBLIB\+\_\+\+NS\+::time\+\_\+to\+\_\+str (\begin{DoxyParamCaption}\item[{std\+::chrono\+::time\+\_\+point$<$ clock, duration $>$ \&}]{tp,  }\item[{const std\+::string \&}]{fmt = {\ttfamily \char`\"{}\%F~\%T\char`\"{}} }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00249}{249}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a8f69a38c346e76844a7f85a37f739710}\label{namespace_k_b_l_i_b___n_s_a8f69a38c346e76844a7f85a37f739710}} 
\index{KBLIB\_NS@{KBLIB\_NS}!tmpfile@{tmpfile}}
\index{tmpfile@{tmpfile}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{tmpfile()}{tmpfile()}}
{\footnotesize\ttfamily template$<$typename File  = std\+::fstream$>$ \\
auto KBLIB\+\_\+\+NS\+::tmpfile (\begin{DoxyParamCaption}\item[{const std\+::filesystem\+::path \&}]{path,  }\item[{std\+::ios\+\_\+base\+::openmode}]{mode = {\ttfamily std\+:\+:ios\+\_\+base\+:\+:in~$\vert$~std\+:\+:ios\+\_\+base\+:\+:out} }\end{DoxyParamCaption})}



Definition at line \mbox{\hyperlink{io_8h_source_l00563}{563}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae1e351b026f08dd5504d72f4f253b0bb}\label{namespace_k_b_l_i_b___n_s_ae1e351b026f08dd5504d72f4f253b0bb}} 
\index{KBLIB\_NS@{KBLIB\_NS}!to\_bytes@{to\_bytes}}
\index{to\_bytes@{to\_bytes}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{to\_bytes()}{to\_bytes()}}
{\footnotesize\ttfamily template$<$typename Integral , typename CharT $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::to\+\_\+bytes (\begin{DoxyParamCaption}\item[{Integral}]{val,  }\item[{CharT(\&)}]{dest\mbox{[}sizeof(\+Integral)\mbox{]} }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{hash_8h_source_l00080}{80}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aee9cc4f92a7ea3ca84f35e51b24d8785}\label{namespace_k_b_l_i_b___n_s_aee9cc4f92a7ea3ca84f35e51b24d8785}} 
\index{KBLIB\_NS@{KBLIB\_NS}!to\_bytes\_be@{to\_bytes\_be}}
\index{to\_bytes\_be@{to\_bytes\_be}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{to\_bytes\_be()}{to\_bytes\_be()}}
{\footnotesize\ttfamily template$<$typename Integral , typename CharT $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::to\+\_\+bytes\+\_\+be (\begin{DoxyParamCaption}\item[{Integral}]{ival,  }\item[{CharT(\&)}]{dest\mbox{[}sizeof(\+Integral)\mbox{]} }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{hash_8h_source_l00068}{68}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7bfbd64c936a402d66726e9aba676304}\label{namespace_k_b_l_i_b___n_s_a7bfbd64c936a402d66726e9aba676304}} 
\index{KBLIB\_NS@{KBLIB\_NS}!to\_bytes\_le@{to\_bytes\_le}}
\index{to\_bytes\_le@{to\_bytes\_le}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{to\_bytes\_le()}{to\_bytes\_le()}}
{\footnotesize\ttfamily template$<$typename Integral , typename CharT $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::to\+\_\+bytes\+\_\+le (\begin{DoxyParamCaption}\item[{Integral}]{ival,  }\item[{CharT(\&)}]{dest\mbox{[}sizeof(\+Integral)\mbox{]} }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{hash_8h_source_l00056}{56}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a74ab3a9d881e3fcf4f4f081292fea57c}\label{namespace_k_b_l_i_b___n_s_a74ab3a9d881e3fcf4f4f081292fea57c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!to\_pointer@{to\_pointer}}
\index{to\_pointer@{to\_pointer}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{to\_pointer()}{to\_pointer()}}
{\footnotesize\ttfamily template$<$typename P $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::to\+\_\+pointer (\begin{DoxyParamCaption}\item[{P \&\&}]{p }\end{DoxyParamCaption}) -\/$>$ auto$\ast$ \hspace{0.3cm}{\ttfamily [constexpr]}, {\ttfamily [noexcept]}}



Gets a raw pointer out of any smart pointer or iterator you might pass in, without dereferencing it or relying on a \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af860681f5cf19cd64006f9e71aae5de9}{get()}} method. 


\begin{DoxyParams}{Parameters}
{\em p} & A smart pointer to extract from. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{iterators_8h_source_l00072}{72}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a0bf6727ccda28bc596400a97e889b630}\label{namespace_k_b_l_i_b___n_s_a0bf6727ccda28bc596400a97e889b630}} 
\index{KBLIB\_NS@{KBLIB\_NS}!to\_signed@{to\_signed}}
\index{to\_signed@{to\_signed}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{to\_signed()}{to\_signed()}}
{\footnotesize\ttfamily template$<$typename I $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::to\+\_\+signed (\begin{DoxyParamCaption}\item[{I}]{x }\end{DoxyParamCaption}) -\/$>$ std\+::make\+\_\+signed\+\_\+t$<$I$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Cast integral argument to corresponding signed type. 



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00593}{593}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a637c9698ae9288ff611e9547a7905f76}\label{namespace_k_b_l_i_b___n_s_a637c9698ae9288ff611e9547a7905f76}} 
\index{KBLIB\_NS@{KBLIB\_NS}!to\_string@{to\_string}}
\index{to\_string@{to\_string}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{to\_string()}{to\_string()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$int base, typename Int $>$ \\
auto KBLIB\+\_\+\+NS\+::to\+\_\+string (\begin{DoxyParamCaption}\item[{Int}]{num }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00071}{71}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3d3c76ec1770949fd16862b9fffe15dd}\label{namespace_k_b_l_i_b___n_s_a3d3c76ec1770949fd16862b9fffe15dd}} 
\index{KBLIB\_NS@{KBLIB\_NS}!to\_string@{to\_string}}
\index{to\_string@{to\_string}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{to\_string()}{to\_string()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Int $>$ \\
auto KBLIB\+\_\+\+NS\+::to\+\_\+string (\begin{DoxyParamCaption}\item[{Int}]{num,  }\item[{int}]{base }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00094}{94}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a4c1ba1ef4c78ce0f5dba55945d70c8a5}\label{namespace_k_b_l_i_b___n_s_a4c1ba1ef4c78ce0f5dba55945d70c8a5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!to\_unique@{to\_unique}}
\index{to\_unique@{to\_unique}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{to\_unique()}{to\_unique()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::to\+\_\+unique (\begin{DoxyParamCaption}\item[{gsl\+::owner$<$ T $\ast$ $>$}]{p }\end{DoxyParamCaption}) -\/$>$ std\+::unique\+\_\+ptr$<$T$>$ }



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00573}{573}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a546cfb179cb6d14095e3da0271e4df91}\label{namespace_k_b_l_i_b___n_s_a546cfb179cb6d14095e3da0271e4df91}} 
\index{KBLIB\_NS@{KBLIB\_NS}!to\_unique@{to\_unique}}
\index{to\_unique@{to\_unique}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{to\_unique()}{to\_unique()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename T , typename D $>$ \\
auto KBLIB\+\_\+\+NS\+::to\+\_\+unique (\begin{DoxyParamCaption}\item[{gsl\+::owner$<$ T $\ast$ $>$}]{p,  }\item[{D \&\&}]{d }\end{DoxyParamCaption}) -\/$>$ std\+::unique\+\_\+ptr$<$T, D$>$ }



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00577}{577}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a95c6c350179360eac5f4f1b01eff86b3}\label{namespace_k_b_l_i_b___n_s_a95c6c350179360eac5f4f1b01eff86b3}} 
\index{KBLIB\_NS@{KBLIB\_NS}!to\_unsigned@{to\_unsigned}}
\index{to\_unsigned@{to\_unsigned}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{to\_unsigned()}{to\_unsigned()}}
{\footnotesize\ttfamily template$<$typename I $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::to\+\_\+unsigned (\begin{DoxyParamCaption}\item[{I}]{x }\end{DoxyParamCaption}) -\/$>$ std\+::make\+\_\+unsigned\+\_\+t$<$I$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Cast integral argument to corresponding unsigned type. 



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00586}{586}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af4da1056b52c74075982b32b83e10460}\label{namespace_k_b_l_i_b___n_s_af4da1056b52c74075982b32b83e10460}} 
\index{KBLIB\_NS@{KBLIB\_NS}!tolower@{tolower}}
\index{tolower@{tolower}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{tolower()}{tolower()}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::tolower (\begin{DoxyParamCaption}\item[{string}]{str }\end{DoxyParamCaption}) -\/$>$ string \hspace{0.3cm}{\ttfamily [constexpr]}}



Folds all characters in a string using the default execution character set to lowercase. 


\begin{DoxyParams}{Parameters}
{\em str} & The string to case-\/fold. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
string The case-\/folded string. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00591}{591}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a592ba900c4c004025d90eed8ea6f23e7}\label{namespace_k_b_l_i_b___n_s_a592ba900c4c004025d90eed8ea6f23e7}} 
\index{KBLIB\_NS@{KBLIB\_NS}!toStr@{toStr}}
\index{toStr@{toStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{toStr()}{toStr()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily auto KBLIB\+\_\+\+NS\+::to\+Str (\begin{DoxyParamCaption}\item[{std\+::string}]{val }\end{DoxyParamCaption}) -\/$>$ std\+::string \hspace{0.3cm}{\ttfamily [inline]}}



Definition at line \mbox{\hyperlink{convert_8h_source_l00750}{750}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a92acbb9bb7f69027f4404fd26724f6a3}\label{namespace_k_b_l_i_b___n_s_a92acbb9bb7f69027f4404fd26724f6a3}} 
\index{KBLIB\_NS@{KBLIB\_NS}!toStr@{toStr}}
\index{toStr@{toStr}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{toStr()}{toStr()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
auto KBLIB\+\_\+\+NS\+::to\+Str (\begin{DoxyParamCaption}\item[{T}]{val }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00745}{745}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6342518049abc9aa1ee5d0309eabbf38}\label{namespace_k_b_l_i_b___n_s_a6342518049abc9aa1ee5d0309eabbf38}} 
\index{KBLIB\_NS@{KBLIB\_NS}!toupper@{toupper}}
\index{toupper@{toupper}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{toupper()}{toupper()}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::toupper (\begin{DoxyParamCaption}\item[{string}]{str }\end{DoxyParamCaption}) -\/$>$ string }



Folds all characters in a string using the default execution character set to uppercase. 


\begin{DoxyParams}{Parameters}
{\em str} & The string to case-\/fold. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
string The case-\/folded string. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{stringops_8h_source_l00604}{604}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a98dc7e3e80286bed68984415ee11b417}\label{namespace_k_b_l_i_b___n_s_a98dc7e3e80286bed68984415ee11b417}} 
\index{KBLIB\_NS@{KBLIB\_NS}!toUTF32@{toUTF32}}
\index{toUTF32@{toUTF32}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{toUTF32()}{toUTF32()}}
{\footnotesize\ttfamily template$<$typename string  = std\+::u32string$>$ \\
auto KBLIB\+\_\+\+NS\+::to\+UTF32 (\begin{DoxyParamCaption}\item[{const icu\+::\+Unicode\+String \&}]{s }\end{DoxyParamCaption}) -\/$>$ string }



Converts a Unicode\+String to UTF-\/32. 


\begin{DoxyParams}{Parameters}
{\em s} & The string to convert. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
string The re-\/encoded result. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{icu_8h_source_l00078}{78}} of file \mbox{\hyperlink{icu_8h_source}{icu.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7d320f31c75223f38b8e90d2da1f783c}\label{namespace_k_b_l_i_b___n_s_a7d320f31c75223f38b8e90d2da1f783c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!toUTF8@{toUTF8}}
\index{toUTF8@{toUTF8}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{toUTF8()}{toUTF8()}}
{\footnotesize\ttfamily template$<$typename string  = std\+::string$>$ \\
auto KBLIB\+\_\+\+NS\+::to\+UTF8 (\begin{DoxyParamCaption}\item[{const icu\+::\+Unicode\+String \&}]{s }\end{DoxyParamCaption}) -\/$>$ string }



Convert a Unicode\+String to a UTF-\/8 string. 

This functionality is present in ICU, however the interface is inelegant.


\begin{DoxyParams}{Parameters}
{\em s} & The string to convert. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
string The re-\/encoded result. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{icu_8h_source_l00052}{52}} of file \mbox{\hyperlink{icu_8h_source}{icu.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a53a44bde2b2b3a7f6f3c037148856981}\label{namespace_k_b_l_i_b___n_s_a53a44bde2b2b3a7f6f3c037148856981}} 
\index{KBLIB\_NS@{KBLIB\_NS}!transform@{transform}}
\index{transform@{transform}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{transform()}{transform()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename Input\+It2 , typename Output\+It , typename Binary\+Operation $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::transform (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Input\+It}]{first2,  }\item[{Output\+It}]{d\+\_\+first,  }\item[{Binary\+Operation}]{binary\+\_\+op }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



transform applies the given function to a range and stores the result in another range, beginning at d\+\_\+first. The unary operation unary\+\_\+op is applied to the range defined by \mbox{[}first1, last1). It also allows for a sentinel end iterator. 

\begin{DoxyRemark}{Remarks}
The expression {\ttfamily $\ast$d\+\_\+first = kblib\+::invoke(binary\+\_\+op, $\ast$first, $\ast$first2)} must be valid and must not modify {\ttfamily $\ast$first} or {\ttfamily $\ast$first2}.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the first input range \\
\hline
{\em last} & The end of the first input range \\
\hline
{\em first2} & The beginning of the second input range \\
\hline
{\em d\+\_\+first} & The beginning of the output range \\
\hline
{\em binary\+\_\+op} & The operation to apply \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Output\+It An iterator to past the last element written 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01659}{1659}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a776689bdcc9e3aa8017448393fe85f3a}\label{namespace_k_b_l_i_b___n_s_a776689bdcc9e3aa8017448393fe85f3a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!transform@{transform}}
\index{transform@{transform}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{transform()}{transform()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename Output\+It , typename Unary\+Operation $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::transform (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Output\+It}]{d\+\_\+first,  }\item[{Unary\+Operation}]{unary\+\_\+op }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



transform applies the given function to a range and stores the result in another range, beginning at d\+\_\+first. The unary operation unary\+\_\+op is applied to the range defined by \mbox{[}first1, last1). It also allows for a sentinel end iterator. 

\begin{DoxyRemark}{Remarks}
The expression {\ttfamily $\ast$d\+\_\+first = kblib\+::invoke(unary\+\_\+op, $\ast$first)} must be valid and must not modify {\ttfamily $\ast$first}.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the input range \\
\hline
{\em last} & The end of the input range \\
\hline
{\em d\+\_\+first} & The beginning of the output range \\
\hline
{\em unary\+\_\+op} & The operation to apply \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Output\+It An iterator to past the last element written 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01632}{1632}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae0cfc3f04e375d11b53fe0ac7273a6df}\label{namespace_k_b_l_i_b___n_s_ae0cfc3f04e375d11b53fe0ac7273a6df}} 
\index{KBLIB\_NS@{KBLIB\_NS}!transform\_exclusive\_scan@{transform\_exclusive\_scan}}
\index{transform\_exclusive\_scan@{transform\_exclusive\_scan}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{transform\_exclusive\_scan()}{transform\_exclusive\_scan()}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename Output\+It , typename T , typename Binary\+Accumulation , typename Unary\+Transform $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::transform\+\_\+exclusive\+\_\+scan (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Output\+It}]{d\+\_\+first,  }\item[{T}]{init,  }\item[{Binary\+Accumulation}]{accum,  }\item[{Unary\+Transform}]{proj }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{algorithm_8h_source_l00251}{251}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aed7ba033d733e8a9a07b5fa2215b6988}\label{namespace_k_b_l_i_b___n_s_aed7ba033d733e8a9a07b5fa2215b6988}} 
\index{KBLIB\_NS@{KBLIB\_NS}!transform\_if@{transform\_if}}
\index{transform\_if@{transform\_if}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{transform\_if()}{transform\_if()}}
{\footnotesize\ttfamily template$<$typename Input\+It , typename End\+It , typename Output\+It , typename Unary\+Predicate , typename Unary\+Operation $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::transform\+\_\+if (\begin{DoxyParamCaption}\item[{Input\+It}]{first,  }\item[{End\+It}]{last,  }\item[{Output\+It}]{d\+\_\+first,  }\item[{Unary\+Predicate}]{pred,  }\item[{Unary\+Operation}]{unary\+\_\+op }\end{DoxyParamCaption}) -\/$>$ Output\+It \hspace{0.3cm}{\ttfamily [constexpr]}}



transform applies the given function to a range and stores the result in another range, beginning at d\+\_\+first. The unary operation unary\+\_\+op is applied to the range defined by \mbox{[}first1, last1). It also allows for a sentinel end iterator. 

\begin{DoxyRemark}{Remarks}
The expression {\ttfamily kblib\+::invoke(pred, $\ast$first)} must be valid and must return a type convertible to {\ttfamily bool}, and must not modify {\ttfamily $\ast$first} 

The expression {\ttfamily $\ast$d\+\_\+first = kblib\+::invoke(unary\+\_\+op, $\ast$first)} must be valid and must not modify {\ttfamily $\ast$first}.
\end{DoxyRemark}

\begin{DoxyParams}{Parameters}
{\em first} & The beginning of the input range \\
\hline
{\em last} & The end of the input range \\
\hline
{\em d\+\_\+first} & The beginning of the output range \\
\hline
{\em pred} & The predicate to apply \\
\hline
{\em unary\+\_\+op} & The operation to apply \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
Output\+It An iterator to past the last element written 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{algorithm_8h_source_l01690}{1690}} of file \mbox{\hyperlink{algorithm_8h_source}{algorithm.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a854750da58a40d155e5ec67c6ab3bb6a}\label{namespace_k_b_l_i_b___n_s_a854750da58a40d155e5ec67c6ab3bb6a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!transform\_iterator@{transform\_iterator}}
\index{transform\_iterator@{transform\_iterator}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{transform\_iterator()}{transform\_iterator()}}
{\footnotesize\ttfamily template$<$typename It , typename operation $>$ \\
\mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{KBLIB\+\_\+\+NS\+::transform\+\_\+iterator}} (\begin{DoxyParamCaption}\item[{It}]{,  }\item[{operation}]{ }\end{DoxyParamCaption}) -\/$>$  \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{transform\+\_\+iterator}}$<$ It, operation $>$}

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a1961ed6dd7c57f8638b6d35b03589a70}\label{namespace_k_b_l_i_b___n_s_a1961ed6dd7c57f8638b6d35b03589a70}} 
\index{KBLIB\_NS@{KBLIB\_NS}!transform\_range@{transform\_range}}
\index{transform\_range@{transform\_range}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{transform\_range()}{transform\_range()}}
{\footnotesize\ttfamily template$<$typename It , typename End\+It , typename operation $>$ \\
auto KBLIB\+\_\+\+NS\+::transform\+\_\+range (\begin{DoxyParamCaption}\item[{It}]{begin,  }\item[{End\+It}]{end,  }\item[{operation}]{op }\end{DoxyParamCaption}) -\/$>$ auto \hspace{0.3cm}{\ttfamily [noexcept]}}



Definition at line \mbox{\hyperlink{iterators_8h_source_l01321}{1321}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af82c660d05b18b8d626ed30bcfddd764}\label{namespace_k_b_l_i_b___n_s_af82c660d05b18b8d626ed30bcfddd764}} 
\index{KBLIB\_NS@{KBLIB\_NS}!transformer@{transformer}}
\index{transformer@{transformer}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{transformer()}{transformer()}}
{\footnotesize\ttfamily template$<$typename base\+\_\+iterator , typename operation $>$ \\
auto KBLIB\+\_\+\+NS\+::transformer (\begin{DoxyParamCaption}\item[{base\+\_\+iterator}]{it,  }\item[{operation}]{op }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{class_k_b_l_i_b___n_s_1_1transform__iterator}{transform\+\_\+iterator}}$<$base\+\_\+iterator, operation$>$ \hspace{0.3cm}{\ttfamily [noexcept]}}



Factory function to make transform\+\_\+iterators. 


\begin{DoxyParams}{Parameters}
{\em it} & An Input\+Iterator to a range to transform. \\
\hline
{\em op} & The transformation to apply. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
transform\+\_\+iterator$<$base\+\_\+iterator, operation$>$ 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{iterators_8h_source_l01314}{1314}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7ce3c29a812049a41491b64b679c63b0}\label{namespace_k_b_l_i_b___n_s_a7ce3c29a812049a41491b64b679c63b0}} 
\index{KBLIB\_NS@{KBLIB\_NS}!trim\_array@{trim\_array}}
\index{trim\_array@{trim\_array}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{trim\_array()}{trim\_array()}}
{\footnotesize\ttfamily template$<$int trim, typename T , int N, typename Indices  = std\+::make\+\_\+integer\+\_\+sequence$<$int, N -\/ trim$>$$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::trim\+\_\+array (\begin{DoxyParamCaption}\item[{const T(\&)}]{arr\mbox{[}\+N\mbox{]} }\end{DoxyParamCaption}) -\/$>$ std\+::array$<$T, N -\/ trim$>$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Truncates the last trim elements from an array. 


\begin{DoxyParams}{Parameters}
{\em arr} & The array to trim. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
std\+::array\texorpdfstring{$<$}{<}T, N -\/ trim\texorpdfstring{$>$}{>} The trimmed array. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{traits_8h_source_l00121}{121}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a02dd4f161e175a64e0cb6556ad8104d9}\label{namespace_k_b_l_i_b___n_s_a02dd4f161e175a64e0cb6556ad8104d9}} 
\index{KBLIB\_NS@{KBLIB\_NS}!try\_get@{try\_get}}
\index{try\_get@{try\_get}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{try\_get()}{try\_get()}}
{\footnotesize\ttfamily template$<$typename Map , typename Key $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::try\+\_\+get (\begin{DoxyParamCaption}\item[{Map \&}]{map,  }\item[{Key \&\&}]{key }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a04784aad6b67bfd042b6047e3fb249c2}{copy\+\_\+const\+\_\+t}}$<$Map, typename Map\+::mapped\+\_\+type$>$$\ast$ \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{containers_8h_source_l00067}{67}} of file \mbox{\hyperlink{containers_8h_source}{containers.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a741c72809e4611dfb92f9673f91956bf}\label{namespace_k_b_l_i_b___n_s_a741c72809e4611dfb92f9673f91956bf}} 
\index{KBLIB\_NS@{KBLIB\_NS}!try\_get\_file\_contents@{try\_get\_file\_contents}}
\index{try\_get\_file\_contents@{try\_get\_file\_contents}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{try\_get\_file\_contents()}{try\_get\_file\_contents()}}
{\footnotesize\ttfamily template$<$typename D  = std\+::string, typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::try\+\_\+get\+\_\+file\+\_\+contents (\begin{DoxyParamCaption}\item[{const string \&}]{filename }\end{DoxyParamCaption}) -\/$>$ D }



Read the entire contents of a file into a container, such as std\+::string or std\+::vector$<$char$>$. Note that it will be most efficient to read into contiguous containers, as opposed to non-\/contiguous containers. 


\begin{DoxyParams}{Parameters}
{\em filename} & The filename to open. \\
\hline
\end{DoxyParams}

\begin{DoxyTemplParams}{Template Parameters}
{\em D} & A contiguous sequence container, which will be created and filled with the contents of the file to be read. \\
\hline
\end{DoxyTemplParams}
\begin{DoxyReturn}{Returns}
std\+::optional$<$\+D$>$ The contents of the file, if reading was successful. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{io_8h_source_l00123}{123}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab192185efddea3b03e734c39ef6c9051}\label{namespace_k_b_l_i_b___n_s_ab192185efddea3b03e734c39ef6c9051}} 
\index{KBLIB\_NS@{KBLIB\_NS}!try\_reserve@{try\_reserve}}
\index{try\_reserve@{try\_reserve}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{try\_reserve()}{try\_reserve()}}
{\footnotesize\ttfamily template$<$typename C , typename std\+::enable\+\_\+if$<$ \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_a55198f023deee0c3ff0009ee698d0fc0}{has\+\_\+reserve\+\_\+v}}$<$ C $>$, int $>$\+::type  = 0$>$ \\
auto KBLIB\+\_\+\+NS\+::try\+\_\+reserve (\begin{DoxyParamCaption}\item[{C \&}]{c,  }\item[{std\+::size\+\_\+t}]{s }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [noexcept]}}



Attempt to reserve capacity in a container. No-\/op if unsupported. 


\begin{DoxyParams}{Parameters}
{\em c} & The container to modify. \\
\hline
{\em s} & The requested capacity. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{traits_8h_source_l00239}{239}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a7d4b1043680d2f53765ea2468267c864}\label{namespace_k_b_l_i_b___n_s_a7d4b1043680d2f53765ea2468267c864}} 
\index{KBLIB\_NS@{KBLIB\_NS}!unformatted\_expect@{unformatted\_expect}}
\index{unformatted\_expect@{unformatted\_expect}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{unformatted\_expect()}{unformatted\_expect()}}
{\footnotesize\ttfamily template$<$typename CharT $>$ \\
auto KBLIB\+\_\+\+NS\+::unformatted\+\_\+expect (\begin{DoxyParamCaption}\item[{CharT}]{c }\end{DoxyParamCaption}) -\/$>$ auto }



Read a character from an input stream only if it equals c. Acts as an Unformatted\+Input\+Operation, that is, it will not ignore any leading whitespace. 



Definition at line \mbox{\hyperlink{io_8h_source_l00262}{262}} of file \mbox{\hyperlink{io_8h_source}{io.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa1ee4e576884b82bfa4338ee175eeac5}\label{namespace_k_b_l_i_b___n_s_aa1ee4e576884b82bfa4338ee175eeac5}} 
\index{KBLIB\_NS@{KBLIB\_NS}!url\_encode@{url\_encode}}
\index{url\_encode@{url\_encode}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{url\_encode()}{url\_encode()}}
{\footnotesize\ttfamily template$<$typename string $>$ \\
auto KBLIB\+\_\+\+NS\+::url\+\_\+encode (\begin{DoxyParamCaption}\item[{const string \&}]{value }\end{DoxyParamCaption}) -\/$>$ std\+::string }



Definition at line \mbox{\hyperlink{convert_8h_source_l00498}{498}} of file \mbox{\hyperlink{convert_8h_source}{convert.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ad71a34434026400dcbb8b1392299d733}\label{namespace_k_b_l_i_b___n_s_ad71a34434026400dcbb8b1392299d733}} 
\index{KBLIB\_NS@{KBLIB\_NS}!variant\_cast@{variant\_cast}}
\index{variant\_cast@{variant\_cast}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{variant\_cast()}{variant\_cast()}}
{\footnotesize\ttfamily template$<$typename To , typename From $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::variant\+\_\+cast (\begin{DoxyParamCaption}\item[{From \&\&}]{v }\end{DoxyParamCaption}) -\/$>$ To \hspace{0.3cm}{\ttfamily [constexpr]}}



Promotes an input variant to a super-\/variant. That is, one which provides at least the same set of types. 


\begin{DoxyParams}{Parameters}
{\em v} & The variant to promote. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
To A super-\/variant with the same value as v. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{variant_8h_source_l00194}{194}} of file \mbox{\hyperlink{variant_8h_source}{variant.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a49bfcf40f9c0a41a7b2f356e299ae450}\label{namespace_k_b_l_i_b___n_s_a49bfcf40f9c0a41a7b2f356e299ae450}} 
\index{KBLIB\_NS@{KBLIB\_NS}!visit@{visit}}
\index{visit@{visit}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{visit()}{visit()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename V , typename F , typename... Fs$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::visit (\begin{DoxyParamCaption}\item[{V \&\&}]{v,  }\item[{F \&\&}]{f,  }\item[{Fs \&\&...}]{fs }\end{DoxyParamCaption}) -\/$>$ decltype(auto) \hspace{0.3cm}{\ttfamily [constexpr]}}



Wraps std\+::visit to provide an interface taking one variant and any number of functors providing an overload set. 

Also moves the variant to the left side of the operation, improving readability.


\begin{DoxyParams}{Parameters}
{\em v} & The variant to visit over. \\
\hline
{\em fs} & Any number of functors, which taken together as an overload set can be unambiguously called with any type in V. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{variant_8h_source_l00221}{221}} of file \mbox{\hyperlink{variant_8h_source}{variant.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a1be42ea0b4b20e53d446abb929c116ba}\label{namespace_k_b_l_i_b___n_s_a1be42ea0b4b20e53d446abb929c116ba}} 
\index{KBLIB\_NS@{KBLIB\_NS}!visit@{visit}}
\index{visit@{visit}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{visit()}{visit()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename V $>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::visit (\begin{DoxyParamCaption}\item[{V \&}]{v }\end{DoxyParamCaption}) -\/$>$ auto \hspace{0.3cm}{\ttfamily [constexpr]}}



Two-\/step visiting interface. Takes a variant, and returns an object which can be called with any number of callable arguments, builds an overload set from them, and visits the variant. 

\begin{DoxyNote}{Note}
The returned callable object contains a reference to v, so care must be taken to avoid dangling. However, if v is long-\/lived, the returned object may be stored and used to visit the same variant multiple times.
\end{DoxyNote}

\begin{DoxyParams}{Parameters}
{\em v} & A variant to visit. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
auto A callable object which takes callable arguments and visits the visitor. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{variant_8h_source_l00332}{332}} of file \mbox{\hyperlink{variant_8h_source}{variant.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9d4940990e9591fd7f4270e3e77502da}\label{namespace_k_b_l_i_b___n_s_a9d4940990e9591fd7f4270e3e77502da}} 
\index{KBLIB\_NS@{KBLIB\_NS}!visit2@{visit2}}
\index{visit2@{visit2}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{visit2()}{visit2()}}
{\footnotesize\ttfamily template$<$typename V , typename F , typename... Fs$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::visit2 (\begin{DoxyParamCaption}\item[{V \&\&}]{v,  }\item[{F \&\&}]{f,  }\item[{Fs \&\&...}]{fs }\end{DoxyParamCaption}) -\/$>$ decltype(auto) \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{variant_8h_source_l00295}{295}} of file \mbox{\hyperlink{variant_8h_source}{variant.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a5d2ab261affe206adbd984f89b167fac}\label{namespace_k_b_l_i_b___n_s_a5d2ab261affe206adbd984f89b167fac}} 
\index{KBLIB\_NS@{KBLIB\_NS}!visit2\_nop@{visit2\_nop}}
\index{visit2\_nop@{visit2\_nop}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{visit2\_nop()}{visit2\_nop()}}
{\footnotesize\ttfamily template$<$typename V , typename F , typename... Fs$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::visit2\+\_\+nop (\begin{DoxyParamCaption}\item[{V \&\&}]{v,  }\item[{F \&\&}]{f,  }\item[{Fs \&\&...}]{fs }\end{DoxyParamCaption}) -\/$>$ void \hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{variant_8h_source_l00306}{306}} of file \mbox{\hyperlink{variant_8h_source}{variant.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac0ef79b1174e241dede98314e8484e63}\label{namespace_k_b_l_i_b___n_s_ac0ef79b1174e241dede98314e8484e63}} 
\index{KBLIB\_NS@{KBLIB\_NS}!visit\_indexed@{visit\_indexed}}
\index{visit\_indexed@{visit\_indexed}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{visit\_indexed()}{visit\_indexed()}}
{\footnotesize\ttfamily template$<$typename Variant , typename... Fs$>$ \\
constexpr auto KBLIB\+\_\+\+NS\+::visit\+\_\+indexed (\begin{DoxyParamCaption}\item[{Variant \&\&}]{variant,  }\item[{Fs \&\&...}]{fs }\end{DoxyParamCaption}) -\/$>$ decltype(auto) \hspace{0.3cm}{\ttfamily [constexpr]}}



Visit a variant, but pass the index (as an integral\+\_\+constant) to the visitor. This allows for a visitor of a variant with duplicated types to maintain index information. 


\begin{DoxyParams}{Parameters}
{\em variant} & The variant to visit. \\
\hline
{\em fs} & Any number of functors, which taken together as an overload set can be unambiguously called with (I, A), for I = kblib\+::constant$<$std\+::size\+\_\+t, variant.\+index()$>$ and A = std\+::get$<$variant.\+index()$>$(variant). Note that kblib\+::constant implicitly converts to std\+::integral\+\_\+constant. \\
\hline
\end{DoxyParams}


Definition at line \mbox{\hyperlink{variant_8h_source_l00176}{176}} of file \mbox{\hyperlink{variant_8h_source}{variant.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a308892140c15cc0c3dacf95054c5bc38}\label{namespace_k_b_l_i_b___n_s_a308892140c15cc0c3dacf95054c5bc38}} 
\index{KBLIB\_NS@{KBLIB\_NS}!visitor@{visitor}}
\index{visitor@{visitor}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{visitor()}{visitor()}}
{\footnotesize\ttfamily template$<$typename... Ts$>$ \\
\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1visitor}{KBLIB\+\_\+\+NS\+::visitor}} (\begin{DoxyParamCaption}\item[{Ts...}]{ }\end{DoxyParamCaption}) -\/$>$  \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1visitor}{visitor}}$<$ Ts... $>$}

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a6d9b27640c095aa2fd137687619565a2}\label{namespace_k_b_l_i_b___n_s_a6d9b27640c095aa2fd137687619565a2}} 
\index{KBLIB\_NS@{KBLIB\_NS}!zip@{zip}}
\index{zip@{zip}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{zip()}{zip()}\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily template$<$typename Input\+It1 , typename End\+It , typename Input\+It2 $>$ \\
auto KBLIB\+\_\+\+NS\+::zip (\begin{DoxyParamCaption}\item[{Input\+It1}]{begin1,  }\item[{End\+It}]{end1,  }\item[{Input\+It2}]{begin2 }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1zip__iterator}{zip\+\_\+iterator}}$<$Input\+It1, End\+It, Input\+It2$>$ \hspace{0.3cm}{\ttfamily [noexcept]}}



Iterate over two ranges in lockstep, like Python\textquotesingle{}s zip. 

Input\+It1 and End\+It may be different types, however that breaks range-\/for in C++14.


\begin{DoxyParams}{Parameters}
{\em begin1,end1} & The first range. \\
\hline
{\em begin2} & The beginning of the second range. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
zip\+\_\+iterator$<$\+Input\+It1, End\+It, Input\+It2$>$ A range (and also an iterator) which represents the two ranges taken in pairs. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{iterators_8h_source_l01454}{1454}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af9fd8e067453b5a2073c406585a24eb2}\label{namespace_k_b_l_i_b___n_s_af9fd8e067453b5a2073c406585a24eb2}} 
\index{KBLIB\_NS@{KBLIB\_NS}!zip@{zip}}
\index{zip@{zip}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{zip()}{zip()}\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily template$<$typename Range1 , typename Range2 $>$ \\
auto KBLIB\+\_\+\+NS\+::zip (\begin{DoxyParamCaption}\item[{Range1 \&\&}]{r1,  }\item[{Range2 \&\&}]{r2 }\end{DoxyParamCaption}) -\/$>$ \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1zip__iterator}{zip\+\_\+iterator}}$<$decltype(begin(r1)), decltype(end(r1)),                     decltype(begin(r2))$>$ \hspace{0.3cm}{\ttfamily [noexcept]}}



Iterate over two ranges in lockstep, like Python\textquotesingle{}s zip. 


\begin{DoxyParams}{Parameters}
{\em r1} & The first range. \\
\hline
{\em r2} & The second range. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
\mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1zip__iterator}{zip\+\_\+iterator}}\texorpdfstring{$<$}{<}decltype(begin(r1)), decltype(end(r1)), decltype(begin(r2))\texorpdfstring{$>$}{>} A range (and also an iterator) which represents the two ranges taken in pairs. 
\end{DoxyReturn}


Definition at line \mbox{\hyperlink{iterators_8h_source_l01470}{1470}} of file \mbox{\hyperlink{iterators_8h_source}{iterators.\+h}}.



\doxysubsection{Variable Documentation}
\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a1b7771329ad37243c15c9ef44dfa1902}\label{namespace_k_b_l_i_b___n_s_a1b7771329ad37243c15c9ef44dfa1902}} 
\index{KBLIB\_NS@{KBLIB\_NS}!any\_void@{any\_void}}
\index{any\_void@{any\_void}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{any\_void}{any\_void}}
{\footnotesize\ttfamily template$<$typename... Ts$>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::any\+\_\+void = (std\+::is\+\_\+void\+\_\+v$<$Ts$>$ or ...)\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{simple_8h_source_l00072}{72}} of file \mbox{\hyperlink{simple_8h_source}{simple.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_abf777dbb6730c5e4c446d676a438677b}\label{namespace_k_b_l_i_b___n_s_abf777dbb6730c5e4c446d676a438677b}} 
\index{KBLIB\_NS@{KBLIB\_NS}!bits\_of@{bits\_of}}
\index{bits\_of@{bits\_of}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{bits\_of}{bits\_of}}
{\footnotesize\ttfamily template$<$typename Int $>$ \\
constexpr int KBLIB\+\_\+\+NS\+::bits\+\_\+of = std\+::numeric\+\_\+limits$<$Int$>$\+::digits\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{bits_8h_source_l00053}{53}} of file \mbox{\hyperlink{bits_8h_source}{bits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a713ffad77fec82960b5b4df868afeb6d}\label{namespace_k_b_l_i_b___n_s_a713ffad77fec82960b5b4df868afeb6d}} 
\index{KBLIB\_NS@{KBLIB\_NS}!build\_end@{build\_end}}
\index{build\_end@{build\_end}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{build\_end}{build\_end}}
{\footnotesize\ttfamily constexpr struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1build__end__t}{KBLIB\+\_\+\+NS\+::build\+\_\+end\+\_\+t}} KBLIB\+\_\+\+NS\+::build\+\_\+end}

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a2f8cb693187964dd1f1c2b89bdca2357}\label{namespace_k_b_l_i_b___n_s_a2f8cb693187964dd1f1c2b89bdca2357}} 
\index{KBLIB\_NS@{KBLIB\_NS}!conjunction\_v@{conjunction\_v}}
\index{conjunction\_v@{conjunction\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{conjunction\_v}{conjunction\_v}}
{\footnotesize\ttfamily template$<$bool... args$>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::conjunction\+\_\+v = (args and ...)\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{logic_8h_source_l00061}{61}} of file \mbox{\hyperlink{logic_8h_source}{logic.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa1b0ee551189bad056eb650c6b18e230}\label{namespace_k_b_l_i_b___n_s_aa1b0ee551189bad056eb650c6b18e230}} 
\index{KBLIB\_NS@{KBLIB\_NS}!contains\_type\_v@{contains\_type\_v}}
\index{contains\_type\_v@{contains\_type\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{contains\_type\_v}{contains\_type\_v}}
{\footnotesize\ttfamily template$<$typename... Ts$>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::contains\+\_\+type\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__type}{contains\+\_\+type}}$<$Ts...$>$\+::value}



Definition at line \mbox{\hyperlink{traits_8h_source_l00065}{65}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab554d81133be98603522c9dcbcc5f507}\label{namespace_k_b_l_i_b___n_s_ab554d81133be98603522c9dcbcc5f507}} 
\index{KBLIB\_NS@{KBLIB\_NS}!contains\_types\_v@{contains\_types\_v}}
\index{contains\_types\_v@{contains\_types\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{contains\_types\_v}{contains\_types\_v}}
{\footnotesize\ttfamily template$<$typename... Ts$>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::contains\+\_\+types\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1contains__types}{contains\+\_\+types}}$<$Ts...$>$\+::value}



Definition at line \mbox{\hyperlink{traits_8h_source_l00084}{84}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae5c97637c46ccfb5caa3fdb73bca3aa7}\label{namespace_k_b_l_i_b___n_s_ae5c97637c46ccfb5caa3fdb73bca3aa7}} 
\index{KBLIB\_NS@{KBLIB\_NS}!eof@{eof}}
\index{eof@{eof}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{eof}{eof}}
{\footnotesize\ttfamily template$<$typename CharT  = char$>$ \\
\mbox{\hyperlink{tdecl_8h_a35b356d58929dd3ae764e8291838f5be}{KBLIB\+\_\+\+CONSTANT}} auto KBLIB\+\_\+\+NS\+::eof = std\+::char\+\_\+traits$<$CharT$>$\+::eof()}



Names the EOF value for the given character type in std\+::char\+\_\+traits. 



Definition at line \mbox{\hyperlink{traits_8h_source_l00444}{444}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a55198f023deee0c3ff0009ee698d0fc0}\label{namespace_k_b_l_i_b___n_s_a55198f023deee0c3ff0009ee698d0fc0}} 
\index{KBLIB\_NS@{KBLIB\_NS}!has\_reserve\_v@{has\_reserve\_v}}
\index{has\_reserve\_v@{has\_reserve\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{has\_reserve\_v}{has\_reserve\_v}}
{\footnotesize\ttfamily template$<$typename C , typename  = void$>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::has\+\_\+reserve\+\_\+v = false}



Definition at line \mbox{\hyperlink{traits_8h_source_l00220}{220}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a134f651b2d497fa4e25a2169b27ba21a}\label{namespace_k_b_l_i_b___n_s_a134f651b2d497fa4e25a2169b27ba21a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!hash\_detected\_v@{hash\_detected\_v}}
\index{hash\_detected\_v@{hash\_detected\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{hash\_detected\_v}{hash\_detected\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::hash\+\_\+detected\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1hash__detected}{hash\+\_\+detected}}$<$T$>$\+::value\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00921}{921}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a416add1e204cea4ba163d0b152cb7023}\label{namespace_k_b_l_i_b___n_s_a416add1e204cea4ba163d0b152cb7023}} 
\index{KBLIB\_NS@{KBLIB\_NS}!hash\_order@{hash\_order}}
\index{hash\_order@{hash\_order}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{hash\_order}{hash\_order}}
{\footnotesize\ttfamily constexpr \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1}{endian}} KBLIB\+\_\+\+NS\+::hash\+\_\+order = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail_a62231f99aa3fe4d8f764afe5f78d6c06}{detail\+::get\+\_\+hash\+\_\+order}}()\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{tdecl_8h_source_l00227}{227}} of file \mbox{\hyperlink{tdecl_8h_source}{tdecl.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aa2f89ee505b39584b766194bc6949fa8}\label{namespace_k_b_l_i_b___n_s_aa2f89ee505b39584b766194bc6949fa8}} 
\index{KBLIB\_NS@{KBLIB\_NS}!implies\_v@{implies\_v}}
\index{implies\_v@{implies\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{implies\_v}{implies\_v}}
{\footnotesize\ttfamily template$<$bool A, bool B$>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::implies\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1implies}{implies}}$<$A, B$>$\+::value\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [constexpr]}}

Equivalent to implies$<$\+A, B$>$\+::value. 

Definition at line \mbox{\hyperlink{logic_8h_source_l00058}{58}} of file \mbox{\hyperlink{logic_8h_source}{logic.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a0136c0689dddfe6c52a67392b45a586c}\label{namespace_k_b_l_i_b___n_s_a0136c0689dddfe6c52a67392b45a586c}} 
\index{KBLIB\_NS@{KBLIB\_NS}!in\_place\_agg@{in\_place\_agg}}
\index{in\_place\_agg@{in\_place\_agg}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{in\_place\_agg}{in\_place\_agg}}
{\footnotesize\ttfamily constexpr struct \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1in__place__agg__t}{KBLIB\+\_\+\+NS\+::in\+\_\+place\+\_\+agg\+\_\+t}} KBLIB\+\_\+\+NS\+::in\+\_\+place\+\_\+agg}

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a400d2f53ac4a3c95066b6c3330ae0400}\label{namespace_k_b_l_i_b___n_s_a400d2f53ac4a3c95066b6c3330ae0400}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_aliasing\_type\_v@{is\_aliasing\_type\_v}}
\index{is\_aliasing\_type\_v@{is\_aliasing\_type\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_aliasing\_type\_v}{is\_aliasing\_type\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+aliasing\+\_\+type\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__aliasing__type}{is\+\_\+aliasing\+\_\+type}}$<$T$>$\+::value}



Definition at line \mbox{\hyperlink{traits_8h_source_l00471}{471}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a9b0f47dcb794a46a80201a97520e9423}\label{namespace_k_b_l_i_b___n_s_a9b0f47dcb794a46a80201a97520e9423}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_bidirectional\_iterator\_v@{is\_bidirectional\_iterator\_v}}
\index{is\_bidirectional\_iterator\_v@{is\_bidirectional\_iterator\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_bidirectional\_iterator\_v}{is\_bidirectional\_iterator\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+bidirectional\+\_\+iterator\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__bidirectional__iterator}{is\+\_\+bidirectional\+\_\+iterator}}$<$T$>$\+::value}



Definition at line \mbox{\hyperlink{traits_8h_source_l00363}{363}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a50124a019a763aa533428f9bb73754c6}\label{namespace_k_b_l_i_b___n_s_a50124a019a763aa533428f9bb73754c6}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_byte\_v@{is\_byte\_v}}
\index{is\_byte\_v@{is\_byte\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_byte\_v}{is\_byte\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::is\+\_\+byte\+\_\+v = false\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{sort_8h_source_l00248}{248}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac0ed725ba5e07193afa00d4e7b46bf63}\label{namespace_k_b_l_i_b___n_s_ac0ed725ba5e07193afa00d4e7b46bf63}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_character\_v@{is\_character\_v}}
\index{is\_character\_v@{is\_character\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_character\_v}{is\_character\_v}}
{\footnotesize\ttfamily template$<$typename C $>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::is\+\_\+character\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__character}{is\+\_\+character}}$<$C$>$\+::value\hspace{0.3cm}{\ttfamily [constexpr]}}



Equivalent to is\+\_\+character$<$\+C$>$\+::value. 



Definition at line \mbox{\hyperlink{stringops_8h_source_l00076}{76}} of file \mbox{\hyperlink{stringops_8h_source}{stringops.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a2530a939dc0029a61d40e4b71d24a326}\label{namespace_k_b_l_i_b___n_s_a2530a939dc0029a61d40e4b71d24a326}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_contiguous\_v@{is\_contiguous\_v}}
\index{is\_contiguous\_v@{is\_contiguous\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_contiguous\_v}{is\_contiguous\_v}}
{\footnotesize\ttfamily template$<$typename C , typename  = void$>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+contiguous\+\_\+v = false}



Type trait to determine if a container is contiguous. 



Definition at line \mbox{\hyperlink{traits_8h_source_l00261}{261}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aec264a886c8a43f4d14983878b22d254}\label{namespace_k_b_l_i_b___n_s_aec264a886c8a43f4d14983878b22d254}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_forward\_iterator\_v@{is\_forward\_iterator\_v}}
\index{is\_forward\_iterator\_v@{is\_forward\_iterator\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_forward\_iterator\_v}{is\_forward\_iterator\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+forward\+\_\+iterator\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__forward__iterator}{is\+\_\+forward\+\_\+iterator}}$<$T$>$\+::value}



Definition at line \mbox{\hyperlink{traits_8h_source_l00350}{350}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a5c6ead81a6fc54203d729f6d2c3080a0}\label{namespace_k_b_l_i_b___n_s_a5c6ead81a6fc54203d729f6d2c3080a0}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_hashable\_v@{is\_hashable\_v}}
\index{is\_hashable\_v@{is\_hashable\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_hashable\_v}{is\_hashable\_v}}
{\footnotesize\ttfamily template$<$typename Key $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+hashable\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__hashable}{is\+\_\+hashable}}$<$Key$>$\+::value}



Definition at line \mbox{\hyperlink{hash_8h_source_l00350}{350}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a547a1e7930fbf709bb1b79b40f482566}\label{namespace_k_b_l_i_b___n_s_a547a1e7930fbf709bb1b79b40f482566}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_input\_iterator\_v@{is\_input\_iterator\_v}}
\index{is\_input\_iterator\_v@{is\_input\_iterator\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_input\_iterator\_v}{is\_input\_iterator\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+input\+\_\+iterator\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__input__iterator}{is\+\_\+input\+\_\+iterator}}$<$T$>$\+::value}



Definition at line \mbox{\hyperlink{traits_8h_source_l00337}{337}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a96b3971b86941f98762c8da07b60f105}\label{namespace_k_b_l_i_b___n_s_a96b3971b86941f98762c8da07b60f105}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_iterable\_v@{is\_iterable\_v}}
\index{is\_iterable\_v@{is\_iterable\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_iterable\_v}{is\_iterable\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+iterable\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterable}{is\+\_\+iterable}}$<$T$>$\+::value}



Definition at line \mbox{\hyperlink{traits_8h_source_l00413}{413}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a93341c873e1c1744c353cc37872997db}\label{namespace_k_b_l_i_b___n_s_a93341c873e1c1744c353cc37872997db}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_iterator\_v@{is\_iterator\_v}}
\index{is\_iterator\_v@{is\_iterator\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_iterator\_v}{is\_iterator\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+iterator\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__iterator}{is\+\_\+iterator}}$<$T$>$\+::value}



Definition at line \mbox{\hyperlink{traits_8h_source_l00424}{424}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aaba14e673821b31ca6d7fad5f06a9296}\label{namespace_k_b_l_i_b___n_s_aaba14e673821b31ca6d7fad5f06a9296}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_radix\_sortable\_v@{is\_radix\_sortable\_v}}
\index{is\_radix\_sortable\_v@{is\_radix\_sortable\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_radix\_sortable\_v}{is\_radix\_sortable\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::is\+\_\+radix\+\_\+sortable\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__radix__sortable}{is\+\_\+radix\+\_\+sortable}}$<$T$>$\+::value\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{sort_8h_source_l00240}{240}} of file \mbox{\hyperlink{sort_8h_source}{sort.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}\label{namespace_k_b_l_i_b___n_s_aff91727007a9457a908e244ec230d731}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_random\_access\_iterator\_v@{is\_random\_access\_iterator\_v}}
\index{is\_random\_access\_iterator\_v@{is\_random\_access\_iterator\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_random\_access\_iterator\_v}{is\_random\_access\_iterator\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+random\+\_\+access\+\_\+iterator\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1is__random__access__iterator}{is\+\_\+random\+\_\+access\+\_\+iterator}}$<$T$>$\+::value}



Definition at line \mbox{\hyperlink{traits_8h_source_l00377}{377}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_abf2986560eafaec6880b49a93d3443ec}\label{namespace_k_b_l_i_b___n_s_abf2986560eafaec6880b49a93d3443ec}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_reference\_v@{is\_reference\_v}}
\index{is\_reference\_v@{is\_reference\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_reference\_v}{is\_reference\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+reference\+\_\+v = std\+::is\+\_\+reference$<$T$>$\+::value}



Abbreviated name for std\+::is\+\_\+reference$<$\+T$>$\+::value for C++14. 



Definition at line \mbox{\hyperlink{traits_8h_source_l00431}{431}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}\label{namespace_k_b_l_i_b___n_s_aabd392ee371833d0e5bd70680e375b45}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_resizable\_v@{is\_resizable\_v}}
\index{is\_resizable\_v@{is\_resizable\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_resizable\_v}{is\_resizable\_v}}
{\footnotesize\ttfamily template$<$typename C $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+resizable\+\_\+v = decltype(\mbox{\hyperlink{namespace_k_b_l_i_b___n_s_1_1detail_a917b16b05f6a6e67dd5bde48eefa05a1}{detail\+::calc\+\_\+resizable}}$<$C$>$(0))\+::value}

True if and only if C is a resizable container. 

Definition at line \mbox{\hyperlink{traits_8h_source_l00214}{214}} of file \mbox{\hyperlink{traits_8h_source}{traits.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab285613a76758ad7a7693b5562101634}\label{namespace_k_b_l_i_b___n_s_ab285613a76758ad7a7693b5562101634}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_trivially\_hashable\_v@{is\_trivially\_hashable\_v}}
\index{is\_trivially\_hashable\_v@{is\_trivially\_hashable\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_trivially\_hashable\_v}{is\_trivially\_hashable\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
\mbox{\hyperlink{tdecl_8h_a9b2376bf15765fad0ad95e4aecf36e87}{KBLIB\+\_\+\+CONSTANT\+\_\+V}} KBLIB\+\_\+\+NS\+::is\+\_\+trivially\+\_\+hashable\+\_\+v}

{\bfseries Initial value\+:}
\begin{DoxyCode}{0}
\DoxyCodeLine{= (std::is\_integral<T>::value and padding\_bits<T>::value == 0)}
\DoxyCodeLine{      or std::is\_pointer<T>::value or std::is\_member\_object\_pointer<T>::value}
\DoxyCodeLine{      or std::is\_member\_function\_pointer<T>::value}

\end{DoxyCode}


Definition at line \mbox{\hyperlink{hash_8h_source_l00432}{432}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ac75e607e4cb117d75d16ef5d26112a7f}\label{namespace_k_b_l_i_b___n_s_ac75e607e4cb117d75d16ef5d26112a7f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!is\_variant\_like\_v@{is\_variant\_like\_v}}
\index{is\_variant\_like\_v@{is\_variant\_like\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{is\_variant\_like\_v}{is\_variant\_like\_v}}
{\footnotesize\ttfamily template$<$typename T , typename  = void$>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::is\+\_\+variant\+\_\+like\+\_\+v = false\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{variant_8h_source_l00051}{51}} of file \mbox{\hyperlink{variant_8h_source}{variant.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ae4d168e52ff97267c89c7f25c1303d13}\label{namespace_k_b_l_i_b___n_s_ae4d168e52ff97267c89c7f25c1303d13}} 
\index{KBLIB\_NS@{KBLIB\_NS}!key\_detected\_v@{key\_detected\_v}}
\index{key\_detected\_v@{key\_detected\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{key\_detected\_v}{key\_detected\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::key\+\_\+detected\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1key__detected}{key\+\_\+detected}}$<$T$>$\+::value\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00895}{895}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_ab1669a40c383aea13c09c3083244d28a}\label{namespace_k_b_l_i_b___n_s_ab1669a40c383aea13c09c3083244d28a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!mapped\_detected\_v@{mapped\_detected\_v}}
\index{mapped\_detected\_v@{mapped\_detected\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{mapped\_detected\_v}{mapped\_detected\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::mapped\+\_\+detected\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1mapped__detected}{mapped\+\_\+detected}}$<$T$>$\+::value\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00908}{908}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_abc6d2d019fe4d5366d476f8ab43b0e5a}\label{namespace_k_b_l_i_b___n_s_abc6d2d019fe4d5366d476f8ab43b0e5a}} 
\index{KBLIB\_NS@{KBLIB\_NS}!padding\_bits\_v@{padding\_bits\_v}}
\index{padding\_bits\_v@{padding\_bits\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{padding\_bits\_v}{padding\_bits\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr int KBLIB\+\_\+\+NS\+::padding\+\_\+bits\+\_\+v\hspace{0.3cm}{\ttfamily [constexpr]}}

{\bfseries Initial value\+:}
\begin{DoxyCode}{0}
\DoxyCodeLine{= CHAR\_BIT * \textcolor{keyword}{sizeof}(T) -\/ std::numeric\_limits<T>::digits}
\DoxyCodeLine{      -\/ std::numeric\_limits<T>::is\_signed}

\end{DoxyCode}


Get the number of padding bits in an integral type. 



Definition at line \mbox{\hyperlink{hash_8h_source_l00300}{300}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_af0c852a6f506fd89424502edf9cf707f}\label{namespace_k_b_l_i_b___n_s_af0c852a6f506fd89424502edf9cf707f}} 
\index{KBLIB\_NS@{KBLIB\_NS}!padding\_bits\_v$<$ void $>$@{padding\_bits\_v$<$ void $>$}}
\index{padding\_bits\_v$<$ void $>$@{padding\_bits\_v$<$ void $>$}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{padding\_bits\_v$<$ void $>$}{padding\_bits\_v< void >}}
{\footnotesize\ttfamily template$<$$>$ \\
constexpr int \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_abc6d2d019fe4d5366d476f8ab43b0e5a}{KBLIB\+\_\+\+NS\+::padding\+\_\+bits\+\_\+v}}$<$ void $>$ = 0\hspace{0.3cm}{\ttfamily [inline]}, {\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{hash_8h_source_l00305}{305}} of file \mbox{\hyperlink{hash_8h_source}{hash.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_aaaae1f4f59791e7522360aba8a02ad04}\label{namespace_k_b_l_i_b___n_s_aaaae1f4f59791e7522360aba8a02ad04}} 
\index{KBLIB\_NS@{KBLIB\_NS}!seed\_discard\_v@{seed\_discard\_v}}
\index{seed\_discard\_v@{seed\_discard\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{seed\_discard\_v}{seed\_discard\_v}}
{\footnotesize\ttfamily template$<$typename T , typename  = void$>$ \\
constexpr std\+::size\+\_\+t KBLIB\+\_\+\+NS\+::seed\+\_\+discard\+\_\+v = 0\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{random_8h_source_l00196}{196}} of file \mbox{\hyperlink{random_8h_source}{random.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a3c73283c42fa767d04476fe249aab299}\label{namespace_k_b_l_i_b___n_s_a3c73283c42fa767d04476fe249aab299}} 
\index{KBLIB\_NS@{KBLIB\_NS}!state\_size\_v@{state\_size\_v}}
\index{state\_size\_v@{state\_size\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{state\_size\_v}{state\_size\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr std\+::size\+\_\+t KBLIB\+\_\+\+NS\+::state\+\_\+size\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1state__size}{state\+\_\+size}}$<$T$>$\+::value\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{random_8h_source_l00189}{189}} of file \mbox{\hyperlink{random_8h_source}{random.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a4ca198c8b213042d9bd7437a34e18476}\label{namespace_k_b_l_i_b___n_s_a4ca198c8b213042d9bd7437a34e18476}} 
\index{KBLIB\_NS@{KBLIB\_NS}!swap@{swap}}
\index{swap@{swap}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{}{}}
{\footnotesize\ttfamily struct  \{ ... \}  KBLIB\+\_\+\+NS\+::swap}

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a0678ff217e6fea1ec2bfe2286356b045}\label{namespace_k_b_l_i_b___n_s_a0678ff217e6fea1ec2bfe2286356b045}} 
\index{KBLIB\_NS@{KBLIB\_NS}!system\_endian@{system\_endian}}
\index{system\_endian@{system\_endian}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{system\_endian}{system\_endian}}
{\footnotesize\ttfamily constexpr \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1}{endian}} KBLIB\+\_\+\+NS\+::system\+\_\+endian = \mbox{\hyperlink{namespace_k_b_l_i_b___n_s_af2d769d113da59f30bf2c3eafdb3f1b1aad921d60486366258809553a3db49a4a}{endian\+::unknown}}\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{tdecl_8h_source_l00211}{211}} of file \mbox{\hyperlink{tdecl_8h_source}{tdecl.\+h}}.

\mbox{\Hypertarget{namespace_k_b_l_i_b___n_s_a02befc3759ed0939086821b3a53b82e1}\label{namespace_k_b_l_i_b___n_s_a02befc3759ed0939086821b3a53b82e1}} 
\index{KBLIB\_NS@{KBLIB\_NS}!value\_detected\_v@{value\_detected\_v}}
\index{value\_detected\_v@{value\_detected\_v}!KBLIB\_NS@{KBLIB\_NS}}
\doxysubsubsection{\texorpdfstring{value\_detected\_v}{value\_detected\_v}}
{\footnotesize\ttfamily template$<$typename T $>$ \\
constexpr bool KBLIB\+\_\+\+NS\+::value\+\_\+detected\+\_\+v = \mbox{\hyperlink{struct_k_b_l_i_b___n_s_1_1value__detected}{value\+\_\+detected}}$<$T$>$\+::value\hspace{0.3cm}{\ttfamily [constexpr]}}



Definition at line \mbox{\hyperlink{fakestd_8h_source_l00882}{882}} of file \mbox{\hyperlink{fakestd_8h_source}{fakestd.\+h}}.