aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorMarshall Lochbaum <mwlochbaum@gmail.com>2020-06-16 14:23:09 -0400
committerMarshall Lochbaum <mwlochbaum@gmail.com>2020-06-16 14:23:09 -0400
commit2e5d8f82a7d304950812e097f96cb78ca41fd6e9 (patch)
tree0af6e8dd3d002fd9d2ae970d87fd01fa82dd6e65
parentaba1bd9d694f6551d6db00b71d2df560ee0f5df7 (diff)
Rename Count to Length
-rw-r--r--README.md2
-rw-r--r--problems.md2
2 files changed, 2 insertions, 2 deletions
diff --git a/README.md b/README.md
index d890f976..6747bb4e 100644
--- a/README.md
+++ b/README.md
@@ -107,7 +107,7 @@ Functions that have significant differences from APL functions are marked with a
| `>` | [Unbox](https://aplwiki.com/wiki/Mix) | [Greater Than](https://aplwiki.com/wiki/Greater_than)
| `≥` | | [Greater Than or Equal to](https://aplwiki.com/wiki/Greater_than_or_Equal_to)
| `=` | | [Equals](https://aplwiki.com/wiki/Equal_to)
-| `≠` | [Count](https://aplwiki.com/wiki/Tally) | [Not Equals](https://aplwiki.com/wiki/Not_Equal_to)
+| `≠` | [Length](https://aplwiki.com/wiki/Tally) | [Not Equals](https://aplwiki.com/wiki/Not_Equal_to)
| `≡` | [Depth](https://aplwiki.com/wiki/Depth) | [Match](https://aplwiki.com/wiki/Match)
| `≢` | [Shape](https://aplwiki.com/wiki/Shape) | [Not Match](https://aplwiki.com/wiki/Not_Match)
| `⊣` | [Identity](https://aplwiki.com/wiki/Identity) | [Left](https://aplwiki.com/wiki/Identity)
diff --git a/problems.md b/problems.md
index d65d3e2d..76802057 100644
--- a/problems.md
+++ b/problems.md
@@ -108,7 +108,7 @@ Boolean And (`∧`) and Or (`∨`) are identical to Min (`⌊`) and Max (`⌈`)
The other drawback of Min (`∧`) and Max (`∨`) is that the symbols are counterintuitive, but I have found a way to remember them: consider the graph of variables `a←x` and `b←¬x` for x from 0 to 1: two crossed lines. Now the graph of `a∧b` is a caret shape and `a∨b` is a vee.
### Acting on windows can be awkward
-When taking Windows along more than one axis, acting on the resulting array requires the Rank operator, duplicating either the right argument rank or (negated) left argument count. A nested Windows would only require Each.
+When taking Windows along more than one axis, acting on the resulting array requires the Rank operator, duplicating either the right argument rank or (negated) left argument length. A nested Windows would only require Each.
### Group doesn't include trailing empty groups
But there are workarounds, described in [its documentation](doc/group.md). dzaima has suggested allowing a single extra element in the index argument to specify the result shape. Another possibility is for the result prototype to be specified to allow overtaking.