[−][src]Crate beach_map
A BeachMap is actually a SlotMap, a data structure used to store elements and access them with an id.
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]);
You shouldn't assume the order of the elements as any removing operation will shuffle them.
Structs
BeachMap | |
FilterOut | |
ID | Handle to a value inside the BeachMap. |
IterID | |
IterMutID |
Type Definitions
DefaultVersion |