\section{R\+Plus\+Plus\+Tree\+Descent\+Heuristic Class Reference}
\label{classmlpack_1_1tree_1_1RPlusPlusTreeDescentHeuristic}\index{R\+Plus\+Plus\+Tree\+Descent\+Heuristic@{R\+Plus\+Plus\+Tree\+Descent\+Heuristic}}
\subsection*{Static Public Member Functions}
\begin{DoxyCompactItemize}
\item 
{\footnotesize template$<$typename Tree\+Type $>$ }\\static size\+\_\+t \textbf{ Choose\+Descent\+Node} (Tree\+Type $\ast$node, const size\+\_\+t point)
\begin{DoxyCompactList}\small\item\em Evaluate the node using a heuristic. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Tree\+Type $>$ }\\static size\+\_\+t \textbf{ Choose\+Descent\+Node} (const Tree\+Type $\ast$node, const Tree\+Type $\ast$inserted\+Node)
\begin{DoxyCompactList}\small\item\em Evaluate the node using a heuristic. \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}


Definition at line 21 of file r\+\_\+plus\+\_\+plus\+\_\+tree\+\_\+descent\+\_\+heuristic.\+hpp.



\subsection{Member Function Documentation}
\mbox{\label{classmlpack_1_1tree_1_1RPlusPlusTreeDescentHeuristic_addab0c2e6048c1ca04f964cbd8f4c4e6}} 
\index{mlpack\+::tree\+::\+R\+Plus\+Plus\+Tree\+Descent\+Heuristic@{mlpack\+::tree\+::\+R\+Plus\+Plus\+Tree\+Descent\+Heuristic}!Choose\+Descent\+Node@{Choose\+Descent\+Node}}
\index{Choose\+Descent\+Node@{Choose\+Descent\+Node}!mlpack\+::tree\+::\+R\+Plus\+Plus\+Tree\+Descent\+Heuristic@{mlpack\+::tree\+::\+R\+Plus\+Plus\+Tree\+Descent\+Heuristic}}
\subsubsection{Choose\+Descent\+Node()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily static size\+\_\+t Choose\+Descent\+Node (\begin{DoxyParamCaption}\item[{Tree\+Type $\ast$}]{node,  }\item[{const size\+\_\+t}]{point }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [static]}}



Evaluate the node using a heuristic. 

Returns the number of the node with minimum largest Hilbert value is greater than the Hilbert value of the point being inserted.


\begin{DoxyParams}{Parameters}
{\em node} & The node that is being evaluated. \\
\hline
{\em point} & The number of the point that is being inserted. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RPlusPlusTreeDescentHeuristic_aa91503da5ab453e1a2e13cde6deded48}} 
\index{mlpack\+::tree\+::\+R\+Plus\+Plus\+Tree\+Descent\+Heuristic@{mlpack\+::tree\+::\+R\+Plus\+Plus\+Tree\+Descent\+Heuristic}!Choose\+Descent\+Node@{Choose\+Descent\+Node}}
\index{Choose\+Descent\+Node@{Choose\+Descent\+Node}!mlpack\+::tree\+::\+R\+Plus\+Plus\+Tree\+Descent\+Heuristic@{mlpack\+::tree\+::\+R\+Plus\+Plus\+Tree\+Descent\+Heuristic}}
\subsubsection{Choose\+Descent\+Node()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily static size\+\_\+t Choose\+Descent\+Node (\begin{DoxyParamCaption}\item[{const Tree\+Type $\ast$}]{node,  }\item[{const Tree\+Type $\ast$}]{inserted\+Node }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [static]}}



Evaluate the node using a heuristic. 

Returns the number of the node with minimum largest Hilbert value is greater than the largest Hilbert value of the point being inserted.


\begin{DoxyParams}{Parameters}
{\em node} & The node that is being evaluated. \\
\hline
{\em inserted\+Node} & The node that is being inserted. \\
\hline
\end{DoxyParams}


The documentation for this class was generated from the following file\+:\begin{DoxyCompactItemize}
\item 
/var/www/mlpack.\+ratml.\+org/mlpack.\+org/\+\_\+src/mlpack-\/git/src/mlpack/core/tree/rectangle\+\_\+tree/\textbf{ r\+\_\+plus\+\_\+plus\+\_\+tree\+\_\+descent\+\_\+heuristic.\+hpp}\end{DoxyCompactItemize}
