Struct hash_cons::single_threaded::HCTable

pub struct HCTable<T>where
    T: Hash + Eq,{ /* private fields */ }

HCTable

A table structure for efficiently managing Hc<T> instances. This struct hides the underlying table and its reference count management.

This structure utilizes a HashMap to store Hc<T> instances, offering quick retrieval and management capabilities.

Type Parameters

• T - The type of values managed by the Hc<T> instances within this table.

Fields

• table: HashMap - The underlying data structure storing Hc<T> instances.

Implementations

impl<T> HCTable<T>where T: Hash + Eq,

pub fn new() -> Self

Creates a new HCTable.

Returns

A new instance of HCTable<T>.

pub fn hashcons(&self, value: T) -> Hc<T>

Simplifies object retrieval or creation with an intuitive interface.

Parameters

• value: The value to be managed.

Returns

A Hc<T> instance corresponding to the given value.

pub fn cleanup(&self)

Cleans up the HCTable, removing any values that are no longer in use. This method is useful for managing memory and ensuring that unused values are not unnecessarily kept in the table.

pub fn len(&self) -> usize

Returns the number of elements currently stored in the HCTable.

Returns

The number of elements in the HCTable.