Crate data_registry

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;

Structs

• IntoIter
  An owning iterator over the entries of Registry<T>. Item type is (usize, T)
• IntoValues
  An owning iterator over the values of Registry<T>. Item type is T.
• Iter
  A reference iterator over the entries of Registry<T>. Item type is (usize, &T)
• IterMut
  A mutable reference iterator over the entries of Registry<T>. Item type is (usize, &mut T)
• Keys
  An iterator over the keys of Registry<T>. Item type is usize.
• Registry
  An unordered, growable map type with heap-allocated contents, written as Registry<T>.
• Values
  A reference iterator over the values of Registry<T>. Item type is &T.
• ValuesMut
  A mutable reference iterator over the values of Registry<T>. Item type is &mut T.