\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(vector-\typen?  \vect)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return \#t if \vect is a vector of C++ objects of type \typen.  $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(vector-ref  \vect \ind)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return the element of \vect at location \index.  $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(vector-fill!  \vect \val)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Fill all of the entries of \vect with \valn. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(vector-copy  \vect)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Create and return a new copy of \vect. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(vector-set!  \vect \index \val)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Assign \val to $vect[index]$. $O(1)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(vector-length  \vect\ )
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return the length of the longest initialized segment of \vect. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(eq?  \vectone \vecttwo $\ldots$ \vectk)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return true if all argments are the same vector. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(eqv?  \vectone \vecttwo $\ldots$ \vectk)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return true if all argments are vectors with the same elements. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(\lth  \vectone \vecttwo $\ldots$ \vectk)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return true if \vecti \lth \vectj whenever $i \lth j$. Ordering
 is lexicographic. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(\ltheq  \vectone \vecttwo $\ldots$ \vectk)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return true if \vecti \ltheq \vectj whenever $i \ltheq j$. Ordering
 is lexicographic. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(\gth  \vectone \vecttwo $\ldots$ \vectk)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return true if \vecti \gth \vectj whenever $i \gth j$. Ordering
 is lexicographic. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(\gtheq  \vectone \vecttwo $\ldots$ \vectk)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Return true if \vecti \gtheq \vectj whenever $i \gtheq j$. Ordering
 is lexicographic. $O(n)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 

\begin{minipage}[t]{8in}
\begin{tabular}{ll}
 & \index{Vector!}(vector-resize  \vect \newsize)
\end{tabular}\\


 \parbox[b]{2in} \ \ 
\begin{minipage}[t]{4in}Change the number of memory locations allocated to \vect.  
$O(n + newsize)$\end{minipage}
\end{minipage}
\vspace{0.2in}
 
