\HeaderA{findEqualGreater}{Find values in sorted vectors}{findEqualGreater}
\aliasA{findEqualGreaterM}{findEqualGreater}{findEqualGreaterM}
\aliasA{findEqualLess}{findEqualGreater}{findEqualLess}
\aliasA{findRange}{findEqualGreater}{findRange}
\keyword{utilities}{findEqualGreater}
\keyword{internal}{findEqualGreater}
\begin{Description}\relax
Find values in sorted vectors.
\end{Description}
\begin{Usage}
\begin{verbatim}
findEqualGreater(x, value)
findEqualLess(x, value)
findEqualGreaterM(x, values)
findRange(x, values, NAOK = FALSE)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{x}] numeric vector sorted in increasing order
\item[\code{value}] value to find in \code{x}
\item[\code{values}] numeric values to find in \code{x}
\item[\code{NAOK}] don't check for NA values in \code{x}
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
\code{findEqualGreater} finds the index of the first value in
\code{x} that is equal or greater than \code{value}. \code{findEqualLess}
does same except that it finds equal or less. \code{findEqualGreaterM}
creates an index of a vector by finding specified values.
\code{findRange} locates the start and stop indicides of a range
of two \code{x} values.

The only things that save time at this point are
\code{findeEqualGreaterM} (when the length of values approaches
the lenght of x) and \code{findRange} (when \code{NAOK} is set
to TRUE). They run in log(N) and N time, respectively.
\end{Details}
\begin{Value}
An integer vector with the position(s) of the values(s).
\end{Value}
\begin{Author}\relax
Colin A. Smith, \email{csmith@scripps.edu}
\end{Author}

