\hypertarget{kblib__iterators_8h}{}\section{kblib\+\_\+iterators.\+h File Reference}
\label{kblib__iterators_8h}\index{kblib\+\_\+iterators.\+h@{kblib\+\_\+iterators.\+h}}
{\ttfamily \#include \char`\"{}kblib\+\_\+fakestd.\+h\char`\"{}}\newline
{\ttfamily \#include $<$iterator$>$}\newline
Include dependency graph for kblib\+\_\+iterators.\+h\+:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=350pt]{kblib__iterators_8h__incl}
\end{center}
\end{figure}
This graph shows which files directly or indirectly include this file\+:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=264pt]{kblib__iterators_8h__dep__incl}
\end{center}
\end{figure}
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
struct \hyperlink{structkblib_1_1to__pointer__impl}{kblib\+::to\+\_\+pointer\+\_\+impl$<$ ptr $>$}
\item 
struct \hyperlink{structkblib_1_1to__pointer__impl_3_01_t_01_5_01_4}{kblib\+::to\+\_\+pointer\+\_\+impl$<$ T $\ast$ $>$}
\item 
struct \hyperlink{structkblib_1_1is__output__iterator}{kblib\+::is\+\_\+output\+\_\+iterator$<$ T, E, typename $>$}
\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 \hyperlink{structkblib_1_1is__output__iterator_3_01_t_00_01_e_00_01fakestd_1_1void__t_3_01decltype_07_5std_630181452c5f3acc566cb7fbbe7c671f}{kblib\+::is\+\_\+output\+\_\+iterator$<$ T, E, fakestd\+::void\+\_\+t$<$ decltype($\ast$std\+::declval$<$ T \& $>$()=std\+::declval$<$ const E \& $>$())$>$ $>$}
\item 
class \hyperlink{classkblib_1_1counting__back__insert__iterator}{kblib\+::counting\+\_\+back\+\_\+insert\+\_\+iterator$<$ Container $>$}
\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 \hyperlink{structkblib_1_1counting__back__insert__iterator_1_1proxy__iterator}{kblib\+::counting\+\_\+back\+\_\+insert\+\_\+iterator$<$ Container $>$\+::proxy\+\_\+iterator}
\end{DoxyCompactItemize}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \hyperlink{namespacekblib}{kblib}
\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename P $>$ }\\constexpr auto \hyperlink{namespacekblib_a162d1116645a4ed1755868c383df4692}{kblib\+::to\+\_\+pointer} (P \&\&p) noexcept
\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 get() method. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Container , typename Comp  = std\+::less$<$value\+\_\+type\+\_\+linear\+\_\+t$<$\+Container$>$$>$$>$ }\\value\+\_\+type\+\_\+linear\+\_\+t$<$ Container $>$ $\ast$ \hyperlink{namespacekblib_ab5945715550510b9b848e06ee443860e}{kblib\+::max\+\_\+element} (Container \&c, Comp comp)
\item 
{\footnotesize template$<$typename C $>$ }\\\hyperlink{kblib__fakestd_8h_a7f62d0731631a0e7675f45924b7f5ea0}{K\+B\+L\+I\+B\+\_\+\+N\+O\+D\+I\+S\+C\+A\+RD} counting\+\_\+back\+\_\+insert\+\_\+iterator$<$ C $>$ \hyperlink{namespacekblib_aa854bed71675a534fee5e9bcc33535b3}{kblib\+::counting\+\_\+back\+\_\+inserter} (C \&c, std\+::size\+\_\+t count=0)
\end{DoxyCompactItemize}