From 0510c0cecefb50dedd691de82151bc629b35d816 Mon Sep 17 00:00:00 2001 From: Mark Summerfield Date: Tue, 14 Mar 2017 14:07:45 +0000 Subject: 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). --- doc/lib.rst | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'doc') 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 `_ 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 `_ This module implements operations for the built-in seq type which were inspired by functional programming languages. -- cgit 1.4.1-2-gfad0 rtik/teliva/log/src/lmem.c'>log blame commit diff stats
path: root/src/lmem.c
blob: ae7d8c965f6e996e77ab51bb7598d4f544a0e539 (plain) (tree) 
74f8cd1






















































































1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86