pub struct UnificationTable<S>where
S: UnificationStoreBase,{ /* private fields */ }
Expand description
Table of unification keys and their values. You must define a key type K
that implements the UnifyKey
trait. Unification tables can be used in two-modes:
- in-place (
UnificationTable<InPlace<K>>
orInPlaceUnificationTable<K>
):- This is the standard mutable mode, where the array is modified in place.
- To do backtracking, you can employ the
snapshot
androllback_to
methods.
- persistent (
UnificationTable<Persistent<K>>
orPersistentUnificationTable<K>
):- In this mode, we use a persistent vector to store the data, so that cloning the table is an O(1) operation.
- This implies that ordinary operations are quite a bit slower though.
- Requires the
persistent
feature be selected in your Cargo.toml file.
Implementations§
source§impl<S> UnificationTable<S>where
S: UnificationStoreBase + Default,
impl<S> UnificationTable<S>where
S: UnificationStoreBase + Default,
pub fn new() -> UnificationTable<S>
source§impl<S> UnificationTable<S>where
S: UnificationStore,
impl<S> UnificationTable<S>where
S: UnificationStore,
sourcepub fn snapshot(&mut self) -> Snapshot<S>
pub fn snapshot(&mut self) -> Snapshot<S>
Starts a new snapshot. Each snapshot must be either rolled back or committed in a “LIFO” (stack) order.
sourcepub fn rollback_to(&mut self, snapshot: Snapshot<S>)
pub fn rollback_to(&mut self, snapshot: Snapshot<S>)
Reverses all changes since the last snapshot. Also removes any keys that have been created since then.
sourcepub fn commit(&mut self, snapshot: Snapshot<S>)
pub fn commit(&mut self, snapshot: Snapshot<S>)
Commits all changes since the last snapshot. Of course, they can still be undone if there is a snapshot further out.
sourcepub fn vars_since_snapshot(
&self,
snapshot: &Snapshot<S>
) -> Range<<S as UnificationStoreBase>::Key>
pub fn vars_since_snapshot( &self, snapshot: &Snapshot<S> ) -> Range<<S as UnificationStoreBase>::Key>
Returns the keys of all variables created since the snapshot
.
source§impl<S> UnificationTable<S>where
S: UnificationStoreBase,
impl<S> UnificationTable<S>where
S: UnificationStoreBase,
source§impl<S> UnificationTable<S>where
S: UnificationStoreMut,
impl<S> UnificationTable<S>where
S: UnificationStoreMut,
sourcepub fn new_key(
&mut self,
value: <S as UnificationStoreBase>::Value
) -> <S as UnificationStoreBase>::Key
pub fn new_key( &mut self, value: <S as UnificationStoreBase>::Value ) -> <S as UnificationStoreBase>::Key
Starts a new snapshot. Each snapshot must be either Creates a fresh key with the given value.
sourcepub fn reserve(&mut self, num_new_keys: usize)
pub fn reserve(&mut self, num_new_keys: usize)
Reserve memory for num_new_keys
to be created. Does not
actually create the new keys; you must then invoke new_key
.
sourcepub fn reset_unifications(
&mut self,
value: impl FnMut(<S as UnificationStoreBase>::Key) -> <S as UnificationStoreBase>::Value
)
pub fn reset_unifications( &mut self, value: impl FnMut(<S as UnificationStoreBase>::Key) -> <S as UnificationStoreBase>::Value )
Clears all unifications that have been performed, resetting to the initial state. The values of each variable are given by the closure.
source§impl<S, K, V> UnificationTable<S>
impl<S, K, V> UnificationTable<S>
//////////////////////////////////////////////////////////////////////// Public API
sourcepub fn try_probe_value<'a, K1>(&'a self, id: K1) -> Option<&'a V>where
K1: Into<K>,
K: 'a,
pub fn try_probe_value<'a, K1>(&'a self, id: K1) -> Option<&'a V>where
K1: Into<K>,
K: 'a,
Obtains current value for key without any pointer chasing; may return None
if key has been union’d.
source§impl<S, K, V> UnificationTable<S>
impl<S, K, V> UnificationTable<S>
sourcepub fn union<K1, K2>(&mut self, a_id: K1, b_id: K2)
pub fn union<K1, K2>(&mut self, a_id: K1, b_id: K2)
Unions two keys without the possibility of failure; only
applicable when unify values use NoError
as their error
type.
sourcepub fn union_value<K1>(&mut self, id: K1, value: V)
pub fn union_value<K1>(&mut self, id: K1, value: V)
Unions a key and a value without the possibility of failure;
only applicable when unify values use NoError
as their error
type.
sourcepub fn unioned<K1, K2>(&mut self, a_id: K1, b_id: K2) -> bool
pub fn unioned<K1, K2>(&mut self, a_id: K1, b_id: K2) -> bool
Given two keys, indicates whether they have been unioned together.
sourcepub fn find<K1>(&mut self, id: K1) -> Kwhere
K1: Into<K>,
pub fn find<K1>(&mut self, id: K1) -> Kwhere
K1: Into<K>,
Given a key, returns the (current) root key.
sourcepub fn unify_var_var<K1, K2>(
&mut self,
a_id: K1,
b_id: K2
) -> Result<(), <V as UnifyValue>::Error>
pub fn unify_var_var<K1, K2>( &mut self, a_id: K1, b_id: K2 ) -> Result<(), <V as UnifyValue>::Error>
Unions together two variables, merging their values. If merging the values fails, the error is propagated and this method has no effect.
sourcepub fn unify_var_value<K1>(
&mut self,
a_id: K1,
b: V
) -> Result<(), <V as UnifyValue>::Error>where
K1: Into<K>,
pub fn unify_var_value<K1>(
&mut self,
a_id: K1,
b: V
) -> Result<(), <V as UnifyValue>::Error>where
K1: Into<K>,
Sets the value of the key a_id
to b
, attempting to merge
with the previous value.
sourcepub fn probe_value<K1>(&mut self, id: K1) -> Vwhere
K1: Into<K>,
pub fn probe_value<K1>(&mut self, id: K1) -> Vwhere
K1: Into<K>,
Returns the current value for the given key. If the key has been union’d, this will give the value from the current root.
pub fn inlined_probe_value<K1>(&mut self, id: K1) -> Vwhere
K1: Into<K>,
Trait Implementations§
source§impl<S> Clone for UnificationTable<S>where
S: Clone + UnificationStoreBase,
impl<S> Clone for UnificationTable<S>where
S: Clone + UnificationStoreBase,
source§fn clone(&self) -> UnificationTable<S>
fn clone(&self) -> UnificationTable<S>
1.0.0 · source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source
. Read more