\section{/var/www/mlpack.ratml.\+org/mlpack.org/\+\_\+src/mlpack-\/3.3.0/src/mlpack/methods/rann/ra\+\_\+model.hpp File Reference}
\label{ra__model_8hpp}\index{/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/3.\+3.\+0/src/mlpack/methods/rann/ra\+\_\+model.\+hpp@{/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/3.\+3.\+0/src/mlpack/methods/rann/ra\+\_\+model.\+hpp}}
Include dependency graph for ra\+\_\+model.\+hpp\+:
\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=350pt]{ra__model_8hpp__incl}
\end{center}
\end{figure}
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \textbf{ Alpha\+Visitor}
\begin{DoxyCompactList}\small\item\em Exposes the Alpha() method of the given R\+A\+Type. \end{DoxyCompactList}\item 
class \textbf{ Bi\+Search\+Visitor$<$ Sort\+Policy $>$}
\begin{DoxyCompactList}\small\item\em \doxyref{Bi\+Search\+Visitor}{p.}{classmlpack_1_1neighbor_1_1BiSearchVisitor} executes a bichromatic neighbor search on the given N\+S\+Type. \end{DoxyCompactList}\item 
class \textbf{ Delete\+Visitor}
\begin{DoxyCompactList}\small\item\em \doxyref{Delete\+Visitor}{p.}{classmlpack_1_1neighbor_1_1DeleteVisitor} deletes the given N\+S\+Type instance. \end{DoxyCompactList}\item 
class \textbf{ First\+Leaf\+Exact\+Visitor}
\begin{DoxyCompactList}\small\item\em Exposes the First\+Leaf\+Exact() method of the given R\+A\+Type. \end{DoxyCompactList}\item 
class \textbf{ Mono\+Search\+Visitor}
\begin{DoxyCompactList}\small\item\em \doxyref{Mono\+Search\+Visitor}{p.}{classmlpack_1_1neighbor_1_1MonoSearchVisitor} executes a monochromatic neighbor search on the given N\+S\+Type. \end{DoxyCompactList}\item 
class \textbf{ Naive\+Visitor}
\begin{DoxyCompactList}\small\item\em \doxyref{Naive\+Visitor}{p.}{classmlpack_1_1neighbor_1_1NaiveVisitor} exposes the Naive() method of the given R\+A\+Type. \end{DoxyCompactList}\item 
class \textbf{ R\+A\+Model$<$ Sort\+Policy $>$}
\begin{DoxyCompactList}\small\item\em The \doxyref{R\+A\+Model}{p.}{classmlpack_1_1neighbor_1_1RAModel} class provides an abstraction for the \doxyref{R\+A\+Search}{p.}{classmlpack_1_1neighbor_1_1RASearch} class, abstracting away the Tree\+Type parameter and allowing it to be specified at runtime in this class. \end{DoxyCompactList}\item 
class \textbf{ Reference\+Set\+Visitor}
\begin{DoxyCompactList}\small\item\em \doxyref{Reference\+Set\+Visitor}{p.}{classmlpack_1_1neighbor_1_1ReferenceSetVisitor} exposes the reference\+Set of the given N\+S\+Type. \end{DoxyCompactList}\item 
class \textbf{ Sample\+At\+Leaves\+Visitor}
\begin{DoxyCompactList}\small\item\em Exposes the Sample\+At\+Leaves() method of the given R\+A\+Type. \end{DoxyCompactList}\item 
class \textbf{ Single\+Mode\+Visitor}
\begin{DoxyCompactList}\small\item\em Exposes the Single\+Mode() method of the given R\+A\+Type. \end{DoxyCompactList}\item 
class \textbf{ Single\+Sample\+Limit\+Visitor}
\begin{DoxyCompactList}\small\item\em Exposes the Single\+Sample\+Limit() method of the given R\+A\+Type. \end{DoxyCompactList}\item 
class \textbf{ Tau\+Visitor}
\begin{DoxyCompactList}\small\item\em Exposes the Tau() method of the given R\+A\+Type. \end{DoxyCompactList}\item 
class \textbf{ Train\+Visitor$<$ Sort\+Policy $>$}
\begin{DoxyCompactList}\small\item\em \doxyref{Train\+Visitor}{p.}{classmlpack_1_1neighbor_1_1TrainVisitor} sets the reference set to a new reference set on the given N\+S\+Type. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Namespaces}
\begin{DoxyCompactItemize}
\item 
 \textbf{ mlpack}
\begin{DoxyCompactList}\small\item\em strip\+\_\+type.\+hpp \end{DoxyCompactList}\item 
 \textbf{ mlpack\+::neighbor}
\end{DoxyCompactItemize}
\subsection*{Typedefs}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Sort\+Policy , template$<$ typename Tree\+Metric\+Type, typename Tree\+Stat\+Type, typename Tree\+Mat\+Type $>$ class Tree\+Type$>$ }\\using \textbf{ R\+A\+Type} = R\+A\+Search$<$ Sort\+Policy, metric\+::\+Euclidean\+Distance, arma\+::mat, Tree\+Type $>$
\begin{DoxyCompactList}\small\item\em Alias template for \doxyref{R\+A\+Search}{p.}{classmlpack_1_1neighbor_1_1RASearch}. \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
\begin{DoxyAuthor}{Author}
Ryan Curtin
\end{DoxyAuthor}
This is a model for rank-\/approximate nearest neighbor search. It provides an easy way to serialize a rank-\/approximate neighbor search model by abstracting the types of trees and reflecting the R\+A\+Search A\+PI.

mlpack is free software; you may redistribute it and/or modify it under the terms of the 3-\/clause B\+SD license. You should have received a copy of the 3-\/clause B\+SD license along with mlpack. If not, see {\tt http\+://www.\+opensource.\+org/licenses/\+B\+S\+D-\/3-\/\+Clause} for more information.