An unordered data-structure with O(1) lookup, removal, iteration and O(1) amortized insertion.
Like a faster HashMap that chooses its own keys.
Also similar to a Vec<Option<T>>, where instead of calling Vec::remove elements are removed by setting the element to None.
See the documentation for more information.
This crate is partly a port of plf::colony, which is a
proposed addition
to the C++ standard library under the name std::hive.
```rust let mut colony = Colony::new();
// Insert let foohandle = colony.insert("foo"); let barhandle = colony.insert("bar");
// Remove asserteq!(colony.remove(foohandle), Some("foo"));
// Lookup asserteq!(colony.get(foohandle), None); asserteq!(colony.get(barhandle), Some(&"bar"));
// Iteration for (key, &value) in colony.iter() { asserteq!((key, value), (barhandle, "bar")); } ```