2 unstable releases

Uses old Rust 2015

0.1.0 Jul 18, 2017
0.0.1 Jun 14, 2017

#58 in #collections

Download history 22/week @ 2023-02-13 23/week @ 2023-02-20 19/week @ 2023-02-27 9/week @ 2023-03-06 15/week @ 2023-03-13 17/week @ 2023-03-20 14/week @ 2023-03-27 17/week @ 2023-04-03 21/week @ 2023-04-10 14/week @ 2023-04-17 13/week @ 2023-04-24 19/week @ 2023-05-01 19/week @ 2023-05-08 15/week @ 2023-05-15 14/week @ 2023-05-22 14/week @ 2023-05-29

64 downloads per month




Rudy is a Judy array implementation in Rust. Judy arrays are highly efficient word-to-word or word-to-bool maps that adapt well to different data. The reference Judy array implementation provides a word to word map (JudyL), set of words (Judy1), string to word (JudySL) and fixed length byte array to word map (JudyHS). Judy arrays use a compressed 256-radix trie.

The initial Rudy implementation will implement JudyL as RudyMap and Judy1 as RudySet. Because zero sized types can be represented by a RudyMap, it will be trivial to represent RudySet as a wrapper around a RudyMap<T, ()>. Future iterations may include JudySL and JudyHS support.

Differences between Judy and Rudy

Rudy appears to be the first implementation to use generics in the core library. The judy-template bindings for C++ allow for automatic conversion to and from words, but not use of values that need larger storage. Using generics allows for lower memory usage for smaller types and the usage of larger types, with possible impact to performance.


  • General library structure
  • Top-level root nodes
    • Leaf1
    • Leaf2
    • VecLeaf
  • JPM
    • Linear Leaf
    • Bitmap Leaf
    • Bitmap Branch
    • Linear Branch
    • Uncompressed Branch
  • Insertion
  • Get
  • Remove
  • Memory used
  • Shrink
  • Iterators


Rudy is dual licensed under the MIT and Apache-2.0 licenses.