@{}{(collection-int?  \col)}
{Return \#t if \col is a collection of \verb+int+ objects.  $O(1)$}@ 

@{}{(size  \col )}
{Return the number of elements in \coln. $O(n)$}@ 

@{}{(null?  \col )}
{Return \#t if \col has 0 elements. $O(1)$}@ 

@{}{(member?  \val \col)}
{Return \val if it is in the colleciton \coln; otherwise return \#f. $O(n)$}@ 

@{}{(insert!  \val \col)}
{Add the element \val to colleciton \coln. If \col does not allow multiple 
 elements, requests for multiple insertion of an element are ignored.  Time 
 complexity depends on collection implementation.}@ 

@{}{(remove! \val \col)}
{Remove the element \val to colleciton \coln. If \val occurred $k$ times
 before the call, it will occur $k-1$ times afterwards. Time complexity 
 depends on collection implementation.}@ 

@{}{(clear!  \col)}
{Remove all of the elements from colleciton \coln. $O(n)$}@

@{}{(occurrences  \val \col)}
{Remove number of times element \val occurs in collection \coln. $O(n)$ }@

@{}{(eq?  \colone \coltwo $\ldots$ \colk)}
{Return true if all argments are the same object. $O(n)$}@ 

@{}{(eqv?  \colone \coltwo $\ldots$ \colk)}
{Return true if all argments are collections with the same elements. $O(n)$}@ 

@{}{(\lth  \colone \coltwo $\ldots$ \colk)}
{Return true if \coli \lth \colj whenever $i \lth j$. Ordering
 is lexicographic. $O(n)$}@ 

@{}{(\ltheq  \colone \coltwo $\ldots$ \colk)}
{Return true if \coli \ltheq \colj whenever $i \ltheq j$. Ordering
 is lexicographic. $O(n)$}@ 

@{}{(\gth  \colone \coltwo $\ldots$ \colk)}
{Return true if \coli \gth \colj whenever $i \gth j$. Ordering
 is lexicographic. $O(n)$}@ 

@{}{(\gtheq  \colone \coltwo $\ldots$ \colk)}
{Return true if \coli \gtheq \colj whenever $i \gtheq j$. Ordering
 is lexicographic. $O(n)$}@ 

@{}{(+  \colone \coltwo $\ldots$ \colk)}
{Return a multiset containing the union of \colone $\ldots$ \colkn, i.e. 
 each occurrence of each element of collection \coli is added to the result.
 Time complexity depends on the types of the \colin.}@ 

@{}{(\^  \colone \coltwo $\ldots$ \colk)}
{Return a multiset containing the intersection of \colone $\ldots$ \colkn. The
 number of occurrences of element $i$ in the result is the minimum number
 of occurrences of $i$ in any \colin.
 Time complexity depends on the types of the \colin.}@ 

@{}{(-  \colone \coltwo $\ldots$ \colk)}
{Return a multiset containing the difference of \colone $\ldots$ \colkn. 
 If \rji\ denotes the number of occurrences of element $i$ in \coljn, 
 then the number of occurrences of $i$ in the result is the maximum
 of 0 and the difference between \ronei and the sum from 2 to $k$ of
 \rji.  Time complexity depends on the types of the \colin.}@ 

@{}{(subset  \colone \coltwo $\ldots$ \colk)}
{Return \#t if $\colone \subseteq \coltwo \subseteq \colk$.
 Time complexity depends on the types of the \colin.}@ 

@{}{(proper-subset  \colone \coltwo $\ldots$ \colk)}
{Return \#t if $\colone \subset \coltwo \subset \colk,$ where 
 $\coli \subset \colj$ if and only if for each element $e$ in
 the $\coli \cup \colj$, $r_i(e) < r_j(e)$.
 Time complexity depends on the types of the \colin.}@

@{}{(cartesian-product  \set1 \set2n)}
{Return the set of all ordered pairs in the cartesian product of \set1 and
\set2n.  $O(n^2)$.}@

@{}{(choose  \set \kn)}
{Return the set of all k-subsets of $\setn,$ where  $\set$ is a LINK
 $\set$ class object (not a multiset or sequence). $O(2^n)$.}@

@{}{(power-set  \set)}
{Return the set of all subsets of $\setn,$ where  $\set$ is a LINK
 $\set$ class object (not a multiset or sequence). $O(2^n)$.}@