\section{Discrete\+Hilbert\+Value$<$ Tree\+Elem\+Type $>$ Class Template Reference}
\label{classmlpack_1_1tree_1_1DiscreteHilbertValue}\index{Discrete\+Hilbert\+Value$<$ Tree\+Elem\+Type $>$@{Discrete\+Hilbert\+Value$<$ Tree\+Elem\+Type $>$}}


The \doxyref{Discrete\+Hilbert\+Value}{p.}{classmlpack_1_1tree_1_1DiscreteHilbertValue} class stores Hilbert values for all of the points in a \doxyref{Rectangle\+Tree}{p.}{classmlpack_1_1tree_1_1RectangleTree} node, and calculates Hilbert values for new points.  




\subsection{Detailed Description}
\subsubsection*{template$<$typename Tree\+Elem\+Type$>$\newline
class mlpack\+::tree\+::\+Discrete\+Hilbert\+Value$<$ Tree\+Elem\+Type $>$}

The \doxyref{Discrete\+Hilbert\+Value}{p.}{classmlpack_1_1tree_1_1DiscreteHilbertValue} class stores Hilbert values for all of the points in a \doxyref{Rectangle\+Tree}{p.}{classmlpack_1_1tree_1_1RectangleTree} node, and calculates Hilbert values for new points. 

This implementation calculates the full discrete Hilbert value; for a d-\/dimensional vector filled with elements of size E, each Hilbert value will take dE space. 

Definition at line 29 of file discrete\+\_\+hilbert\+\_\+value.\+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{ discrete\+\_\+hilbert\+\_\+value.\+hpp}\end{DoxyCompactItemize}