\begin{minipage}[t]{8in}
\begin{tabular}{ll}
List$<$Item$>$\&  & operator=\index{DList!operator=}(List$<$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
		 into the current list. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
ContainerNode*  & insert\index{DList!insert}(ContainerNode *cn)
\end{tabular}\\
 
			
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Insert the item stored in node {\em cn} 
			 at the beginning of the list. $O(1)$.
			 This enables users who have saved pointers to 
			 certain elements to move them between \DLists\
			 efficiently. $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
ContainerNode*  & unlink\index{DList!unlink}(ContainerNode *cn)
\end{tabular}\\
 
			
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Remove a node from the list. $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}