\doxysection{heapnode\+\_\+s Struct Reference}
\label{structheapnode__s}\index{heapnode\_s@{heapnode\_s}}


One node on the heap.  


\doxysubsubsection*{Data Fields}
\begin{DoxyCompactItemize}
\item 
void $\ast$ \textbf{ data}
\begin{DoxyCompactList}\small\item\em Application data at this node. \end{DoxyCompactList}\item 
int32 \textbf{ val}
\begin{DoxyCompactList}\small\item\em Associated with above application data; according to which heap is sorted (in ascending order) \end{DoxyCompactList}\item 
int32 \textbf{ nl}
\item 
int32 \textbf{ nr}
\begin{DoxyCompactList}\small\item\em left/right descendants of this node (for balancing heap) \end{DoxyCompactList}\item 
struct \textbf{ heapnode\+\_\+s} $\ast$ \textbf{ l}
\begin{DoxyCompactList}\small\item\em Root of left descendant heap. \end{DoxyCompactList}\item 
struct \textbf{ heapnode\+\_\+s} $\ast$ \textbf{ r}
\begin{DoxyCompactList}\small\item\em Root of right descendant heap. \end{DoxyCompactList}\end{DoxyCompactItemize}


\doxysubsection{Detailed Description}
One node on the heap. 

Definition at line \textbf{ 77} of file \textbf{ heap.\+c}.



\doxysubsection{Field Documentation}
\label{structheapnode__s_a2cac1684dd94b922db98de988232efeb} 
\index{heapnode\_s@{heapnode\_s}!data@{data}}
\index{data@{data}!heapnode\_s@{heapnode\_s}}
\doxysubsubsection{data}
{\footnotesize\ttfamily void$\ast$ heapnode\+\_\+s\+::data}



Application data at this node. 



Definition at line \textbf{ 78} of file \textbf{ heap.\+c}.



Referenced by \textbf{ heap\+\_\+pop()}, and \textbf{ heap\+\_\+top()}.

\label{structheapnode__s_af25b6bfb16162294dd35851e04ad6c6b} 
\index{heapnode\_s@{heapnode\_s}!l@{l}}
\index{l@{l}!heapnode\_s@{heapnode\_s}}
\doxysubsubsection{l}
{\footnotesize\ttfamily struct \textbf{ heapnode\+\_\+s}$\ast$ heapnode\+\_\+s\+::l}



Root of left descendant heap. 



Definition at line \textbf{ 82} of file \textbf{ heap.\+c}.

\label{structheapnode__s_a9fd3eb832298ae9ca73896835d38e6d5} 
\index{heapnode\_s@{heapnode\_s}!nl@{nl}}
\index{nl@{nl}!heapnode\_s@{heapnode\_s}}
\doxysubsubsection{nl}
{\footnotesize\ttfamily int32 heapnode\+\_\+s\+::nl}



Definition at line \textbf{ 81} of file \textbf{ heap.\+c}.

\label{structheapnode__s_ab5a21ee1a48ce5359bbcca1d416a51eb} 
\index{heapnode\_s@{heapnode\_s}!nr@{nr}}
\index{nr@{nr}!heapnode\_s@{heapnode\_s}}
\doxysubsubsection{nr}
{\footnotesize\ttfamily int32 heapnode\+\_\+s\+::nr}



left/right descendants of this node (for balancing heap) 



Definition at line \textbf{ 81} of file \textbf{ heap.\+c}.



Referenced by \textbf{ heap\+\_\+size()}.

\label{structheapnode__s_a92c30e27e1ccdbaea15f28aa49b0f7ea} 
\index{heapnode\_s@{heapnode\_s}!r@{r}}
\index{r@{r}!heapnode\_s@{heapnode\_s}}
\doxysubsubsection{r}
{\footnotesize\ttfamily struct \textbf{ heapnode\+\_\+s}$\ast$ heapnode\+\_\+s\+::r}



Root of right descendant heap. 



Definition at line \textbf{ 83} of file \textbf{ heap.\+c}.

\label{structheapnode__s_a02a74be7915860cf3fc436d5fed6fe7d} 
\index{heapnode\_s@{heapnode\_s}!val@{val}}
\index{val@{val}!heapnode\_s@{heapnode\_s}}
\doxysubsubsection{val}
{\footnotesize\ttfamily int32 heapnode\+\_\+s\+::val}



Associated with above application data; according to which heap is sorted (in ascending order) 



Definition at line \textbf{ 79} of file \textbf{ heap.\+c}.



Referenced by \textbf{ heap\+\_\+pop()}, and \textbf{ heap\+\_\+top()}.



The documentation for this struct was generated from the following file\+:\begin{DoxyCompactItemize}
\item 
src/libsphinxbase/util/heap.\+c\end{DoxyCompactItemize}
