formualizer-eval 0.7.0

High-performance Arrow-backed Excel formula engine with dependency graph and incremental recalculation
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
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
427
428
429
430
431
432
433
434
//! Tests for the Stage-1 live-edge collector (pre-work for RFC #112).
//!
//! These drive a real `Engine` wrapped in `RecordingContext`, evaluating
//! formula ASTs via `Interpreter` directly — exactly how Stage-2 SCC tasks
//! will evaluate statically-cyclic members. Nothing here touches production
//! evaluation paths: `RecordingContext` is constructed only by this test
//! module, and no public `Engine` API exposes or stores a collector.

use crate::engine::live_edges::{LiveEdgeCollector, RecordingContext};
use crate::engine::named_range::{NameScope, NamedDefinition};
use crate::engine::{Engine, EvalConfig};
use crate::interpreter::Interpreter;
use crate::reference::{CellRef, Coord, RangeRef};
use crate::test_workbook::TestWorkbook;
use formualizer_common::LiteralValue;
use rustc_hash::FxHashSet;

fn parse(formula: &str) -> formualizer_parse::parser::ASTNode {
    formualizer_parse::parser::parse(formula).expect("valid formula")
}

fn new_engine() -> Engine<TestWorkbook> {
    Engine::new(TestWorkbook::new(), EvalConfig::default())
}

fn cell(engine: &Engine<TestWorkbook>, sheet: &str, row: u32, col: u32) -> CellRef {
    CellRef::new(
        engine.sheet_id(sheet).expect("sheet exists"),
        Coord::from_excel(row, col, true, true),
    )
}

/// Evaluate `formula` as if it were the body of `member` (an SCC member at
/// `member_idx`), recording live edges into `collector`.
fn eval_as_member(
    engine: &Engine<TestWorkbook>,
    collector: &LiveEdgeCollector,
    member_idx: u32,
    sheet: &str,
    member: CellRef,
    formula: &str,
) -> LiteralValue {
    collector.set_current(member_idx);
    let ctx = RecordingContext::new(engine, collector);
    let interp = Interpreter::new_with_cell(&ctx, sheet, member);
    interp
        .evaluate_ast(&parse(formula))
        .map(|cv| cv.into_literal())
        .unwrap_or_else(LiteralValue::Error)
}

fn edges(collector: &LiveEdgeCollector) -> FxHashSet<(u32, u32)> {
    collector.take_edges()
}

fn set_num(engine: &mut Engine<TestWorkbook>, sheet: &str, row: u32, col: u32, v: f64) {
    engine
        .set_cell_value(sheet, row, col, LiteralValue::Number(v))
        .unwrap();
}

/* ─────────────────────────── 1. scalar reads ─────────────────────────── */

#[test]
fn scalar_read_of_member_records_edge() {
    let mut engine = new_engine();
    set_num(&mut engine, "Sheet1", 1, 1, 5.0); // A1 (member)
    set_num(&mut engine, "Sheet1", 1, 2, 7.0); // B1 (non-member)
    engine.evaluate_all().unwrap();

    // Members: [C1 (the evaluating member), A1].
    let c1 = cell(&engine, "Sheet1", 1, 3);
    let a1 = cell(&engine, "Sheet1", 1, 1);
    let collector = LiveEdgeCollector::new(&[c1, a1]);

    let v = eval_as_member(&engine, &collector, 0, "Sheet1", c1, "=A1");
    assert_eq!(v, LiteralValue::Number(5.0));
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1)]));

    // Reading a non-member records nothing.
    let v = eval_as_member(&engine, &collector, 0, "Sheet1", c1, "=B1");
    assert_eq!(v, LiteralValue::Number(7.0));
    assert!(edges(&collector).is_empty());
}

/* ──────────────────────── 2. short-circuiting ────────────────────────── */

/// For each (formula_no_edge, formula_edge) pair: the member read sits in a
/// branch that is untaken in the first formula and taken in the second.
fn assert_short_circuit_polarity(no_edge: &str, edge_expected: &str) {
    let mut engine = new_engine();
    set_num(&mut engine, "Sheet1", 1, 1, 5.0); // A1 (member)
    engine.evaluate_all().unwrap();

    let c1 = cell(&engine, "Sheet1", 1, 3);
    let a1 = cell(&engine, "Sheet1", 1, 1);
    let collector = LiveEdgeCollector::new(&[c1, a1]);

    eval_as_member(&engine, &collector, 0, "Sheet1", c1, no_edge);
    assert!(
        edges(&collector).is_empty(),
        "{no_edge}: untaken branch must record no live edge"
    );

    eval_as_member(&engine, &collector, 0, "Sheet1", c1, edge_expected);
    assert_eq!(
        edges(&collector),
        FxHashSet::from_iter([(0, 1)]),
        "{edge_expected}: taken branch must record the live edge"
    );
}

#[test]
fn if_short_circuit_polarity() {
    assert_short_circuit_polarity("=IF(TRUE, 1, A1)", "=IF(FALSE, 1, A1)");
}

#[test]
fn ifs_short_circuit_polarity() {
    assert_short_circuit_polarity("=IFS(TRUE, 1, TRUE, A1)", "=IFS(FALSE, 1, TRUE, A1)");
}

#[test]
fn choose_short_circuit_polarity() {
    assert_short_circuit_polarity("=CHOOSE(1, 9, A1)", "=CHOOSE(2, 9, A1)");
}

#[test]
fn switch_short_circuit_polarity() {
    // First: case 1 matches, default (A1) untaken. Second: default taken.
    assert_short_circuit_polarity("=SWITCH(1, 1, 9, A1)", "=SWITCH(2, 1, 9, A1)");
}

/* ─────────────────────────── 3. range reads ──────────────────────────── */

#[test]
fn range_read_intersects_members_exactly() {
    let mut engine = new_engine();
    for r in 1..=10 {
        set_num(&mut engine, "Sheet1", r, 2, r as f64); // B1:B10
        set_num(&mut engine, "Sheet1", r, 3, r as f64); // C1:C10
    }
    engine.evaluate_all().unwrap();

    let d1 = cell(&engine, "Sheet1", 1, 4);
    let b3 = cell(&engine, "Sheet1", 3, 2);
    let b7 = cell(&engine, "Sheet1", 7, 2);
    let collector = LiveEdgeCollector::new(&[d1, b3, b7]);

    let v = eval_as_member(&engine, &collector, 0, "Sheet1", d1, "=SUM(B1:B10)");
    assert_eq!(v, LiteralValue::Number(55.0));
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1), (0, 2)]));

    // A rect not containing any member records nothing.
    eval_as_member(&engine, &collector, 0, "Sheet1", d1, "=SUM(C1:C10)");
    assert!(edges(&collector).is_empty());

    // Rect adjacent to a member (B4:B6 vs members B3/B7) records nothing.
    eval_as_member(&engine, &collector, 0, "Sheet1", d1, "=SUM(B4:B6)");
    assert!(edges(&collector).is_empty());
}

#[test]
fn range_read_boundary_inclusion_at_rect_corners() {
    let mut engine = new_engine();
    for r in 1..=10 {
        set_num(&mut engine, "Sheet1", r, 2, 1.0); // B1:B10
    }
    engine.evaluate_all().unwrap();

    let d1 = cell(&engine, "Sheet1", 1, 4);
    let b1 = cell(&engine, "Sheet1", 1, 2); // top corner of B1:B10
    let b10 = cell(&engine, "Sheet1", 10, 2); // bottom corner of B1:B10
    let collector = LiveEdgeCollector::new(&[d1, b1, b10]);

    eval_as_member(&engine, &collector, 0, "Sheet1", d1, "=SUM(B1:B10)");
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1), (0, 2)]));

    // One row inside: B2:B9 excludes both corner members.
    eval_as_member(&engine, &collector, 0, "Sheet1", d1, "=SUM(B2:B9)");
    assert!(edges(&collector).is_empty());
}

/* ─────────────────── 4. whole-column (unbounded) reads ───────────────── */

#[test]
fn whole_column_read_resolves_used_bounds_and_records_member() {
    let mut engine = new_engine();
    for r in 1..=10 {
        set_num(&mut engine, "Sheet1", r, 2, r as f64); // B1:B10
    }
    engine.evaluate_all().unwrap();

    let d1 = cell(&engine, "Sheet1", 1, 4);
    let b5 = cell(&engine, "Sheet1", 5, 2);
    let a5 = cell(&engine, "Sheet1", 5, 1); // not in column B
    let collector = LiveEdgeCollector::new(&[d1, b5, a5]);

    let v = eval_as_member(&engine, &collector, 0, "Sheet1", d1, "=SUM(B:B)");
    assert_eq!(v, LiteralValue::Number(55.0));
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1)]));
}

/* ───────────────────────── 5. named ranges ───────────────────────────── */

#[test]
fn named_range_region_containing_member_records_edge() {
    let mut engine = new_engine();
    for r in 1..=5 {
        set_num(&mut engine, "Sheet1", r, 2, r as f64); // B1:B5
    }
    engine.evaluate_all().unwrap();

    let sheet_id = engine.sheet_id("Sheet1").unwrap();
    let nr_range = RangeRef::new(
        CellRef::new(sheet_id, Coord::from_excel(2, 2, true, true)), // B2
        CellRef::new(sheet_id, Coord::from_excel(4, 2, true, true)), // B4
    );
    engine
        .define_name("NR", NamedDefinition::Range(nr_range), NameScope::Workbook)
        .unwrap();

    let d1 = cell(&engine, "Sheet1", 1, 4);
    let b3 = cell(&engine, "Sheet1", 3, 2); // inside NR
    let b5 = cell(&engine, "Sheet1", 5, 2); // outside NR
    let collector = LiveEdgeCollector::new(&[d1, b3, b5]);

    let v = eval_as_member(&engine, &collector, 0, "Sheet1", d1, "=SUM(NR)");
    assert_eq!(v, LiteralValue::Number(9.0));
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1)]));
}

#[test]
fn table_column_region_containing_member_records_edge() {
    let mut engine = new_engine();
    // Table T over A1:B3: header row + 2 data rows.
    set_num(&mut engine, "Sheet1", 2, 1, 5.0);
    set_num(&mut engine, "Sheet1", 2, 2, 10.0);
    set_num(&mut engine, "Sheet1", 3, 1, 7.0);
    set_num(&mut engine, "Sheet1", 3, 2, 20.0);
    engine.evaluate_all().unwrap();

    let sheet_id = engine.sheet_id("Sheet1").unwrap();
    let range = RangeRef::new(
        CellRef::new(sheet_id, Coord::from_excel(1, 1, true, true)),
        CellRef::new(sheet_id, Coord::from_excel(3, 2, true, true)),
    );
    engine
        .define_table(
            "Sales",
            range,
            true,
            vec!["Region".into(), "Amount".into()],
            false,
        )
        .unwrap();

    let d1 = cell(&engine, "Sheet1", 1, 4);
    let b2 = cell(&engine, "Sheet1", 2, 2); // inside Sales[Amount]
    let a2 = cell(&engine, "Sheet1", 2, 1); // in Sales[Region], not [Amount]
    let collector = LiveEdgeCollector::new(&[d1, b2, a2]);

    let v = eval_as_member(&engine, &collector, 0, "Sheet1", d1, "=SUM(Sales[Amount])");
    assert_eq!(v, LiteralValue::Number(30.0));
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1)]));
}

/* ──────────────────── 6. dynamic reads (INDIRECT) ─────────────────────── */

#[test]
fn indirect_scalar_read_flows_through_wrapper() {
    let mut engine = new_engine();
    set_num(&mut engine, "Sheet1", 3, 2, 42.0); // B3 (member)
    engine.evaluate_all().unwrap();

    let d1 = cell(&engine, "Sheet1", 1, 4);
    let b3 = cell(&engine, "Sheet1", 3, 2);
    let collector = LiveEdgeCollector::new(&[d1, b3]);

    let v = eval_as_member(&engine, &collector, 0, "Sheet1", d1, "=INDIRECT(\"B3\")");
    assert_eq!(v, LiteralValue::Number(42.0));
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1)]));

    // Dynamic *range* read: the rect is recorded at resolution time.
    let v = eval_as_member(
        &engine,
        &collector,
        0,
        "Sheet1",
        d1,
        "=SUM(INDIRECT(\"B1:B5\"))",
    );
    assert_eq!(v, LiteralValue::Number(42.0));
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1)]));

    // Dynamic read of a non-member records nothing.
    eval_as_member(&engine, &collector, 0, "Sheet1", d1, "=INDIRECT(\"C3\")");
    assert!(edges(&collector).is_empty());
}

/* ─────────────────────────── 8. attribution ──────────────────────────── */

#[test]
fn edges_attribute_to_current_member() {
    let mut engine = new_engine();
    set_num(&mut engine, "Sheet1", 1, 1, 1.0); // A1
    set_num(&mut engine, "Sheet1", 2, 1, 2.0); // A2
    engine.evaluate_all().unwrap();

    let a1 = cell(&engine, "Sheet1", 1, 1);
    let a2 = cell(&engine, "Sheet1", 2, 1);
    let collector = LiveEdgeCollector::new(&[a1, a2]);

    // A1's formula reads A2; A2's formula reads A1 (a 2-cycle).
    eval_as_member(&engine, &collector, 0, "Sheet1", a1, "=A2");
    eval_as_member(&engine, &collector, 1, "Sheet1", a2, "=A1");
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1), (1, 0)]));
}

/* ─────────────────────────── 9. self-edges ───────────────────────────── */

#[test]
fn member_ranging_over_itself_records_self_edge() {
    let mut engine = new_engine();
    for r in 1..=3 {
        set_num(&mut engine, "Sheet1", r, 2, r as f64); // B1:B3
    }
    engine.evaluate_all().unwrap();

    let b2 = cell(&engine, "Sheet1", 2, 2);
    let collector = LiveEdgeCollector::new(&[b2]);

    // B2's formula ranges over B1:B3, which includes B2 itself.
    eval_as_member(&engine, &collector, 0, "Sheet1", b2, "=SUM(B1:B3)");
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 0)]));
}

/* ─────────────────────────── 10. multi-sheet ─────────────────────────── */

#[test]
fn cross_sheet_qualified_reads_record_member_on_other_sheet() {
    let mut engine = new_engine();
    engine.add_sheet("Sheet2").unwrap();
    set_num(&mut engine, "Sheet1", 1, 1, 1.0); // Sheet1!A1
    set_num(&mut engine, "Sheet2", 1, 1, 9.0); // Sheet2!A1 (member)
    set_num(&mut engine, "Sheet2", 2, 1, 8.0); // Sheet2!A2
    engine.evaluate_all().unwrap();

    let s1_c1 = cell(&engine, "Sheet1", 1, 3);
    let s2_a1 = cell(&engine, "Sheet2", 1, 1);
    let collector = LiveEdgeCollector::new(&[s1_c1, s2_a1]);

    // Scalar qualified read from Sheet1.
    let v = eval_as_member(&engine, &collector, 0, "Sheet1", s1_c1, "=Sheet2!A1");
    assert_eq!(v, LiteralValue::Number(9.0));
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1)]));

    // Same coordinates on the *current* sheet must NOT match the member.
    eval_as_member(&engine, &collector, 0, "Sheet1", s1_c1, "=A1");
    assert!(edges(&collector).is_empty());

    // Qualified range read.
    let v = eval_as_member(
        &engine,
        &collector,
        0,
        "Sheet1",
        s1_c1,
        "=SUM(Sheet2!A1:A2)",
    );
    assert_eq!(v, LiteralValue::Number(17.0));
    assert_eq!(edges(&collector), FxHashSet::from_iter([(0, 1)]));
}

/* ──────────────────────────── 11. inertness ──────────────────────────── */

/// Structural inertness: the acyclic/hot path never constructs a
/// `RecordingContext` — no `Engine` API creates, stores, or exposes one (the
/// only constructor takes an externally-owned collector), so production
/// evaluation is untouched by this module. This test pins the cheap proxies
/// for that argument: the wrapper is two borrowed pointers (no owned state to
/// allocate), and wrapped evaluation is value-identical to bare evaluation.
#[test]
fn wrapper_is_inert_and_value_transparent() {
    assert_eq!(
        std::mem::size_of::<RecordingContext<'_, TestWorkbook>>(),
        2 * std::mem::size_of::<usize>(),
        "RecordingContext must stay two borrowed pointers"
    );

    let mut engine = new_engine();
    for r in 1..=10 {
        set_num(&mut engine, "Sheet1", r, 2, r as f64); // B1:B10
    }
    set_num(&mut engine, "Sheet1", 1, 1, 100.0); // A1
    engine.evaluate_all().unwrap();

    let d1 = cell(&engine, "Sheet1", 1, 4);
    let formula = "=SUM(B1:B10)+A1*2";

    // Bare engine context (production shape).
    let bare = {
        let interp = Interpreter::new_with_cell(&engine, "Sheet1", d1);
        interp.evaluate_ast(&parse(formula)).unwrap().into_literal()
    };

    // Wrapped with an empty membership: identical value, zero edges.
    let collector = LiveEdgeCollector::new(&[]);
    let ctx = RecordingContext::new(&engine, &collector);
    let wrapped = {
        let interp = Interpreter::new_with_cell(&ctx, "Sheet1", d1);
        interp.evaluate_ast(&parse(formula)).unwrap().into_literal()
    };

    assert_eq!(bare, wrapped);
    assert!(collector.take_edges().is_empty());
}

/// Reads observed before `set_current` is called are not attributable to any
/// member and must be dropped rather than mis-attributed.
#[test]
fn reads_without_current_member_are_dropped() {
    let mut engine = new_engine();
    set_num(&mut engine, "Sheet1", 1, 1, 5.0); // A1 (member)
    engine.evaluate_all().unwrap();

    let a1 = cell(&engine, "Sheet1", 1, 1);
    let collector = LiveEdgeCollector::new(&[a1]);
    let ctx = RecordingContext::new(&engine, &collector);
    let d1 = cell(&engine, "Sheet1", 1, 4);
    let interp = Interpreter::new_with_cell(&ctx, "Sheet1", d1);
    let _ = interp.evaluate_ast(&parse("=A1"));
    assert!(collector.take_edges().is_empty());
}