judy ☆
« Back to VersTracker
Description:
State-of-the-art C library that implements a sparse dynamic array
Type: Formula  |  Tracked Since: Dec 28, 2025
Links: Homepage  |  formulae.brew.sh
Category: Developer tools
Tags: c-library data-structures sparse-array performance memory-efficiency
Install: brew install judy
About:
Judy is a high-performance C library that implements a sparse dynamic array, also known as a Judy array. It provides an interface similar to a C pointer array but offers exceptional memory efficiency and speed for large, sparse datasets. Its primary value is replacing traditional arrays and hash tables in applications requiring fast insert, search, and delete operations on huge integer or string key spaces.
Key Features:
  • Memory efficient for sparse data
  • High performance for insert, search, and delete
  • Simple C pointer-like API
  • Handles both integer and string keys
Use Cases:
  • High-performance networking equipment for packet routing and classification
  • Large-scale database indexing and storage engines
  • Memory-constrained embedded systems
Alternatives:
  • Hash Table (e.g., Glib GHashTable) – Hash tables are more general but often use more memory and have less predictable performance than Judy arrays for integer keys.
  • Red-Black Tree – Balanced binary trees offer similar O(log n) performance but typically have higher overhead per node compared to Judy's compressed node structure.
Version History
Detected Version Rev Change Commit
Sep 11, 2025 4:28am 0 VERSION_BUMP 42d40011
Oct 22, 2024 12:01am 0 VERSION_BUMP 904db189
« Back to VersTracker  |  Browse Packages  |  About