From c5eef0418df2ae6a97c54839fa010ff60d96f78b Mon Sep 17 00:00:00 2001 From: Marshall Lochbaum Date: Sat, 8 Jan 2022 16:14:51 -0500 Subject: =?UTF-8?q?Add=20error=20messages=20to=20generated=20markdown=20do?= =?UTF-8?q?cs=20with=20=E2=80=A2CurrentError=20(fixes=20#22)?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- docs/doc/order.html | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) (limited to 'docs/doc/order.html') diff --git a/docs/doc/order.html b/docs/doc/order.html index bd13f64a..1916167d 100644 --- a/docs/doc/order.html +++ b/docs/doc/order.html @@ -88,9 +88,9 @@

The two Bins functions are written with the same symbols ⍋ and ⍒ as Grade, but take two arguments instead of one. More complicated? A little, but once you understand Bins you'll find that it's a basic concept that shows up in the real world all the time.

Bins behaves like a search function with respect to rank: it looks up cells from 𝕩 relative to major cells of 𝕨. However, there's an extra requirement: the left argument to Bins is already sorted according to whichever ordering is used. If it isn't, you'll get an error.

↗️
    5‿6‿2‿4‿1 ⍋ 3
-ERROR
+Error: ⍋: 𝕨 must be sorted
     0‿3‿4‿7‿9 ⍒ 3
-ERROR
+Error: ⍒: 𝕨 must be sorted in descending order

Given this, the simplest definition of 𝕨⍋𝕩 (or 𝕨⍒𝕩) is that for each cell in 𝕩 of rank (=𝕨)-1, it counts the number of major cells from 𝕨 that come earlier in the ordering, or match that cell.

Why would that be useful? How about an example. A pinball machine has some high scores on it. You play, and your rank is the number of scores higher than yours (in this case, if you tie someone's score, you won't unseat them).

-- cgit v1.2.3