Programming with Judy

About Judy
When To Use Judy
Chapter 1 13
In summary
Judy can replace many commonly used data structures: arrays,
sparse arrays, hash tables, B-trees, binary trees, linear lists,
skiplists, and counting functions. Judy is designed to:
❏ Scale dynamically for future program requirements.
❏ Handle large, unbounded array structures particularly well with
performance that is almost linear across large populations.
❏ Provide fast, built-in sorting and counting.
❏ Increase productivity through an easy-to-use API.