diff options
| author | Mark Summerfield <mark@qtrac.eu> | 2017-03-14 14:07:45 +0000 |
|---|---|---|
| committer | Andreas Rumpf <rumpf_a@web.de> | 2017-03-14 15:07:45 +0100 |
| commit | 0510c0cecefb50dedd691de82151bc629b35d816 (patch) | |
| tree | cede4512d90e0dc876e688d7c33ec0fdac1844b0 | |
| parent | 3eff1b776533019e3e69b18f4ad06aa54438e761 (diff) | |
| download | Nim-0510c0cecefb50dedd691de82151bc629b35d816.tar.gz | |
Mentioned that critbits is sorted... (#5524)
Having a lexicographically sorted collection is a big benefit (I asked GvR years ago to add one to Python but it was no then and seems to be no now!). Anyone looking for a such a collection could easily miss the critbits model because very few people have heard of them (according to Wikipedia most people in a ration of approx 750:1 know them as radix trees: https://en.wikipedia.org/wiki/Talk%3ACrit_bit_tree).
| -rw-r--r-- | doc/lib.rst | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/lib.rst b/doc/lib.rst index b43f295ef..ea43c0db9 100644 --- a/doc/lib.rst +++ b/doc/lib.rst @@ -84,7 +84,7 @@ Collections and algorithms Efficient implementation of a set of ints as a sparse bit set. * `critbits <critbits.html>`_ This module implements a *crit bit tree* which is an efficient - container for a set or a mapping of strings. + container for a sorted set of strings, or for a sorted mapping of strings. * `sequtils <sequtils.html>`_ This module implements operations for the built-in seq type which were inspired by functional programming languages. |