Struct rate_common::parser::DynamicHashTable

pub struct DynamicHashTable(_);

A hashtable that simply uses the standard HashMap

This maps clauses (by equality) to a a list of clause identifiers. We chose SmallVector<Clause> for the latter because most clauses are not duplicated. This way we can avoid one allocation for unique clauses.

Methods

impl DynamicHashTable

pub fn new() -> DynamicHashTable

Create a new empty hash table.

Trait Implementations

impl HashTable for DynamicHashTable

fn add_clause(&mut self, clause: Clause)

Add a new clause to the hashtable.

fn find_equal_clause(&mut self, needle: Clause, delete: bool) -> Option<Clause>

Find a clause that is equivalent to given clause.

fn clause_is_active(&self, needle: Clause) -> bool

Return true if this exact clause is active.

fn delete_clause(&mut self, needle: Clause) -> bool

Delete this exact clause, return true if that succeeded.