Programming with Judy

Index
67
Numerics
10-way digital tree
, 15
A
advantages (of Judy)
, 15
algorithms
counting, 27
search and retrieval, 17
sorting, 26
arrays
binary
, 28
dynamic, 11, 16, 25
in Judy, 11, 25, 59
in memory, 62
Judy1, 28
JudyL, 33
JudySL, 44
multi-dimensional, 44, 49
sparse, 11
unbounded, 9, 11
B
big O notation
, 10
Boolean values, 28
C
caching
, 61
cache line fills, 17, 61
CPU, 61
curve, 61
defined, 61
in Judy, 62
counting, 10, 11, 17, 27
CPU caching, 61
D
data structures, 10, 15
digital trees, 15, 59
in memory, 17
definition of Judy, 9
digital trees, 15, 59
nodes in, 17
E
examples
digital trees
, 15
Judy1 array, 29
JudyL array, 34
JudySL array, 45
multi-dimensional arrays, 49
zip code, 15
H
history (of Judy)
, 12, 59
HP-UX, 12, 49
hybrid digital tree, 16
I
indexes (Judy tree), 17
J
Judy header file
, 25
Judy technology
advantages, 15
array types, 11
defined, 9
history, 12
libraries, 12
memory requirements, 9
name, 60
overview, 9
performance, 10, 11, 12
scalability, 10, 11
summary of functions, 25
unbounded arrays, 9, 11
when to use, 11
Judy tree structure
count, 17
indexes, 17
pointers, 17
type, 17
Judy1 array
counting
, 27
defined, 11
examples, 29
table of functions, 28
using, 28, 44
JudyL array
counting
, 27
defined, 11
examples, 34
table of functions, 33
using, 33
JudySL array
defined
, 11
examples, 45
sorting, 26