Struct rate_common::parser::FixedSizeHashTable

pub struct FixedSizeHashTable(_);

A hash table with a fixed size

This should work exactly like the one used in drat-trim. Given that we expect the number of clauses in the hash table not to exceed a couple million this should be faster and leaner than DynamicHashTable.

Methods

impl FixedSizeHashTable

pub fn new() -> FixedSizeHashTable

Allocate the hash table.

Trait Implementations

impl HeapSpace for FixedSizeHashTable

fn heap_space(&self) -> usize

The number of bytes allocated on the heap that this owns.

impl HashTable for FixedSizeHashTable

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.

impl<'a> IntoIterator for &'a FixedSizeHashTable

type Item = &'a Clause

The type of the elements being iterated over.

type IntoIter = FixedSizeHashTableIterator<'a>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.