Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
M
menhir
Project overview
Project overview
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
10
Issues
10
List
Boards
Labels
Milestones
Merge Requests
3
Merge Requests
3
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Packages
Packages
Container Registry
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
POTTIER Francois
menhir
Commits
d5dd4089
Commit
d5dd4089
authored
Apr 07, 2017
by
POTTIER Francois
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Document [pop_many].
parent
0f2e9c1a
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
13 additions
and
2 deletions
+13
-2
doc/main.tex
doc/main.tex
+11
-0
src/IncrementalEngine.ml
src/IncrementalEngine.ml
+2
-2
No files found.
doc/main.tex
View file @
d5dd4089
...
...
@@ -2525,6 +2525,17 @@ this stack element is the current state of the automaton. If the stack is
empty,
\verb
+
None
+
is returned. In that case, the current state of the
automaton must be an initial state.
%% val pop_many
\begin{verbatim}
val pop
_
many: int -> 'a env -> 'a env option
\end{verbatim}
\verb
+
pop_many i env
+
pops
\verb
+
i
+
elements off the automaton's stack. This
is done via
\verb
+
i
+
successive invocations of
\verb
+
pop
+
. Thus,
\verb
+
pop_many 1
+
is
\verb
+
pop
+
. The index
\verb
+
i
+
must be nonnegative. The
time complexity is
$
O
(
i
)
$
.
%% val positions
\begin{verbatim}
...
...
src/IncrementalEngine.ml
View file @
d5dd4089
...
...
@@ -269,8 +269,8 @@ module type INCREMENTAL_ENGINE = sig
val
top
:
'
a
env
->
element
option
(* [pop_many i env] pops [i] cells off the automaton's stack. This is done
by
invoking [pop] [i] times in succession
. Thus, [pop_many 1] is [pop]. The
(* [pop_many i env] pops [i] cells off the automaton's stack. This is done
via [i] successive invocations of [pop]
. Thus, [pop_many 1] is [pop]. The
index [i] must be nonnegative. The time complexity is O(i). *)
val
pop_many
:
int
->
'
a
env
->
'
a
env
option
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment