data_registry 2.0.0

An unordered data structure with immediate insertion, removal and access.
Documentation
  • Coverage
  • 100%
    30 out of 30 items documented5 out of 30 items with examples
  • Size
  • Source code size: 29.49 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 7.35 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Ø build duration
  • this release: 14s Average build duration of successful builds.
  • all releases: 18s Average build duration of successful builds in releases after 2024-10-23.
  • Links
  • Repository
  • crates.io
  • Dependencies
  • Versions
  • Owners
  • SmakoszJan

This library exports an unordered, growable map type with heap-allocated contents, written as Registry<T>. All contained values have their unique indices attributed to them at the point of insertion. Indices are freed when the items are removed.

Registries have O(1) indexing, O(1) removal and O(1) insertion.

Examples

You can explicitly create a Registry with Registry::new:

let r: Registry<i32> = Registry::new();

You can [insert] values into the registry:

let mut r = Registry::new();
let index = r.insert(3);

Removing values works in much the same way:

let mut r = Registry::new();

let index = r.insert(3);
let three = r.remove(index);

Registries also support indexing (through the Index and IndexMut traits):

let mut r = Registry::new();
let i1 = r.insert(1);
let i2 = r.insert(4);

let one = r[i1];
r[i2] = r[i2] + 5;

The Registry type also exposes a full iterator API, so it can be used just like any other Rust container.