aboutsummaryrefslogtreecommitdiff
path: root/doc/search.md
diff options
context:
space:
mode:
authorMarshall Lochbaum <mwlochbaum@gmail.com>2021-11-12 22:15:44 -0500
committerMarshall Lochbaum <mwlochbaum@gmail.com>2021-11-12 22:15:44 -0500
commit59ab5338d4e23eb108a43f876aa979238ae2490e (patch)
tree616acd22834a1aa42b030a0a28e024df43683dd8 /doc/search.md
parent3a5c72c7a3457560be2ca4a837eb5491e5b9e8b6 (diff)
Slightly less APL-centric documentation
Diffstat (limited to 'doc/search.md')
-rw-r--r--doc/search.md4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/search.md b/doc/search.md
index 5a093dc7..7c0aa7dd 100644
--- a/doc/search.md
+++ b/doc/search.md
@@ -71,7 +71,7 @@ Member of can be used in a [train](train.md) to compute the set intersection and
"initial set" (¬∘∊/⊣) "difference" # Remove 𝕩
-These are the APL functions Intersect (`∩`) and Without (`~`). Really, only `𝕩` is treated like a set, while the ordering and multiplicity of elements of `𝕨` are maintained. I think the explicit implementations show this well, since `𝕩` is only used as the right argument to `∊`, and prefer this clarity to the brevity of a single symbol.
+These functions appear in APL as Intersect (`∩`) and Without (`~`). Really, only `𝕩` is treated like a set, while the ordering and multiplicity of elements of `𝕨` are maintained. I think the explicit implementations show this well, since `𝕩` is only used as the right argument to `∊`, and prefer this clarity to the brevity of a single symbol.
## Index of
@@ -103,7 +103,7 @@ Above we said that `𝕩∊𝕨` is `(𝕨⊐𝕩)<≠𝕨`, so that `⊐˜<≠
"aabbcc" ((⊒˜=≠∘⊢)/⊣) "baa" # Multiset difference
-This primitive gives an interesting way to implement the [ordinals](order.md#ordinals) pattern that might be easier to understand than the APL classic `⍋⍋` (it's probably a little slower though). The idea is to use the sorted array as the left argument to `⊒`. Now the index returned for each cell is just where it ended up in that sorted order. If we used ordinary Index of then equal cells would share the smallest index; Progressive Index of means ties are broken in favor of earlier cells.
+This primitive gives an interesting way to implement the [ordinals](order.md#ordinals) pattern that might be easier to understand than the classic `⍋⍋` (it's probably a little slower though). The idea is to use the sorted array as the left argument to `⊒`. Now the index returned for each cell is just where it ended up in that sorted order. If we used ordinary Index of then equal cells would share the smallest index; Progressive Index of means ties are broken in favor of earlier cells.
⍋∘⍋ "adebcedba"