smt2 0.2.0

A SMT-LIB 2.6 parsing/formatting library for Rust
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149

use std::fmt;
use source_span::Span;
use crate::{Located, Sort};
use super::TypeRef;

pub enum Error<S: Sort> {
	Missmatch(SortMissmatch<S>),
	Ambiguity
}

impl<S: Sort> Error<S> {
	pub fn at(self, span: Span) -> Located<Error<S>> {
		Located::new(self, span)
	}
}

pub type Result<T, S> = std::result::Result<T, Located<Error<S>>>;

impl<S: Sort + fmt::Display> fmt::Display for Error<S> {
	fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
		use self::Error::*;
		match self {
			Missmatch(_) => write!(f, "mismatched sorts"),
			Ambiguity => write!(f, "sort ambiguity")
		}
	}
}

impl<S: Sort + fmt::Display> crate::error::Informative for Error<S> {
	fn informations(&self, i: &mut crate::error::Infos) {
		use self::Error::*;
		match self {
			Missmatch(m) => {
				let (expected, given) = m.mismatched_sorts();
				i.set_label(format!("expected `{}`, found `{}`", expected, given));
				i.add_note(format!("\x1b[1mnote:\x1b[m expected sort `{}`\n		 found sort `{}`", Expected(&m), Given(&m)));
			},
			Ambiguity => {
				i.set_label(format!("use the `(as {} <sort>)` type coercion construct to remove the ambiguity", i.content()));
			}
		}
	}
}

pub enum SortMissmatch<S: Sort> {
	Var(usize, Span),
	Match {
		sort: S,
		parameters: Vec<SortMissmatch<S>>
	},
	Miss {
		expected_sort: S,
		expected_parameters: Vec<TypeRef<S>>,

		given_sort: S,
		given_parameters: Vec<TypeRef<S>>
	}
}

pub struct Expected<'a, S: Sort>(&'a SortMissmatch<S>);

impl<'a, S: Sort + fmt::Display> fmt::Display for Expected<'a, S> {
	fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
		use SortMissmatch::*;
		match &self.0 {
			Var(_, _) => write!(f, "_"),
			Match { sort, parameters } => {
				if parameters.is_empty() {
					write!(f, "{}", sort)
				} else {
					write!(f, "({}", sort)?;
					for p in parameters {
						write!(f, " {}", Expected(p))?;
					}
					write!(f, ")")
				}
			},
			Miss { expected_sort, expected_parameters, .. } => {
				if expected_parameters.is_empty() {
					write!(f, "\x1b[1m{}\x1b[m", expected_sort)
				} else {
					write!(f, "\x1b[1m({}", expected_sort)?;
					for p in expected_parameters {
						write!(f, " {}", p)?;
					}
					write!(f, ")\x1b[m")
				}
			}
		}
	}
}

pub struct Given<'a, S: Sort>(&'a SortMissmatch<S>);

impl<'a, S: Sort + fmt::Display> fmt::Display for Given<'a, S> {
	fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
		use SortMissmatch::*;
		match &self.0 {
			Var(_, _) => write!(f, "_"),
			Match { sort, parameters } => {
				if parameters.is_empty() {
					write!(f, "{}", sort)
				} else {
					write!(f, "({}", sort)?;
					for p in parameters {
						write!(f, " {}", Given(p))?;
					}
					write!(f, ")")
				}
			},
			Miss { given_sort, given_parameters, .. } => {
				if given_parameters.is_empty() {
					write!(f, "\x1b[1m{}\x1b[m", given_sort)
				} else {
					write!(f, "\x1b[1m({}", given_sort)?;
					for p in given_parameters {
						write!(f, " {}", p)?;
					}
					write!(f, ")\x1b[m")
				}
			}
		}
	}
}

impl<S: Sort> SortMissmatch<S> {
	fn find_mismatched_sorts(&self) -> Option<(&S, &S)> {
		use SortMissmatch::*;
		match self {
			Var(_, _) => None,
			Match { parameters, .. } => {
				for p in parameters {
					if let Some(m) = p.find_mismatched_sorts() {
						return Some(m)
					}
				}

				None
			},
			Miss { expected_sort, given_sort, .. } => {
				Some((expected_sort, given_sort))
			}
		}
	}

	pub fn mismatched_sorts(&self) -> (&S, &S) {
		self.find_mismatched_sorts().unwrap()
	}
}