\section{Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$ Class Template Reference}
\label{classmlpack_1_1tree_1_1RectangleTree}\index{Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$@{Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$}}


A rectangle type tree tree, such as an R-\/tree or X-\/tree.  


\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \textbf{ Dual\+Tree\+Traverser}
\begin{DoxyCompactList}\small\item\em A dual tree traverser for rectangle type trees. \end{DoxyCompactList}\item 
class \textbf{ Single\+Tree\+Traverser}
\begin{DoxyCompactList}\small\item\em A single traverser for rectangle type trees. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Public Types}
\begin{DoxyCompactItemize}
\item 
typedef Auxiliary\+Information\+Type$<$ \textbf{ Rectangle\+Tree} $>$ \textbf{ Auxiliary\+Information}
\begin{DoxyCompactList}\small\item\em The auxiliary information type held by the tree. \end{DoxyCompactList}\item 
typedef Mat\+Type\+::elem\+\_\+type \textbf{ Elem\+Type}
\begin{DoxyCompactList}\small\item\em The element type held by the matrix type. \end{DoxyCompactList}\item 
typedef Mat\+Type \textbf{ Mat}
\begin{DoxyCompactList}\small\item\em So other classes can use Tree\+Type\+::\+Mat. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Public Member Functions}
\begin{DoxyCompactItemize}
\item 
\textbf{ Rectangle\+Tree} (const Mat\+Type \&data, const size\+\_\+t max\+Leaf\+Size=20, const size\+\_\+t min\+Leaf\+Size=8, const size\+\_\+t max\+Num\+Children=5, const size\+\_\+t min\+Num\+Children=2, const size\+\_\+t first\+Data\+Index=0)
\begin{DoxyCompactList}\small\item\em Construct this as the root node of a rectangle type tree using the given dataset. \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} (Mat\+Type \&\&data, const size\+\_\+t max\+Leaf\+Size=20, const size\+\_\+t min\+Leaf\+Size=8, const size\+\_\+t max\+Num\+Children=5, const size\+\_\+t min\+Num\+Children=2, const size\+\_\+t first\+Data\+Index=0)
\begin{DoxyCompactList}\small\item\em Construct this as the root node of a rectangle tree type using the given dataset, and taking ownership of the given dataset. \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} (\textbf{ Rectangle\+Tree} $\ast$parent\+Node, const size\+\_\+t num\+Max\+Children=0)
\begin{DoxyCompactList}\small\item\em Construct this as an empty node with the specified parent. \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} (const \textbf{ Rectangle\+Tree} \&other, const bool deep\+Copy=true, \textbf{ Rectangle\+Tree} $\ast$new\+Parent=N\+U\+LL)
\begin{DoxyCompactList}\small\item\em Create a rectangle tree by copying the other tree. \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} (\textbf{ Rectangle\+Tree} \&\&other)
\begin{DoxyCompactList}\small\item\em Create a rectangle tree by moving the other tree. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Archive $>$ }\\\textbf{ Rectangle\+Tree} (Archive \&ar, const typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ Archive\+::is\+\_\+loading\+::value $>$ $\ast$=0)
\begin{DoxyCompactList}\small\item\em Construct the tree from a \doxyref{boost\+::serialization}{p.}{namespaceboost_1_1serialization} archive. \end{DoxyCompactList}\item 
\textbf{ $\sim$\+Rectangle\+Tree} ()
\begin{DoxyCompactList}\small\item\em Deletes this node, deallocating the memory for the children and calling their destructors in turn. \end{DoxyCompactList}\item 
const Auxiliary\+Information\+Type$<$ \textbf{ Rectangle\+Tree} $>$ \& \textbf{ Auxiliary\+Info} () const
\begin{DoxyCompactList}\small\item\em Return the auxiliary information object of this node. \end{DoxyCompactList}\item 
Auxiliary\+Information\+Type$<$ \textbf{ Rectangle\+Tree} $>$ \& \textbf{ Auxiliary\+Info} ()
\begin{DoxyCompactList}\small\item\em Modify the split object of this node. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Begin} () const
\begin{DoxyCompactList}\small\item\em Return the index of the beginning point of this subset. \end{DoxyCompactList}\item 
size\+\_\+t \& \textbf{ Begin} ()
\begin{DoxyCompactList}\small\item\em Modify the index of the beginning point of this subset. \end{DoxyCompactList}\item 
const \textbf{ bound\+::\+H\+Rect\+Bound}$<$ Metric\+Type $>$ \& \textbf{ Bound} () const
\begin{DoxyCompactList}\small\item\em Return the bound object for this node. \end{DoxyCompactList}\item 
\textbf{ bound\+::\+H\+Rect\+Bound}$<$ Metric\+Type $>$ \& \textbf{ Bound} ()
\begin{DoxyCompactList}\small\item\em Modify the bound object for this node. \end{DoxyCompactList}\item 
void \textbf{ Center} (arma\+::vec \&center)
\begin{DoxyCompactList}\small\item\em Get the centroid of the node and store it in the given vector. \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} \& \textbf{ Child} (const size\+\_\+t child) const
\begin{DoxyCompactList}\small\item\em Get the specified child. \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} \& \textbf{ Child} (const size\+\_\+t child)
\begin{DoxyCompactList}\small\item\em Modify the specified child. \end{DoxyCompactList}\item 
void \textbf{ Condense\+Tree} (const arma\+::vec \&point, std\+::vector$<$ bool $>$ \&relevels, const bool use\+Point)
\begin{DoxyCompactList}\small\item\em Condense the bounding rectangles for this node based on the removal of the point specified by the arma\+::vec\&. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Count} () const
\begin{DoxyCompactList}\small\item\em Return the number of points in this subset. \end{DoxyCompactList}\item 
size\+\_\+t \& \textbf{ Count} ()
\begin{DoxyCompactList}\small\item\em Modify the number of points in this subset. \end{DoxyCompactList}\item 
const Mat\+Type \& \textbf{ Dataset} () const
\begin{DoxyCompactList}\small\item\em Get the dataset which the tree is built on. \end{DoxyCompactList}\item 
Mat\+Type \& \textbf{ Dataset} ()
\begin{DoxyCompactList}\small\item\em Modify the dataset which the tree is built on. Be careful! \end{DoxyCompactList}\item 
bool \textbf{ Delete\+Point} (const size\+\_\+t point)
\begin{DoxyCompactList}\small\item\em Deletes a point from the treeand, updates the bounding rectangle. \end{DoxyCompactList}\item 
bool \textbf{ Delete\+Point} (const size\+\_\+t point, std\+::vector$<$ bool $>$ \&relevels)
\begin{DoxyCompactList}\small\item\em Deletes a point from the tree, updates the bounding rectangle, tracking levels. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Descendant} (const size\+\_\+t index) const
\begin{DoxyCompactList}\small\item\em Return the index (with reference to the dataset) of a particular descendant of this node. \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} $\ast$ \textbf{ Exact\+Clone} ()
\begin{DoxyCompactList}\small\item\em Make an exact copy of this node, pointers and everything. \end{DoxyCompactList}\item 
const \textbf{ Rectangle\+Tree} $\ast$ \textbf{ Find\+By\+Begin\+Count} (size\+\_\+t begin, size\+\_\+t count) const
\begin{DoxyCompactList}\small\item\em Find a node in this tree by its begin and count (const). \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} $\ast$ \textbf{ Find\+By\+Begin\+Count} (size\+\_\+t begin, size\+\_\+t count)
\begin{DoxyCompactList}\small\item\em Find a node in this tree by its begin and count. \end{DoxyCompactList}\item 
\textbf{ Elem\+Type} \textbf{ Furthest\+Descendant\+Distance} () const
\begin{DoxyCompactList}\small\item\em Return the furthest possible descendant distance. \end{DoxyCompactList}\item 
\textbf{ Elem\+Type} \textbf{ Furthest\+Point\+Distance} () const
\begin{DoxyCompactList}\small\item\em Return the furthest distance to a point held in this node. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Vec\+Type $>$ }\\size\+\_\+t \textbf{ Get\+Furthest\+Child} (const Vec\+Type \&point, typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ \textbf{ Is\+Vector}$<$ Vec\+Type $>$\+::value $>$ $\ast$=0)
\begin{DoxyCompactList}\small\item\em Return the index of the furthest child node to the given query point. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Get\+Furthest\+Child} (const \textbf{ Rectangle\+Tree} \&query\+Node)
\begin{DoxyCompactList}\small\item\em Return the index of the furthest child node to the given query node. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Vec\+Type $>$ }\\size\+\_\+t \textbf{ Get\+Nearest\+Child} (const Vec\+Type \&point, typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ \textbf{ Is\+Vector}$<$ Vec\+Type $>$\+::value $>$ $\ast$=0)
\begin{DoxyCompactList}\small\item\em Return the index of the nearest child node to the given query point. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Get\+Nearest\+Child} (const \textbf{ Rectangle\+Tree} \&query\+Node)
\begin{DoxyCompactList}\small\item\em Return the index of the nearest child node to the given query node. \end{DoxyCompactList}\item 
void \textbf{ Insert\+Node} (\textbf{ Rectangle\+Tree} $\ast$node, const size\+\_\+t level, std\+::vector$<$ bool $>$ \&relevels)
\begin{DoxyCompactList}\small\item\em Inserts a node into the tree, tracking which levels have been inserted into. \end{DoxyCompactList}\item 
void \textbf{ Insert\+Point} (const size\+\_\+t point)
\begin{DoxyCompactList}\small\item\em Inserts a point into the tree. \end{DoxyCompactList}\item 
void \textbf{ Insert\+Point} (const size\+\_\+t point, std\+::vector$<$ bool $>$ \&relevels)
\begin{DoxyCompactList}\small\item\em Inserts a point into the tree, tracking which levels have been inserted into. \end{DoxyCompactList}\item 
bool \textbf{ Is\+Leaf} () const
\begin{DoxyCompactList}\small\item\em Return whether or not this node is a leaf (true if it has no children). \end{DoxyCompactList}\item 
\textbf{ Elem\+Type} \textbf{ Max\+Distance} (const \textbf{ Rectangle\+Tree} \&other) const
\begin{DoxyCompactList}\small\item\em Return the maximum distance to another node. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Vec\+Type $>$ }\\\textbf{ Elem\+Type} \textbf{ Max\+Distance} (const Vec\+Type \&point, typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ \textbf{ Is\+Vector}$<$ Vec\+Type $>$\+::value $>$ $\ast$=0) const
\begin{DoxyCompactList}\small\item\em Return the maximum distance to another point. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Max\+Leaf\+Size} () const
\begin{DoxyCompactList}\small\item\em Return the maximum leaf size. \end{DoxyCompactList}\item 
size\+\_\+t \& \textbf{ Max\+Leaf\+Size} ()
\begin{DoxyCompactList}\small\item\em Modify the maximum leaf size. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Max\+Num\+Children} () const
\begin{DoxyCompactList}\small\item\em Return the maximum number of children (in a non-\/leaf node). \end{DoxyCompactList}\item 
size\+\_\+t \& \textbf{ Max\+Num\+Children} ()
\begin{DoxyCompactList}\small\item\em Modify the maximum number of children (in a non-\/leaf node). \end{DoxyCompactList}\item 
Metric\+Type \textbf{ Metric} () const
\begin{DoxyCompactList}\small\item\em Get the metric which the tree uses. \end{DoxyCompactList}\item 
\textbf{ Elem\+Type} \textbf{ Min\+Distance} (const \textbf{ Rectangle\+Tree} \&other) const
\begin{DoxyCompactList}\small\item\em Return the minimum distance to another node. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Vec\+Type $>$ }\\\textbf{ Elem\+Type} \textbf{ Min\+Distance} (const Vec\+Type \&point, typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ \textbf{ Is\+Vector}$<$ Vec\+Type $>$\+::value $>$ $\ast$=0) const
\begin{DoxyCompactList}\small\item\em Return the minimum distance to another point. \end{DoxyCompactList}\item 
\textbf{ Elem\+Type} \textbf{ Minimum\+Bound\+Distance} () const
\begin{DoxyCompactList}\small\item\em Return the minimum distance from the center to any edge of the bound. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Min\+Leaf\+Size} () const
\begin{DoxyCompactList}\small\item\em Return the minimum leaf size. \end{DoxyCompactList}\item 
size\+\_\+t \& \textbf{ Min\+Leaf\+Size} ()
\begin{DoxyCompactList}\small\item\em Modify the minimum leaf size. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Min\+Num\+Children} () const
\begin{DoxyCompactList}\small\item\em Return the minimum number of children (in a non-\/leaf node). \end{DoxyCompactList}\item 
size\+\_\+t \& \textbf{ Min\+Num\+Children} ()
\begin{DoxyCompactList}\small\item\em Modify the minimum number of children (in a non-\/leaf node). \end{DoxyCompactList}\item 
void \textbf{ Nullify\+Data} ()
\begin{DoxyCompactList}\small\item\em Nullify the auxiliary information. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Num\+Children} () const
\begin{DoxyCompactList}\small\item\em Return the number of child nodes. (One level beneath this one only.) \end{DoxyCompactList}\item 
size\+\_\+t \& \textbf{ Num\+Children} ()
\begin{DoxyCompactList}\small\item\em Modify the number of child nodes. Be careful. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Num\+Descendants} () const
\begin{DoxyCompactList}\small\item\em Return the number of descendants of this node. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Num\+Points} () const
\begin{DoxyCompactList}\small\item\em Return the number of points in this node (returns 0 if this node is not a leaf). \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} \& \textbf{ operator=} (const \textbf{ Rectangle\+Tree} \&other)
\begin{DoxyCompactList}\small\item\em Copy the given rectangle tree. \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} \& \textbf{ operator=} (\textbf{ Rectangle\+Tree} \&\&other)
\begin{DoxyCompactList}\small\item\em Take ownership of the given rectangle tree. \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} $\ast$ \textbf{ Parent} () const
\begin{DoxyCompactList}\small\item\em Gets the parent of this node. \end{DoxyCompactList}\item 
\textbf{ Rectangle\+Tree} $\ast$\& \textbf{ Parent} ()
\begin{DoxyCompactList}\small\item\em Modify the parent of this node. \end{DoxyCompactList}\item 
\textbf{ Elem\+Type} \textbf{ Parent\+Distance} () const
\begin{DoxyCompactList}\small\item\em Return the distance from the center of this node to the center of the parent node. \end{DoxyCompactList}\item 
\textbf{ Elem\+Type} \& \textbf{ Parent\+Distance} ()
\begin{DoxyCompactList}\small\item\em Modify the distance from the center of this node to the center of the parent node. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Point} (const size\+\_\+t index) const
\begin{DoxyCompactList}\small\item\em Return the index (with reference to the dataset) of a particular point in this node. \end{DoxyCompactList}\item 
size\+\_\+t \& \textbf{ Point} (const size\+\_\+t index)
\begin{DoxyCompactList}\small\item\em Modify the index of a particular point in this node. \end{DoxyCompactList}\item 
\textbf{ math\+::\+Range\+Type}$<$ \textbf{ Elem\+Type} $>$ \textbf{ Range\+Distance} (const \textbf{ Rectangle\+Tree} \&other) const
\begin{DoxyCompactList}\small\item\em Return the minimum and maximum distance to another node. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Vec\+Type $>$ }\\\textbf{ math\+::\+Range\+Type}$<$ \textbf{ Elem\+Type} $>$ \textbf{ Range\+Distance} (const Vec\+Type \&point, typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ \textbf{ Is\+Vector}$<$ Vec\+Type $>$\+::value $>$ $\ast$=0) const
\begin{DoxyCompactList}\small\item\em Return the minimum and maximum distance to another point. \end{DoxyCompactList}\item 
bool \textbf{ Remove\+Node} (const \textbf{ Rectangle\+Tree} $\ast$node, std\+::vector$<$ bool $>$ \&relevels)
\begin{DoxyCompactList}\small\item\em Removes a node from the tree. \end{DoxyCompactList}\item 
{\footnotesize template$<$typename Archive $>$ }\\void \textbf{ serialize} (Archive \&ar, const unsigned int)
\begin{DoxyCompactList}\small\item\em Serialize the tree. \end{DoxyCompactList}\item 
bool \textbf{ Shrink\+Bound\+For\+Bound} (const \textbf{ bound\+::\+H\+Rect\+Bound}$<$ Metric\+Type $>$ \&changed\+Bound)
\begin{DoxyCompactList}\small\item\em Shrink the bound object of this node for the removal of a child node. \end{DoxyCompactList}\item 
bool \textbf{ Shrink\+Bound\+For\+Point} (const arma\+::vec \&point)
\begin{DoxyCompactList}\small\item\em Shrink the bound object of this node for the removal of a point. \end{DoxyCompactList}\item 
void \textbf{ Soft\+Delete} ()
\begin{DoxyCompactList}\small\item\em Delete this node of the tree, but leave the stuff contained in it intact. \end{DoxyCompactList}\item 
const Statistic\+Type \& \textbf{ Stat} () const
\begin{DoxyCompactList}\small\item\em Return the statistic object for this node. \end{DoxyCompactList}\item 
Statistic\+Type \& \textbf{ Stat} ()
\begin{DoxyCompactList}\small\item\em Modify the statistic object for this node. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Tree\+Depth} () const
\begin{DoxyCompactList}\small\item\em Obtains the number of levels below this node in the tree, starting with this. \end{DoxyCompactList}\item 
size\+\_\+t \textbf{ Tree\+Size} () const
\begin{DoxyCompactList}\small\item\em Obtains the number of nodes in the tree, starting with this. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Protected Member Functions}
\begin{DoxyCompactItemize}
\item 
\textbf{ Rectangle\+Tree} ()
\begin{DoxyCompactList}\small\item\em A default constructor. \end{DoxyCompactList}\end{DoxyCompactItemize}
\subsection*{Protected Attributes}
\begin{DoxyCompactItemize}
\item 
friend \textbf{ Auxiliary\+Information}
\begin{DoxyCompactList}\small\item\em Give friend access for Auxiliary\+Information\+Type. \end{DoxyCompactList}\item 
friend \textbf{ Descent\+Type}
\begin{DoxyCompactList}\small\item\em Give friend access for Descent\+Type. \end{DoxyCompactList}\item 
friend \textbf{ Split\+Type}
\begin{DoxyCompactList}\small\item\em Give friend access for Split\+Type. \end{DoxyCompactList}\end{DoxyCompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$typename Metric\+Type = metric\+::\+Euclidean\+Distance, typename Statistic\+Type = Empty\+Statistic, typename Mat\+Type = arma\+::mat, typename Split\+Type = R\+Tree\+Split, typename Descent\+Type = R\+Tree\+Descent\+Heuristic, template$<$ typename $>$ class Auxiliary\+Information\+Type = No\+Auxiliary\+Information$>$\newline
class mlpack\+::tree\+::\+Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$}

A rectangle type tree tree, such as an R-\/tree or X-\/tree. 

Once the bound and type of dataset is defined, the tree will construct itself. Call the constructor with the dataset to build the tree on, and the entire tree will be built.

This tree does allow growth, so you can add and delete nodes from it.


\begin{DoxyTemplParams}{Template Parameters}
{\em Metric\+Type} & This {\itshape must} be Euclidean\+Distance, but the template parameter is required to satisfy the Tree\+Type A\+PI. \\
\hline
{\em Statistic\+Type} & Extra data contained in the node. See \doxyref{statistic.\+hpp}{p.}{statistic_8hpp} for the necessary skeleton interface. \\
\hline
{\em Mat\+Type} & The dataset class. \\
\hline
{\em Split\+Type} & The type of split to use when inserting points. \\
\hline
{\em Descent\+Type} & The heuristic to use when descending the tree to insert points. \\
\hline
{\em Auxiliary\+Information\+Type} & An auxiliary information contained in the node. This information depends on the type of the \doxyref{Rectangle\+Tree}{p.}{classmlpack_1_1tree_1_1RectangleTree}. \\
\hline
\end{DoxyTemplParams}


Definition at line 54 of file rectangle\+\_\+tree.\+hpp.



\subsection{Member Typedef Documentation}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a5037c9f86afcfda12a618bfe99994a23}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Auxiliary\+Information@{Auxiliary\+Information}}
\index{Auxiliary\+Information@{Auxiliary\+Information}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Auxiliary\+Information}
{\footnotesize\ttfamily typedef Auxiliary\+Information\+Type$<$\textbf{ Rectangle\+Tree}$>$ \textbf{ Auxiliary\+Information}}



The auxiliary information type held by the tree. 



Definition at line 66 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a227d0c7e23e98fcd6c81ecab357a791f}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Elem\+Type@{Elem\+Type}}
\index{Elem\+Type@{Elem\+Type}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Elem\+Type}
{\footnotesize\ttfamily typedef Mat\+Type\+::elem\+\_\+type \textbf{ Elem\+Type}}



The element type held by the matrix type. 



Definition at line 64 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a57758caa2e58c3fe05d1284eeabae523}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Mat@{Mat}}
\index{Mat@{Mat}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Mat}
{\footnotesize\ttfamily typedef Mat\+Type \textbf{ Mat}}



So other classes can use Tree\+Type\+::\+Mat. 



Definition at line 58 of file rectangle\+\_\+tree.\+hpp.



\subsection{Constructor \& Destructor Documentation}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a1027fe8c984d5656006328acd6cc92c3}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Rectangle\+Tree@{Rectangle\+Tree}}
\index{Rectangle\+Tree@{Rectangle\+Tree}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Rectangle\+Tree()\hspace{0.1cm}{\footnotesize\ttfamily [1/7]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree} (\begin{DoxyParamCaption}\item[{const Mat\+Type \&}]{data,  }\item[{const size\+\_\+t}]{max\+Leaf\+Size = {\ttfamily 20},  }\item[{const size\+\_\+t}]{min\+Leaf\+Size = {\ttfamily 8},  }\item[{const size\+\_\+t}]{max\+Num\+Children = {\ttfamily 5},  }\item[{const size\+\_\+t}]{min\+Num\+Children = {\ttfamily 2},  }\item[{const size\+\_\+t}]{first\+Data\+Index = {\ttfamily 0} }\end{DoxyParamCaption})}



Construct this as the root node of a rectangle type tree using the given dataset. 

This will modify the ordering of the points in the dataset!


\begin{DoxyParams}{Parameters}
{\em data} & Dataset from which to create the tree. This will be modified! \\
\hline
{\em max\+Leaf\+Size} & Maximum size of each leaf in the tree. \\
\hline
{\em min\+Leaf\+Size} & Minimum size of each leaf in the tree. \\
\hline
{\em max\+Num\+Children} & The maximum number of child nodes a non-\/leaf node may have. \\
\hline
{\em min\+Num\+Children} & The minimum number of child nodes a non-\/leaf node may have. \\
\hline
{\em first\+Data\+Index} & The index of the first data point. U\+N\+U\+S\+ED U\+N\+L\+E\+SS WE A\+DD S\+U\+P\+P\+O\+RT F\+OR H\+A\+V\+I\+NG A \char`\"{}\+C\+E\+N\+T\+E\+R\+A\+L\char`\"{} D\+A\+TA M\+A\+T\+R\+IX. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_af147218dd8dc0045cd6a7cecd43a2ffe}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Rectangle\+Tree@{Rectangle\+Tree}}
\index{Rectangle\+Tree@{Rectangle\+Tree}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Rectangle\+Tree()\hspace{0.1cm}{\footnotesize\ttfamily [2/7]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree} (\begin{DoxyParamCaption}\item[{Mat\+Type \&\&}]{data,  }\item[{const size\+\_\+t}]{max\+Leaf\+Size = {\ttfamily 20},  }\item[{const size\+\_\+t}]{min\+Leaf\+Size = {\ttfamily 8},  }\item[{const size\+\_\+t}]{max\+Num\+Children = {\ttfamily 5},  }\item[{const size\+\_\+t}]{min\+Num\+Children = {\ttfamily 2},  }\item[{const size\+\_\+t}]{first\+Data\+Index = {\ttfamily 0} }\end{DoxyParamCaption})}



Construct this as the root node of a rectangle tree type using the given dataset, and taking ownership of the given dataset. 


\begin{DoxyParams}{Parameters}
{\em data} & Dataset from which to create the tree. \\
\hline
{\em max\+Leaf\+Size} & Maximum size of each leaf in the tree. \\
\hline
{\em min\+Leaf\+Size} & Minimum size of each leaf in the tree. \\
\hline
{\em max\+Num\+Children} & The maximum number of child nodes a non-\/leaf node may have. \\
\hline
{\em min\+Num\+Children} & The minimum number of child nodes a non-\/leaf node may have. \\
\hline
{\em first\+Data\+Index} & The index of the first data point. U\+N\+U\+S\+ED U\+N\+L\+E\+SS WE A\+DD S\+U\+P\+P\+O\+RT F\+OR H\+A\+V\+I\+NG A \char`\"{}\+C\+E\+N\+T\+E\+R\+A\+L\char`\"{} D\+A\+TA M\+A\+T\+R\+IX. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a3b593f811c454b7b95d033c80e051ed3}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Rectangle\+Tree@{Rectangle\+Tree}}
\index{Rectangle\+Tree@{Rectangle\+Tree}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Rectangle\+Tree()\hspace{0.1cm}{\footnotesize\ttfamily [3/7]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree} (\begin{DoxyParamCaption}\item[{\textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ $\ast$}]{parent\+Node,  }\item[{const size\+\_\+t}]{num\+Max\+Children = {\ttfamily 0} }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [explicit]}}



Construct this as an empty node with the specified parent. 

Copying the parameters (max\+Leaf\+Size, min\+Leaf\+Size, max\+Num\+Children, min\+Num\+Children, first\+Data\+Index) from the parent.


\begin{DoxyParams}{Parameters}
{\em parent\+Node} & The parent of the node that is being constructed. \\
\hline
{\em num\+Max\+Children} & The max number of child nodes (used in x-\/trees). \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a7021cb2a458cca4ead6ae79780c14ad8}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Rectangle\+Tree@{Rectangle\+Tree}}
\index{Rectangle\+Tree@{Rectangle\+Tree}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Rectangle\+Tree()\hspace{0.1cm}{\footnotesize\ttfamily [4/7]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree} (\begin{DoxyParamCaption}\item[{const \textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ \&}]{other,  }\item[{const bool}]{deep\+Copy = {\ttfamily true},  }\item[{\textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ $\ast$}]{new\+Parent = {\ttfamily NULL} }\end{DoxyParamCaption})}



Create a rectangle tree by copying the other tree. 

Be careful! This can take a long time and use a lot of memory.


\begin{DoxyParams}{Parameters}
{\em other} & The tree to be copied. \\
\hline
{\em deep\+Copy} & If false, the children are not recursively copied. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a32f828a13cdc2f5eeca43d37c87ff4db}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Rectangle\+Tree@{Rectangle\+Tree}}
\index{Rectangle\+Tree@{Rectangle\+Tree}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Rectangle\+Tree()\hspace{0.1cm}{\footnotesize\ttfamily [5/7]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree} (\begin{DoxyParamCaption}\item[{\textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ \&\&}]{other }\end{DoxyParamCaption})}



Create a rectangle tree by moving the other tree. 


\begin{DoxyParams}{Parameters}
{\em other} & The tree to be moved. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a2f695e4e8424d3685764b1e1892c6a4c}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Rectangle\+Tree@{Rectangle\+Tree}}
\index{Rectangle\+Tree@{Rectangle\+Tree}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Rectangle\+Tree()\hspace{0.1cm}{\footnotesize\ttfamily [6/7]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree} (\begin{DoxyParamCaption}\item[{Archive \&}]{ar,  }\item[{const typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ Archive\+::is\+\_\+loading\+::value $>$ $\ast$}]{ = {\ttfamily 0} }\end{DoxyParamCaption})}



Construct the tree from a \doxyref{boost\+::serialization}{p.}{namespaceboost_1_1serialization} archive. 

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a71251e80af594b01fde0d834d178f849}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!````~Rectangle\+Tree@{$\sim$\+Rectangle\+Tree}}
\index{````~Rectangle\+Tree@{$\sim$\+Rectangle\+Tree}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{$\sim$\+Rectangle\+Tree()}
{\footnotesize\ttfamily $\sim$\textbf{ Rectangle\+Tree} (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})}



Deletes this node, deallocating the memory for the children and calling their destructors in turn. 

This will invalidate any younters or references to any nodes which are children of this one. \mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a916bffeba8c599629948d1711a97cbd7}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Rectangle\+Tree@{Rectangle\+Tree}}
\index{Rectangle\+Tree@{Rectangle\+Tree}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Rectangle\+Tree()\hspace{0.1cm}{\footnotesize\ttfamily [7/7]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree} (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [protected]}}



A default constructor. 

This is meant to only be used with \doxyref{boost\+::serialization}{p.}{namespaceboost_1_1serialization}, which is allowed with the friend declaration below. This does not return a valid tree! This method must be protected, so that the serialization shim can work with the default constructor. 

Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Count().



\subsection{Member Function Documentation}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_aef466731529118c6276cf3d214fee09d}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Auxiliary\+Info@{Auxiliary\+Info}}
\index{Auxiliary\+Info@{Auxiliary\+Info}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Auxiliary\+Info()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily const Auxiliary\+Information\+Type$<$\textbf{ Rectangle\+Tree}$>$\& Auxiliary\+Info (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the auxiliary information object of this node. 



Definition at line 324 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a3217304f02ab31874410c5326e3d74c3}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Auxiliary\+Info@{Auxiliary\+Info}}
\index{Auxiliary\+Info@{Auxiliary\+Info}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Auxiliary\+Info()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily Auxiliary\+Information\+Type$<$\textbf{ Rectangle\+Tree}$>$\& Auxiliary\+Info (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the split object of this node. 



Definition at line 327 of file rectangle\+\_\+tree.\+hpp.



References Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Is\+Leaf().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ac50a3a009687e641fd8249e011f628d4}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Begin@{Begin}}
\index{Begin@{Begin}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Begin()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t Begin (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the index of the beginning point of this subset. 



Definition at line 542 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a49cdbf8b1b2899522cd80f4cbff40b69}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Begin@{Begin}}
\index{Begin@{Begin}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Begin()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t\& Begin (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the index of the beginning point of this subset. 



Definition at line 544 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ad4a13f7a6c0b11ebbfc0c1bf551141d1}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Bound@{Bound}}
\index{Bound@{Bound}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Bound()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily const \textbf{ bound\+::\+H\+Rect\+Bound}$<$Metric\+Type$>$\& Bound (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the bound object for this node. 



Definition at line 314 of file rectangle\+\_\+tree.\+hpp.



Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Max\+Distance(), Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Min\+Distance(), and Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Range\+Distance().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a8a0a35d824602c0e21a8d21638cfd6ad}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Bound@{Bound}}
\index{Bound@{Bound}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Bound()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily \textbf{ bound\+::\+H\+Rect\+Bound}$<$Metric\+Type$>$\& Bound (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the bound object for this node. 



Definition at line 316 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a16e556777ca3125ab3cdc16aed9e7885}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Center@{Center}}
\index{Center@{Center}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Center()}
{\footnotesize\ttfamily void Center (\begin{DoxyParamCaption}\item[{arma\+::vec \&}]{center }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Get the centroid of the node and store it in the given vector. 



Definition at line 367 of file rectangle\+\_\+tree.\+hpp.



References H\+Rect\+Bound$<$ Metric\+Type, Elem\+Type $>$\+::\+Center().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a562c73abb0bf2e473ecb9ff0075aa9d5}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Child@{Child}}
\index{Child@{Child}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Child()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree}\& Child (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{child }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Get the specified child. 


\begin{DoxyParams}{Parameters}
{\em child} & Index of child to return. \\
\hline
\end{DoxyParams}


Definition at line 436 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ae1f4a985db958092c3015e735a8db69d}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Child@{Child}}
\index{Child@{Child}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Child()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree}\& Child (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{child }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the specified child. 


\begin{DoxyParams}{Parameters}
{\em child} & Index of child to return. \\
\hline
\end{DoxyParams}


Definition at line 446 of file rectangle\+\_\+tree.\+hpp.



References Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Descendant(), Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Num\+Descendants(), and Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Num\+Points().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ae6ffa3cb0972ea772a972b50df36fc59}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Condense\+Tree@{Condense\+Tree}}
\index{Condense\+Tree@{Condense\+Tree}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Condense\+Tree()}
{\footnotesize\ttfamily void Condense\+Tree (\begin{DoxyParamCaption}\item[{const arma\+::vec \&}]{point,  }\item[{std\+::vector$<$ bool $>$ \&}]{relevels,  }\item[{const bool}]{use\+Point }\end{DoxyParamCaption})}



Condense the bounding rectangles for this node based on the removal of the point specified by the arma\+::vec\&. 

This recurses up the tree. If a node goes below the minimum fill, this function will fix the tree.


\begin{DoxyParams}{Parameters}
{\em point} & The arma\+::vec\& of the point that was removed to require this condesation of the tree. \\
\hline
{\em use\+Point} & True if we use the optimized version of the algorithm that is possible when we now what point was deleted. False otherwise (eg. if we deleted a node instead of a point). \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ab30fd361b8bee994ff8ed9fbb6fae845}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Count@{Count}}
\index{Count@{Count}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Count()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t Count (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the number of points in this subset. 



Definition at line 547 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a5a132e068ab206a014b986ff71c3442d}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Count@{Count}}
\index{Count@{Count}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Count()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t\& Count (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the number of points in this subset. 



Definition at line 549 of file rectangle\+\_\+tree.\+hpp.



References Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Rectangle\+Tree().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a4c3764c98d5804083a9ec2c867eb9366}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Dataset@{Dataset}}
\index{Dataset@{Dataset}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Dataset()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily const Mat\+Type\& Dataset (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Get the dataset which the tree is built on. 



Definition at line 359 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_abb34576c3ddb31987f1dda9c33e6476f}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Dataset@{Dataset}}
\index{Dataset@{Dataset}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Dataset()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily Mat\+Type\& Dataset (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the dataset which the tree is built on. Be careful! 



Definition at line 361 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a0509380350bfe78f838730719b5421ee}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Delete\+Point@{Delete\+Point}}
\index{Delete\+Point@{Delete\+Point}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Delete\+Point()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily bool Delete\+Point (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{point }\end{DoxyParamCaption})}



Deletes a point from the treeand, updates the bounding rectangle. 

However, the point will be kept in the centeral dataset. (The user may remove it from there if he wants, but he must not change the indices of the other points.) Returns true if the point is successfully removed and false if it is not. (ie. the point is not in the tree) \mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a06c0d2543978fc03efc5d2114d6e1e54}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Delete\+Point@{Delete\+Point}}
\index{Delete\+Point@{Delete\+Point}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Delete\+Point()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily bool Delete\+Point (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{point,  }\item[{std\+::vector$<$ bool $>$ \&}]{relevels }\end{DoxyParamCaption})}



Deletes a point from the tree, updates the bounding rectangle, tracking levels. 

However, the point will be kept in the centeral dataset. (The user may remove it from there if he wants, but he must not change the indices of the other points.) Returns true if the point is successfully removed and false if it is not. (ie. the point is not in the tree) \mbox{\label{classmlpack_1_1tree_1_1RectangleTree_aa732ea3eeb38529c549fd4d15d8655be}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Descendant@{Descendant}}
\index{Descendant@{Descendant}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Descendant()}
{\footnotesize\ttfamily size\+\_\+t Descendant (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{index }\end{DoxyParamCaption}) const}



Return the index (with reference to the dataset) of a particular descendant of this node. 

The index should be greater than zero but less than the number of descendants.


\begin{DoxyParams}{Parameters}
{\em index} & Index of the descendant. \\
\hline
\end{DoxyParams}


Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Child().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a07db5ef67990c55a04f42765ed589bef}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Exact\+Clone@{Exact\+Clone}}
\index{Exact\+Clone@{Exact\+Clone}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Exact\+Clone()}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree}$\ast$ Exact\+Clone (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})}



Make an exact copy of this node, pointers and everything. 

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a27dcf57c01f3eaafaa08631c31900eb5}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Find\+By\+Begin\+Count@{Find\+By\+Begin\+Count}}
\index{Find\+By\+Begin\+Count@{Find\+By\+Begin\+Count}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Find\+By\+Begin\+Count()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily const \textbf{ Rectangle\+Tree}$\ast$ Find\+By\+Begin\+Count (\begin{DoxyParamCaption}\item[{size\+\_\+t}]{begin,  }\item[{size\+\_\+t}]{count }\end{DoxyParamCaption}) const}



Find a node in this tree by its begin and count (const). 

Every node is uniquely identified by these two numbers. This is useful for communicating position over the network, when pointers would be invalid.


\begin{DoxyParams}{Parameters}
{\em begin} & The begin() of the node to find. \\
\hline
{\em count} & The count() of the node to find. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The found node, or N\+U\+LL if not found. 
\end{DoxyReturn}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a97f6fd1983ad549297e75d849e1a2bca}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Find\+By\+Begin\+Count@{Find\+By\+Begin\+Count}}
\index{Find\+By\+Begin\+Count@{Find\+By\+Begin\+Count}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Find\+By\+Begin\+Count()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree}$\ast$ Find\+By\+Begin\+Count (\begin{DoxyParamCaption}\item[{size\+\_\+t}]{begin,  }\item[{size\+\_\+t}]{count }\end{DoxyParamCaption})}



Find a node in this tree by its begin and count. 

Every node is uniquely identified by these two numbers. This is useful for communicating position over the network, when pointers would be invalid.


\begin{DoxyParams}{Parameters}
{\em begin} & The begin() of the node to find. \\
\hline
{\em count} & The count() of the node to find. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
The found node, or N\+U\+LL if not found. 
\end{DoxyReturn}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_adc597088eadfcfa3060336d0484ab573}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Furthest\+Descendant\+Distance@{Furthest\+Descendant\+Distance}}
\index{Furthest\+Descendant\+Distance@{Furthest\+Descendant\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Furthest\+Descendant\+Distance()}
{\footnotesize\ttfamily \textbf{ Elem\+Type} Furthest\+Descendant\+Distance (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const}



Return the furthest possible descendant distance. 

This returns the maximum distance from the centroid to the edge of the bound and not the empirical quantity which is the actual furthest descendant distance. So the actual furthest descendant distance may be less than what this method returns (but it will never be greater than this). 

Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Num\+Children().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_acbe82a6439f71405b5801ca7d941cbfb}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Furthest\+Point\+Distance@{Furthest\+Point\+Distance}}
\index{Furthest\+Point\+Distance@{Furthest\+Point\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Furthest\+Point\+Distance()}
{\footnotesize\ttfamily \textbf{ Elem\+Type} Furthest\+Point\+Distance (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const}



Return the furthest distance to a point held in this node. 

If this is not a leaf node, then the distance is 0 because the node holds no points. 

Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Num\+Children().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a0257281722537c7916db7763623f67f7}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Get\+Furthest\+Child@{Get\+Furthest\+Child}}
\index{Get\+Furthest\+Child@{Get\+Furthest\+Child}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Get\+Furthest\+Child()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t Get\+Furthest\+Child (\begin{DoxyParamCaption}\item[{const Vec\+Type \&}]{point,  }\item[{typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ \textbf{ Is\+Vector}$<$ Vec\+Type $>$\+::value $>$ $\ast$}]{ = {\ttfamily 0} }\end{DoxyParamCaption})}



Return the index of the furthest child node to the given query point. 

If this is a leaf node, it will return \doxyref{Num\+Children()}{p.}{classmlpack_1_1tree_1_1RectangleTree_a605a6e856364afd0bad4bafa17dbe5c0} (invalid index). 

Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Num\+Children().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_aea96598fb89ed27fe7340349051aa6a2}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Get\+Furthest\+Child@{Get\+Furthest\+Child}}
\index{Get\+Furthest\+Child@{Get\+Furthest\+Child}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Get\+Furthest\+Child()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t Get\+Furthest\+Child (\begin{DoxyParamCaption}\item[{const \textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ \&}]{query\+Node }\end{DoxyParamCaption})}



Return the index of the furthest child node to the given query node. 

If it can\textquotesingle{}t decide, it will return \doxyref{Num\+Children()}{p.}{classmlpack_1_1tree_1_1RectangleTree_a605a6e856364afd0bad4bafa17dbe5c0} (invalid index). \mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a19b9a5fd41d8e192b62effb1445bd410}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Get\+Nearest\+Child@{Get\+Nearest\+Child}}
\index{Get\+Nearest\+Child@{Get\+Nearest\+Child}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Get\+Nearest\+Child()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t Get\+Nearest\+Child (\begin{DoxyParamCaption}\item[{const Vec\+Type \&}]{point,  }\item[{typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ \textbf{ Is\+Vector}$<$ Vec\+Type $>$\+::value $>$ $\ast$}]{ = {\ttfamily 0} }\end{DoxyParamCaption})}



Return the index of the nearest child node to the given query point. 

If this is a leaf node, it will return \doxyref{Num\+Children()}{p.}{classmlpack_1_1tree_1_1RectangleTree_a605a6e856364afd0bad4bafa17dbe5c0} (invalid index). 

Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Num\+Children().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_adae284b6b280a26fd609ad03ede81884}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Get\+Nearest\+Child@{Get\+Nearest\+Child}}
\index{Get\+Nearest\+Child@{Get\+Nearest\+Child}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Get\+Nearest\+Child()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t Get\+Nearest\+Child (\begin{DoxyParamCaption}\item[{const \textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ \&}]{query\+Node }\end{DoxyParamCaption})}



Return the index of the nearest child node to the given query node. 

If it can\textquotesingle{}t decide, it will return \doxyref{Num\+Children()}{p.}{classmlpack_1_1tree_1_1RectangleTree_a605a6e856364afd0bad4bafa17dbe5c0} (invalid index). \mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a35df6b8ff4b000deb441755b6bb2f2d4}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Insert\+Node@{Insert\+Node}}
\index{Insert\+Node@{Insert\+Node}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Insert\+Node()}
{\footnotesize\ttfamily void Insert\+Node (\begin{DoxyParamCaption}\item[{\textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ $\ast$}]{node,  }\item[{const size\+\_\+t}]{level,  }\item[{std\+::vector$<$ bool $>$ \&}]{relevels }\end{DoxyParamCaption})}



Inserts a node into the tree, tracking which levels have been inserted into. 

The node will be inserted so that the tree remains valid.


\begin{DoxyParams}{Parameters}
{\em node} & The node to be inserted. \\
\hline
{\em level} & The depth that should match the node where this node is finally inserted. This should be the number returned by calling \doxyref{Tree\+Depth()}{p.}{classmlpack_1_1tree_1_1RectangleTree_a5ec5eed000f9d4996ab56d5869817e7f} from the node that originally contained \char`\"{}node\char`\"{}. \\
\hline
{\em relevels} & The levels that have been reinserted to on this top level insertion. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a3095158e2444767314c01f08d6548505}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Insert\+Point@{Insert\+Point}}
\index{Insert\+Point@{Insert\+Point}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Insert\+Point()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily void Insert\+Point (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{point }\end{DoxyParamCaption})}



Inserts a point into the tree. 


\begin{DoxyParams}{Parameters}
{\em point} & The index of a point in the dataset. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_aa2008c231e0bc68b24da85dd6a8231ca}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Insert\+Point@{Insert\+Point}}
\index{Insert\+Point@{Insert\+Point}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Insert\+Point()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily void Insert\+Point (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{point,  }\item[{std\+::vector$<$ bool $>$ \&}]{relevels }\end{DoxyParamCaption})}



Inserts a point into the tree, tracking which levels have been inserted into. 


\begin{DoxyParams}{Parameters}
{\em point} & The index of a point in the dataset. \\
\hline
{\em relevels} & The levels that have been reinserted to on this top level insertion. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_aa0f4813924e6cdee43b45050bb947abe}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Is\+Leaf@{Is\+Leaf}}
\index{Is\+Leaf@{Is\+Leaf}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Is\+Leaf()}
{\footnotesize\ttfamily bool Is\+Leaf (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const}



Return whether or not this node is a leaf (true if it has no children). 



Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Auxiliary\+Info().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a9bb75acadb3f676baa2ae6b6fae506d7}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Max\+Distance@{Max\+Distance}}
\index{Max\+Distance@{Max\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Max\+Distance()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily \textbf{ Elem\+Type} Max\+Distance (\begin{DoxyParamCaption}\item[{const \textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ \&}]{other }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the maximum distance to another node. 



Definition at line 492 of file rectangle\+\_\+tree.\+hpp.



References Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Bound(), and H\+Rect\+Bound$<$ Metric\+Type, Elem\+Type $>$\+::\+Max\+Distance().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ae764d88483236cc470f5abe0273df4c5}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Max\+Distance@{Max\+Distance}}
\index{Max\+Distance@{Max\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Max\+Distance()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily \textbf{ Elem\+Type} Max\+Distance (\begin{DoxyParamCaption}\item[{const Vec\+Type \&}]{point,  }\item[{typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ \textbf{ Is\+Vector}$<$ Vec\+Type $>$\+::value $>$ $\ast$}]{ = {\ttfamily 0} }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the maximum distance to another point. 



Definition at line 514 of file rectangle\+\_\+tree.\+hpp.



References H\+Rect\+Bound$<$ Metric\+Type, Elem\+Type $>$\+::\+Max\+Distance().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a327048550159fb03f23f87f48dbaa324}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Max\+Leaf\+Size@{Max\+Leaf\+Size}}
\index{Max\+Leaf\+Size@{Max\+Leaf\+Size}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Max\+Leaf\+Size()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t Max\+Leaf\+Size (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the maximum leaf size. 



Definition at line 334 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_adae692ee05a48b48cc51c57106ec8e7b}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Max\+Leaf\+Size@{Max\+Leaf\+Size}}
\index{Max\+Leaf\+Size@{Max\+Leaf\+Size}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Max\+Leaf\+Size()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t\& Max\+Leaf\+Size (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the maximum leaf size. 



Definition at line 336 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a24c251ad0b5266cca6e2e96b9bb95c42}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Max\+Num\+Children@{Max\+Num\+Children}}
\index{Max\+Num\+Children@{Max\+Num\+Children}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Max\+Num\+Children()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t Max\+Num\+Children (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the maximum number of children (in a non-\/leaf node). 



Definition at line 344 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a6af237a35eebff7911cce7fd553748ce}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Max\+Num\+Children@{Max\+Num\+Children}}
\index{Max\+Num\+Children@{Max\+Num\+Children}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Max\+Num\+Children()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t\& Max\+Num\+Children (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the maximum number of children (in a non-\/leaf node). 



Definition at line 346 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ab7cdd810a507e4a0aa262ea0fa8a322c}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Metric@{Metric}}
\index{Metric@{Metric}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Metric()}
{\footnotesize\ttfamily Metric\+Type Metric (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Get the metric which the tree uses. 



Definition at line 364 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a0f14293f72c1558489a01063d109cd33}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Min\+Distance@{Min\+Distance}}
\index{Min\+Distance@{Min\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Min\+Distance()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily \textbf{ Elem\+Type} Min\+Distance (\begin{DoxyParamCaption}\item[{const \textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ \&}]{other }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the minimum distance to another node. 



Definition at line 486 of file rectangle\+\_\+tree.\+hpp.



References Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Bound(), and H\+Rect\+Bound$<$ Metric\+Type, Elem\+Type $>$\+::\+Min\+Distance().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a73bf99a433e88a31d98b46bf4c0da147}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Min\+Distance@{Min\+Distance}}
\index{Min\+Distance@{Min\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Min\+Distance()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily \textbf{ Elem\+Type} Min\+Distance (\begin{DoxyParamCaption}\item[{const Vec\+Type \&}]{point,  }\item[{typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ \textbf{ Is\+Vector}$<$ Vec\+Type $>$\+::value $>$ $\ast$}]{ = {\ttfamily 0} }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the minimum distance to another point. 



Definition at line 505 of file rectangle\+\_\+tree.\+hpp.



References H\+Rect\+Bound$<$ Metric\+Type, Elem\+Type $>$\+::\+Min\+Distance().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a20a4e92da6066eb335a576b7f9cd0415}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Minimum\+Bound\+Distance@{Minimum\+Bound\+Distance}}
\index{Minimum\+Bound\+Distance@{Minimum\+Bound\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Minimum\+Bound\+Distance()}
{\footnotesize\ttfamily \textbf{ Elem\+Type} Minimum\+Bound\+Distance (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the minimum distance from the center to any edge of the bound. 

Currently, this returns 0, which doesn\textquotesingle{}t break algorithms, but it isn\textquotesingle{}t necessarily correct, either. 

Definition at line 422 of file rectangle\+\_\+tree.\+hpp.



References H\+Rect\+Bound$<$ Metric\+Type, Elem\+Type $>$\+::\+Min\+Width().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_adca26805731ae240cfe1073a42ecee2e}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Min\+Leaf\+Size@{Min\+Leaf\+Size}}
\index{Min\+Leaf\+Size@{Min\+Leaf\+Size}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Min\+Leaf\+Size()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t Min\+Leaf\+Size (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the minimum leaf size. 



Definition at line 339 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ac6f8a0c45a30bbe3c43af0375d51236e}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Min\+Leaf\+Size@{Min\+Leaf\+Size}}
\index{Min\+Leaf\+Size@{Min\+Leaf\+Size}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Min\+Leaf\+Size()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t\& Min\+Leaf\+Size (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the minimum leaf size. 



Definition at line 341 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a5d3958327333930dd14e490db6a3c4d6}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Min\+Num\+Children@{Min\+Num\+Children}}
\index{Min\+Num\+Children@{Min\+Num\+Children}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Min\+Num\+Children()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t Min\+Num\+Children (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the minimum number of children (in a non-\/leaf node). 



Definition at line 349 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a612aa5b60faaf2050038e6cf6e056839}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Min\+Num\+Children@{Min\+Num\+Children}}
\index{Min\+Num\+Children@{Min\+Num\+Children}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Min\+Num\+Children()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t\& Min\+Num\+Children (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the minimum number of children (in a non-\/leaf node). 



Definition at line 351 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a8dbe26c4727e347359f1da279659f0cd}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Nullify\+Data@{Nullify\+Data}}
\index{Nullify\+Data@{Nullify\+Data}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Nullify\+Data()}
{\footnotesize\ttfamily void Nullify\+Data (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})}



Nullify the auxiliary information. 

Used for memory management. Be cafeful. \mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a1f7ec083be66d58a3e02e12956bf005e}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Num\+Children@{Num\+Children}}
\index{Num\+Children@{Num\+Children}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Num\+Children()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t Num\+Children (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the number of child nodes. (One level beneath this one only.) 



Definition at line 370 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a605a6e856364afd0bad4bafa17dbe5c0}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Num\+Children@{Num\+Children}}
\index{Num\+Children@{Num\+Children}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Num\+Children()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t\& Num\+Children (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the number of child nodes. Be careful. 



Definition at line 372 of file rectangle\+\_\+tree.\+hpp.



References Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Furthest\+Descendant\+Distance(), Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Furthest\+Point\+Distance(), Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Get\+Furthest\+Child(), and Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Get\+Nearest\+Child().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a2a85eb34222f1fc073940e8c89274e81}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Num\+Descendants@{Num\+Descendants}}
\index{Num\+Descendants@{Num\+Descendants}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Num\+Descendants()}
{\footnotesize\ttfamily size\+\_\+t Num\+Descendants (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const}



Return the number of descendants of this node. 

For a non-\/leaf in a binary space tree, this is the number of points at the descendant leaves. For a leaf, this is the number of points in the leaf. 

Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Child().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a352077c26368da0ee570c0b7f062b1e3}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Num\+Points@{Num\+Points}}
\index{Num\+Points@{Num\+Points}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Num\+Points()}
{\footnotesize\ttfamily size\+\_\+t Num\+Points (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const}



Return the number of points in this node (returns 0 if this node is not a leaf). 



Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Child().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a909551417a05af16d48eaa9713088eb3}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!operator=@{operator=}}
\index{operator=@{operator=}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{operator=()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree}\& operator= (\begin{DoxyParamCaption}\item[{const \textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ \&}]{other }\end{DoxyParamCaption})}



Copy the given rectangle tree. 


\begin{DoxyParams}{Parameters}
{\em other} & The tree to be copied. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ae8eb5a80d261df7b9331c4444e54bc21}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!operator=@{operator=}}
\index{operator=@{operator=}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{operator=()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree}\& operator= (\begin{DoxyParamCaption}\item[{\textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ \&\&}]{other }\end{DoxyParamCaption})}



Take ownership of the given rectangle tree. 


\begin{DoxyParams}{Parameters}
{\em other} & The tree to take ownership of. \\
\hline
\end{DoxyParams}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a05bac703d5c74952f9a92fafa507837b}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Parent@{Parent}}
\index{Parent@{Parent}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Parent()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree}$\ast$ Parent (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Gets the parent of this node. 



Definition at line 354 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ac585a5030dd745d64fed3111bf3b83b9}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Parent@{Parent}}
\index{Parent@{Parent}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Parent()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily \textbf{ Rectangle\+Tree}$\ast$\& Parent (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the parent of this node. 



Definition at line 356 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_af44ed4e7bfea088689caed082da67e17}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Parent\+Distance@{Parent\+Distance}}
\index{Parent\+Distance@{Parent\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Parent\+Distance()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily \textbf{ Elem\+Type} Parent\+Distance (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the distance from the center of this node to the center of the parent node. 



Definition at line 426 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_aa22ead21ac809efb970b90ec014dc318}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Parent\+Distance@{Parent\+Distance}}
\index{Parent\+Distance@{Parent\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Parent\+Distance()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily \textbf{ Elem\+Type}\& Parent\+Distance (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the distance from the center of this node to the center of the parent node. 



Definition at line 429 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a559eede5ea60f68634f8e7e72c3c68d2}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Point@{Point}}
\index{Point@{Point}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Point()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily size\+\_\+t Point (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{index }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the index (with reference to the dataset) of a particular point in this node. 

This will happily return invalid indices if the given index is greater than the number of points in this node (obtained with \doxyref{Num\+Points()}{p.}{classmlpack_1_1tree_1_1RectangleTree_a352077c26368da0ee570c0b7f062b1e3}) -- be careful.


\begin{DoxyParams}{Parameters}
{\em index} & Index of point for which a dataset index is wanted. \\
\hline
\end{DoxyParams}


Definition at line 479 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a24009b888a79e08dcbf3c1587f33a8c2}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Point@{Point}}
\index{Point@{Point}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Point()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily size\+\_\+t\& Point (\begin{DoxyParamCaption}\item[{const size\+\_\+t}]{index }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the index of a particular point in this node. 

Be very careful when you do this! You may make the tree invalid. 

Definition at line 483 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a3a9f26442a5841dcdf5022d14df68a13}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Range\+Distance@{Range\+Distance}}
\index{Range\+Distance@{Range\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Range\+Distance()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily \textbf{ math\+::\+Range\+Type}$<$\textbf{ Elem\+Type}$>$ Range\+Distance (\begin{DoxyParamCaption}\item[{const \textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ \&}]{other }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the minimum and maximum distance to another node. 



Definition at line 498 of file rectangle\+\_\+tree.\+hpp.



References Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Bound(), and H\+Rect\+Bound$<$ Metric\+Type, Elem\+Type $>$\+::\+Range\+Distance().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a60a550bf46aa1d7b858134ce41fd5a3a}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Range\+Distance@{Range\+Distance}}
\index{Range\+Distance@{Range\+Distance}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Range\+Distance()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily \textbf{ math\+::\+Range\+Type}$<$\textbf{ Elem\+Type}$>$ Range\+Distance (\begin{DoxyParamCaption}\item[{const Vec\+Type \&}]{point,  }\item[{typename \textbf{ std\+::enable\+\_\+if\+\_\+t}$<$ \textbf{ Is\+Vector}$<$ Vec\+Type $>$\+::value $>$ $\ast$}]{ = {\ttfamily 0} }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the minimum and maximum distance to another point. 



Definition at line 523 of file rectangle\+\_\+tree.\+hpp.



References H\+Rect\+Bound$<$ Metric\+Type, Elem\+Type $>$\+::\+Range\+Distance(), Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Tree\+Depth(), and Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Tree\+Size().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a9429055f5e8da6c92f684f73355c4199}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Remove\+Node@{Remove\+Node}}
\index{Remove\+Node@{Remove\+Node}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Remove\+Node()}
{\footnotesize\ttfamily bool Remove\+Node (\begin{DoxyParamCaption}\item[{const \textbf{ Rectangle\+Tree}$<$ Metric\+Type, Statistic\+Type, Mat\+Type, \textbf{ Split\+Type}, \textbf{ Descent\+Type}, Auxiliary\+Information\+Type $>$ $\ast$}]{node,  }\item[{std\+::vector$<$ bool $>$ \&}]{relevels }\end{DoxyParamCaption})}



Removes a node from the tree. 

You are responsible for deleting it if you wish to do so. \mbox{\label{classmlpack_1_1tree_1_1RectangleTree_af0dd9205158ccf7bcfcd8ff81f79c927}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!serialize@{serialize}}
\index{serialize@{serialize}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{serialize()}
{\footnotesize\ttfamily void serialize (\begin{DoxyParamCaption}\item[{Archive \&}]{ar,  }\item[{const unsigned}]{int }\end{DoxyParamCaption})}



Serialize the tree. 

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_abb9c409311948fe4a16aa79f434c0a91}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Shrink\+Bound\+For\+Bound@{Shrink\+Bound\+For\+Bound}}
\index{Shrink\+Bound\+For\+Bound@{Shrink\+Bound\+For\+Bound}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Shrink\+Bound\+For\+Bound()}
{\footnotesize\ttfamily bool Shrink\+Bound\+For\+Bound (\begin{DoxyParamCaption}\item[{const \textbf{ bound\+::\+H\+Rect\+Bound}$<$ Metric\+Type $>$ \&}]{changed\+Bound }\end{DoxyParamCaption})}



Shrink the bound object of this node for the removal of a child node. 


\begin{DoxyParams}{Parameters}
{\em bound} & The H\+Rect\+Bound$<$$>$\& of the bound that was removed to reqire this shrinking. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
true if the bound needed to be changed, false if it did not. 
\end{DoxyReturn}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a14b62a27c4f71e7d38a92b5982b4bff9}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Shrink\+Bound\+For\+Point@{Shrink\+Bound\+For\+Point}}
\index{Shrink\+Bound\+For\+Point@{Shrink\+Bound\+For\+Point}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Shrink\+Bound\+For\+Point()}
{\footnotesize\ttfamily bool Shrink\+Bound\+For\+Point (\begin{DoxyParamCaption}\item[{const arma\+::vec \&}]{point }\end{DoxyParamCaption})}



Shrink the bound object of this node for the removal of a point. 


\begin{DoxyParams}{Parameters}
{\em point} & The arma\+::vec\& of the point that was removed to require this shrinking. \\
\hline
\end{DoxyParams}
\begin{DoxyReturn}{Returns}
true if the bound needed to be changed, false if it did not. 
\end{DoxyReturn}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ad35ef7f791a42b33ebf554e27def9391}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Soft\+Delete@{Soft\+Delete}}
\index{Soft\+Delete@{Soft\+Delete}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Soft\+Delete()}
{\footnotesize\ttfamily void Soft\+Delete (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})}



Delete this node of the tree, but leave the stuff contained in it intact. 

This is used when splitting a node, where the data in this tree is moved to two other trees. \mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ad8b29c84ac793742cd15834f9f4c4f31}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Stat@{Stat}}
\index{Stat@{Stat}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Stat()\hspace{0.1cm}{\footnotesize\ttfamily [1/2]}}
{\footnotesize\ttfamily const Statistic\+Type\& Stat (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const\hspace{0.3cm}{\ttfamily [inline]}}



Return the statistic object for this node. 



Definition at line 319 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_aac2d3c104b89109f3df4a9a8cad244da}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Stat@{Stat}}
\index{Stat@{Stat}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Stat()\hspace{0.1cm}{\footnotesize\ttfamily [2/2]}}
{\footnotesize\ttfamily Statistic\+Type\& Stat (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption})\hspace{0.3cm}{\ttfamily [inline]}}



Modify the statistic object for this node. 



Definition at line 321 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_a5ec5eed000f9d4996ab56d5869817e7f}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Tree\+Depth@{Tree\+Depth}}
\index{Tree\+Depth@{Tree\+Depth}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Tree\+Depth()}
{\footnotesize\ttfamily size\+\_\+t Tree\+Depth (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const}



Obtains the number of levels below this node in the tree, starting with this. 



Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Range\+Distance().

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ab8408997f02b82d3ded6adf51b289427}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Tree\+Size@{Tree\+Size}}
\index{Tree\+Size@{Tree\+Size}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Tree\+Size()}
{\footnotesize\ttfamily size\+\_\+t Tree\+Size (\begin{DoxyParamCaption}{ }\end{DoxyParamCaption}) const}



Obtains the number of nodes in the tree, starting with this. 



Referenced by Rectangle\+Tree$<$ Metric\+Type, Statistic\+Type, Mat\+Type, Split\+Type, Descent\+Type, Auxiliary\+Information\+Type $>$\+::\+Range\+Distance().



\subsection{Member Data Documentation}
\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ac178ecb38a40a86e40c005ff70d2702a}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Auxiliary\+Information@{Auxiliary\+Information}}
\index{Auxiliary\+Information@{Auxiliary\+Information}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Auxiliary\+Information}
{\footnotesize\ttfamily friend \textbf{ Auxiliary\+Information}\hspace{0.3cm}{\ttfamily [protected]}}



Give friend access for Auxiliary\+Information\+Type. 



Definition at line 585 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_ad326ceae04a3d7cb8de5f57c385475fe}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Descent\+Type@{Descent\+Type}}
\index{Descent\+Type@{Descent\+Type}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Descent\+Type}
{\footnotesize\ttfamily friend Descent\+Type\hspace{0.3cm}{\ttfamily [protected]}}



Give friend access for Descent\+Type. 



Definition at line 579 of file rectangle\+\_\+tree.\+hpp.

\mbox{\label{classmlpack_1_1tree_1_1RectangleTree_af8cd44a1d4485c9c0022f124b0b312bf}} 
\index{mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}!Split\+Type@{Split\+Type}}
\index{Split\+Type@{Split\+Type}!mlpack\+::tree\+::\+Rectangle\+Tree@{mlpack\+::tree\+::\+Rectangle\+Tree}}
\subsubsection{Split\+Type}
{\footnotesize\ttfamily friend Split\+Type\hspace{0.3cm}{\ttfamily [protected]}}



Give friend access for Split\+Type. 



Definition at line 582 of file rectangle\+\_\+tree.\+hpp.



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