radix_trees 0.2.0

Various radix tree (trie) data structures.
Documentation
  • Coverage
  • 100%
    46 out of 46 items documented1 out of 24 items with examples
  • Size
  • Source code size: 97.85 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 10.91 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 22s Average build duration of successful builds.
  • all releases: 19s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • ajambrose/radix_trees
    5 0 0
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • ajambrose

Radix Trees

This is an implementation of various types of radix trees in Rust.

Overview

radix_trees currently provides a Patricia tree implementation, PTreeMap. This allows associative storage of common-prefix keys with arbitrary values. See the documentation for more information.

no_std

radix_trees is no_std with alloc by default, and doesn't currently require an std trait to enable additional functionality.

Cargo Features

  • zerocopy: radix_trees enables the zerocopy feature by default (and therefore depends on zerocopy). This feature can optionally be disabled, with a reduced default set of supported key types and no helper macro to implement the key trait using zerocopy.

Versioning

Until radix_trees reaches version 1.0, breaking changes may occur every minor release (0.X -> 0.Y). Patch releases (0.A.X -> 0.A.Y) will only contain new APIs, unit tests, or bug fixes.