\section{KIO::Data\-Slave::Queue\-Struct Struct Reference}
\label{structKIO_1_1DataSlave_1_1QueueStruct}\index{KIO::DataSlave::QueueStruct@{KIO::DataSlave::QueueStruct}}
structure for queueing.  


{\tt \#include $<$dataslave.h$>$}

Collaboration diagram for KIO::Data\-Slave::Queue\-Struct:\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=91pt]{structKIO_1_1DataSlave_1_1QueueStruct__coll__graph}
\end{center}
\end{figure}
\subsection*{Public Member Functions}
\begin{CompactItemize}
\item 
{\bf Queue\-Struct} ({\bf Queue\-Type} type)\label{structKIO_1_1DataSlave_1_1QueueStruct_a1}

\end{CompactItemize}
\subsection*{Public Attributes}
\begin{CompactItemize}
\item 
{\bf Queue\-Type} {\bf type}\label{structKIO_1_1DataSlave_1_1QueueStruct_o0}

\item 
{\bf QString} {\bf s}\label{structKIO_1_1DataSlave_1_1QueueStruct_o1}

\item 
{\bf KIO::filesize\_\-t} {\bf size}\label{structKIO_1_1DataSlave_1_1QueueStruct_o2}

\item 
{\bf QByte\-Array} {\bf ba}\label{structKIO_1_1DataSlave_1_1QueueStruct_o3}

\end{CompactItemize}


\subsection{Detailed Description}
structure for queueing. 

It is very primitive, it doesn't even try to conserve memory.



Definition at line 90 of file dataslave.h.

The documentation for this struct was generated from the following file:\begin{CompactItemize}
\item 
dataslave.h\end{CompactItemize}
