From ef05f1499a8b6509b50376ef12308fd32c3cbcb2 Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Fri, 16 Jul 2021 08:57:20 -0400 Subject: Typo --- doc/search.md | 2 +- docs/doc/search.html | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/doc/search.md b/doc/search.md index 2e85c69d..266bd484 100644 --- a/doc/search.md +++ b/doc/search.md @@ -95,7 +95,7 @@ Progressive Index of (`⊒`), as the name and glyph suggest, is a more sophistic "aaabb" ⊒ "ababababab" -Above we said that `𝕩∊𝕨` is `(𝕨⊐𝕩)<≠𝕨`, so that `⊐˜<≠∘⊢` is an implementation of Member of. The corresponding `⊒˜<≠∘⊢` implements *progressive* member of, that is, membership on [multisets](https://en.wikipedia.org/wiki/Multiset). So if `𝕩` contains two copies of `'a'`, only the first to instances of `'a'` in `𝕨` are considered to belong to it. And like membership is useful for set intersection and difference, progressive membership gives multiset versions of these. +Above we said that `𝕩∊𝕨` is `(𝕨⊐𝕩)<≠𝕨`, so that `⊐˜<≠∘⊢` is an implementation of Member of. The corresponding `⊒˜<≠∘⊢` implements *progressive* member of, that is, membership on [multisets](https://en.wikipedia.org/wiki/Multiset). So if `𝕩` contains two copies of `'a'`, only the first two instances of `'a'` in `𝕨` are considered to belong to it. And like membership is useful for set intersection and difference, progressive membership gives multiset versions of these. "aabbcc" (⊐˜<≠∘⊢) "baa" diff --git a/docs/doc/search.html b/docs/doc/search.html index a44c3fc0..20b19ac7 100644 --- a/docs/doc/search.html +++ b/docs/doc/search.html @@ -168,7 +168,7 @@ "aaabb" "ababababab" ⟨ 0 3 1 4 2 5 5 5 5 5 ⟩ -

Above we said that 𝕩𝕨 is (𝕨𝕩)<≠𝕨, so that ˜<≠ is an implementation of Member of. The corresponding ˜<≠ implements progressive member of, that is, membership on multisets. So if 𝕩 contains two copies of 'a', only the first to instances of 'a' in 𝕨 are considered to belong to it. And like membership is useful for set intersection and difference, progressive membership gives multiset versions of these.

+

Above we said that 𝕩𝕨 is (𝕨𝕩)<≠𝕨, so that ˜<≠ is an implementation of Member of. The corresponding ˜<≠ implements progressive member of, that is, membership on multisets. So if 𝕩 contains two copies of 'a', only the first two instances of 'a' in 𝕨 are considered to belong to it. And like membership is useful for set intersection and difference, progressive membership gives multiset versions of these.

↗️
    "aabbcc" (˜<≠) "baa"
 ⟨ 1 1 1 1 0 0 ⟩
 
-- 
cgit v1.2.3