Skip to main content

exactly_one_of_n_contenders_commits

Function exactly_one_of_n_contenders_commits 

pub async fn exactly_one_of_n_contenders_commits<F>(
    open: impl AsyncFn() -> F,
) -> RuleOutcome
where F: Fixture, F::Store: EventStore + Send,
Available on non-WebAssembly only.
Expand description

Of CONTENDERS handlers that decided from one snapshot, exactly one commits.

This is racing_conditional_appends_elect_one_winner’s question asked of a store that is genuinely contended rather than called twice in a row, and the difference is the whole reason this family exists. The sequential rule cannot separate an atomic check-and-write from a probe followed by an insert, because with one caller at a time the probe and the insert are adjacent and nothing can get between them. RacingProbeStore in the proof artefact is that store: it probes, opens a window, then inserts, and every sequential rule in the suite passes it.

The condition is after: boundary with the boundary taken from a real setup append rather than written as a number (CF-6), and its query is tagged rather than type-only for two_handles_observe_each_others_appends’s reason: the tag join is the first thing an adapter drops from a probe, and a type-only condition returns the identical verdict here while testing strictly less.