323 lines
28 KiB
HTML
323 lines
28 KiB
HTML
|
|
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
|
|
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
|
|
|
|
<html xmlns="http://www.w3.org/1999/xhtml">
|
|
<head>
|
|
<meta http-equiv="X-UA-Compatible" content="IE=Edge" />
|
|
<meta http-equiv="Content-Type" content="text/html; charset=utf-8" />
|
|
<title>Advent of Code 2017 — Thun 0.2.0 documentation</title>
|
|
<link rel="stylesheet" href="../_static/alabaster.css" type="text/css" />
|
|
<link rel="stylesheet" href="../_static/pygments.css" type="text/css" />
|
|
<script type="text/javascript" src="../_static/documentation_options.js"></script>
|
|
<script type="text/javascript" src="../_static/jquery.js"></script>
|
|
<script type="text/javascript" src="../_static/underscore.js"></script>
|
|
<script type="text/javascript" src="../_static/doctools.js"></script>
|
|
<script type="text/javascript" src="https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config=TeX-AMS-MML_HTMLorMML"></script>
|
|
<link rel="index" title="Index" href="../genindex.html" />
|
|
<link rel="search" title="Search" href="../search.html" />
|
|
|
|
<link rel="stylesheet" href="../_static/custom.css" type="text/css" />
|
|
|
|
|
|
<meta name="viewport" content="width=device-width, initial-scale=0.9, maximum-scale=0.9" />
|
|
|
|
</head><body>
|
|
|
|
|
|
<div class="document">
|
|
<div class="documentwrapper">
|
|
<div class="bodywrapper">
|
|
<div class="body" role="main">
|
|
|
|
<div class="section" id="advent-of-code-2017">
|
|
<h1>Advent of Code 2017<a class="headerlink" href="#advent-of-code-2017" title="Permalink to this headline">¶</a></h1>
|
|
<div class="section" id="december-6th">
|
|
<h2>December 6th<a class="headerlink" href="#december-6th" title="Permalink to this headline">¶</a></h2>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="mi">0</span> <span class="mi">2</span> <span class="mi">7</span> <span class="mi">0</span><span class="p">]</span> <span class="n">dup</span> <span class="nb">max</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">notebook_preamble</span> <span class="k">import</span> <span class="n">D</span><span class="p">,</span> <span class="n">J</span><span class="p">,</span> <span class="n">V</span><span class="p">,</span> <span class="n">define</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[0 2 7 0] dup max'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="mi">0</span> <span class="mi">2</span> <span class="mi">7</span> <span class="mi">0</span><span class="p">]</span> <span class="mi">7</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">joy.library</span> <span class="k">import</span> <span class="n">SimpleFunctionWrapper</span>
|
|
<span class="kn">from</span> <span class="nn">joy.utils.stack</span> <span class="k">import</span> <span class="n">list_to_stack</span>
|
|
|
|
|
|
<span class="nd">@SimpleFunctionWrapper</span>
|
|
<span class="k">def</span> <span class="nf">index_of</span><span class="p">(</span><span class="n">stack</span><span class="p">):</span>
|
|
<span class="sd">'''Given a sequence and a item, return the index of the item, or -1 if not found.</span>
|
|
|
|
<span class="sd"> E.g.:</span>
|
|
|
|
<span class="sd"> [a b c] a index_of</span>
|
|
<span class="sd"> ------------------------</span>
|
|
<span class="sd"> 0</span>
|
|
|
|
<span class="sd"> [a b c] d index_of</span>
|
|
<span class="sd"> ------------------------</span>
|
|
<span class="sd"> -1</span>
|
|
|
|
<span class="sd"> '''</span>
|
|
<span class="n">item</span><span class="p">,</span> <span class="p">(</span><span class="n">sequence</span><span class="p">,</span> <span class="n">stack</span><span class="p">)</span> <span class="o">=</span> <span class="n">stack</span>
|
|
<span class="n">i</span> <span class="o">=</span> <span class="mi">0</span>
|
|
<span class="k">while</span> <span class="n">sequence</span><span class="p">:</span>
|
|
<span class="n">term</span><span class="p">,</span> <span class="n">sequence</span> <span class="o">=</span> <span class="n">sequence</span>
|
|
<span class="k">if</span> <span class="n">term</span> <span class="o">==</span> <span class="n">item</span><span class="p">:</span>
|
|
<span class="k">break</span>
|
|
<span class="n">i</span> <span class="o">+=</span> <span class="mi">1</span>
|
|
<span class="k">else</span><span class="p">:</span>
|
|
<span class="n">i</span> <span class="o">=</span> <span class="o">-</span><span class="mi">1</span>
|
|
<span class="k">return</span> <span class="n">i</span><span class="p">,</span> <span class="n">stack</span>
|
|
|
|
|
|
<span class="n">D</span><span class="p">[</span><span class="s1">'index_of'</span><span class="p">]</span> <span class="o">=</span> <span class="n">index_of</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[0 2 7 0] 7 index_of'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="mi">2</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[0 2 7 0] 23 index_of'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="o">-</span><span class="mi">1</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>Starting at <code class="docutils literal notranslate"><span class="pre">index</span></code> distribute <code class="docutils literal notranslate"><span class="pre">count</span></code> “blocks” to the “banks” in
|
|
the sequence.</p>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="n">count</span> <span class="n">index</span> <span class="n">distribute</span>
|
|
<span class="o">----------------------------</span>
|
|
<span class="p">[</span><span class="o">...</span><span class="p">]</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>This seems like it would be a PITA to implement in Joypy…</p>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="kn">from</span> <span class="nn">joy.utils.stack</span> <span class="k">import</span> <span class="n">iter_stack</span><span class="p">,</span> <span class="n">list_to_stack</span>
|
|
|
|
|
|
<span class="nd">@SimpleFunctionWrapper</span>
|
|
<span class="k">def</span> <span class="nf">distribute</span><span class="p">(</span><span class="n">stack</span><span class="p">):</span>
|
|
<span class="sd">'''Starting at index+1 distribute count "blocks" to the "banks" in the sequence.</span>
|
|
|
|
<span class="sd"> [...] count index distribute</span>
|
|
<span class="sd"> ----------------------------</span>
|
|
<span class="sd"> [...]</span>
|
|
|
|
<span class="sd"> '''</span>
|
|
<span class="n">index</span><span class="p">,</span> <span class="p">(</span><span class="n">count</span><span class="p">,</span> <span class="p">(</span><span class="n">sequence</span><span class="p">,</span> <span class="n">stack</span><span class="p">))</span> <span class="o">=</span> <span class="n">stack</span>
|
|
<span class="k">assert</span> <span class="n">count</span> <span class="o">>=</span> <span class="mi">0</span>
|
|
<span class="n">cheat</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">iter_stack</span><span class="p">(</span><span class="n">sequence</span><span class="p">))</span>
|
|
<span class="n">n</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">cheat</span><span class="p">)</span>
|
|
<span class="k">assert</span> <span class="n">index</span> <span class="o"><</span> <span class="n">n</span>
|
|
<span class="n">cheat</span><span class="p">[</span><span class="n">index</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span>
|
|
<span class="k">while</span> <span class="n">count</span><span class="p">:</span>
|
|
<span class="n">index</span> <span class="o">+=</span> <span class="mi">1</span>
|
|
<span class="n">index</span> <span class="o">%=</span> <span class="n">n</span>
|
|
<span class="n">cheat</span><span class="p">[</span><span class="n">index</span><span class="p">]</span> <span class="o">+=</span> <span class="mi">1</span>
|
|
<span class="n">count</span> <span class="o">-=</span> <span class="mi">1</span>
|
|
<span class="k">return</span> <span class="n">list_to_stack</span><span class="p">(</span><span class="n">cheat</span><span class="p">),</span> <span class="n">stack</span>
|
|
|
|
|
|
<span class="n">D</span><span class="p">[</span><span class="s1">'distribute'</span><span class="p">]</span> <span class="o">=</span> <span class="n">distribute</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[0 2 7 0] dup max [index_of] nullary distribute'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="mi">2</span> <span class="mi">4</span> <span class="mi">1</span> <span class="mi">2</span><span class="p">]</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[2 4 1 2] dup max [index_of] nullary distribute'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="mi">3</span> <span class="mi">1</span> <span class="mi">2</span> <span class="mi">3</span><span class="p">]</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[3 1 2 3] dup max [index_of] nullary distribute'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="mi">0</span> <span class="mi">2</span> <span class="mi">3</span> <span class="mi">4</span><span class="p">]</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[0 2 3 4] dup max [index_of] nullary distribute'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="mi">1</span> <span class="mi">3</span> <span class="mi">4</span> <span class="mi">1</span><span class="p">]</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[1 3 4 1] dup max [index_of] nullary distribute'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="mi">2</span> <span class="mi">4</span> <span class="mi">1</span> <span class="mi">2</span><span class="p">]</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="section" id="recalling-generator-programs">
|
|
<h3>Recalling “Generator Programs”<a class="headerlink" href="#recalling-generator-programs" title="Permalink to this headline">¶</a></h3>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="n">a</span> <span class="n">F</span><span class="p">]</span> <span class="n">x</span>
|
|
<span class="p">[</span><span class="n">a</span> <span class="n">F</span><span class="p">]</span> <span class="n">a</span> <span class="n">F</span>
|
|
|
|
<span class="p">[</span><span class="n">a</span> <span class="n">F</span><span class="p">]</span> <span class="n">a</span> <span class="n">swap</span> <span class="p">[</span><span class="n">C</span><span class="p">]</span> <span class="n">dip</span> <span class="n">rest</span> <span class="n">cons</span>
|
|
<span class="n">a</span> <span class="p">[</span><span class="n">a</span> <span class="n">F</span><span class="p">]</span> <span class="p">[</span><span class="n">C</span><span class="p">]</span> <span class="n">dip</span> <span class="n">rest</span> <span class="n">cons</span>
|
|
<span class="n">a</span> <span class="n">C</span> <span class="p">[</span><span class="n">a</span> <span class="n">F</span><span class="p">]</span> <span class="n">rest</span> <span class="n">cons</span>
|
|
<span class="n">a</span> <span class="n">C</span> <span class="p">[</span><span class="n">F</span><span class="p">]</span> <span class="n">cons</span>
|
|
|
|
<span class="n">w</span><span class="o">/</span> <span class="n">C</span> <span class="o">==</span> <span class="n">dup</span> <span class="n">G</span>
|
|
|
|
<span class="n">a</span> <span class="n">dup</span> <span class="n">G</span> <span class="p">[</span><span class="n">F</span><span class="p">]</span> <span class="n">cons</span>
|
|
<span class="n">a</span> <span class="n">a</span> <span class="n">G</span> <span class="p">[</span><span class="n">F</span><span class="p">]</span> <span class="n">cons</span>
|
|
|
|
<span class="n">w</span><span class="o">/</span> <span class="n">G</span> <span class="o">==</span> <span class="n">dup</span> <span class="nb">max</span> <span class="p">[</span><span class="n">index_of</span><span class="p">]</span> <span class="n">nullary</span> <span class="n">distribute</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">define</span><span class="p">(</span><span class="s1">'direco == dip rest cons'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">define</span><span class="p">(</span><span class="s1">'G == [direco] cons [swap] swoncat cons'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">define</span><span class="p">(</span><span class="s1">'make_distributor == [dup dup max [index_of] nullary distribute] G'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[0 2 7 0] make_distributor 6 [x] times pop'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[</span><span class="mi">0</span> <span class="mi">2</span> <span class="mi">7</span> <span class="mi">0</span><span class="p">]</span> <span class="p">[</span><span class="mi">2</span> <span class="mi">4</span> <span class="mi">1</span> <span class="mi">2</span><span class="p">]</span> <span class="p">[</span><span class="mi">3</span> <span class="mi">1</span> <span class="mi">2</span> <span class="mi">3</span><span class="p">]</span> <span class="p">[</span><span class="mi">0</span> <span class="mi">2</span> <span class="mi">3</span> <span class="mi">4</span><span class="p">]</span> <span class="p">[</span><span class="mi">1</span> <span class="mi">3</span> <span class="mi">4</span> <span class="mi">1</span><span class="p">]</span> <span class="p">[</span><span class="mi">2</span> <span class="mi">4</span> <span class="mi">1</span> <span class="mi">2</span><span class="p">]</span>
|
|
</pre></div>
|
|
</div>
|
|
</div>
|
|
<div class="section" id="a-function-to-drive-a-generator-and-count-how-many-states-before-a-repeat">
|
|
<h3>A function to drive a generator and count how many states before a repeat.<a class="headerlink" href="#a-function-to-drive-a-generator-and-count-how-many-states-before-a-repeat" title="Permalink to this headline">¶</a></h3>
|
|
<p>First draft:</p>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="n">x</span> <span class="p">[</span><span class="n">pop</span> <span class="n">index_of</span> <span class="mi">0</span> <span class="o">>=</span><span class="p">]</span> <span class="p">[</span><span class="n">pop</span> <span class="n">size</span> <span class="o">--</span><span class="p">]</span> <span class="p">[[</span><span class="n">swons</span><span class="p">]</span> <span class="n">dip</span> <span class="n">x</span><span class="p">]</span> <span class="n">primrec</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>(?)</p>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="n">x</span> <span class="p">[</span><span class="n">pop</span> <span class="n">index_of</span> <span class="mi">0</span> <span class="o">>=</span><span class="p">]</span> <span class="p">[</span><span class="n">pop</span> <span class="n">size</span> <span class="o">--</span><span class="p">]</span> <span class="p">[[</span><span class="n">swons</span><span class="p">]</span> <span class="n">dip</span> <span class="n">x</span><span class="p">]</span> <span class="n">primrec</span>
|
|
<span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="p">[</span><span class="n">pop</span> <span class="n">index_of</span> <span class="mi">0</span> <span class="o">>=</span><span class="p">]</span> <span class="p">[</span><span class="n">pop</span> <span class="n">size</span> <span class="o">--</span><span class="p">]</span> <span class="p">[[</span><span class="n">swons</span><span class="p">]</span> <span class="n">dip</span> <span class="n">x</span><span class="p">]</span> <span class="n">primrec</span>
|
|
<span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="n">pop</span> <span class="n">index_of</span> <span class="mi">0</span> <span class="o">>=</span>
|
|
<span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="n">index_of</span> <span class="mi">0</span> <span class="o">>=</span>
|
|
<span class="o">-</span><span class="mi">1</span> <span class="mi">0</span> <span class="o">>=</span>
|
|
<span class="kc">False</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>Base case</p>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="p">[</span><span class="n">pop</span> <span class="n">index_of</span> <span class="mi">0</span> <span class="o">>=</span><span class="p">]</span> <span class="p">[</span><span class="n">pop</span> <span class="n">size</span> <span class="o">--</span><span class="p">]</span> <span class="p">[[</span><span class="n">swons</span><span class="p">]</span> <span class="n">dip</span> <span class="n">x</span><span class="p">]</span> <span class="n">primrec</span>
|
|
<span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="n">pop</span> <span class="n">size</span> <span class="o">--</span>
|
|
<span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="n">size</span> <span class="o">--</span>
|
|
<span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="n">size</span> <span class="o">--</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>A mistake, <code class="docutils literal notranslate"><span class="pre">popop</span></code> and no need for <code class="docutils literal notranslate"><span class="pre">--</span></code></p>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="n">popop</span> <span class="n">size</span>
|
|
<span class="p">[]</span> <span class="n">size</span>
|
|
<span class="n">n</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>Recursive case</p>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="p">[</span><span class="n">pop</span> <span class="n">index_of</span> <span class="mi">0</span> <span class="o">>=</span><span class="p">]</span> <span class="p">[</span><span class="n">popop</span> <span class="n">size</span><span class="p">]</span> <span class="p">[[</span><span class="n">swons</span><span class="p">]</span> <span class="n">dip</span> <span class="n">x</span><span class="p">]</span> <span class="n">primrec</span>
|
|
<span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="p">[</span><span class="n">swons</span><span class="p">]</span> <span class="n">dip</span> <span class="n">x</span> <span class="n">F</span>
|
|
<span class="p">[]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="n">swons</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="n">x</span> <span class="n">F</span>
|
|
<span class="p">[[</span><span class="o">...</span><span class="p">]]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="n">x</span> <span class="n">F</span>
|
|
<span class="p">[[</span><span class="o">...</span><span class="p">]]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="n">F</span>
|
|
|
|
<span class="p">[[</span><span class="o">...</span><span class="p">]]</span> <span class="p">[</span><span class="o">...</span><span class="p">]</span> <span class="p">[</span><span class="n">GEN</span><span class="p">]</span> <span class="n">F</span>
|
|
</pre></div>
|
|
</div>
|
|
<p>What have we learned?</p>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">F</span> <span class="o">==</span> <span class="p">[</span><span class="n">pop</span> <span class="n">index_of</span> <span class="mi">0</span> <span class="o">>=</span><span class="p">]</span> <span class="p">[</span><span class="n">popop</span> <span class="n">size</span><span class="p">]</span> <span class="p">[[</span><span class="n">swons</span><span class="p">]</span> <span class="n">dip</span> <span class="n">x</span><span class="p">]</span> <span class="n">primrec</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">define</span><span class="p">(</span><span class="s1">'count_states == [] swap x [pop index_of 0 >=] [popop size] [[swons] dip x] primrec'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">define</span><span class="p">(</span><span class="s1">'AoC2017.6 == make_distributor count_states'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[0 2 7 0] AoC2017.6'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="mi">5</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[1 1 1] AoC2017.6'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="mi">4</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="code ipython2 highlight-default notranslate"><div class="highlight"><pre><span></span><span class="n">J</span><span class="p">(</span><span class="s1">'[8 0 0 0 0 0] AoC2017.6'</span><span class="p">)</span>
|
|
</pre></div>
|
|
</div>
|
|
<div class="highlight-default notranslate"><div class="highlight"><pre><span></span><span class="mi">15</span>
|
|
</pre></div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
</div>
|
|
|
|
|
|
</div>
|
|
</div>
|
|
</div>
|
|
<div class="sphinxsidebar" role="navigation" aria-label="main navigation">
|
|
<div class="sphinxsidebarwrapper">
|
|
<h3><a href="../index.html">Table Of Contents</a></h3>
|
|
<ul>
|
|
<li><a class="reference internal" href="#">Advent of Code 2017</a><ul>
|
|
<li><a class="reference internal" href="#december-6th">December 6th</a><ul>
|
|
<li><a class="reference internal" href="#recalling-generator-programs">Recalling “Generator Programs”</a></li>
|
|
<li><a class="reference internal" href="#a-function-to-drive-a-generator-and-count-how-many-states-before-a-repeat">A function to drive a generator and count how many states before a repeat.</a></li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
</li>
|
|
</ul>
|
|
<div class="relations">
|
|
<h3>Related Topics</h3>
|
|
<ul>
|
|
<li><a href="../index.html">Documentation overview</a><ul>
|
|
</ul></li>
|
|
</ul>
|
|
</div>
|
|
<div role="note" aria-label="source link">
|
|
<h3>This Page</h3>
|
|
<ul class="this-page-menu">
|
|
<li><a href="../_sources/notebooks/Advent of Code 2017 December 6th.rst.txt"
|
|
rel="nofollow">Show Source</a></li>
|
|
</ul>
|
|
</div>
|
|
<div id="searchbox" style="display: none" role="search">
|
|
<h3>Quick search</h3>
|
|
<div class="searchformwrapper">
|
|
<form class="search" action="../search.html" method="get">
|
|
<input type="text" name="q" />
|
|
<input type="submit" value="Go" />
|
|
<input type="hidden" name="check_keywords" value="yes" />
|
|
<input type="hidden" name="area" value="default" />
|
|
</form>
|
|
</div>
|
|
</div>
|
|
<script type="text/javascript">$('#searchbox').show(0);</script>
|
|
</div>
|
|
</div>
|
|
<div class="clearer"></div>
|
|
</div>
|
|
<div class="footer" role="contentinfo">
|
|
<a rel="license" href="http://creativecommons.org/licenses/by-nc-sa/4.0/">
|
|
<img alt="Creative Commons License" style="border-width:0" src="https://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png" />
|
|
</a>
|
|
<br />
|
|
<span xmlns:dct="http://purl.org/dc/terms/" property="dct:title">Thun Documentation</span> by <a xmlns:cc="http://creativecommons.org/ns#" href="https://joypy.osdn.io/" property="cc:attributionName" rel="cc:attributionURL">Simon Forman</a> is licensed under a <a rel="license" href="http://creativecommons.org/licenses/by-nc-sa/4.0/">Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License</a>.<br />Based on a work at <a xmlns:dct="http://purl.org/dc/terms/" href="https://osdn.net/projects/joypy/" rel="dct:source">https://osdn.net/projects/joypy/</a>.
|
|
Created using <a href="http://sphinx-doc.org/">Sphinx</a> 1.7.3.
|
|
</div>
|
|
|
|
</body>
|
|
</html> |