#slotmap #beachmap

beach_map

Implementation of a slotmap

3 releases

✓ Uses Rust 2018 edition

0.1.2 Mar 30, 2019
0.1.1 Mar 30, 2019
0.1.0 Mar 30, 2019

#266 in Data structures

30 downloads per month
Used in 2 crates

MIT/Apache

45KB
854 lines

BeachMap

A BeachMap is actually a SlotMap, a data structure used to store elements and access them with an id.

LICENSE LICENSE Crates.io Documentation

Exemple:

use beach_map::BeachMap;

let mut beach = BeachMap::default();
let id1 = beach.insert(1);
let id2 = beach.insert(2);

assert_eq!(beach.len(), 2);
assert_eq!(beach[id1], 1);

assert_eq!(beach.remove(id2), Some(2));
assert_eq!(beach.get(id2), None);
assert_eq!(beach.len(), 1);

beach[id1] = 7;
assert_eq!(beach[id1], 7);

beach.extend(vec![1, 2, 3]);

assert_eq!(beach.data(), [7, 1, 2, 3]);

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

Dependencies

~235KB