diff options
| author | Marshall Lochbaum <mwlochbaum@gmail.com> | 2020-12-02 14:45:59 -0500 |
|---|---|---|
| committer | Marshall Lochbaum <mwlochbaum@gmail.com> | 2020-12-02 15:06:12 -0500 |
| commit | 55c40e75dde0ddad39a305f29e036ec88c85babe (patch) | |
| tree | 3475a3c3e600227468828c507a241763e58f2085 /doc/based.md | |
| parent | 1b8aab1ebfc36888d58d5347f7723e4bd1c5031c (diff) | |
Move problems.md to commentary folder
Diffstat (limited to 'doc/based.md')
| -rw-r--r-- | doc/based.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/based.md b/doc/based.md index b9c5d3e9..83fe74e8 100644 --- a/doc/based.md +++ b/doc/based.md @@ -46,7 +46,7 @@ Nested array theory can seem simpler to use, because the programmer never has to A property that might warn about dangerous issues like this is that nested array theory tends to create *inversions* where the depth of a particular array depends on its rank (reversing the normal hierarchy of depth→rank→shape). A 1-character string has depth 1, but when its rank is reduced to 0, its depth is reduced as well. -In some cases nested array theory can remove a depth issue entirely, and not just partially. Most notable is the [search function result depth](../problems.md#search-function-depth) issue, in which it's impossible for a search function in BQN to return an atomic number because it always returns an array. Nested array theory doesn't have this issue since a scalar number is "just a number", and more complicated arrays can't cause problems because a search function's result is always a numeric array. The other half of the problem, about the non-principal argument depth, is only partly hidden, and causes problems for example when searching for a single string out of a list of strings. +In some cases nested array theory can remove a depth issue entirely, and not just partially. Most notable is the [search function result depth](../commentary/problems.md#search-function-depth) issue, in which it's impossible for a search function in BQN to return an atomic number because it always returns an array. Nested array theory doesn't have this issue since a scalar number is "just a number", and more complicated arrays can't cause problems because a search function's result is always a numeric array. The other half of the problem, about the non-principal argument depth, is only partly hidden, and causes problems for example when searching for a single string out of a list of strings. ## Versus the boxed array model |