From c8ba488d6e1c9bca9c67bcb21162656dd0852bd7 Mon Sep 17 00:00:00 2001 From: Charles Blake Date: Tue, 16 Apr 2024 06:43:30 -0400 Subject: [PATCH] Slight improvement to module doc comment. --- adix/bist.nim | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/adix/bist.nim b/adix/bist.nim index 6656c99..9f48567 100644 --- a/adix/bist.nim +++ b/adix/bist.nim @@ -1,6 +1,6 @@ ## Binary Indexed Sum Tree (BIST); Invented by P.Fenwick in 1994. { Fenwick ## proposed "BIT" but that A) collides with many uses, B) takes partial sums as -## implied, while the trick applies more broadly (e.g.products), and C) does not +## implied, but explicit is better (though products could work), and C) does not ## rhyme with "dist" (for distribution, which is what this is mostly about). } ## While the Internet has many tutorials, to my knowledge, no one (yet) collects ## these algorithms all in one place. Fenwick1994 itself messed up on what we