\section{lib/sfdpgen/\-Priority\-Queue.h File Reference}
\label{PriorityQueue_8h}\index{lib/sfdpgen/\-Priority\-Queue.\-h@{lib/sfdpgen/\-Priority\-Queue.\-h}}
{\ttfamily \#include \char`\"{}Linked\-List.\-h\char`\"{}}\\*
Include dependency graph for Priority\-Queue.\-h\-:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=178pt]{PriorityQueue_8h__incl}
\end{center}
\end{figure}
This graph shows which files directly or indirectly include this file\-:\nopagebreak
\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=312pt]{PriorityQueue_8h__dep__incl}
\end{center}
\end{figure}
\subsection*{Data Structures}
\begin{DoxyCompactItemize}
\item 
struct {\bf Priority\-Queue\-\_\-struct}
\end{DoxyCompactItemize}
\subsection*{Typedefs}
\begin{DoxyCompactItemize}
\item 
typedef struct \\*
{\bf Priority\-Queue\-\_\-struct} $\ast$ {\bf Priority\-Queue}
\end{DoxyCompactItemize}
\subsection*{Functions}
\begin{DoxyCompactItemize}
\item 
{\bf Priority\-Queue} {\bf Priority\-Queue\-\_\-new} ({\bf int} n, {\bf int} ngain)
\item 
void {\bf Priority\-Queue\-\_\-delete} ({\bf Priority\-Queue} q)
\item 
{\bf Priority\-Queue} {\bf Priority\-Queue\-\_\-push} ({\bf Priority\-Queue} q, {\bf int} i, {\bf int} gain)
\item 
{\bf int} {\bf Priority\-Queue\-\_\-pop} ({\bf Priority\-Queue} q, {\bf int} $\ast$i, {\bf int} $\ast$gain)
\item 
{\bf int} {\bf Priority\-Queue\-\_\-remove} ({\bf Priority\-Queue} q, {\bf int} i)
\item 
{\bf int} {\bf Priority\-Queue\-\_\-get\-\_\-gain} ({\bf Priority\-Queue} q, {\bf int} i)
\end{DoxyCompactItemize}


\subsection{Typedef Documentation}
\index{Priority\-Queue.\-h@{Priority\-Queue.\-h}!Priority\-Queue@{Priority\-Queue}}
\index{Priority\-Queue@{Priority\-Queue}!PriorityQueue.h@{Priority\-Queue.\-h}}
\subsubsection[{Priority\-Queue}]{\setlength{\rightskip}{0pt plus 5cm}typedef struct {\bf Priority\-Queue\-\_\-struct}$\ast$ {\bf Priority\-Queue}}\label{PriorityQueue_8h_a81e7787612d216ad45d6934a94b2e9b3}


Definition at line 27 of file Priority\-Queue.\-h.



\subsection{Function Documentation}
\index{Priority\-Queue.\-h@{Priority\-Queue.\-h}!Priority\-Queue\-\_\-delete@{Priority\-Queue\-\_\-delete}}
\index{Priority\-Queue\-\_\-delete@{Priority\-Queue\-\_\-delete}!PriorityQueue.h@{Priority\-Queue.\-h}}
\subsubsection[{Priority\-Queue\-\_\-delete}]{\setlength{\rightskip}{0pt plus 5cm}void Priority\-Queue\-\_\-delete (
\begin{DoxyParamCaption}
\item[{{\bf Priority\-Queue}}]{q}
\end{DoxyParamCaption}
)}\label{PriorityQueue_8h_a5be696c5597299fc2cacd72a3544b0a5}


Definition at line 47 of file Priority\-Queue.\-c.



References Priority\-Queue\-\_\-struct\-::buckets, Double\-Linked\-List\-\_\-delete(), F\-R\-E\-E, Priority\-Queue\-\_\-struct\-::gain, Priority\-Queue\-\_\-struct\-::ngain, and Priority\-Queue\-\_\-struct\-::where.

\index{Priority\-Queue.\-h@{Priority\-Queue.\-h}!Priority\-Queue\-\_\-get\-\_\-gain@{Priority\-Queue\-\_\-get\-\_\-gain}}
\index{Priority\-Queue\-\_\-get\-\_\-gain@{Priority\-Queue\-\_\-get\-\_\-gain}!PriorityQueue.h@{Priority\-Queue.\-h}}
\subsubsection[{Priority\-Queue\-\_\-get\-\_\-gain}]{\setlength{\rightskip}{0pt plus 5cm}{\bf int} Priority\-Queue\-\_\-get\-\_\-gain (
\begin{DoxyParamCaption}
\item[{{\bf Priority\-Queue}}]{q, }
\item[{{\bf int}}]{i}
\end{DoxyParamCaption}
)}\label{PriorityQueue_8h_a93870e2c9598cf7eeb124114a9015c24}


Definition at line 125 of file Priority\-Queue.\-c.



References Priority\-Queue\-\_\-struct\-::gain.

\index{Priority\-Queue.\-h@{Priority\-Queue.\-h}!Priority\-Queue\-\_\-new@{Priority\-Queue\-\_\-new}}
\index{Priority\-Queue\-\_\-new@{Priority\-Queue\-\_\-new}!PriorityQueue.h@{Priority\-Queue.\-h}}
\subsubsection[{Priority\-Queue\-\_\-new}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Priority\-Queue} Priority\-Queue\-\_\-new (
\begin{DoxyParamCaption}
\item[{{\bf int}}]{n, }
\item[{{\bf int}}]{ngain}
\end{DoxyParamCaption}
)}\label{PriorityQueue_8h_aab6234d385e171923933b2cf5b296edb}


Definition at line 27 of file Priority\-Queue.\-c.



References Priority\-Queue\-\_\-struct\-::buckets, Priority\-Queue\-\_\-struct\-::count, Priority\-Queue\-\_\-struct\-::gain, Priority\-Queue\-\_\-struct\-::gain\-\_\-max, Priority\-Queue\-\_\-struct\-::n, N\-\_\-\-G\-N\-E\-W, Priority\-Queue\-\_\-struct\-::ngain, N\-U\-L\-L, and Priority\-Queue\-\_\-struct\-::where.

\index{Priority\-Queue.\-h@{Priority\-Queue.\-h}!Priority\-Queue\-\_\-pop@{Priority\-Queue\-\_\-pop}}
\index{Priority\-Queue\-\_\-pop@{Priority\-Queue\-\_\-pop}!PriorityQueue.h@{Priority\-Queue.\-h}}
\subsubsection[{Priority\-Queue\-\_\-pop}]{\setlength{\rightskip}{0pt plus 5cm}{\bf int} Priority\-Queue\-\_\-pop (
\begin{DoxyParamCaption}
\item[{{\bf Priority\-Queue}}]{q, }
\item[{{\bf int} $\ast$}]{i, }
\item[{{\bf int} $\ast$}]{gain}
\end{DoxyParamCaption}
)}\label{PriorityQueue_8h_a37704afd389a3ea12d6340901505e5cf}


Definition at line 100 of file Priority\-Queue.\-c.



References Priority\-Queue\-\_\-struct\-::buckets, Priority\-Queue\-\_\-struct\-::count, Double\-Linked\-List\-\_\-delete\-\_\-element(), Double\-Linked\-List\-\_\-get\-\_\-data(), Priority\-Queue\-\_\-struct\-::gain, Priority\-Queue\-\_\-struct\-::gain\-\_\-max, N\-U\-L\-L, and Priority\-Queue\-\_\-struct\-::where.

\index{Priority\-Queue.\-h@{Priority\-Queue.\-h}!Priority\-Queue\-\_\-push@{Priority\-Queue\-\_\-push}}
\index{Priority\-Queue\-\_\-push@{Priority\-Queue\-\_\-push}!PriorityQueue.h@{Priority\-Queue.\-h}}
\subsubsection[{Priority\-Queue\-\_\-push}]{\setlength{\rightskip}{0pt plus 5cm}{\bf Priority\-Queue} Priority\-Queue\-\_\-push (
\begin{DoxyParamCaption}
\item[{{\bf Priority\-Queue}}]{q, }
\item[{{\bf int}}]{i, }
\item[{{\bf int}}]{gain}
\end{DoxyParamCaption}
)}\label{PriorityQueue_8h_ab6238b96ce271ac5ebf481c3725103c4}


Definition at line 65 of file Priority\-Queue.\-c.



References assert, Priority\-Queue\-\_\-struct\-::buckets, Priority\-Queue\-\_\-struct\-::count, Double\-Linked\-List\-\_\-delete\-\_\-element(), Double\-Linked\-List\-\_\-new(), Double\-Linked\-List\-\_\-prepend(), Priority\-Queue\-\_\-struct\-::gain, Priority\-Queue\-\_\-struct\-::gain\-\_\-max, N\-\_\-\-G\-N\-E\-W, N\-U\-L\-L, Priority\-Queue\-\_\-push(), and Priority\-Queue\-\_\-struct\-::where.



Referenced by Priority\-Queue\-\_\-push().

\index{Priority\-Queue.\-h@{Priority\-Queue.\-h}!Priority\-Queue\-\_\-remove@{Priority\-Queue\-\_\-remove}}
\index{Priority\-Queue\-\_\-remove@{Priority\-Queue\-\_\-remove}!PriorityQueue.h@{Priority\-Queue.\-h}}
\subsubsection[{Priority\-Queue\-\_\-remove}]{\setlength{\rightskip}{0pt plus 5cm}{\bf int} Priority\-Queue\-\_\-remove (
\begin{DoxyParamCaption}
\item[{{\bf Priority\-Queue}}]{q, }
\item[{{\bf int}}]{i}
\end{DoxyParamCaption}
)}\label{PriorityQueue_8h_a811bef87d31e1b89cc9597835b4664f8}


Definition at line 129 of file Priority\-Queue.\-c.



References Priority\-Queue\-\_\-struct\-::buckets, Priority\-Queue\-\_\-struct\-::count, Double\-Linked\-List\-\_\-delete\-\_\-element(), Priority\-Queue\-\_\-struct\-::gain, Priority\-Queue\-\_\-struct\-::gain\-\_\-max, N\-U\-L\-L, and Priority\-Queue\-\_\-struct\-::where.

