\begin{minipage}[t]{8in}
\begin{tabular}{ll}
SequenceBase$<$Item,Impl$>$  & s;
\end{tabular}\\
 
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Create an empty sequence using the 
	unsorted \Container\ class {\em Impl} (where {\em Impl} 
	contains elements of type {\em Item}) as an implementation.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
SequenceBase$<$Item,Impl$>$  & s( (Collection$<$Item$>$\&) c); 
\end{tabular}\\

	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Create a sequence 
	using the unsorted \Container\ 
	class {\em Impl} (where {\em Impl} contains elements of type 
	{\em Item}) as an implementation.  
	Initialize the collection with the elements of $c$ such that the
	same order is maintained. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
SequenceBase$<$Item,Impl$>$  & s( (SequenceBase$<$Item,Impl$>$\&) ss); 
\end{tabular}\\

	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Create an empty sequence 
	using the unsorted \Container\ 
	class {\em Impl} (where {\em Impl} contains elements of type 
	{\em Item}) as an implementation.  
	Use reference counting to share the elements of $ss$. $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}



\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Sequence$<$Item$>$  & s( (Collection$<$Item$>$\&) c); 
\end{tabular}\\

	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Create a set using the implementation
	specified by DEFAULT\_SET\_IMPL in MSet.h.  Initialize it with 
	the elements
	of $c$ such that the same order is maintained.  $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Sequence$<$Item$>$  & s( (Sequence$<$Item$>$\&) ss); 
\end{tabular}\\

	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Create an empty sequence using the implementation
specified by DEFAULT\_SET\_IMPL in MSet.h.  Use reference counting to
share the elements of $ss$. $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}

