\hypertarget{classNextTableMap}{
\section{NextTableMap$<$ A $>$ Class Template Reference}
\label{classNextTableMap}\index{NextTableMap@{NextTableMap}}
}


\hyperlink{classNextTableMap}{NextTableMap} behaves more or less like a map between a \hyperlink{classBGPRouteTable}{BGPRouteTable}$\ast$ and a const PeerHandler$\ast$, but it gives deterministic ordering semantics so our test suites aren't dependent on \hyperlink{protocolthe-p}{the} memory allocator.  




{\ttfamily \#include $<$route\_\-table\_\-fanout.hh$>$}

\subsection*{Public Types}
\begin{DoxyCompactItemize}
\item 
\hypertarget{classNextTableMap_ad44b54a427b5b45b38362011b4eba865}{
typedef \hyperlink{classNextTableMapIterator}{NextTableMapIterator}$<$ A $>$ {\bfseries iterator}}
\label{classNextTableMap_ad44b54a427b5b45b38362011b4eba865}

\end{DoxyCompactItemize}
\subsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
\hypertarget{classNextTableMap_ae7169f3e47a1a96bdea954ae259d5232}{
void {\bfseries insert} (\hyperlink{classBGPRouteTable}{BGPRouteTable}$<$ A $>$ $\ast$next\_\-table, const \hyperlink{classPeerHandler}{PeerHandler} $\ast$ph, uint32\_\-t genid)}
\label{classNextTableMap_ae7169f3e47a1a96bdea954ae259d5232}

\item 
\hypertarget{classNextTableMap_a6620827ff834f85e39f784cbd7b6a483}{
void {\bfseries erase} (\hyperlink{classNextTableMapIterator}{iterator} \&iter)}
\label{classNextTableMap_a6620827ff834f85e39f784cbd7b6a483}

\item 
\hypertarget{classNextTableMap_a94e3dde90bab2db9c62a094a0a3e1882}{
\hyperlink{classNextTableMapIterator}{iterator} {\bfseries find} (\hyperlink{classBGPRouteTable}{BGPRouteTable}$<$ A $>$ $\ast$next\_\-table)}
\label{classNextTableMap_a94e3dde90bab2db9c62a094a0a3e1882}

\item 
\hypertarget{classNextTableMap_a532552136741dd578441ad89d8a2df35}{
\hyperlink{classNextTableMapIterator}{iterator} {\bfseries begin} ()}
\label{classNextTableMap_a532552136741dd578441ad89d8a2df35}

\item 
\hypertarget{classNextTableMap_a904b49cd542a5af16a86a3dbb2a400bb}{
\hyperlink{classNextTableMapIterator}{iterator} {\bfseries end} ()}
\label{classNextTableMap_a904b49cd542a5af16a86a3dbb2a400bb}

\end{DoxyCompactItemize}
\subsection*{Private Attributes}
\begin{DoxyCompactItemize}
\item 
\hypertarget{classNextTableMap_a2b8cd74afa110ffc9eab3d157829def7}{
map$<$ \hyperlink{classBGPRouteTable}{BGPRouteTable}$<$ A $>$ $\ast$, \hyperlink{classPeerTableInfo}{PeerTableInfo}$<$ A $>$ $\ast$ $>$ {\bfseries \_\-next\_\-tables}}
\label{classNextTableMap_a2b8cd74afa110ffc9eab3d157829def7}

\item 
\hypertarget{classNextTableMap_addf1e2ed8b1f726698dbd7651ad9aadc}{
multimap$<$ uint32\_\-t, \hyperlink{classPeerTableInfo}{PeerTableInfo}$<$ A $>$ $\ast$ $>$ {\bfseries \_\-next\_\-table\_\-order}}
\label{classNextTableMap_addf1e2ed8b1f726698dbd7651ad9aadc}

\end{DoxyCompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$class A$>$ class NextTableMap$<$ A $>$}

\hyperlink{classNextTableMap}{NextTableMap} behaves more or less like a map between a \hyperlink{classBGPRouteTable}{BGPRouteTable}$\ast$ and a const PeerHandler$\ast$, but it gives deterministic ordering semantics so our test suites aren't dependent on \hyperlink{protocolthe-p}{the} memory allocator. This class basically hides \hyperlink{protocolthe-p}{the} complexity of maintaining two parallel data structures from \hyperlink{protocolthe-p}{the} main \hyperlink{classFanoutTable}{FanoutTable} code 

The documentation for this class was generated from the following files:\begin{DoxyCompactItemize}
\item 
/home/greearb/git/xorp.ct.github/xorp/bgp/route\_\-table\_\-fanout.hh\item 
/home/greearb/git/xorp.ct.github/xorp/bgp/route\_\-table\_\-fanout.cc\end{DoxyCompactItemize}
