Struct VecHashCons

pub struct VecHashCons { /* private fields */ }

A hashconsing data structure for vectors of u32. Given a vector, it stores it only once and returns a unique id. The ids are consecutive and start at 0.

Implementations

impl VecHashCons

pub fn new() -> VecHashCons

Create a new hashcons.

pub fn insert(&mut self, data: &[u32]) -> u32

Insert a given vector and return its unique id.

pub fn get(&self, id: u32) -> &[u32]

Get vector with given unique id. Panics if id is out of bounds.

pub fn is_valid(&self, id: u32) -> bool

pub fn len(&self) -> usize

Return number of elements in the hashcons (also largest unique id + 1).

pub fn num_bytes(&self) -> usize

Estimate number of bytes used by the hashcons.

pub fn start_insert(&mut self)

Start insertion process for a vector. Panics if start_insert() is called twice without finish_insert().

pub fn push_u32(&mut self, head: u32)

Add an element to the vector being inserted. Requires start_insert() to have been called.

pub fn push_slice(&mut self, elts: &[u32])

Add a slice to the vector being inserted. Requires start_insert() to have been called.

pub fn finish_insert(&mut self) -> u32

Finish insertion process for a vector. Returns the unique id of the vector. Requires start_insert() to have been called.

Trait Implementations

impl Clone for VecHashCons

fn clone(&self) -> VecHashCons

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.