\doxysection{sorted\+\_\+list\+\_\+t Struct Reference}
\label{structsorted__list__t}\index{sorted\_list\_t@{sorted\_list\_t}}


The sorted list.  




{\ttfamily \#include $<$lm3g\+\_\+model.\+h$>$}

\doxysubsubsection*{Data Fields}
\begin{DoxyCompactItemize}
\item 
\textbf{ sorted\+\_\+entry\+\_\+t} $\ast$ \textbf{ list}
\item 
int32 \textbf{ free}
\begin{DoxyCompactList}\small\item\em first free element in list \end{DoxyCompactList}\item 
int32 \textbf{ size}
\end{DoxyCompactItemize}


\doxysubsection{Detailed Description}
The sorted list. 

list is a (64K long) array. The first entry is the root of the tree and is created during initialization. 

Definition at line \textbf{ 82} of file \textbf{ lm3g\+\_\+model.\+h}.



\doxysubsection{Field Documentation}
\label{structsorted__list__t_aa7468ec9a2fe7c61d2bc76ba43c575ce} 
\index{sorted\_list\_t@{sorted\_list\_t}!free@{free}}
\index{free@{free}!sorted\_list\_t@{sorted\_list\_t}}
\doxysubsubsection{free}
{\footnotesize\ttfamily int32 sorted\+\_\+list\+\_\+t\+::free}



first free element in list 



Definition at line \textbf{ 84} of file \textbf{ lm3g\+\_\+model.\+h}.

\label{structsorted__list__t_a9c1b67b418297e14f9f6c1ea69dd3969} 
\index{sorted\_list\_t@{sorted\_list\_t}!list@{list}}
\index{list@{list}!sorted\_list\_t@{sorted\_list\_t}}
\doxysubsubsection{list}
{\footnotesize\ttfamily \textbf{ sorted\+\_\+entry\+\_\+t}$\ast$ sorted\+\_\+list\+\_\+t\+::list}



Definition at line \textbf{ 83} of file \textbf{ lm3g\+\_\+model.\+h}.

\label{structsorted__list__t_a8fa949a4a4666c158df6a8d412dac415} 
\index{sorted\_list\_t@{sorted\_list\_t}!size@{size}}
\index{size@{size}!sorted\_list\_t@{sorted\_list\_t}}
\doxysubsubsection{size}
{\footnotesize\ttfamily int32 sorted\+\_\+list\+\_\+t\+::size}



Definition at line \textbf{ 85} of file \textbf{ lm3g\+\_\+model.\+h}.



The documentation for this struct was generated from the following file\+:\begin{DoxyCompactItemize}
\item 
src/libsphinxbase/lm/lm3g\+\_\+model.\+h\end{DoxyCompactItemize}
