diff --git a/docs/build_index.py b/docs/build_index.py index 16f5e2c..01472ee 100644 --- a/docs/build_index.py +++ b/docs/build_index.py @@ -19,8 +19,8 @@ print(f'''\
It's a matter of taste whether you implement this in terms of [branch] or -the other way around.
combinator
Run two programs in parallel, consuming one additional item, and put their +the other way around.
combinator
Run two programs in parallel, consuming one additional item, and put their results on the stack.
... x [A] [B] cleave
------------------------
@@ -206,7 +206,7 @@ expressions, e.g.:
------------------
[a ...]
Cons is a venerable old function from Lisp. -Its inverse operation is [uncons].
combinator built-in
The dip combinator expects a quoted program on the stack and below it
+Its inverse operation is [uncons].
combinator built-in
The dip combinator expects a quoted program on the stack and below it
some item, it hoists the item into the expression and runs the program
on the rest of the stack.
... x [Q] . dip
@@ -224,7 +224,7 @@ Continuation-Passing Style. The dip combinator could "set aside" t
item and replace it after running Q but that means that there is an
"extra space" where the item resides while Q runs. One of the nice
things about CPS is that the whole state is recorded in the stack and
-pending expression (not counting modifications to the dictionary.)combinator
Like [dip] but expects two items.
+pending expression (not counting modifications to the dictionary.)combinator
Like [dip] but expects two items.
... y x [Q] . dipd
-------------------------
... . Q y x
@@ -264,7 +264,7 @@ items removed off the top.
a dup
-----------
a a
-
[dup] the second item down on the stack.
+[dup] the second item down on the stack.
a b dupd
--------------
a a b
@@ -293,8 +293,8 @@ It doesn't consume the list. ... a b c enstacken
-------------------------
[c b a ...]
-This is a destructive version of [stack]. See the note under -[disenstacken] about the apparent but illusory reversal of the stack.
built-in
Compare the two items on the top of the stack for equality and replace +
This is a destructive version of [stack]. See the note under +[disenstacken] about the apparent but illusory reversal of the stack.
built-in
Compare the two items on the top of the stack for equality and replace them with a Boolean value.
a b eq
-------------
@@ -610,7 +610,7 @@ the underlying [map] function is so implemented, of course.)[pop] the second item down on the stack.
+[pop] the second item down on the stack.
a b popd
--------------
b
@@ -786,8 +786,8 @@ list.
... c b a stack
---------------------------
... c b a [a b c ...]
-
This function forms a pair with [unstack], and together they form the -complement to the "destructive" pair [enstacken] and [disenstacken].
Grab the stack under the top item and put it onto the stack.
+This function forms a pair with [unstack], and together they form the +complement to the "destructive" pair [enstacken] and [disenstacken].
Grab the stack under the top item and put it onto the stack.
... 1 2 3 stackd
------------------------
@@ -832,7 +832,7 @@ with the list, and put the old stack onto it.
--------------------------
6 5 4 [3 2 1]
This function works as a kind of "context switch". It's used in the -definition of [infra].
built-in
Swap the top two items on the stack.
a b swap
--------------
b a
@@ -930,7 +930,7 @@ the list. You cannot uncons an item from an empty list.
joy? unstack
1 2 3 6 5 4
- [a ...] unswons
+Print warranty information.
combinator
A specialization of [loop] that accepts a quoted predicate program P
diff --git a/docs/html/Thun.html b/docs/html/Thun.html
index 471943c..e3ff640 100644
--- a/docs/html/Thun.html
+++ b/docs/html/Thun.html
@@ -3,8 +3,8 @@