\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Set$<$Sequence$<$Item$>$ $>$  & SetFuncs$<$Item$>$::cartesianProduct\index{SetFuncs!SetFuncs$<$Item$>$::cartesianProduct}(const Set$<$Item$>$\&s,
				const Set$<$Item$>$\&s2);
\end{tabular}\\

	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Constructs and returns the set of all ordered pairs in the
	 cartesian product of s and s2.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Set$<$Sequence$<$Item$>$ $>$  & SetFuncs$<$Item$>$::cartesianProduct\index{SetFuncs!SetFuncs$<$Item$>$::cartesianProduct}(const Set$<$Item$>$\&s1, 
						const Set$<$Item$>$\&s2)
\end{tabular}\\
 
	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Constructs and returns the set of all k-subsets of s.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Set$<$Set$<$Item$>$ $>$  & SetFuncs$<$Item$>$::choose\index{SetFuncs!SetFuncs$<$Item$>$::choose}(const Set$<$Item$>$\&s, int k)
\end{tabular}\\
 
	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Constructs and returns the set of all k-subsets of s.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Set$<$Set$<$Item$>$ $>$  & SetFuncs$<$Item$>$::powerSet\index{SetFuncs!SetFuncs$<$Item$>$::powerSet}(const Set$<$Item$>$\&s)
\end{tabular}\\
 
	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Constructs and returns the set of all possible subsets s.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Sequence$<$Item$>$  & SetFuncs$<$Item$>$::permutation\index{SetFuncs!SetFuncs$<$Item$>$::permutation}(const Set$<$Item$>$\&s,
			 const Permutation\& p);
\end{tabular}\\
 
	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Permutes the elements of s into the order specified by 
	 permutation p.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Sequence$<$Item$>$  & SetFuncs$<$Item$>$::permutation\index{SetFuncs!SetFuncs$<$Item$>$::permutation}(const Array$<$Item$>$\&a,
			 const Permutation\& p);
\end{tabular}\\
 
	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Permutes the elements of a into the order specified by 
	 permutation p.\end{minipage}
\end{minipage}
\vspace{0.2in}


\begin{minipage}[t]{8in}
\begin{tabular}{ll}
Set$<$Sequence$<$Item$>$ $>$  & SetFuncs$<$Item$>$::permutations\index{SetFuncs!SetFuncs$<$Item$>$::permutations}(const Set$<$Item$>$\&a);
\end{tabular}\\

	
 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in} Returns a set of all permutations of s.\end{minipage}
\end{minipage}
\vspace{0.2in}

