Expand description
Immutable Radix Tree
Porting Go’s go-immutable-radix to Rust. Provides the iradix package that implements an immutable radix tree.
English | 简体中文
Introduction
The package only provides a single Tree implementation, optimized for sparse nodes.
As a radix tree, it provides the following:
-
O(k)operations. In many cases, this can be faster than a hash table since the hash function is anO(k)operation, and hash tables have very poor cache locality. -
Minimum / Maximum value lookups
-
Ordered iteration
A tree supports using a transaction to batch multiple updates (insert, delete) in a more efficient manner than performing each operation one at a time.
Installation
[dependencies]
iradix = "0.1"
License
immuradix is under the terms of both the MIT license and the
Apache License (Version 2.0).
See LICENSE-APACHE, LICENSE-MIT for details.
Copyright (c) 2023 Al Liu.