#slot-map #multi-agent-systems #generational #reference #genvec

nightly hexga_generational

GenVec, ideal for MAS (Multi-Agent System), where each agent can be removed at any time and has references to other agents

14 releases

Uses new Rust 2024

0.0.10-beta.16 Jun 1, 2025
0.0.10-beta.13 May 29, 2025
0.0.10-beta.3 Apr 20, 2025
0.0.10-beta.1 Mar 31, 2025

#1438 in Rust patterns

Download history 454/week @ 2025-03-25 218/week @ 2025-04-01 76/week @ 2025-04-08 137/week @ 2025-04-15 21/week @ 2025-04-22 3/week @ 2025-04-29 394/week @ 2025-05-06 381/week @ 2025-05-13 135/week @ 2025-05-20 458/week @ 2025-05-27 74/week @ 2025-06-03

1,246 downloads per month
Used in 4 crates (via hexga)

MIT/Apache

165KB
3K SLoC

🚧 Warning: Experimental Crate! 🚧

This crate is currently in beta and experimental.
It is subject to breaking changes in future releases.
Use it at your own risk, and keep in mind that the API may change in future versions.

HexGa Generational

Provide, GenVec, a generational index-based vector for and efficient element storage and retrieval, ideal for MAS (Multi-Agent System), where each agent can be removed at any time and has references to other agents.

Provides a stable GenID for each inserted element.

  • insert() in O(1)
  • get()/get_mut() in O(1), (no hashing)
  • remove() in O(1)
  • iteration over elements O(<max_slot_capacity>) >= O(N).

A GenID is just a pair of integer (index : usize, generation : Gen), where you choose the precision of the Generation.

By default GenVen<T> and GenId<T> use u32 bits generation, but you can change it by using the full type GenVecOf<T,Gen>, GenIdOf<T,Gen>.

Contrary to slotmap, once the generation reach the max value, the slot of a GenVen<T> will be saturated and not reused by default. (Read the #Choose your policy ! for more information!)

Example

let mut entities = GenVec::new();
let enemy = entities.insert("zoombie");

assert_eq!(enemy.get(&entities), Some(&"zoombie"));
assert_eq!(entities[enemy], "zoombie");
assert!(entities.get(enemy).is_some());

entities.remove(enemy); // the key is no longer valid
assert!(entities.get(enemy).is_none()); // the value don't exist

entities.insert("slime");
entities.insert("skeleton");

for (id, entity) in entities
{
    println!("{:?} => {}", id, entity)
}

Choose your policy !

By default, slots have a saturated behavior. This means that once the generation reaches the maximum index, the slot becomes invalid and will not be reused.

Inside this crate, GenVec is a type alias for type GenVec<T> = GenVecOf<T,u32>. To modify the policy, you can use the more general type, GenVecOf :

  • GenVecOf::<T, u32> for a saturating generation approch (by default)
  • GenVecOf::<T, Wrapping<u8>> for a wrapping generation approch (This means that after many insertions and deletions, there is a small chance that an invalid key could become valid again and point to an unintended element. (u8::MAX in this case))

Use case

GenVec are ideal for MAS (Multi-Agent System), where each agent can be removed at any time and has references to other agents.

This is great for stuff like simulation, video game, ECS...

Inspiration

This crate was mainly inspired by

Main Hexga crate

Check hexga : https://crates.io/crates/hexga if you are interested in a quick start, it regroup multiple hexga crates.

Dependencies

~1.4–2.1MB
~45K SLoC