\begin{minipage}[t]{8in}
\begin{tabular}{ll}
List$<$Item$>$\&  & operator=\index{SortedList!operator=}(Container$<$Item$>$\& list)
\end{tabular}\\

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}If the current list is different from the passed list,
		 then remove any elements in the current list and iterate 
		 through the elements of the passed list, inserting them
		 in the lexicographic order. $O(n^2)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
List$<$Item$>$\&  & operator=\index{SortedList!operator=}(SortedList$<$Item$>$\& list)
\end{tabular}\\

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}If the current list is different from the passed list,
		 then remove any elements in the current list and iterate 
		 through the elements of the passed list, appending them
		 in the same order onto the end of the current list. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Bool  & memberQ\index{SortedList!memberQ}(Item\& item)
\end{tabular}\\

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Indicate whether item is in list or not. Do not proceed
		 if {\em item} is less than the current item $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Bool  & sortedQ\index{SortedList!sortedQ}() const
\end{tabular}\\

	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return TRUE.  $O(1)$.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
ContainerNode*  & search\index{SortedList!search}(Item\& item)
\end{tabular}\\

		
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Search for item and return a pointer to 
		the node which contains it.  Do not proceed if 
		{\em item} is less than the current item. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
ContainerNode*  & prepend\index{SortedList!prepend}(Item item)
\end{tabular}\\
 
			
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Insert the item at the beginning of list if no
			 order violation would occur.
			 Otherwise warn of an attempted order violation and
			 return NULL. $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
ContainerNode*  & insert\index{SortedList!insert}(Item item)
\end{tabular}\\
 
			
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Insert the item in lexicographically sorted order. 
			 $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
ContainerNode*  & append\index{SortedList!append}(Item item)
\end{tabular}\\
 
			
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Append the item to the back of list if no order
			 violation would occur. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
ContainerNode*  & insertBefore\index{SortedList!insertBefore}(Item item, ContainerNode *n)
\end{tabular}\\

			
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Insert the item before node n if no order violation
			 would occur.  Otherwise warn the user and return. 
			 $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
ContainerNode*  & insertAfter\index{SortedList!insertAfter}(Item item, ContainerNode *n)
\end{tabular}\\

			
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Insert the item after node n if no order violation
			 would occur.  Otherwise warn the user and return. 
			 $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}

