pub fn max_volatility_batched<'a, I>(edges: I) -> f64where
I: IntoIterator<Item = &'a CausalEdge>,Expand description
Maximum edge-type volatility across an iterator of edges, using a
clawft_treecalc::triage dispatch on the edge-kind stream so a
uniform-kind incident set collapses to a single match branch
(Sequence form) instead of one per edge.
Behaviour-equivalent to edges.map(volatility).fold(1.0, max) —
the hardcoded fallback semantics — but faster on the common case
where a node’s incident edges are all the same kind (e.g. a
node touched only by Causes edges).
NOTE(treecalc-swap): wired — Finding #9 (CausalEdgeType decay
dispatch). The treecalc batching is the structural change; a
per-kind learned DecayScheduleModel is a follow-up.