\Header{seq}{Sequence Generation}
\alias{:}{seq}
\methalias{seq.default}{seq}
\keyword{manip}{seq}
\begin{Description}\relax
Generate regular sequences.
\end{Description}
\begin{Usage}
\begin{verbatim}
from:to
   a:b

seq(from, to)
seq(from, to, by=)
seq(from, to, length=)
seq(along=)
seq(from)
\end{verbatim}
\end{Usage}
\begin{Arguments}
\begin{ldescription}
\item[\code{from}] starting value of sequence.
\item[\code{to}] (maximal) end value of the sequence.
\item[\code{by}] increment of the sequence.
\item[\code{length}] desired length of the sequence.
\item[\code{along}] take the length from the length of this argument.
\item[\code{a,b}] \code{\Link{factor}}s of same length.
\end{ldescription}
\end{Arguments}
\begin{Details}\relax
The binary operator \code{:} has two meanings: for factors \code{a:b} is
equivalent to \code{\Link{interaction}(a, b)} (except for labelling by
\code{la:lb} not \code{la.lb}).  For numeric arguments \code{a:b} is
equivalent to \code{seq(from=a, to=b)}.

The interpretation of the unnamed arguments of \code{seq} is
\emph{not} standard, and it is recommended always to name the
arguments when programming.

Function \code{seq} is generic, and only the default method is
described here.

The operator \code{:} and the \code{seq(from, to)} form generate the
sequence \code{from, from+1, ..., to}.

The second form generates \code{from, from+by}, \ldots, up to the
sequence value less than or equal to \code{to}.

The third generates a sequence of \code{length} equally spaced values
from \code{from} to \code{to}.

The fourth form generates the sequence \code{1, 2, ..., length(along)}.

The last generates the sequence \code{1, 2, ..., length(from)}
(as if argument \code{along} had been specified),
\emph{unless} the argument is numeric of length 1 when it is
interpreted as \code{1:from} (even for \code{seq(0)} for
compatibility with S).

If \code{from} and \code{to} are factors of the same length, then
\code{from : to} returns the \dQuote{cross} of the two.

Very small sequences (with \code{from - to} of the order of \eqn{10^{-14}}{}
times the larger of the ends) will return \code{from}.
\end{Details}
\begin{Value}
The result is of \code{mode} \code{"integer"} if \code{from} is
(numerically equal to an) integer and \code{by} is not specified.
\end{Value}
\begin{References}\relax
Becker, R. A., Chambers, J. M. and Wilks, A. R. (1988)
\emph{The New S Language}.
Wadsworth \& Brooks/Cole.
\end{References}
\begin{SeeAlso}\relax
The method \code{\Link{seq.POSIXt}}.

\code{\Link{rep}},
\code{\Link{sequence}},
\code{\Link{row}},
\code{\Link{col}}.

As an alternative to using \code{:} for factors, \code{\Link{interaction}}.
\end{SeeAlso}
\begin{Examples}
\begin{ExampleCode}
1:4
pi:6 # float
6:pi # integer

seq(0,1, length=11)
seq(rnorm(20))
seq(1,9, by = 2) # match
seq(1,9, by = pi)# stay below
seq(1,6, by = 3)
seq(1.575, 5.125, by=0.05)
seq(17) # same as 1:17

for (x in list(NULL, letters[1:6], list(1,pi)))
  cat("x=",deparse(x),";  seq(along = x):",seq(along = x),"\n")

f1 <- gl(2,3); f1
f2 <- gl(3,2); f2
f1:f2 # a factor, the "cross"  f1 x f2
\end{ExampleCode}
\end{Examples}

