.BG
.FN c
.TL
Combine Values
.CS
c(..., recursive=F)
.AG ...
any S objects.  Missing values (`NA's) are allowed.
.AG recursive
should the combining be done recursively?
.RT
vector which is the combination of all values from all
arguments to the function.
If `recursive' is `TRUE' arguments with recursive modes are effectively
unlisted (see `unlist') before they are used.
The mode of the result is the most general of all the modes in the arguments
(or the unlisted arguments, if `recursive=T').
In particular, `list' objects can be combined this way.
.PP
Arguments that are `NULL' or length 0 do not contribute elements to the result.
See the last example.
.SA
`unlist'; `c(...,recursive=r)' is equivalent to `unlist(list(...),recursive=r)'.
.EX
c(1:10, 1:5, 1:10)
c(1,2,3,5,7,11,13)

c(states, "Washington DC")

# build x, element by element
# useful if final length not known in advance
x <- numeric(0)
for(i in possibles)
  if(test(i))x <- c(x, fun(i))
.KW manip
.WR
