\hypertarget{BTD_8h}{
\section{BTD.h File Reference}
\label{BTD_8h}\index{BTD.h@{BTD.h}}
}
Binary Tree Dencoding interface file.  




This graph shows which files directly or indirectly include this file:\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=39pt]{BTD_8h__dep__incl}
\end{center}
\end{figure}
\subsection*{Functions}
\begin{CompactItemize}
\item 
unsigned int \hyperlink{BTD_8h_a0}{BTD\_\-word\-Decode} (unsigned int w, unsigned int scheme, int $\ast$nbits)
\begin{CompactList}\small\item\em Decodes the bits in {\em w\/} according to {\em scheme\/}. \item\end{CompactList}\end{CompactItemize}


\subsection{Detailed Description}
Binary Tree Dencoding interface file. 

\begin{Desc}
\item[Author:]JJRussell - \href{mailto:russell@slac.stanford.edu}{\tt russell@slac.stanford.edu}\end{Desc}


\footnotesize\begin{verbatim}
    CVS $Id: BTD.h,v 1.1.1.1 2005/09/23 06:41:07 russell Exp $
\end{verbatim}\normalsize


Interface specification for routines to decode bit strings previously binary tree encoded data.

\subsection{Function Documentation}
\hypertarget{BTD_8h_a0}{
\index{BTD.h@{BTD.h}!BTD_wordDecode@{BTD\_\-wordDecode}}
\index{BTD_wordDecode@{BTD\_\-wordDecode}!BTD.h@{BTD.h}}
\subsubsection[BTD\_\-wordDecode]{\setlength{\rightskip}{0pt plus 5cm}unsigned int BTD\_\-word\-Decode (unsigned int {\em w}, unsigned int {\em scheme}, int $\ast$ {\em nbits})}}
\label{BTD_8h_a0}


Decodes the bits in {\em w\/} according to {\em scheme\/}. 

\begin{Desc}
\item[Returns:]The decoded word\end{Desc}
\begin{Desc}
\item[Parameters:]
\begin{description}
\item[{\em w}]The encoded bits \item[{\em scheme}]The encoding scheme \item[{\em nbits}]Returns the number of bits decoded. \end{description}
\end{Desc}


Here is the call graph for this function:\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=111pt]{BTD_8h_a0_cgraph}
\end{center}
\end{figure}
