tessellate-core 0.3.0

Compiler and deterministic runtime for the Tess rule language
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
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
//! Stable, deterministic snapshots of decision results for declared tests.

use crate::ast::{Cardinality, ExprKind};
use crate::compiler::CompiledProgram;
use crate::engine::{DecisionStatus, Input, Query, evaluate_query};
use crate::value::Value;
use serde::{Deserialize, Serialize};
use std::collections::{BTreeMap, BTreeSet};
use std::error::Error;
use std::fmt;

pub const DECISION_SNAPSHOT_SCHEMA_VERSION: &str = "tess.decision-snapshot/v1";
pub const SNAPSHOT_DIFF_SCHEMA_VERSION: &str = "tess.snapshot-diff/v1";

#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct DecisionSnapshot {
    pub schema_version: String,
    pub module: String,
    pub cases: Vec<CaseSnapshot>,
}

impl DecisionSnapshot {
    #[must_use]
    pub fn decision_count(&self) -> usize {
        self.cases.iter().map(|case| case.decisions.len()).sum()
    }
}

#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct CaseSnapshot {
    pub case: String,
    pub decisions: Vec<DecisionObservation>,
}

#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct DecisionObservation {
    pub query: String,
    /// One-based occurrence of this query within the test.
    pub occurrence: usize,
    pub cardinality: Cardinality,
    pub result: SnapshotDecisionStatus,
}

#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
#[serde(tag = "status", rename_all = "snake_case")]
pub enum SnapshotDecisionStatus {
    Resolved { values: Vec<Value> },
    Undefined,
    Unknown { missing: Vec<String> },
    Conflict { values: Vec<Value> },
    Error { message: String },
}

impl SnapshotDecisionStatus {
    #[must_use]
    pub fn render_text(&self) -> String {
        match self {
            Self::Resolved { values } => format!("resolved [{}]", render_values(values)),
            Self::Undefined => "undefined".to_owned(),
            Self::Unknown { missing } => format!("unknown (missing {})", missing.join(", ")),
            Self::Conflict { values } => format!("conflict [{}]", render_values(values)),
            Self::Error { message } => format!("error ({message})"),
        }
    }
}

fn render_values(values: &[Value]) -> String {
    values
        .iter()
        .map(ToString::to_string)
        .collect::<Vec<_>>()
        .join(", ")
}

#[derive(Clone, Debug, PartialEq, Eq)]
pub struct SnapshotBuildError {
    pub case: String,
    pub message: String,
}

impl fmt::Display for SnapshotBuildError {
    fn fmt(&self, formatter: &mut fmt::Formatter<'_>) -> fmt::Result {
        write!(formatter, "test `{}`: {}", self.case, self.message)
    }
}

impl Error for SnapshotBuildError {}

/// Evaluate declared test queries and capture only their semantic result.
///
/// Timing, source locations, rule traces, and absolute paths are deliberately
/// excluded so repeated captures of the same policy serialize identically.
///
/// # Errors
///
/// Returns an error if a selected test cannot be converted to runtime input or
/// contains a query argument that is not a binding name.
pub fn capture_decision_snapshot(
    program: &CompiledProgram,
    case_filter: Option<&str>,
) -> Result<DecisionSnapshot, SnapshotBuildError> {
    let mut cases = Vec::new();
    for case in program.cases().values() {
        if case_filter.is_some_and(|filter| case.name.value != filter) {
            continue;
        }
        let input = Input::from_case(program, case).map_err(|diagnostics| SnapshotBuildError {
            case: case.name.value.clone(),
            message: diagnostics
                .into_iter()
                .map(|diagnostic| diagnostic.message)
                .collect::<Vec<_>>()
                .join("; "),
        })?;
        let mut occurrences = BTreeMap::<String, usize>::new();
        let mut decisions = Vec::with_capacity(case.expectations.len());
        for expectation in &case.expectations {
            let arguments = expectation
                .arguments
                .iter()
                .map(|argument| match &argument.kind {
                    ExprKind::Name(name) => Ok(name.clone()),
                    _ => Err(SnapshotBuildError {
                        case: case.name.value.clone(),
                        message: "an expectation contains a non-name query argument".to_owned(),
                    }),
                })
                .collect::<Result<Vec<_>, _>>()?;
            let query = Query {
                decision: expectation.decision.value.clone(),
                arguments,
            };
            let rendered = query.render();
            let occurrence = occurrences.entry(rendered.clone()).or_default();
            *occurrence += 1;
            let (cardinality, result) = match evaluate_query(program, &input, &query) {
                Ok(evaluation) => (
                    evaluation.result.cardinality,
                    canonical_status(evaluation.result.status),
                ),
                Err(error) => (
                    program
                        .decision(&query.decision)
                        .map_or(Cardinality::ExactlyOne, |decision| decision.cardinality),
                    SnapshotDecisionStatus::Error {
                        message: error.message,
                    },
                ),
            };
            decisions.push(DecisionObservation {
                query: rendered,
                occurrence: *occurrence,
                cardinality,
                result,
            });
        }
        decisions.sort_by(|left, right| {
            (&left.query, left.occurrence).cmp(&(&right.query, right.occurrence))
        });
        cases.push(CaseSnapshot {
            case: case.name.value.clone(),
            decisions,
        });
    }
    cases.sort_by(|left, right| left.case.cmp(&right.case));
    Ok(DecisionSnapshot {
        schema_version: DECISION_SNAPSHOT_SCHEMA_VERSION.to_owned(),
        module: program.ast().module.value.clone(),
        cases,
    })
}

fn canonical_status(status: DecisionStatus) -> SnapshotDecisionStatus {
    match status {
        DecisionStatus::Resolved { mut values } => {
            values.sort();
            values.dedup();
            SnapshotDecisionStatus::Resolved { values }
        }
        DecisionStatus::Undefined => SnapshotDecisionStatus::Undefined,
        DecisionStatus::Unknown { missing } => SnapshotDecisionStatus::Unknown {
            missing: canonical_strings(missing),
        },
        DecisionStatus::Conflict { mut values, .. } => {
            values.sort();
            values.dedup();
            SnapshotDecisionStatus::Conflict { values }
        }
    }
}

fn canonical_strings(values: Vec<String>) -> Vec<String> {
    BTreeSet::from_iter(values).into_iter().collect()
}

#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
pub struct SnapshotDiff {
    pub schema_version: String,
    pub baseline_module: String,
    pub current_module: String,
    pub unchanged_decisions: usize,
    pub changes: Vec<SnapshotChange>,
}

impl SnapshotDiff {
    #[must_use]
    pub fn matches(&self) -> bool {
        self.changes.is_empty()
    }
}

#[derive(Clone, Debug, PartialEq, Eq, Serialize, Deserialize)]
#[serde(tag = "change", rename_all = "snake_case")]
pub enum SnapshotChange {
    ModuleChanged {
        before: String,
        after: String,
    },
    CaseAdded {
        case: String,
        decisions: Vec<DecisionObservation>,
    },
    CaseRemoved {
        case: String,
        decisions: Vec<DecisionObservation>,
    },
    DecisionAdded {
        case: String,
        decision: DecisionObservation,
    },
    DecisionRemoved {
        case: String,
        decision: DecisionObservation,
    },
    DecisionChanged {
        case: String,
        before: DecisionObservation,
        after: DecisionObservation,
    },
}

/// Compare two snapshots by test and `(query, occurrence)` identity.
#[must_use]
pub fn diff_decision_snapshots(
    baseline: &DecisionSnapshot,
    current: &DecisionSnapshot,
) -> SnapshotDiff {
    let mut changes = Vec::new();
    if baseline.module != current.module {
        changes.push(SnapshotChange::ModuleChanged {
            before: baseline.module.clone(),
            after: current.module.clone(),
        });
    }
    let baseline_cases = baseline
        .cases
        .iter()
        .map(|case| (case.case.as_str(), case))
        .collect::<BTreeMap<_, _>>();
    let current_cases = current
        .cases
        .iter()
        .map(|case| (case.case.as_str(), case))
        .collect::<BTreeMap<_, _>>();
    let case_names = baseline_cases
        .keys()
        .chain(current_cases.keys())
        .copied()
        .collect::<BTreeSet<_>>();
    let mut unchanged_decisions = 0;
    for case_name in case_names {
        match (baseline_cases.get(case_name), current_cases.get(case_name)) {
            (None, Some(current_case)) => changes.push(SnapshotChange::CaseAdded {
                case: case_name.to_owned(),
                decisions: current_case.decisions.clone(),
            }),
            (Some(baseline_case), None) => changes.push(SnapshotChange::CaseRemoved {
                case: case_name.to_owned(),
                decisions: baseline_case.decisions.clone(),
            }),
            (Some(baseline_case), Some(current_case)) => {
                let baseline_decisions = decisions_by_identity(&baseline_case.decisions);
                let current_decisions = decisions_by_identity(&current_case.decisions);
                let identities = baseline_decisions
                    .keys()
                    .chain(current_decisions.keys())
                    .cloned()
                    .collect::<BTreeSet<_>>();
                for identity in identities {
                    match (
                        baseline_decisions.get(&identity),
                        current_decisions.get(&identity),
                    ) {
                        (None, Some(decision)) => changes.push(SnapshotChange::DecisionAdded {
                            case: case_name.to_owned(),
                            decision: (*decision).clone(),
                        }),
                        (Some(decision), None) => {
                            changes.push(SnapshotChange::DecisionRemoved {
                                case: case_name.to_owned(),
                                decision: (*decision).clone(),
                            });
                        }
                        (Some(before), Some(after)) if before != after => {
                            changes.push(SnapshotChange::DecisionChanged {
                                case: case_name.to_owned(),
                                before: (*before).clone(),
                                after: (*after).clone(),
                            });
                        }
                        (Some(_), Some(_)) => unchanged_decisions += 1,
                        (None, None) => unreachable!("identity came from one snapshot"),
                    }
                }
            }
            (None, None) => unreachable!("case name came from one snapshot"),
        }
    }
    SnapshotDiff {
        schema_version: SNAPSHOT_DIFF_SCHEMA_VERSION.to_owned(),
        baseline_module: baseline.module.clone(),
        current_module: current.module.clone(),
        unchanged_decisions,
        changes,
    }
}

fn decisions_by_identity(
    decisions: &[DecisionObservation],
) -> BTreeMap<(String, usize), &DecisionObservation> {
    decisions
        .iter()
        .map(|decision| ((decision.query.clone(), decision.occurrence), decision))
        .collect()
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::{SourceFile, compile_source};

    fn snapshot(source: &str) -> DecisionSnapshot {
        let output = compile_source(SourceFile::new("snapshot.tes", source));
        assert!(output.program.is_some(), "{:?}", output.diagnostics);
        capture_decision_snapshot(output.program.as_ref().unwrap(), None).unwrap()
    }

    #[test]
    fn capture_is_sorted_and_omits_non_semantic_rule_details() {
        let captured = snapshot(
            r"mod sample
record Subject:
    flag: Bool

dec result(s Subject) -> Bool

policy::result @result policy:
    Enabled subjects receive a positive result.

    rule yes(s Subject):
        s.flag => result(s) = true

test z:
    let s = Subject { flag: true }
    expect result(s) = true

test a:
    let s = Subject { flag: false }
    expect result(s) = true
",
        );
        assert_eq!(captured.schema_version, DECISION_SNAPSHOT_SCHEMA_VERSION);
        assert_eq!(captured.cases[0].case, "a");
        assert!(matches!(
            captured.cases[0].decisions[0].result,
            SnapshotDecisionStatus::Undefined
        ));
        assert_eq!(captured.decision_count(), 2);
    }

    #[test]
    fn diff_reports_semantic_changes_by_query_identity() {
        let before = snapshot(
            r"mod sample
record Subject:
    flag: Bool

dec result(s Subject) -> Bool

policy::result @result policy:
    The result value before the change.

    rule value(s Subject):
        => result(s) = false

test example:
    let s = Subject { flag: true }
    expect result(s) = true
",
        );
        let after = snapshot(
            r"mod sample
record Subject:
    flag: Bool

dec result(s Subject) -> Bool

policy::result @result policy:
    The result value after the change.

    rule value(s Subject):
        => result(s) = true

test example:
    let s = Subject { flag: true }
    expect result(s) = true
",
        );
        let diff = diff_decision_snapshots(&before, &after);
        assert_eq!(diff.changes.len(), 1);
        assert!(matches!(
            diff.changes[0],
            SnapshotChange::DecisionChanged { .. }
        ));
    }
}