fdu-core 0.3.0

The fdu engine: incremental hierarchical tallies over large directory trees
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
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
//! Deterministic transparent-box support for opened-root session goldens.
//!
//! The recorder consumes production requests, responses, commits, and errors. It owns
//! only stable presentation and contract-coverage bookkeeping; it cannot publish facts
//! or manufacture operation results.

use std::collections::{BTreeMap, BTreeSet};
use std::fmt::Debug;
use std::path::{Path, PathBuf};

use crate::{
    ChangeOutcome, ChangePoll, Commit, Coverage, CoverageReason, EffectiveChange, EntryKind, Error,
    Freshness, IndexState, Knowledge, LifecyclePhase, ProjectionResult, ReadProjection,
    ReadRequest, ReadResponse, RefreshResult, RowShape, SessionId, StateTransition,
};

use super::OpenedIndex;

const UPDATE_ENV: &str = "FDU_UPDATE_OPENED_ROOT_GOLDEN";

/// Complete stable trace for one canonical opened-root session.
pub(super) struct SessionTrace {
    name: &'static str,
    aliases: BTreeMap<String, &'static str>,
    sessions: Vec<(String, String)>,
    lines: Vec<String>,
    coverage: ContractCoverage,
    model: SessionModel,
}

impl SessionTrace {
    pub(super) fn new(name: &'static str, root: &Path) -> Self {
        let mut aliases = BTreeMap::new();
        insert_path_alias(&mut aliases, root, "$ROOT");
        if let Ok(canonical) = std::fs::canonicalize(root) {
            insert_path_alias(&mut aliases, &canonical, "$ROOT");
        }
        Self {
            name,
            aliases,
            sessions: Vec::new(),
            lines: vec![format!("scenario: schema=1 name={name}")],
            coverage: ContractCoverage::default(),
            model: SessionModel::new(root),
        }
    }

    pub(super) fn alias_path(&mut self, path: &Path, alias: &'static str) {
        insert_path_alias(&mut self.aliases, path, alias);
        if let Ok(canonical) = std::fs::canonicalize(path) {
            insert_path_alias(&mut self.aliases, &canonical, alias);
        }
    }

    pub(super) fn bind_session(&mut self, session: SessionId) {
        let rendered = session.0.to_string();
        if self.sessions.iter().any(|(known, _)| known == &rendered) {
            return;
        }
        let alias = format!("session-{}", self.sessions.len() + 1);
        self.sessions.push((rendered, alias));
    }

    pub(super) fn record(&mut self, kind: &str, value: &impl Debug) {
        self.lines.push(format!("{kind}: {}", self.normalize(format!("{value:?}"))));
    }

    pub(super) fn record_text(&mut self, kind: &str, value: impl AsRef<str>) {
        self.lines.push(format!("{kind}: {}", self.normalize(value.as_ref().to_owned())));
    }

    pub(super) fn observe_state(&mut self, state: IndexState) {
        self.coverage.observe_state(state);
    }

    pub(super) fn observe_read(&mut self, result: &crate::Result<ReadResponse>) {
        self.coverage.observe_read(result);
    }

    pub(super) fn observe_poll(&mut self, result: &crate::Result<ChangePoll>) {
        self.coverage.observe_poll(result);
    }

    pub(super) fn verify_poll(&mut self, opened: &OpenedIndex, result: &crate::Result<ChangePoll>) {
        if let Ok(poll) = result {
            self.model.observe_poll(opened, poll);
        }
    }

    pub(super) fn observe_refresh(&mut self, result: &crate::Result<RefreshResult>) {
        self.coverage.observe_refresh(result);
    }

    pub(super) fn observe_priority(&mut self, result: &crate::Result<()>) {
        self.coverage.key(if result.is_ok() { "prioritize.ok" } else { "prioritize.error" });
        if let Err(error) = result {
            self.coverage.observe_error(error);
        }
    }

    pub(super) fn observe_close(&mut self, result: &crate::Result<()>) {
        self.coverage.key(if result.is_ok() { "close.ok" } else { "close.error" });
        if let Err(error) = result {
            self.coverage.observe_error(error);
        }
    }

    pub(super) fn coverage(&self) -> &ContractCoverage {
        &self.coverage
    }

    pub(super) fn finish(self) -> String {
        let mut output = self.lines.join("\n");
        output.push('\n');
        output
    }

    pub(super) fn assert_golden(self) {
        let name = self.name;
        let actual = self.finish();
        let path = golden_path(name);
        match std::env::var(UPDATE_ENV) {
            Ok(requested) if requested == name => {
                std::fs::create_dir_all(path.parent().expect("golden parent"))
                    .expect("create opened-root golden directory");
                std::fs::write(&path, actual).expect("write named opened-root golden");
            }
            _ => {
                let expected = std::fs::read_to_string(&path).unwrap_or_else(|error| {
                    panic!(
                        "read opened-root golden {}: {error}; update only this scenario with \
                         `make opened-root-golden-update SCENARIO={name}`",
                        path.display()
                    )
                });
                assert_eq!(actual, expected, "opened-root session golden {name}");
            }
        }
    }

    fn normalize(&self, mut value: String) -> String {
        let mut aliases: Vec<_> = self.aliases.iter().collect();
        aliases.sort_by_key(|(path, _)| std::cmp::Reverse(path.len()));
        for (path, alias) in aliases {
            value = value.replace(path, alias);
        }
        value = value.replace("/private$ROOT", "$ROOT");
        value = normalize_debug_path_separators(value, std::path::MAIN_SEPARATOR);
        value = replace_system_times(value);
        for (session, alias) in &self.sessions {
            value = value.replace(session, alias);
        }
        for (field, replacement) in [
            ("allocated", "[ALLOCATED]"),
            ("mtime_ns", "[TIME]"),
            ("ctime_ns", "[TIME]"),
            ("inode", "[INODE]"),
            ("dev", "[DEVICE]"),
        ] {
            value = replace_integer_field(value, field, replacement);
        }
        value = replace_integer_after(value, "newest_mtime_ns: Some(", "[TIME]");
        value = replace_integer_after(value, "observed_at_ns: Some(", "[TIME]");
        value = replace_integer_after(value, "kind: Dir, attrs: Attrs { size: ", "[DIR_SIZE]");
        // This byte count includes size_of::<ContinuationRecord>(), whose native
        // representation differs by platform. The scenario checks the actual refusal
        // against its exact limit before formatting; no other attempted count is hidden.
        value = replace_integer_after(
            value,
            "ContinuationRecordLimit { attempted: ",
            "[CONTINUATION_BYTES]",
        );
        value
    }
}

fn insert_path_alias(
    aliases: &mut BTreeMap<String, &'static str>,
    path: &Path,
    alias: &'static str,
) {
    let rendered = path.display().to_string();
    aliases.insert(rendered.clone(), alias);
    aliases.insert(debug_string_contents(&rendered), alias);
}

fn debug_string_contents(value: &str) -> String {
    let quoted = format!("{value:?}");
    quoted[1..quoted.len() - 1].to_owned()
}

fn normalize_debug_path_separators(value: String, separator: char) -> String {
    if separator == '\\' { value.replace("\\\\", "/") } else { value }
}

/// `SystemTime`'s derived debug shape is an implementation detail of each platform.
fn replace_system_times(mut source: String) -> String {
    const PREFIX: &str = "SystemTime {";
    const REPLACEMENT: &str = "[SYSTEM_TIME]";
    let mut offset = 0;
    while let Some(found) = source[offset..].find(PREFIX) {
        let start = offset + found;
        let Some(relative_end) = source[start + PREFIX.len()..].find('}') else {
            break;
        };
        let end = start + PREFIX.len() + relative_end + 1;
        source.replace_range(start..end, REPLACEMENT);
        offset = start + REPLACEMENT.len();
    }
    source
}

#[cfg(test)]
mod normalization_tests {
    use super::*;

    #[test]
    fn path_aliases_cover_native_and_debug_escaped_spellings() {
        let path = Path::new(r"\\?\C:\Temp\root");
        let rendered = path.display().to_string();
        let mut aliases = BTreeMap::new();

        insert_path_alias(&mut aliases, path, "$ROOT");

        assert_eq!(aliases.get(&rendered), Some(&"$ROOT"));
        assert_eq!(aliases.get(&debug_string_contents(&rendered)), Some(&"$ROOT"));
    }

    #[test]
    fn windows_debug_path_separators_become_portable_once() {
        let rendered = r#"Commit { path: "target\\leaf.txt" }"#.to_owned();

        assert_eq!(
            normalize_debug_path_separators(rendered, '\\'),
            r#"Commit { path: "target/leaf.txt" }"#
        );
    }

    #[test]
    fn tier_observation_times_normalize_by_key_without_hiding_stable_values() {
        let trace = SessionTrace::new("timestamp-keys", Path::new("fixture"));
        assert_eq!(
            trace.normalize(
                "observed_at_ns: Some(-123), observed_at_ns: None, attempted: 123, sequence: 123"
                    .into()
            ),
            "observed_at_ns: Some([TIME]), observed_at_ns: None, attempted: 123, sequence: 123"
        );
    }

    #[test]
    fn only_continuation_native_size_is_normalized() {
        let trace = SessionTrace::new("continuation-size", Path::new("fixture"));
        for attempted in [160_263, 160_287] {
            assert_eq!(
                trace.normalize(format!(
                    "Refused(ContinuationRecordLimit {{ attempted: {attempted}, limit: 65536 }}), attempted: 123, ResourceLimit {{ attempted: 456, limit: 789 }}"
                )),
                "Refused(ContinuationRecordLimit { attempted: [CONTINUATION_BYTES], limit: 65536 }), attempted: 123, ResourceLimit { attempted: 456, limit: 789 }"
            );
        }
    }

    #[test]
    fn system_time_debug_shapes_share_one_closed_token() {
        for rendered in [
            "generated_at: SystemTime { tv_sec: 0, tv_nsec: 0 }",
            "generated_at: SystemTime { intervals: 116444736000000000 }",
        ] {
            assert_eq!(replace_system_times(rendered.to_owned()), "generated_at: [SYSTEM_TIME]");
        }
    }
}

#[derive(Clone, Copy, PartialEq, Eq, Debug)]
struct ModelFact {
    kind: EntryKind,
    size: u64,
}

/// Recomputing oracle that owns no engine reducers, mutation helpers, or retained rows.
struct SessionModel {
    root: PathBuf,
    facts: BTreeMap<PathBuf, ModelFact>,
    freshness: BTreeMap<PathBuf, Freshness>,
    state: IndexState,
    clock: crate::Clock,
}

impl SessionModel {
    fn new(root: &Path) -> Self {
        Self {
            root: root.to_path_buf(),
            facts: BTreeMap::new(),
            freshness: BTreeMap::new(),
            state: IndexState::default(),
            clock: crate::Clock::ZERO,
        }
    }

    fn observe_poll(&mut self, opened: &OpenedIndex, poll: &ChangePoll) {
        match &poll.outcome {
            ChangeOutcome::Changes { commits, .. } => {
                for commit in commits {
                    assert!(commit.clock > self.clock, "session commits must advance exactly once");
                    self.apply_commit(commit);
                    self.clock = commit.clock;
                }
                assert_eq!(self.clock, poll.version.sequence, "poll cursor skips a commit");
                assert_eq!(self.state, poll.state, "modeled and published state diverged");
            }
            ChangeOutcome::Idle => {
                assert_eq!(self.clock, poll.version.sequence, "idle poll advanced the model clock");
                assert_eq!(self.state, poll.state, "idle poll changed modeled state");
            }
            ChangeOutcome::Reset { .. } => {
                self.facts = scan_fixture(&self.root);
                self.freshness.clear();
                self.freshness.insert(PathBuf::new(), poll.state.freshness);
                self.clock = poll.version.sequence;
                self.state = poll.state;
            }
        }
        self.assert_public_projection(opened);
    }

    fn apply_commit(&mut self, commit: &Commit) {
        for change in &commit.changes {
            match change {
                EffectiveChange::Inserted { path, kind, attrs } => {
                    assert!(
                        self.facts
                            .insert(path.clone(), ModelFact { kind: *kind, size: attrs.size })
                            .is_none(),
                        "insert replaced an existing modeled fact at {}",
                        path.display()
                    );
                }
                EffectiveChange::Updated { path, kind, previous, current } => {
                    assert_eq!(
                        self.facts.get(path),
                        Some(&ModelFact { kind: *kind, size: previous.size }),
                        "update did not describe the modeled previous fact at {}",
                        path.display()
                    );
                    self.facts.insert(path.clone(), ModelFact { kind: *kind, size: current.size });
                }
                EffectiveChange::Removed { path, kind, attrs } => {
                    assert_eq!(
                        self.facts.remove(path),
                        Some(ModelFact { kind: *kind, size: attrs.size }),
                        "remove did not describe the modeled fact at {}",
                        path.display()
                    );
                }
                EffectiveChange::ControlUpdated { .. }
                | EffectiveChange::ControlRefusalUpdated { .. }
                | EffectiveChange::Reclassified { .. }
                | EffectiveChange::Invalidated { .. } => {}
            }
        }
        for transition in &commit.state {
            match transition {
                StateTransition::Freshness { path, previous, current } => {
                    let modeled = self.freshness.get(path).copied().unwrap_or(Freshness::Fresh);
                    assert_eq!(
                        modeled,
                        *previous,
                        "freshness transition skipped for {}",
                        path.display()
                    );
                    self.freshness.insert(path.clone(), *current);
                }
                StateTransition::IndexState { previous, current } => {
                    assert_eq!(self.state, *previous, "index-state transition skipped");
                    self.state = *current;
                }
                StateTransition::Verified { .. }
                | StateTransition::DirectoryComplete { .. }
                | StateTransition::DirectoryIncomplete { .. } => {}
            }
        }
    }

    fn assert_public_projection(&self, opened: &OpenedIndex) {
        let response = opened
            .read(ReadRequest {
                projections: vec![
                    ReadProjection::Flat {
                        selection: crate::query::EntrySelection::default(),
                        shape: RowShape::Full,
                        page: crate::PageRequest {
                            limit: crate::MAX_PAGE_ROWS,
                            max_work: crate::MAX_PAGE_WORK,
                        },
                    },
                    ReadProjection::RollUp { path: PathBuf::new() },
                ],
                expected: None,
            })
            .expect("model comparison read");
        let ProjectionResult::Flat(page) = &response.results[0] else {
            panic!("model comparison did not return a flat page");
        };
        assert!(page.next.is_none(), "canonical fixture exceeded one bounded model page");
        let actual: BTreeMap<_, _> = page
            .rows
            .iter()
            .map(|row| (row.path.clone(), ModelFact { kind: row.kind, size: row.attrs.size }))
            .collect();
        assert_eq!(actual, self.facts, "modeled facts and coherent flat projection diverged");

        let ProjectionResult::RollUp(Knowledge::Present(rollup)) = &response.results[1] else {
            panic!("model comparison did not return the root roll-up");
        };
        let files = self.facts.values().filter(|fact| fact.kind == EntryKind::File).count() as u64;
        let dirs = self.facts.values().filter(|fact| fact.kind == EntryKind::Dir).count() as u64;
        let bytes = self
            .facts
            .values()
            .filter(|fact| fact.kind == EntryKind::File)
            .map(|fact| fact.size)
            .sum::<u64>();
        assert_eq!((rollup.all.files, rollup.all.dirs, rollup.all.bytes), (files, dirs, bytes));
    }
}

fn scan_fixture(root: &Path) -> BTreeMap<PathBuf, ModelFact> {
    fn visit(root: &Path, relative: &Path, output: &mut BTreeMap<PathBuf, ModelFact>) {
        let directory = root.join(relative);
        let mut entries: Vec<_> = std::fs::read_dir(&directory)
            .expect("scan model directory")
            .map(|entry| entry.expect("scan model entry"))
            .collect();
        entries.sort_by_key(std::fs::DirEntry::file_name);
        for entry in entries {
            let path = relative.join(entry.file_name());
            let metadata = std::fs::symlink_metadata(entry.path()).expect("scan model metadata");
            let kind = if metadata.file_type().is_dir() {
                EntryKind::Dir
            } else if metadata.file_type().is_file() {
                EntryKind::File
            } else if metadata.file_type().is_symlink() {
                EntryKind::Symlink
            } else {
                EntryKind::Other
            };
            output.insert(path.clone(), ModelFact { kind, size: metadata.len() });
            if kind == EntryKind::Dir {
                visit(root, &path, output);
            }
        }
    }

    let mut facts = BTreeMap::new();
    visit(root, Path::new(""), &mut facts);
    facts
}

fn golden_path(name: &str) -> PathBuf {
    Path::new(env!("CARGO_MANIFEST_DIR"))
        .join("tests/golden/opened-root")
        .join(format!("{name}.golden"))
}

/// Replace one named debug integer with a closed normalization token.
fn replace_integer_field(source: String, field: &str, replacement: &str) -> String {
    replace_integer_after(source, &format!("{field}: "), replacement)
}

fn replace_integer_after(mut source: String, needle: &str, replacement: &str) -> String {
    let mut offset = 0;
    while let Some(found) = source[offset..].find(needle) {
        let start = offset + found + needle.len();
        let bytes = source.as_bytes();
        let mut end = start;
        if bytes.get(end) == Some(&b'-') {
            end += 1;
        }
        while bytes.get(end).is_some_and(u8::is_ascii_digit) {
            end += 1;
        }
        if end == start || (end == start + 1 && bytes.get(start) == Some(&b'-')) {
            offset = start;
            continue;
        }
        source.replace_range(start..end, replacement);
        offset = start + replacement.len();
    }
    source
}

/// Coverage keys derived only from production values observed by the session runner.
#[derive(Default)]
pub(super) struct ContractCoverage {
    keys: BTreeSet<&'static str>,
}

impl ContractCoverage {
    pub(super) fn merge(&mut self, other: &Self) {
        self.keys.extend(other.keys.iter().copied());
    }

    pub(super) fn assert_required(&self, required: &[&'static str]) {
        let missing: Vec<_> =
            required.iter().copied().filter(|key| !self.keys.contains(key)).collect();
        assert!(missing.is_empty(), "opened-root contract outcomes not observed: {missing:#?}");
    }

    fn key(&mut self, key: &'static str) {
        self.keys.insert(key);
    }

    fn observe_state(&mut self, state: IndexState) {
        self.key(match state.phase {
            LifecyclePhase::Discovering => "phase.discovering",
            LifecyclePhase::Reconciling => "phase.reconciling",
            LifecyclePhase::Ready => "phase.ready",
            LifecyclePhase::Watching => "phase.watching",
            LifecyclePhase::Stopped => "phase.stopped",
            LifecyclePhase::Failed => "phase.failed",
        });
        match state.coverage {
            Coverage::Complete => self.key("coverage.complete"),
            Coverage::Partial(reason) => {
                self.key("coverage.partial");
                self.key(match reason {
                    CoverageReason::Building => "coverage_reason.building",
                    CoverageReason::Budget => "coverage_reason.budget",
                    CoverageReason::Cancelled => "coverage_reason.cancelled",
                    CoverageReason::Inaccessible => "coverage_reason.inaccessible",
                    CoverageReason::Failed => "coverage_reason.failed",
                });
            }
        }
        self.key(match state.freshness {
            Freshness::Fresh => "freshness.fresh",
            Freshness::Reconciling => "freshness.reconciling",
            Freshness::Stale => "freshness.stale",
            Freshness::Partial => "freshness.partial",
        });
    }

    fn observe_read(&mut self, result: &crate::Result<ReadResponse>) {
        self.key("operation.read");
        match result {
            Ok(response) => {
                self.key("read.ok");
                self.observe_state(response.state);
                for projection in &response.results {
                    match projection {
                        ProjectionResult::Lookup(value) => {
                            self.key("projection.lookup");
                            self.observe_knowledge(value);
                        }
                        ProjectionResult::RollUp(value) => {
                            self.key("projection.rollup");
                            self.observe_knowledge(value);
                        }
                        ProjectionResult::Tree(value) => {
                            self.key("projection.tree");
                            self.observe_knowledge(value);
                        }
                        ProjectionResult::Flat(_) => self.key("projection.flat"),
                        ProjectionResult::Aggregate(_) => self.key("projection.aggregate"),
                        ProjectionResult::Report(_) => self.key("projection.report"),
                        ProjectionResult::Diagnostics(_) => self.key("projection.diagnostics"),
                        ProjectionResult::Limit(_) => self.key("projection.limit"),
                        ProjectionResult::Refused(reason) => {
                            self.key("projection.refused");
                            self.key(match reason {
                                crate::ProjectionRefusal::NotADirectory { .. } => {
                                    "projection.refused.not_a_directory"
                                }
                                crate::ProjectionRefusal::ContinuationRecordLimit { .. } => {
                                    "projection.refused.continuation_record_limit"
                                }
                                crate::ProjectionRefusal::ContinuationUnavailable => {
                                    "projection.refused.continuation_unavailable"
                                }
                            });
                        }
                    }
                }
            }
            Err(error) => {
                self.key("read.error");
                self.observe_error(error);
            }
        }
    }

    fn observe_knowledge<T>(&mut self, knowledge: &Knowledge<T>) {
        self.key(match knowledge {
            Knowledge::Present(_) => "knowledge.present",
            Knowledge::Absent => "knowledge.absent",
            Knowledge::Unknown { .. } => "knowledge.unknown",
        });
    }

    fn observe_poll(&mut self, result: &crate::Result<ChangePoll>) {
        self.key("operation.changes");
        match result {
            Ok(poll) => {
                self.observe_state(poll.state);
                match &poll.outcome {
                    ChangeOutcome::Changes { commits, .. } => {
                        self.key("changes.commits");
                        for commit in commits {
                            self.observe_commit(commit);
                        }
                    }
                    ChangeOutcome::Idle => self.key("changes.idle"),
                    ChangeOutcome::Reset { .. } => self.key("changes.reset"),
                }
            }
            Err(error) => {
                self.key("changes.error");
                self.observe_error(error);
            }
        }
    }

    fn observe_refresh(&mut self, result: &crate::Result<RefreshResult>) {
        self.key("operation.refresh");
        match result {
            Ok(receipt) => {
                self.key("refresh.ok");
                self.observe_state(receipt.state);
                if !receipt.rejected.is_empty() {
                    self.key("refresh.rejected");
                }
            }
            Err(error) => {
                self.key("refresh.error");
                self.observe_error(error);
            }
        }
    }

    fn observe_commit(&mut self, commit: &Commit) {
        for change in &commit.changes {
            self.key(match change {
                EffectiveChange::Inserted { .. } => "change.inserted",
                EffectiveChange::Updated { .. } => "change.updated",
                EffectiveChange::Removed { .. } => "change.removed",
                EffectiveChange::ControlUpdated { .. } => "change.control_updated",
                EffectiveChange::ControlRefusalUpdated { .. } => "change.control_refusal_updated",
                EffectiveChange::Reclassified { .. } => "change.reclassified",
                EffectiveChange::Invalidated { .. } => "change.invalidated",
            });
        }
        for transition in &commit.state {
            match transition {
                StateTransition::Freshness { previous, current, .. } => {
                    self.key("transition.freshness");
                    self.observe_freshness(*previous);
                    self.observe_freshness(*current);
                }
                StateTransition::Verified { .. } => self.key("transition.verified"),
                StateTransition::DirectoryComplete { .. } => {
                    self.key("transition.directory_complete");
                }
                StateTransition::DirectoryIncomplete { .. } => {
                    self.key("transition.directory_incomplete");
                }
                StateTransition::IndexState { previous, current } => {
                    self.key("transition.index_state");
                    self.observe_state(*previous);
                    self.observe_state(*current);
                }
            }
        }
    }

    fn observe_freshness(&mut self, freshness: Freshness) {
        self.key(match freshness {
            Freshness::Fresh => "freshness.fresh",
            Freshness::Reconciling => "freshness.reconciling",
            Freshness::Stale => "freshness.stale",
            Freshness::Partial => "freshness.partial",
        });
    }

    fn observe_error(&mut self, error: &Error) {
        self.key(match error {
            Error::OpenedIndexClosed => "error.closed",
            Error::OpenedIndexStopped => "error.stopped",
            Error::PriorityPathLimit { .. } => "error.priority_limit",
            Error::RefreshPathLimit { .. } => "error.refresh_limit",
            Error::ReadProjectionLimit { .. } => "error.read_limit",
            Error::VersionUnavailable { .. } => "error.version_unavailable",
            Error::ContinuationUnavailable => "error.continuation_unavailable",
            Error::ContinuationStale { .. } => "error.continuation_stale",
            Error::ChangeCursorUnavailable { .. } => "error.change_cursor_unavailable",
            Error::OpenedWorkerPanicked { .. } => "error.worker_panicked",
            Error::OpenedWorkerFailed { .. } => "error.worker_failed",
            _ => "error.other",
        });
    }
}