1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
% Generated by roxygen2: do not edit by hand
% Please edit documentation in R/faststack.R
\name{faststack}
\alias{faststack}
\title{Create a stack}
\usage{
faststack(init = 20, missing_default = NULL)
}
\arguments{
\item{init}{Initial size of the list that backs the stack. This is also used
as the minimum size of the list; it will not shrink any smaller.}
\item{missing_default}{The value to return when \code{pop()} or \code{peek()} are
called when the stack is empty. Default is \code{NULL}.}
}
\description{
A \code{faststack} is backed by a list. The backing list will grow or shrink as
the stack changes in size.
}
\details{
\code{faststack} objects have the following methods:
\describe{
\item{\code{push(x)}}{
Push an object onto the stack.
}
\item{\code{mpush(..., .list = NULL)}}{
Push objects onto the stack. \code{.list} can be a list of objects to add.
}
\item{\code{pop(missing = missing_default)}}{
Remove and return the top object on the stack. If the stack is empty,
it will return \code{missing}, which defaults to the value of
\code{missing_default} that \code{stack()} was created with (typically, \code{NULL}).
}
\item{\code{mpop(n, missing = missing_default)}}{
Remove and return the top \code{n} objects on the stack, in a list. The first
element of the list is the top object in the stack. If \code{n} is greater
than the number of objects in the stack, any requested items beyond
those in the stack will be replaced with \code{missing} (typically, \code{NULL}).
}
\item{\code{peek(missing = missing_default)}}{
Return the top object on the stack, but do not remove it from the stack.
If the stack is empty, this will return \code{missing}.
}
\item{\code{reset()}}{
Reset the stack, clearing all items.
}
\item{\code{size()}}{
Returns the number of items in the stack.
}
\item{\code{as_list()}}{
Return a list containing the objects in the stack, where the first
element in the list is the object at the bottom of the stack, and the
last element in the list is the object at the top of the stack.
}
}
}
|
