diff options
| -rw-r--r-- | docs/problems.html | 2 | ||||
| -rw-r--r-- | problems.md | 2 |
2 files changed, 2 insertions, 2 deletions
diff --git a/docs/problems.html b/docs/problems.html index 761117a1..9469d9dd 100644 --- a/docs/problems.html +++ b/docs/problems.html @@ -26,7 +26,7 @@ <h3 id="hard-to-search-part-of-an-array-or-in-a-different-order">Hard to search part of an array or in a different order</h3> <p>This includes index-of-last, and searching starting at a particular index, when the desired result indices are to the array to be seached <em>before</em> it is modified. Given indices <code><span class='Value'>i</span></code> into an array <code><span class='Value'>๐จ</span></code> (for example <code><span class='Function'>โฝโโ </span><span class='Value'>๐จ</span></code> or <code><span class='Value'>a</span><span class='Function'>+โ</span><span class='Value'>b</span></code>), this section can be searched with <code><span class='Paren'>(</span><span class='Value'>i</span><span class='Function'>โพโ </span><span class='Value'>๐จ</span><span class='Paren'>)</span><span class='Function'>โ</span><span class='Modifier'>ห</span><span class='Paren'>(</span><span class='Value'>i</span><span class='Function'>โ</span><span class='Value'>๐จ</span><span class='Paren'>)</span><span class='Function'>โ</span><span class='Value'>๐ฉ</span></code>. But this is clunky and difficult for the implementation to optimize.</p> <h3 id="subtraction-division-and-span-are-backwards">Subtraction, division, and span are backwards</h3> -<p>The left argument feels much more like the primary one in these cases (indeed, this matches the typical left-to-right ordering of binary operators in mathematics). Not really fixable; too much precedent.</p> +<p>The left argument feels much more like the primary one in these cases (indeed, this matches the typical left-to-right ordering of binary operators in mathematics). The commonly-paired <code><span class='Function'>โ</span><span class='Modifier2'>โ</span><span class='Function'>รท</span></code> and <code><span class='Function'>|</span></code> have opposite orders for this reason. Not really fixable; too much precedent.</p> <h3 id="nothing--interacts-strangely-with-before-and-after">Nothing (<code><span class='Nothing'>ยท</span></code>) interacts strangely with Before and After</h3> <p>Since <code><span class='Value'>๐จ</span><span class='Function'>F</span><span class='Modifier2'>โธ</span><span class='Function'>G</span><span class='Value'>๐ฉ</span></code> is <code><span class='Paren'>(</span><span class='Function'>F</span><span class='Value'>๐จ</span><span class='Paren'>)</span><span class='Function'>G</span><span class='Value'>๐ฉ</span></code> and <code><span class='Value'>๐จ</span><span class='Function'>F</span><span class='Modifier2'>โ</span><span class='Function'>G</span><span class='Value'>๐ฉ</span></code> is <code><span class='Value'>๐จ</span><span class='Function'>F</span> <span class='Function'>G</span><span class='Value'>๐ฉ</span></code> in the dyadic case, we might expect these to devolve to <code><span class='Function'>G</span><span class='Value'>๐ฉ</span></code> and <code><span class='Function'>F</span> <span class='Function'>G</span><span class='Value'>๐ฉ</span></code> when <code><span class='Value'>๐จ</span></code> is not present. Not so: instead <code><span class='Value'>๐ฉ</span></code> is substituted for the missing <code><span class='Value'>๐จ</span></code>. And Before and After are also the main places where a programmer might try to use <code><span class='Value'>๐จ</span></code> as an operand, which doesn't work either (the right way is the train <code><span class='Value'>๐จ</span><span class='Function'>Fโข</span></code>).</p> <h3 id="cant-access-array-ordering-directly">Can't access array ordering directly</h3> diff --git a/problems.md b/problems.md index 5bd7aa90..34f7de67 100644 --- a/problems.md +++ b/problems.md @@ -34,7 +34,7 @@ If you include multiple multi-line functions in what would otherwise be a one-li This includes index-of-last, and searching starting at a particular index, when the desired result indices are to the array to be seached *before* it is modified. Given indices `i` into an array `๐จ` (for example `โฝโโ ๐จ` or `a+โb`), this section can be searched with `(iโพโ ๐จ)โห(iโ๐จ)โ๐ฉ`. But this is clunky and difficult for the implementation to optimize. ### Subtraction, division, and span are backwards -The left argument feels much more like the primary one in these cases (indeed, this matches the typical left-to-right ordering of binary operators in mathematics). Not really fixable; too much precedent. +The left argument feels much more like the primary one in these cases (indeed, this matches the typical left-to-right ordering of binary operators in mathematics). The commonly-paired `โโรท` and `|` have opposite orders for this reason. Not really fixable; too much precedent. ### Nothing (`ยท`) interacts strangely with Before and After Since `๐จFโธG๐ฉ` is `(F๐จ)G๐ฉ` and `๐จFโG๐ฉ` is `๐จF G๐ฉ` in the dyadic case, we might expect these to devolve to `G๐ฉ` and `F G๐ฉ` when `๐จ` is not present. Not so: instead `๐ฉ` is substituted for the missing `๐จ`. And Before and After are also the main places where a programmer might try to use `๐จ` as an operand, which doesn't work either (the right way is the train `๐จFโข`). |