jyapayne/Nim
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Mentioned that critbits is sorted... (#5524)

Browse source 
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).
This commit is contained in:
Mark Summerfield 2017-03-14 14:07:45 +00:00 • committed by Andreas Rumpf
commit 0510c0cece
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
doc/lib.rst
View file

@ -84,7 +84,7 @@ Collections and algorithms
Efficient implementation of a set of ints as a sparse bit set. Efficient implementation of a set of ints as a sparse bit set.
* `critbits <critbits.html>`_ * `critbits <critbits.html>`_
This module implements a *crit bit tree* which is an efficient 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>`_ * `sequtils <sequtils.html>`_
This module implements operations for the built-in seq type This module implements operations for the built-in seq type
which were inspired by functional programming languages. which were inspired by functional programming languages.