xmt-lib 0.1.1

A grounder for SMT solvers
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86

// Copyright Pierre Carbonnelle, 2025.

use std::hash::Hash;

use indexmap::{IndexMap, map::Iter};

/// An IndexMap that maps keys to optional values.  Values are not erased by an insert.
#[derive(Debug, Clone, PartialEq, Eq)]
pub(crate) struct OptionMap<K: Hash + Eq + Clone, V: Clone>(
    pub(crate) IndexMap<K, Option<V>>
);

impl<K: Hash + Eq + Clone, V: Clone> OptionMap<K, V> {

    pub(crate) fn new() -> Self {
        OptionMap(IndexMap::new())
    }

    /// does not insert if key already has some value.
    pub(crate) fn insert(&mut self, key: K, value: Option<V>) -> () {
        match self.0.get(&key) {
            None          => { self.0.insert(key, value); },
            Some(None)    => { self.0.insert(key, value); },
            Some(Some(_)) => {}
            }
    }

    pub(crate) fn append(&mut self, other: &mut OptionMap<K, V>) {
        for (key, value) in other.iter() {
            self.insert(key.clone(), value.clone());
        }
    }
    pub(crate) fn shift_remove(&mut self, key: &K) -> Option<Option<V>> {
        self.0.shift_remove(key)
    }

    pub(crate) fn get(&self, key: &K) -> Option<&Option<V>> {
        self.0.get(key)
    }

    pub fn iter(&self) -> Iter<'_, K, Option<V>> {
        self.0.iter()
    }

}
impl<K, V> FromIterator<(K, Option<V>)> for OptionMap<K, V>
where
    K: Hash + Eq + Clone,
    V: Clone,
{
    fn from_iter<I: IntoIterator<Item = (K, Option<V>)>>(iterable: I) -> Self {
        let map = IndexMap::from_iter(iterable);
        OptionMap(map)
    }
}

impl<K, V, const N: usize> From<[(K, Option<V>); N]> for OptionMap<K, V>
where
    K: Hash + Eq + Clone,
    V: Clone
{
    fn from(arr: [(K, Option<V>); N]) -> Self {
        Self::from_iter(arr)
    }
}

impl<K, V> Extend<(K, Option<V>)> for OptionMap<K, V>
where
    K: Hash + Eq + Clone,
    V: Clone,
{
    /// does not insert when key already has some value.
    fn extend<I: IntoIterator<Item = (K, Option<V>)>>(&mut self, iterable: I) {
        let iter = iterable.into_iter();
        let reserve = if self.0.is_empty() {
            iter.size_hint().0
        } else {
            (iter.size_hint().0 + 1) / 2
        };
        self.0.reserve(reserve);
        iter.for_each(move |(k, v)| {
            self.insert(k, v);
        });
    }
}