Skip to content

Commit

Permalink
Change lingering reference to scalar extension
Browse files Browse the repository at this point in the history
  • Loading branch information
xpqz committed Aug 16, 2021
1 parent c93009c commit b25931d
Show file tree
Hide file tree
Showing 8 changed files with 5 additions and 5 deletions.
Binary file modified contents/_build/.doctrees/environment.pickle
Binary file not shown.
Binary file modified contents/_build/.doctrees/iteration.doctree
Binary file not shown.
Binary file modified contents/_build/.jupyter_cache/global.db
Binary file not shown.
2 changes: 1 addition & 1 deletion contents/_build/html/_sources/iteration.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
"\n",
"In order to get the best possible performance out of APL, it's worth seeking data-parallel algorithms, typically employing Boolean masks. However, it's not always possible, or sometimes performance matters less than code complexity, and a more iterative solution can be both clearer and fast enough.\n",
"\n",
"We have at least four, maybe five different kinds of iteration mechanisms at our disposal: _Each_ (`¨`), _Reduce_ (`⌿`), _Del_ (`∇`) and _Power_ (`⍣`). The fifth is that of _scalar extension_, which can either be seen as a way of achieving iteration, or as a way of _avoiding_ iteration, depending on your point of view. Wait, is it six? Maybe we should count _Rank_ (`⍤`), too? _Rank_ deserves its own separate [section](./rank.ipynb)! Oh, and _Scan_ (`⍀`), don't forget _Scan_! \n",
"We have at least four, maybe five different kinds of iteration mechanisms at our disposal: _Each_ (`¨`), _Reduce_ (`⌿`), _Del_ (`∇`) and _Power_ (`⍣`). The fifth is that of _scalar pervasion_, which can either be seen as a way of achieving iteration, or as a way of _avoiding_ iteration, depending on your point of view. Wait, is it six? Maybe we should count _Rank_ (`⍤`), too? _Rank_ deserves its own separate [section](./rank.ipynb)! Oh, and _Scan_ (`⍀`), don't forget _Scan_! \n",
"\n",
"Let's introduce them."
]
Expand Down
2 changes: 1 addition & 1 deletion contents/_build/html/iteration.html
Original file line number Diff line number Diff line change
Expand Up @@ -445,7 +445,7 @@ <h1>Iteration<a class="headerlink" href="#iteration" title="Permalink to this he
</div></blockquote>
<p>We started all this by claiming that there are no loops in APL. This is of course not entirely true: there are plenty of ways of achieving iteration, some of which are more efficient than others.</p>
<p>In order to get the best possible performance out of APL, it’s worth seeking data-parallel algorithms, typically employing Boolean masks. However, it’s not always possible, or sometimes performance matters less than code complexity, and a more iterative solution can be both clearer and fast enough.</p>
<p>We have at least four, maybe five different kinds of iteration mechanisms at our disposal: <em>Each</em> (<code class="docutils literal notranslate"><span class="pre">¨</span></code>), <em>Reduce</em> (<code class="docutils literal notranslate"><span class="pre"></span></code>), <em>Del</em> (<code class="docutils literal notranslate"><span class="pre"></span></code>) and <em>Power</em> (<code class="docutils literal notranslate"><span class="pre"></span></code>). The fifth is that of <em>scalar extension</em>, which can either be seen as a way of achieving iteration, or as a way of <em>avoiding</em> iteration, depending on your point of view. Wait, is it six? Maybe we should count <em>Rank</em> (<code class="docutils literal notranslate"><span class="pre"></span></code>), too? <em>Rank</em> deserves its own separate <a class="reference internal" href="rank.html"><span class="doc std std-doc">section</span></a>! Oh, and <em>Scan</em> (<code class="docutils literal notranslate"><span class="pre"></span></code>), don’t forget <em>Scan</em>!</p>
<p>We have at least four, maybe five different kinds of iteration mechanisms at our disposal: <em>Each</em> (<code class="docutils literal notranslate"><span class="pre">¨</span></code>), <em>Reduce</em> (<code class="docutils literal notranslate"><span class="pre"></span></code>), <em>Del</em> (<code class="docutils literal notranslate"><span class="pre"></span></code>) and <em>Power</em> (<code class="docutils literal notranslate"><span class="pre"></span></code>). The fifth is that of <em>scalar pervasion</em>, which can either be seen as a way of achieving iteration, or as a way of <em>avoiding</em> iteration, depending on your point of view. Wait, is it six? Maybe we should count <em>Rank</em> (<code class="docutils literal notranslate"><span class="pre"></span></code>), too? <em>Rank</em> deserves its own separate <a class="reference internal" href="rank.html"><span class="doc std std-doc">section</span></a>! Oh, and <em>Scan</em> (<code class="docutils literal notranslate"><span class="pre"></span></code>), don’t forget <em>Scan</em>!</p>
<p>Let’s introduce them.</p>
<div class="cell tag_hide-output docutils container">
<div class="cell_input docutils container">
Expand Down
2 changes: 1 addition & 1 deletion contents/_build/html/searchindex.js

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion contents/_build/jupyter_execute/iteration.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
"\n",
"In order to get the best possible performance out of APL, it's worth seeking data-parallel algorithms, typically employing Boolean masks. However, it's not always possible, or sometimes performance matters less than code complexity, and a more iterative solution can be both clearer and fast enough.\n",
"\n",
"We have at least four, maybe five different kinds of iteration mechanisms at our disposal: _Each_ (`¨`), _Reduce_ (`⌿`), _Del_ (`∇`) and _Power_ (`⍣`). The fifth is that of _scalar extension_, which can either be seen as a way of achieving iteration, or as a way of _avoiding_ iteration, depending on your point of view. Wait, is it six? Maybe we should count _Rank_ (`⍤`), too? _Rank_ deserves its own separate [section](./rank.ipynb)! Oh, and _Scan_ (`⍀`), don't forget _Scan_! \n",
"We have at least four, maybe five different kinds of iteration mechanisms at our disposal: _Each_ (`¨`), _Reduce_ (`⌿`), _Del_ (`∇`) and _Power_ (`⍣`). The fifth is that of _scalar pervasion_, which can either be seen as a way of achieving iteration, or as a way of _avoiding_ iteration, depending on your point of view. Wait, is it six? Maybe we should count _Rank_ (`⍤`), too? _Rank_ deserves its own separate [section](./rank.ipynb)! Oh, and _Scan_ (`⍀`), don't forget _Scan_! \n",
"\n",
"Let's introduce them."
]
Expand Down
2 changes: 1 addition & 1 deletion contents/iteration.ipynb
Original file line number Diff line number Diff line change
Expand Up @@ -13,7 +13,7 @@
"\n",
"In order to get the best possible performance out of APL, it's worth seeking data-parallel algorithms, typically employing Boolean masks. However, it's not always possible, or sometimes performance matters less than code complexity, and a more iterative solution can be both clearer and fast enough.\n",
"\n",
"We have at least four, maybe five different kinds of iteration mechanisms at our disposal: _Each_ (`¨`), _Reduce_ (`⌿`), _Del_ (`∇`) and _Power_ (`⍣`). The fifth is that of _scalar extension_, which can either be seen as a way of achieving iteration, or as a way of _avoiding_ iteration, depending on your point of view. Wait, is it six? Maybe we should count _Rank_ (`⍤`), too? _Rank_ deserves its own separate [section](./rank.ipynb)! Oh, and _Scan_ (`⍀`), don't forget _Scan_! \n",
"We have at least four, maybe five different kinds of iteration mechanisms at our disposal: _Each_ (`¨`), _Reduce_ (`⌿`), _Del_ (`∇`) and _Power_ (`⍣`). The fifth is that of _scalar pervasion_, which can either be seen as a way of achieving iteration, or as a way of _avoiding_ iteration, depending on your point of view. Wait, is it six? Maybe we should count _Rank_ (`⍤`), too? _Rank_ deserves its own separate [section](./rank.ipynb)! Oh, and _Scan_ (`⍀`), don't forget _Scan_! \n",
"\n",
"Let's introduce them."
]
Expand Down

0 comments on commit b25931d

Please sign in to comment.