Refactor Examples to use assert_eq

This commit updates all example files to use `assert_eq!` for verifying
output, replacing the previous `Output:` comments. This change makes the
examples more robust and self-testing.

The benchmark results in some examples have also been slightly adjusted,
reflecting minor performance variations after the refactoring.

Additionally, a runtime panic handling mechanism has been introduced in
the VM for function calls, which improves error reporting for unexpected
panics.
This commit is contained in:
2026-03-26 15:07:48 +01:00
parent 0088a644eb
commit 16af3ae9fc
40 changed files with 313 additions and 235 deletions
+2
View File
@@ -1,3 +1,5 @@
;; Benchmark: 98.9us
;; Benchmark-Repeat: 22
(do
;; make-sma Factory (O(1))
(def make-sma
+3 -4
View File
@@ -1,10 +1,9 @@
;; Benchmark: 1.2us
;; Benchmark-Repeat: 1658
;; Output: 120
;; Benchmark: 1.5us
;; Benchmark-Repeat: 1306
(do
(def factorial (fn [n acc]
(if (= n 0)
acc
(again (- n 1) (* acc n)))))
(factorial 5 1))
(assert-eq 120 (factorial 5 1)))
+3 -4
View File
@@ -1,12 +1,11 @@
;; Closure Scope Test
;; Benchmark: 55ns
;; Benchmark-Repeat: 36184
;; Output: 15
;; Benchmark: 116ns
;; Benchmark-Repeat: 18852
(do
(def make-adder (fn [x]
(fn [y] (+ x y))))
(def add5 (make-adder 5))
(add5 10)
(assert-eq 15 (add5 10))
)
+3 -4
View File
@@ -1,4 +1,3 @@
;; Benchmark: 56ns
;; Benchmark-Repeat: 36321
;; Output: 5
(((fn [x] (fn [] x)) 5))
;; Benchmark: 110ns
;; Benchmark-Repeat: 18341
(assert-eq 5 (((fn [x] (fn [] x)) 5)))
+3 -4
View File
@@ -1,7 +1,6 @@
;; Benchmark: 55ns
;; Benchmark-Repeat: 36269
;; Output: 5
;; Benchmark: 112ns
;; Benchmark-Repeat: 18321
(do
(def f (fn [x] (fn [] x)))
((f 5))
(assert-eq 5 ((f 5)))
)
+3 -4
View File
@@ -1,7 +1,6 @@
;; Benchmark: 55ns
;; Benchmark-Repeat: 36160
;; Output: 42
;; Benchmark: 111ns
;; Benchmark-Repeat: 18551
(do
(def f (fn [a] (fn [b] (fn [c] (+ a (+ b c))))))
(((f 10) 12) 20)
(assert-eq 42 (((f 10) 12) 20))
)
+3 -4
View File
@@ -1,7 +1,6 @@
;; Complex Data Structure Test
;; Benchmark: 33.5us
;; Benchmark-Repeat: 62
;; Output: {:name "Fibonacci", :input 10, :output 55}
;; Benchmark: 36.6us
;; Benchmark-Repeat: 55
(do
(def fib (fn [n]
(if (< n 2)
@@ -16,5 +15,5 @@
:output result
})
data
(assert-eq {:name "Fibonacci" :input 10 :output 55} data)
)
+2 -2
View File
@@ -1,5 +1,5 @@
;; Benchmark: 226ns
;; Benchmark-Repeat: 8861
;; Benchmark: 211ns
;; Benchmark-Repeat: 9558
;; examples/def_local_inlining.myc
;; Demonstrates potential for DefLocal-Inlining (Phase 2.5)
+1
View File
@@ -1,3 +1,4 @@
;; Skip: demonstrates a known language limitation (conditional def may not bind)
(do
(do
+5 -12
View File
@@ -1,5 +1,5 @@
;; Benchmark: 651ns
;; Benchmark-Repeat: 3012
;; Benchmark: 776ns
;; Benchmark-Repeat: 2744
;; Comprehensive Destructuring Test
;; Covers: Nested tuples, mixed params, dynamic passing
@@ -15,13 +15,6 @@
(def data [10 [20 30]])
;; Validation
(if (= (deep [1 [[2 3] 4]]) 10)
(if (= (mixed [1 2] 3) 6)
(if (= (call-dynamic (fn [[a [b c]]] (+ a (+ b c))) data) 60)
"PASS"
"FAIL-DYNAMIC")
"FAIL-MIXED")
"FAIL-DEEP"))
;; Output: "PASS"
(assert-eq 10 (deep [1 [[2 3] 4]]))
(assert-eq 6 (mixed [1 2] 3))
(assert-eq 60 (call-dynamic (fn [[a [b c]]] (+ a (+ b c))) data)))
+3 -4
View File
@@ -1,6 +1,5 @@
;; Benchmark: 55ns
;; Benchmark-Repeat: 35723
;; Output: 36
;; Benchmark: 110ns
;; Benchmark-Repeat: 18390
(do
;; Excessive capture test
;; This script creates deep nesting where the inner-most lambda
@@ -23,5 +22,5 @@
(+ v1 v2 v3 v4 v5 v6 v7 v8))))))))))
;; Execution: (1 + 2 + 3 + 4 + 5 + 6 + 7 + 8) = 36
((((excessive 1) 3) 5) 7)
(assert-eq 36 ((((excessive 1) 3) 5) 7))
)
+3 -4
View File
@@ -1,12 +1,11 @@
;; Fibonacci Recursive
;; Benchmark: 33.3us
;; Benchmark-Repeat: 63
;; Output: 55
;; Benchmark: 37.1us
;; Benchmark-Repeat: 55
(do
(def fib (fn [n]
(if (< n 2)
n
(+ (fib (- n 1)) (fib (- n 2))))))
(fib 10)
(assert-eq 55 (fib 10))
)
+3 -4
View File
@@ -1,4 +1,3 @@
;; Benchmark: 55ns
;; Benchmark-Repeat: 35210
;; Output: 30
(+ 10 20)
;; Benchmark: 112ns
;; Benchmark-Repeat: 18385
(assert-eq 30 (+ 10 20))
+3 -4
View File
@@ -1,10 +1,9 @@
;; Higher-Order Function Example
;; Benchmark: 56ns
;; Benchmark-Repeat: 36342
;; Output: 25
;; Benchmark: 112ns
;; Benchmark-Repeat: 17678
(do
(def apply (fn [f x] (f x)))
(def square (fn [x] (* x x)))
(apply square 5)
(assert-eq 25 (apply square 5))
)
+3 -4
View File
@@ -1,9 +1,8 @@
;; Benchmark: 73ns
;; Benchmark-Repeat: 30580
;; Benchmark: 137ns
;; Benchmark-Repeat: 14903
;; Financial DSL Macro example
;; Demonstrates generating complex records from simple parameters.
;; Output: {:price 100, :size 2, :total 200}
(do
(macro trade [p s] `{:price ~p :size ~s :total (* ~p ~s)})
(trade 100 2))
(assert-eq {:price 100 :size 2 :total 200} (trade 100 2)))
+3 -4
View File
@@ -1,9 +1,8 @@
;; Benchmark: 176ns
;; Benchmark-Repeat: 11632
;; Output: 5
;; Benchmark: 268ns
;; Benchmark-Repeat: 7910
(do
(def y 1)
(macro m1 [x] `(do (def y 10) (assign y 4)))
(m1 8)
(+ y (m1 8))
(assert-eq 5 (+ y (m1 8)))
)
+3 -4
View File
@@ -1,7 +1,6 @@
;; Benchmark: 55ns
;; Benchmark-Repeat: 35990
;; Output: 42
;; Benchmark: 107ns
;; Benchmark-Repeat: 18414
(do
(macro t [x] `(fn [~x] ~x))
(def id (t a))
(id 42))
(assert-eq 42 (id 42)))
+3 -4
View File
@@ -1,9 +1,8 @@
;; Benchmark: 113ns
;; Benchmark-Repeat: 19089
;; Benchmark: 159ns
;; Benchmark-Repeat: 12580
;; Nested Macro and Arithmetic example
;; Output: 81
(do
(macro square [x] `(* ~x ~x))
(macro power4 [x] `(square (square ~x)))
(power4 3))
(assert-eq 81 (power4 3)))
+3 -4
View File
@@ -1,9 +1,8 @@
;; Benchmark: 136ns
;; Benchmark-Repeat: 14587
;; Benchmark: 252ns
;; Benchmark-Repeat: 7955
;; Macro Splicing example
;; Demonstrates unrolling a list into another list.
;; Output: [0 1 2 3 4]
(do
(macro wrap [items] `[0 ~@items 4])
(wrap [1 2 3]))
(assert-eq [0 1 2 3 4] (wrap [1 2 3])))
+3 -4
View File
@@ -1,9 +1,8 @@
;; Benchmark: 55ns
;; Benchmark-Repeat: 36062
;; Benchmark: 108ns
;; Benchmark-Repeat: 18646
;; Classic "unless" macro example
;; Demonstrates simple template substitution.
;; Output: 42
(do
(macro unless [c b] `(if ~c ... ~b))
(unless false 42))
(assert-eq 42 (unless false 42)))
+10 -12
View File
@@ -1,6 +1,5 @@
;; Benchmark: 1.2us
;; Benchmark-Repeat: 1731
;; Output: [150 130 "Insufficient funds" 130]
;; Benchmark: 1.3us
;; Benchmark-Repeat: 1528
; ---------------------------------------------------------
; Object-Oriented Records Example
@@ -34,21 +33,20 @@
; 1. Create an instance
(def my-acc (make-account 100))
; 2. Call 'deposit' method
; Note the double parens: (.deposit my-acc) gets the function, then we call it
; balance is now 150
; 2. deposit 50 -> balance is now 150
(def b1 ((.deposit my-acc) 50))
; 3. Call 'withdraw' method
; balance is now 130
; 3. withdraw 20 -> balance is now 130
(def b2 ((.withdraw my-acc) 20))
; 4. Call 'withdraw' with invalid amount
; 4. withdraw 1000 -> insufficient funds
(def error-msg ((.withdraw my-acc) 1000))
; 5. Call 'balance' getter
; 5. balance getter
(def final-balance ((.balance my-acc)))
; Return summary of operations
[b1 b2 error-msg final-balance]
(assert-eq 150 b1)
(assert-eq 130 b2)
(assert-eq "Insufficient funds" error-msg)
(assert-eq 130 final-balance)
)
+3 -4
View File
@@ -1,6 +1,5 @@
;; Benchmark: 55ns
;; Benchmark-Repeat: 36353
;; Output: 13
;; Benchmark: 110ns
;; Benchmark-Repeat: 19224
(do
(macro wrap [f] `(fn [x] (~f x)))
@@ -10,4 +9,4 @@
(def w1 (wrap add1))
(def w2 (wrap add2))
(w1 (w2 10)))
(assert-eq 13 (w1 (w2 10))))
+3 -4
View File
@@ -1,7 +1,6 @@
;; Benchmark: 68ns
;; Benchmark-Repeat: 36112
;; Output: 31.41592653589793
;; Benchmark: 111ns
;; Benchmark-Repeat: 18959
(do
(def area (fn [x] (* PI x)))
(area 10)
(assert-eq 31.41592653589793 (area 10))
)
+3 -4
View File
@@ -1,6 +1,5 @@
;; Benchmark: 102ns
;; Benchmark-Repeat: 20685
;; Output: [42 150]
;; Benchmark: 196ns
;; Benchmark-Repeat: 10532
(do
;; 1. Provokation Stack-Gap (bei Optimization Level 2)
(def result
@@ -20,5 +19,5 @@
(def b 100)
(+ a b))))
[(result) (complex-add 50)]
(assert-eq [42 150] [(result) (complex-add 50)])
)
+3 -4
View File
@@ -1,6 +1,5 @@
;; Benchmark: 1.4us
;; Benchmark-Repeat: 1423
;; Output: <StreamNode>
;; Benchmark: 1.8us
;; Benchmark-Repeat: 1150
(do
(def src1 (create-random-ohlc 42 3))
@@ -21,5 +20,5 @@
)
)
my_indicator
(assert-eq :StreamNode (type-of my_indicator))
)
+3 -4
View File
@@ -1,6 +1,5 @@
;; Benchmark: 2.1us
;; Benchmark-Repeat: 966
;; Output: <StreamNode>
;; Benchmark: 2.7us
;; Benchmark-Repeat: 749
(do
;; Set the random seed to match the existing test output exactly
@@ -45,5 +44,5 @@
)
)
my_indicator
(assert-eq :StreamNode (type-of my_indicator))
)
+2 -3
View File
@@ -1,12 +1,11 @@
;; Benchmark: 882.7us
;; Benchmark: 868.2us
;; Benchmark-Repeat: 4
;; Tests the effect of record inlining and field lookup optimization
;; Output: 10000
(do
(def config {:start 0 :limit 10000 :step 2})
(def x (.start config))
(while (< x (.limit config))
(assign x (+ x (.step config))))
x
(assert-eq 10000 x)
)
+3 -5
View File
@@ -1,11 +1,9 @@
;; Benchmark: 834ns
;; Benchmark-Repeat: 2387
;; Benchmark: 1.1us
;; Benchmark-Repeat: 1783
;; Test Record SoA specialization in Pipelines
;; Dank der neuen Spezialisierung wird hierfür im Hintergrund
;; eine SharedRecordSeries mit SoA-Layout (Float-Puffer für mid und range) erstellt.
;; Output: <StreamNode>
(do
(def ohlc_stream (create-random-ohlc 42 10))
@@ -21,5 +19,5 @@
)
)
indicator
(assert-eq :StreamNode (type-of indicator))
)
+8 -5
View File
@@ -1,6 +1,5 @@
;; Benchmark: 946ns
;; Benchmark-Repeat: 2116
;; Output: ["Alice" 101 :admin "Zürich" ["Alice" "Bob"] true]
;; Benchmark: 1.3us
;; Benchmark-Repeat: 1597
; ---------------------------------------------------------
; Records & Optimized Field Access Showcase
@@ -44,6 +43,10 @@
; Records with the same layout share memory; equality checks values.
(def is-equal (= {:x 1 :y 2} {:x 1 :y 2}))
; Return a summary of all tested features
[name id role city names is-equal]
(assert-eq "Alice" name)
(assert-eq 101 id)
(assert-eq :admin role)
(assert-eq "Zürich" city)
(assert-eq ["Alice" "Bob"] names)
(assert is-equal)
)
+2
View File
@@ -1,3 +1,5 @@
;; Benchmark: 18.8us
;; Benchmark-Repeat: 113
(do
(repeat n 10 (print n)
)
+1
View File
@@ -1,3 +1,4 @@
;; Skip: work in progress — requires external RTL module (SMA not yet implemented)
#use rtl
(do
+4 -7
View File
@@ -1,6 +1,5 @@
;; Output: 26.7
;; Benchmark: 890ns
;; Benchmark-Repeat: 2240
;; Benchmark: 1.1us
;; Benchmark-Repeat: 1877
(do
(def my_ticks (series 100 {:price :float :volume :int :msg :text}))
@@ -8,10 +7,8 @@
(push my_ticks {:price 11.2 :volume 200 :msg "B"})
(push my_ticks {:price 15.5 :volume 300 :msg "C"})
;(repeat n 100 (push my_ticks {:price (+ n 15.5) :volume (ceil (/ n 300)) :msg "??"})
(def prices (.price my_ticks))
(+ (prices 0) (prices 1))
;; prices 0 = 15.5 (newest), prices 1 = 11.2
(assert-eq 26.7 (+ (prices 0) (prices 1)))
)
+1
View File
@@ -1,3 +1,4 @@
;; Skip: known macro hygiene issue — 'stream' is renamed inside template expansion
(do
(def stream (create-random-ohlc 42 200))
+3 -4
View File
@@ -1,9 +1,8 @@
;; Takeuchi Function Benchmark
;; heavily recursive, benefits significantly from specialization of integer arithmetic
;; and direct function calls (skipping dynamic dispatch).
;; Output: 5
;; Benchmark: 314.2us
;; Benchmark: 339.7us
;; Benchmark-Repeat: 7
(do
(def tak (fn [x y z]
@@ -13,5 +12,5 @@
(tak (- y 1) z x)
(tak (- z 1) x y)))))
(assert-eq 5 (tak 12 8 4))
)
+2 -3
View File
@@ -1,11 +1,10 @@
;; Benchmark: 1.5ms
;; Benchmark: 1.8ms
;; Benchmark-Repeat: 3
;; Output: "done"
(do
(def count_down (fn [n]
(if (< n 1)
"done"
(count_down (- n 1)))))
(count_down 10000)
(assert-eq "done" (count_down 10000))
)
+4 -4
View File
@@ -1,6 +1,5 @@
;; Benchmark: 513ns
;; Benchmark-Repeat: 3911
;; Output: ["Symbol:" "btc" "field:" :close "id:" "cls"]
;; Benchmark: 664ns
;; Benchmark-Repeat: 3026
(do
(def p (fn [conf]
(do
@@ -11,5 +10,6 @@
)
)
(p ["btc" [:close "cls"]])
(assert-eq ["Symbol:" "btc" "field:" :close "id:" "cls"]
(p ["btc" [:close "cls"]]))
)
+4 -5
View File
@@ -1,12 +1,10 @@
;; Benchmark: 936ns
;; Benchmark-Repeat: 2134
;; Benchmark: 2.4us
;; Benchmark-Repeat: 785
;; Demonstration of N-dimensional Tuples, Vectors, and Matrices
;; Based on docs/Tupel 1.md
;;
;; This test verifies that the literals are correctly parsed and represented.
;; Type inference is verified via internal compiler unit tests.
;;
;; Output: [[1 3.14 "text"] [10 20 30 40] [[1 2] [3 4]] [[[1 2] [3 4]] [[5 6] [7 8]]] [[1 2] [3 4 5]] {:x 1, :y 0.3}]
(do
(def tpl [1, 3.14, "text"])
@@ -16,5 +14,6 @@
(def mixed [[1 2] [3 4 5]])
(def rec {:x 1, :y 0.3})
[tpl v mat2d mat3d mixed rec]
(assert-eq [[1 3.14 "text"] [10 20 30 40] [[1 2] [3 4]] [[[1 2] [3 4]] [[5 6] [7 8]]] [[1 2] [3 4 5]] {:x 1 :y 0.3}]
[tpl v mat2d mat3d mixed rec])
)
+109 -1
View File
@@ -1,5 +1,5 @@
use crate::ast::environment::Environment;
use crate::ast::types::{Purity, Signature, StaticType, Value};
use crate::ast::types::{Keyword, Purity, Signature, StaticType, Value};
use std::rc::Rc;
pub fn register(env: &Environment) {
@@ -8,6 +8,7 @@ pub fn register(env: &Environment) {
register_comparison(env);
register_logic(env);
register_io(env);
register_testing(env);
}
fn register_constants(env: &Environment) {
@@ -523,3 +524,110 @@ fn register_io(env: &Environment) {
}).doc("Prints all arguments to stdout followed by a newline. Returns void.")
.examples(&["(print \"Hello World\")", "(print x y z)"]);
}
/// Structural equality that compares record values by field content,
/// not by Arc pointer identity. Required because the compiler may fold
/// record literals at compile-time, yielding a different Arc than one
/// created at runtime via make_record.
fn values_equal(a: &Value, b: &Value) -> bool {
match (a, b) {
(Value::Record(la, va), Value::Record(lb, vb)) => {
la.fields.len() == lb.fields.len()
&& la
.fields
.iter()
.zip(lb.fields.iter())
.all(|((ka, _), (kb, _))| ka == kb)
&& va
.iter()
.zip(vb.iter())
.all(|(x, y)| values_equal(x, y))
}
(Value::Tuple(a), Value::Tuple(b)) => {
a.len() == b.len() && a.iter().zip(b.iter()).all(|(x, y)| values_equal(x, y))
}
_ => a == b,
}
}
fn register_testing(env: &Environment) {
let any_ty = StaticType::Function(Box::new(Signature {
params: StaticType::Any,
ret: StaticType::Void,
}));
// (assert cond) / (assert cond "msg")
env.register_native_fn("assert", any_ty.clone(), Purity::Impure, |args| {
let cond = match args.first() {
Some(Value::Bool(b)) => *b,
Some(other) => panic!("assert expects a bool, got {}", other),
None => panic!("assert requires at least 1 argument"),
};
if !cond {
match args.get(1) {
Some(Value::Text(msg)) => panic!("assertion failed: {}", msg),
_ => panic!("assertion failed"),
}
}
Value::Void
})
.doc("Asserts that a condition is true. Panics with an optional message on failure.")
.examples(&["(assert (= 1 1))", "(assert (> x 0) \"x must be positive\")"]);
// (assert-eq expected actual) / (assert-eq expected actual "msg")
env.register_native_fn("assert-eq", any_ty.clone(), Purity::Impure, |args| {
if args.len() < 2 {
panic!("assert-eq requires at least 2 arguments");
}
let expected = &args[0];
let actual = &args[1];
if !values_equal(expected, actual) {
match args.get(2) {
Some(Value::Text(msg)) => panic!(
"assertion failed: {}\n expected: {}\n got: {}",
msg, expected, actual
),
_ => panic!(
"assertion failed: expected {}, got {}",
expected, actual
),
}
}
Value::Void
})
.doc("Asserts that expected == actual. Panics with a diff message on failure.")
.examples(&["(assert-eq 42 (factorial 5 1))", "(assert-eq :ok (status) \"wrong status\")"]);
// (type-of x) -> keyword
let type_of_ty = StaticType::Function(Box::new(Signature {
params: StaticType::Tuple(vec![StaticType::Any]),
ret: StaticType::Keyword,
}));
env.register_native_fn("type-of", type_of_ty, Purity::Pure, |args| {
let name = match args.first() {
Some(v) => match v.static_type() {
StaticType::Void => "void",
StaticType::Bool => "bool",
StaticType::Int => "int",
StaticType::Float => "float",
StaticType::DateTime => "datetime",
StaticType::Text => "text",
StaticType::Keyword => "keyword",
StaticType::Tuple(_)
| StaticType::Vector(_, _)
| StaticType::Matrix(_, _) => "tuple",
StaticType::Record(_) => "record",
StaticType::Series(_) => "series",
StaticType::Stream(_) => "stream",
StaticType::Function(_) | StaticType::FunctionOverloads(_) => "function",
StaticType::FieldAccessor(_) => "field-accessor",
StaticType::Object(name) => name,
_ => "unknown",
},
None => panic!("type-of requires 1 argument"),
};
Value::Keyword(Keyword::intern(name))
})
.doc("Returns the type of a value as a keyword (e.g. :int, :float, :stream).")
.examples(&["(type-of 42)", "(type-of my-stream)"]);
}
+24 -2
View File
@@ -441,7 +441,19 @@ impl VM {
self.tail_call = Some((func_val, arg_vals));
return Ok(Value::Void);
}
Value::Function(f) => return Ok((f.func)(&arg_vals)),
Value::Function(f) => {
return std::panic::catch_unwind(std::panic::AssertUnwindSafe(|| {
(f.func)(&arg_vals)
}))
.map_err(|e| {
e.downcast_ref::<String>()
.cloned()
.or_else(|| {
e.downcast_ref::<&str>().map(|s| s.to_string())
})
.unwrap_or_else(|| "runtime panic".to_string())
});
}
Value::FieldAccessor(k) => {
if arg_vals.len() != 1 {
return Err(format!(
@@ -510,7 +522,17 @@ impl VM {
loop {
let result = match &current_func {
Value::Function(f) => {
let res = (f.func)(&self.stack[base..]);
let res = std::panic::catch_unwind(std::panic::AssertUnwindSafe(|| {
(f.func)(&self.stack[base..])
}))
.map_err(|e| {
e.downcast_ref::<String>()
.cloned()
.or_else(|| {
e.downcast_ref::<&str>().map(|s| s.to_string())
})
.unwrap_or_else(|| "runtime panic".to_string())
})?;
self.stack.truncate(base);
return Ok(res);
}
+15 -38
View File
@@ -25,53 +25,30 @@ pub fn run_functional_tests() -> Vec<TestResult> {
pub fn run_functional_tests_with_optimization(enabled: bool) -> Vec<TestResult> {
let mut results = Vec::new();
let entries = fs::read_dir("examples").unwrap();
let output_re = Regex::new(r";; Output: (.*)").unwrap();
for entry in entries.filter_map(|e| e.ok()) {
let mut env = Environment::new(); // Fresh environment per test file
let mut env = Environment::new();
env.optimization = enabled;
let path = entry.path();
if path.extension().is_some_and(|ext| ext == "myc") {
let content = fs::read_to_string(&path).unwrap();
let name = path.file_name().unwrap().to_string_lossy().to_string();
let expected_output = output_re
.captures(&content)
.map(|m| m.get(1).unwrap().as_str().trim().to_string());
if content.contains(";; Skip:") {
continue;
}
if let Some(expected) = expected_output {
match env.run_script(&content) {
Ok(val) => {
let val_str = format!("{}", val);
if val_str == expected {
results.push(TestResult {
name,
success: true,
message: format!("OK: {}", val_str),
});
} else {
results.push(TestResult {
name,
success: false,
message: format!(
"Opt {}: Expected {}, got {}",
if enabled { "ON" } else { "OFF" },
expected,
val_str
),
});
}
}
Err(e) => results.push(TestResult {
name,
success: false,
message: format!(
"Opt {}: Error: {}",
if enabled { "ON" } else { "OFF" },
e
),
}),
}
match env.run_script(&content) {
Ok(_) => results.push(TestResult {
name,
success: true,
message: "OK".to_string(),
}),
Err(e) => results.push(TestResult {
name,
success: false,
message: format!("Opt {}: {}", if enabled { "ON" } else { "OFF" }, e),
}),
}
}
}