\section{KSortable\-Item$<$ T, Key $>$ Class Template Reference}
\label{classKSortableItem}\index{KSortableItem@{KSortableItem}}
KSortable\-Item is a {\bf QPair} that provides several operators for sorting.  


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

Inheritance diagram for KSortable\-Item$<$ T, Key $>$:\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=80pt]{classKSortableItem__inherit__graph}
\end{center}
\end{figure}
Collaboration diagram for KSortable\-Item$<$ T, Key $>$:\begin{figure}[H]
\begin{center}
\leavevmode
\includegraphics[width=80pt]{classKSortableItem__coll__graph}
\end{center}
\end{figure}
\subsection*{Public Member Functions}
\begin{CompactItemize}
\item 
{\bf KSortable\-Item} (Key i, const T \&t)
\item 
{\bf KSortable\-Item} (const {\bf KSortable\-Item}$<$ T, Key $>$ \&rhs)
\item 
{\bf KSortable\-Item} ()
\item 
{\bf KSortable\-Item}$<$ T, Key $>$ \& {\bf operator=} (const {\bf KSortable\-Item}$<$ T, Key $>$ \&i)
\item 
bool {\bf operator$>$} (const {\bf KSortable\-Item}$<$ T, Key $>$ \&i2) const 
\item 
bool {\bf operator$<$} (const {\bf KSortable\-Item}$<$ T, Key $>$ \&i2) const 
\item 
bool {\bf operator$>$=} (const {\bf KSortable\-Item}$<$ T, Key $>$ \&i2) const 
\item 
bool {\bf operator$<$=} (const {\bf KSortable\-Item}$<$ T, Key $>$ \&i2) const 
\item 
bool {\bf operator==} (const {\bf KSortable\-Item}$<$ T, Key $>$ \&i2) const 
\item 
bool {\bf operator!=} (const {\bf KSortable\-Item}$<$ T, Key $>$ \&i2) const 
\item 
T \& {\bf value} ()
\item 
const T \& {\bf value} () const 
\item 
Key {\bf index} () const 
\end{CompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$class T, class Key = int$>$ class KSortable\-Item$<$ T, Key $>$}

KSortable\-Item is a {\bf QPair} that provides several operators for sorting. 

\begin{Desc}
\item[See also:]{\bf KSortable\-Value\-List}{\rm (p.\,\pageref{classKSortableValueList})} \end{Desc}




Definition at line 32 of file ksortablevaluelist.h.

\subsection{Constructor \& Destructor Documentation}
\index{KSortableItem@{KSortable\-Item}!KSortableItem@{KSortableItem}}
\index{KSortableItem@{KSortableItem}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ {\bf KSortable\-Item}$<$ T, Key $>$::{\bf KSortable\-Item} (Key {\em i}, const T \& {\em t})\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a0}


Creates a new KSortable\-Item with the given values. 

\begin{Desc}
\item[Parameters:]
\begin{description}
\item[{\em i}]the first value \item[{\em t}]the second value \end{description}
\end{Desc}


Definition at line 40 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!KSortableItem@{KSortableItem}}
\index{KSortableItem@{KSortableItem}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ {\bf KSortable\-Item}$<$ T, Key $>$::{\bf KSortable\-Item} (const {\bf KSortable\-Item}$<$ T, Key $>$ \& {\em rhs})\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a1}


Creates a new KSortable\-Item that copies another one. 

\begin{Desc}
\item[Parameters:]
\begin{description}
\item[{\em rhs}]the other item to copy \end{description}
\end{Desc}


Definition at line 45 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!KSortableItem@{KSortableItem}}
\index{KSortableItem@{KSortableItem}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ {\bf KSortable\-Item}$<$ T, Key $>$::{\bf KSortable\-Item} ()\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a2}


Creates a new KSortable\-Item with uninitialized values. 



Definition at line 51 of file ksortablevaluelist.h.

\subsection{Member Function Documentation}
\index{KSortableItem@{KSortable\-Item}!operator=@{operator=}}
\index{operator=@{operator=}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ {\bf KSortable\-Item}$<$T, Key$>$\& {\bf KSortable\-Item}$<$ T, Key $>$::operator= (const {\bf KSortable\-Item}$<$ T, Key $>$ \& {\em i})\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a3}


Assignment operator, just copies the item. 



Definition at line 56 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!operator>@{operator$>$}}
\index{operator>@{operator$>$}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ bool {\bf KSortable\-Item}$<$ T, Key $>$::operator$>$ (const {\bf KSortable\-Item}$<$ T, Key $>$ \& {\em i2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a4}


Compares the two items. 

This implementation only compares the first value. 

Definition at line 67 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!operator<@{operator$<$}}
\index{operator<@{operator$<$}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ bool {\bf KSortable\-Item}$<$ T, Key $>$::operator$<$ (const {\bf KSortable\-Item}$<$ T, Key $>$ \& {\em i2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a5}


Compares the two items. 

This implementation only compares the first value. 

Definition at line 74 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!operator>=@{operator$>$=}}
\index{operator>=@{operator$>$=}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ bool {\bf KSortable\-Item}$<$ T, Key $>$::operator$>$= (const {\bf KSortable\-Item}$<$ T, Key $>$ \& {\em i2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a6}


Compares the two items. 

This implementation only compares the first value. 

Definition at line 81 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!operator<=@{operator$<$=}}
\index{operator<=@{operator$<$=}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ bool {\bf KSortable\-Item}$<$ T, Key $>$::operator$<$= (const {\bf KSortable\-Item}$<$ T, Key $>$ \& {\em i2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a7}


Compares the two items. 

This implementation only compares the first value. 

Definition at line 88 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!operator==@{operator==}}
\index{operator==@{operator==}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ bool {\bf KSortable\-Item}$<$ T, Key $>$::operator== (const {\bf KSortable\-Item}$<$ T, Key $>$ \& {\em i2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a8}


Compares the two items. 

This implementation only compares the first value. 

Definition at line 95 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!operator"!=@{operator"!=}}
\index{operator"!=@{operator"!=}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ bool {\bf KSortable\-Item}$<$ T, Key $>$::operator!= (const {\bf KSortable\-Item}$<$ T, Key $>$ \& {\em i2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a9}


Compares the two items. 

This implementation only compares the first value. 

Definition at line 102 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!value@{value}}
\index{value@{value}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ T\& {\bf KSortable\-Item}$<$ T, Key $>$::value ()\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a10}


\begin{Desc}
\item[Returns:]the second value \end{Desc}


Definition at line 109 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!value@{value}}
\index{value@{value}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ const T\& {\bf KSortable\-Item}$<$ T, Key $>$::value () const\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a11}


Returns the second value. 



Definition at line 114 of file ksortablevaluelist.h.\index{KSortableItem@{KSortable\-Item}!index@{index}}
\index{index@{index}!KSortableItem@{KSortable\-Item}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$class T, class Key = int$>$ Key {\bf KSortable\-Item}$<$ T, Key $>$::index () const\hspace{0.3cm}{\tt  [inline]}}\label{classKSortableItem_a12}


\begin{Desc}
\item[Returns:]the first value. \end{Desc}


Definition at line 119 of file ksortablevaluelist.h.

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