Struct canrun::collections::lmap::LMap

pub struct LMap<K: Unify + Eq + Hash + Debug, V: Unify + Debug> { /* private fields */ }

A HashMap-like data structure with LVar keys and values.

Implementations

impl<K: Unify + Eq + Hash + Debug, V: Unify + Debug> LMap<K, V>

pub fn new() -> Self

Create a new LMap value.

You may also be interested in the lmap! macro.

Example:

use canrun::lmap::LMap;

let map: LMap<i32, i32> = LMap::new();

pub fn insert<Ki, Vi>(&mut self, key: Ki, value: Vi)where
    Ki: Into<Value<K>>,
    Vi: Into<Value<V>>,

Add a key/value pair to an existing LMap.

Example:

use canrun::lmap::LMap;

let mut map: LMap<i32, i32> = LMap::new();
map.insert(1, 2);

Trait Implementations

impl<K: Clone + Unify + Eq + Hash + Debug, V: Clone + Unify + Debug> Clone for LMap<K, V>

fn clone(&self) -> LMap<K, V>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: Debug + Unify + Eq + Hash + Debug, V: Debug + Unify + Debug> Debug for LMap<K, V>

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

Formats the value using the given formatter.

impl<K: Default + Unify + Eq + Hash + Debug, V: Default + Unify + Debug> Default for LMap<K, V>

fn default() -> LMap<K, V>

Returns the “default value” for a type.

impl<Kv, Kr, Vv, Vr> Reify for LMap<Kv, Vv>where
    Kv: Unify + Eq + Hash + Reify<Reified = Kr>,
    Kr: Eq + Hash,
    Vv: Unify + Reify<Reified = Vr>,

type Reified = HashMap<Kr, Vr, RandomState>

The “concrete” type that Self reifies to.

fn reify_in(&self, state: &State) -> Option<Self::Reified>

Extract a reified Self from a compatible State. This trait is usually used indirectly through the Query trait.

impl<K: Unify + Eq + Hash + Debug, V: Unify + Debug> Unify for LMap<K, V>

fn unify(state: State, a: Rc<Self>, b: Rc<Self>) -> Option<State>

Attempt to unify two fully resolved values.