@{}{(vector-\typen?  \vect)}
{Return \#t if \vect is a vector of C++ objects of type \typen.  $O(1)$}@ 

@{}{(vector-ref  \vect \ind)}
{Return the element of \vect at location \index.  $O(1)$}@ 

@{}{(vector-fill!  \vect \val)}
{Fill all of the entries of \vect with \valn. $O(n)$}@ 

@{}{(vector-copy  \vect)}
{Create and return a new copy of \vect. $O(n)$}@ 

@{}{(vector-set!  \vect \index \val)}
{Assign \val to $vect[index]$. $O(1)$}@ 

@{}{(vector-length  \vect\ )}
{Return the length of the longest initialized segment of \vect. $O(n)$}@ 

@{}{(eq?  \vectone \vecttwo $\ldots$ \vectk)}
{Return true if all argments are the same vector. $O(n)$}@ 

@{}{(eqv?  \vectone \vecttwo $\ldots$ \vectk)}
{Return true if all argments are vectors with the same elements. $O(n)$}@ 

@{}{(\lth  \vectone \vecttwo $\ldots$ \vectk)}
{Return true if \vecti \lth \vectj whenever $i \lth j$. Ordering
 is lexicographic. $O(n)$}@ 

@{}{(\ltheq  \vectone \vecttwo $\ldots$ \vectk)}
{Return true if \vecti \ltheq \vectj whenever $i \ltheq j$. Ordering
 is lexicographic. $O(n)$}@ 

@{}{(\gth  \vectone \vecttwo $\ldots$ \vectk)}
{Return true if \vecti \gth \vectj whenever $i \gth j$. Ordering
 is lexicographic. $O(n)$}@ 

@{}{(\gtheq  \vectone \vecttwo $\ldots$ \vectk)}
{Return true if \vecti \gtheq \vectj whenever $i \gtheq j$. Ordering
 is lexicographic. $O(n)$}@ 

@{}{(vector-resize  \vect \newsize)}
{Change the number of memory locations allocated to \vect.  
$O(n + newsize)$}@