Download
SortedSet NIF is a performant and reliable sorted set data structure for Elixir, implemented in Rust using the Rustler crate to take advantage of native performance while maintaining seamless integration with the BEAM ecosystem. It provides ordering and uniqueness guarantees, with all terms stored according to Elixir’s built-in sorting rules. Internally, it uses a vector of vectors layout rather than a single vector to minimize costly reallocations, allowing efficient bucket pointer copying instead of expensive term copying during growth. This design achieves a balance between performance and simplicity, and developers can customize bucket sizes for specific workloads, with a default of 500 offering solid performance across common scenarios. SortedSet extends beyond traditional set semantics by providing indexing, random access, and slice operations thanks to its deterministic ordering.
Features
- SortedSet implementation following Elixir sorting rules
- Guarantees uniqueness (no duplicate items)
- Supports index reporting when adding/removing items
- Provides random access to items and slices
- Optimized with Rustler crate for high-performance NIF integration
- Customizable bucket sizes for performance tuning
Project Samples
