Struct LazyCache

pub struct LazyCache {
    pub pred_data_hashes: OnceLock<HashSet<Hash>>,
}

Lazily cache expensive to compute values.

Fields

pred_data_hashes: OnceLock<HashSet<Hash>>

Predicate data and addresses set of hashes. See PredicateExists for more details.

Implementations

impl LazyCache

pub fn new() -> Self

Create a new empty LazyCache.

pub fn get_pred_data_hashes(&self, solutions: &[Solution]) -> &HashSet<Hash>

Get the predicate data hashes.

The first time this is called, it will compute the hashes.

Trait Implementations

impl Debug for LazyCache

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for LazyCache

fn default() -> LazyCache

Returns the “default value” for a type.

impl PartialEq for LazyCache

fn eq(&self, other: &LazyCache) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for LazyCache