logicrs 0.6.1

Rust library for logic expression
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

use crate::fol::{Sort, Term};
use giputils::{bitvec::BitVec, hash::GHashMap};

#[derive(Clone, Debug)]
pub enum Value {
    Bv(BitVec),
    Array(GHashMap<usize, BitVec>),
}

impl Value {
    #[inline]
    pub fn default_from(sort: &Sort) -> Self {
        match sort {
            Sort::Bv(w) => Value::Bv(BitVec::from_elem(*w, false)),
            Sort::Array(_, _) => Value::Array(GHashMap::default()),
        }
    }
}

#[derive(Clone, Debug)]
pub struct BvTermValue {
    t: Term,
    v: BitVec,
}

impl BvTermValue {
    #[inline]
    pub fn t(&self) -> &Term {
        &self.t
    }

    #[inline]
    pub fn v(&self) -> &BitVec {
        &self.v
    }

    #[inline]
    pub fn new(t: Term, v: BitVec) -> Self {
        Self { t, v }
    }

    /// Eq Term
    #[inline]
    pub fn teq(&self) -> Term {
        self.t.teq(Term::bv_const(self.v.clone()))
    }
}

#[derive(Clone, Debug)]
pub struct ArrayTermValue {
    pub t: Term,
    pub v: GHashMap<usize, BitVec>,
}

impl ArrayTermValue {
    #[inline]
    pub fn new(t: Term, v: GHashMap<usize, BitVec>) -> Self {
        Self { t, v }
    }

    /// Eq Term
    #[inline]
    pub fn teq(&self) -> Term {
        todo!()
    }
}

#[derive(Clone, Debug)]
pub enum TermValue {
    Bv(BvTermValue),
    Array(ArrayTermValue),
}

impl TermValue {
    #[inline]
    pub fn t(&self) -> &Term {
        match self {
            TermValue::Bv(t) => &t.t,
            TermValue::Array(t) => &t.t,
        }
    }
}