sforman/Thun
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Rebuild docs

Browse Source
This commit is contained in:
Simon Forman
2020-05-17 16:40:58 -07:00
parent ef6411205d
commit 56da4690d0
84 changed files with 7456 additions and 7972 deletions
Download Patch File Download Diff File Expand all files Collapse all files
docs/Advent_of_Code_2017_December_6th.rst
+38 -38
View File
@@ -6,7 +6,7 @@ December 6th
::
[0 2 7 0] dup max
[0 2 7 0] dup max
.. code:: ipython2
@@ -77,16 +77,16 @@ December 6th
-1
Starting at ``index`` distribute ``count`` "blocks" to the "banks" in
Starting at ``index`` distribute ``count`` “blocks” to the “banks” in
the sequence.
::
[...] count index distribute
----------------------------
[...]
[...] count index distribute
----------------------------
[...]
This seems like it would be a PITA to implement in Joypy...
This seems like it would be a PITA to implement in Joypy…
.. code:: ipython2
@@ -168,25 +168,25 @@ This seems like it would be a PITA to implement in Joypy...
[2 4 1 2]
Recalling "Generator Programs"
Recalling “Generator Programs”
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
::
[a F] x
[a F] a F
[a F] x
[a F] a F
[a F] a swap [C] dip rest cons
a [a F] [C] dip rest cons
a C [a F] rest cons
a C [F] cons
[a F] a swap [C] dip rest cons
a [a F] [C] dip rest cons
a C [a F] rest cons
a C [F] cons
w/ C == dup G
w/ C == dup G
a dup G [F] cons
a a G [F] cons
a dup G [F] cons
a a G [F] cons
w/ G == dup max [index_of] nullary distribute
w/ G == dup max [index_of] nullary distribute
.. code:: ipython2
@@ -217,53 +217,53 @@ First draft:
::
[] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
[] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
(?)
::
[] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
[] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
[] [...] [GEN] pop index_of 0 >=
[] [...] index_of 0 >=
-1 0 >=
False
[] [GEN] x [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
[] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
[] [...] [GEN] pop index_of 0 >=
[] [...] index_of 0 >=
-1 0 >=
False
Base case
::
[] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
[] [...] [GEN] pop size --
[] [...] size --
[] [...] size --
[] [...] [GEN] [pop index_of 0 >=] [pop size --] [[swons] dip x] primrec
[] [...] [GEN] pop size --
[] [...] size --
[] [...] size --
A mistake, ``popop`` and no need for ``--``
::
[] [...] [GEN] popop size
[] size
n
[] [...] [GEN] popop size
[] size
n
Recursive case
::
[] [...] [GEN] [pop index_of 0 >=] [popop size] [[swons] dip x] primrec
[] [...] [GEN] [swons] dip x F
[] [...] swons [GEN] x F
[[...]] [GEN] x F
[[...]] [...] [GEN] F
[] [...] [GEN] [pop index_of 0 >=] [popop size] [[swons] dip x] primrec
[] [...] [GEN] [swons] dip x F
[] [...] swons [GEN] x F
[[...]] [GEN] x F
[[...]] [...] [GEN] F
[[...]] [...] [GEN] F
[[...]] [...] [GEN] F
What have we learned?
::
F == [pop index_of 0 >=] [popop size] [[swons] dip x] primrec
F == [pop index_of 0 >=] [popop size] [[swons] dip x] primrec
.. code:: ipython2