#cache #id #index #intern #generate

id_cache

A cache data structure which generates sequentially-assigned ids for unique values

1 unstable release

0.1.0 May 25, 2022

#2458 in Data structures

MIT license

12KB
123 lines

id_cache

Download: crates.io/crates/id_cache

Docs: docs.rs/id_cache


This is a small crate built on id_collections which provides a simple "cache" data structure for generating sequentially-assigned ids for unique values of some hashable type.

Example

use id_collections::id_type;
use id_cache::IdCache;

#[id_type]
struct WordId(u32);

let mut word_cache: IdCache<WordId, &str> = IdCache::new();

let foo_id = word_cache.make_id("foo");
let bar_id = word_cache.make_id("bar");

assert_eq!(word_cache[foo_id], "foo");
assert_eq!(word_cache[bar_id], "bar");

// ids for repeated values are reused:
assert_eq!(word_cache.make_id("foo"), foo_id);

Optional Features

This crate has optional Serde support, which can be enabled with the serde Cargo feature.

Dependencies

~4MB
~83K SLoC