Struct SymbolicStore 

pub struct SymbolicStore<A, N> { /* private fields */ }

Statement-ordered symbolic state used while constructing SLT values.

Each clone is a cheap branch version: the fixed-size page table, its pages, and every range remain shared until a definition mutates them. This gives conditional evaluation SSA-like snapshot semantics while preserving the map-shaped API expected by the frontend.

Implementations

impl<A, N> SymbolicStore<A, N>

pub fn fork(&self) -> Self

Create an independent statement branch from the current symbolic version.

The shared page table makes this operation independent of the number of variables in the module. Definitions remain shared until either branch writes their page.

impl<A: Eq + Hash, N> SymbolicStore<A, N>

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn reserve(&mut self, additional: usize)

where A: Clone, N: Clone,

pub fn contains_key(&self, key: &A) -> bool

pub fn get( &self, key: &A, ) -> Option<&RangeStore<Option<(N, FxHashSet<VarAtomBase<A>>)>>>

pub fn insert( &mut self, key: A, value: RangeStore<Option<(N, FxHashSet<VarAtomBase<A>>)>>, ) -> Option<Arc<RangeStore<Option<(N, FxHashSet<VarAtomBase<A>>)>>>>

where A: Clone, N: Clone,

pub fn remove( &mut self, key: &A, ) -> Option<Arc<RangeStore<Option<(N, FxHashSet<VarAtomBase<A>>)>>>>

where A: Clone, N: Clone,

pub fn iter(&self) -> Iter<'_, A, N>

pub fn values(&self) -> Values<'_, A, N>

pub fn keys(&self) -> Keys<'_, A, N>

pub fn extend<I>(&mut self, values: I)

where A: Clone, N: Clone, I: IntoIterator<Item = (A, RangeStore<Option<(N, FxHashSet<VarAtomBase<A>>)>>)>,

pub fn shares_entry_with(&self, other: &Self, key: &A) -> bool

Whether two branch versions still refer to the same definition for a key.

A shared entry can bypass a deep RangeStore comparison during phi construction, which is the common case for untouched variables.

pub fn differing_keys<'a>( &'a self, other: &'a Self, ) -> impl Iterator<Item = &'a A>

Keys whose symbolic definitions differ between two branch versions.

Entire shared pages are skipped without visiting their keys. Within a copied page, entries that still share the same range version are also skipped. The returned sparse iterator is therefore the only set that can require phi construction. Keys are borrowed directly from their store version, so walking a diff does not allocate or clone addresses.

impl<A: Clone + Eq + Hash, N: Clone> SymbolicStore<A, N>

pub fn clone_entry_from(&mut self, key: &A, source: &Self) -> bool

pub fn entry(&mut self, key: A) -> Entry<'_, A, N>

pub fn get_mut( &mut self, key: &A, ) -> Option<&mut RangeStore<Option<(N, FxHashSet<VarAtomBase<A>>)>>>

pub fn values_mut(&mut self) -> ValuesMut<'_, A, N>

Trait Implementations

impl<A: Clone, N: Clone> Clone for SymbolicStore<A, N>

fn clone(&self) -> SymbolicStore<A, N>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<A: Debug, N: Debug> Debug for SymbolicStore<A, N>

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

Formats the value using the given formatter.

impl<A, N> Default for SymbolicStore<A, N>

fn default() -> Self

Returns the “default value” for a type.

impl<A: Clone + Eq + Hash, N: Clone> FromIterator<(A, RangeStore<Option<(N, HashSet<VarAtomBase<A>, BuildHasherDefault<FxHasher>>)>>)> for SymbolicStore<A, N>

fn from_iter<T: IntoIterator<Item = (A, RangeStore<Option<(N, FxHashSet<VarAtomBase<A>>)>>)>>( iter: T, ) -> Self

Creates a value from an iterator.

impl<A: Eq + Hash, N> Index<&A> for SymbolicStore<A, N>

type Output = RangeStore<Option<(N, HashSet<VarAtomBase<A>, BuildHasherDefault<FxHasher>>)>>

The returned type after indexing.

fn index(&self, key: &A) -> &Self::Output

Performs the indexing (container[index]) operation.

impl<'a, A: Eq + Hash, N> IntoIterator for &'a SymbolicStore<A, N>

type Item = (&'a A, &'a RangeStore<Option<(N, HashSet<VarAtomBase<A>, BuildHasherDefault<FxHasher>>)>>)

The type of the elements being iterated over.

type IntoIter = Iter<'a, A, N>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<A: Clone + Eq + Hash, N: Clone> IntoIterator for SymbolicStore<A, N>

type Item = (A, RangeStore<Option<(N, HashSet<VarAtomBase<A>, BuildHasherDefault<FxHasher>>)>>)

The type of the elements being iterated over.

type IntoIter = IntoIter<A, N>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.