VebTree is a production-quality Van Emde Boas tree implementation providing O(log log U) time complexity for insert, delete, search, successor, and predecessor operations on integer sets. The core algorithm is implemented in C++17 for maximum performance with an idiomatic Ruby API. Perfect for applications requiring fast integer set operations, range queries, and successor/predecessor lookups within a bounded universe.
Required Ruby Version
>= 2.7.0
Authors
pixelcaliber
Versions
-
0.1.2
-
source
- 0.1.2 source January 04, 2026 (12.5 KB)
-
-
0.1.1
-
source
- 0.1.1 source October 03, 2025 (12.5 KB)
-
-
0.1.0
-
source
- 0.1.0 source October 03, 2025 (12 KB)
-
