5 unstable releases

0.3.0 Jun 6, 2024
0.2.1 Apr 24, 2020
0.1.2 Mar 30, 2019
0.1.1 Mar 30, 2019
0.1.0 Mar 30, 2019

#364 in Data structures

Download history 99/week @ 2024-08-24 25/week @ 2024-08-31 58/week @ 2024-09-07 94/week @ 2024-09-14 71/week @ 2024-09-21 160/week @ 2024-09-28 136/week @ 2024-10-05 158/week @ 2024-10-12 62/week @ 2024-10-19 111/week @ 2024-10-26 74/week @ 2024-11-02 16/week @ 2024-11-09 130/week @ 2024-11-16 65/week @ 2024-11-23 23/week @ 2024-11-30 55/week @ 2024-12-07

276 downloads per month
Used in 2 crates

MIT/Apache

46KB
970 lines

BeachMap

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

LICENSE LICENSE Crates.io Documentation

Example:

use beach_map::BeachMap;

let mut beach = BeachMap::new();
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(0..4);

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

Rayon

To use rayon with beach_map, you need rayon in your dependencies and add the parallel feature to beach_map.

Example:

use beach_map::BeachMap;
use rayon::prelude::*;

let mut beach = BeachMap::new();
let ids = beach.extend(0..500);

beach.par_iter_mut().for_each(|x| {
    *x *= 2;
});

for i in 0..ids.len() {
    assert_eq!(beach[ids[i]], i * 2);
}

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

~0–425KB