Struct HashConsArena 

pub struct HashConsArena<T> { /* private fields */ }

A hash consing arena that allows for efficient interning of values.

Caveat(s)

The arena is backed by a bumpalo, therefore, objects allocated via the arena, will not have their Drop implementation called, without manual intervention. Thus, it is relatively easy to leak resources. If you need Drop to be called, use BoxedHashConsArena instead.

Implementations

impl<T> HashConsArena<T>

where T: Eq + Hash,

pub fn new() -> Self

Create a new HashConsArena.

pub fn intern<'a>(&'a self, value: T) -> HRef<'a, T>

where T: Debug,

Intern a value, returning a reference that’s guaranteed to be the same for structurally equal values.

Arguments

• value - The value to intern. It must implement Eq and Hash.

Returns

A HRef<T> that points to the interned value. If the value is already interned, it returns the existing reference.

Example

use hashcons_arena::HashConsArena;

let arena = HashConsArena::new();

let a = arena.intern("hello");
let b = arena.intern("hello");

assert!(a == b); // a and b are the same reference

pub fn reset(&mut self)

Reset the arena, clearing all interned values.