Jump to a problem, path or page
Races, pools and retries
Single-process components that stay correct under concurrent callers, timeouts, cancellation and failing dependencies.
Design a token bucket with an injectable clock, atomic state, and useful retry hints.
Model closed, open and half-open states with bounded recovery probes.
Compose retry classification, backoff, cancellation and a total deadline.
Coordinate producers and consumers with capacity, deadlines and explicit close semantics.
Manage bounded resources, acquisition deadlines and safe lease return under concurrency.
Schedule cancellable deadlines with a min-heap, generation tokens and controlled time.
Coordinate asynchronous work with FIFO permits, cancellation and single-use release handles.
Own bounded child tasks, request cancellation on failure and join every started child.
Reserve seats with expiring holds and reconcile payment without overselling.
Drive one-shot callbacks by virtual time with stable ordering, cancellation and bounded advancement.
Jump to a problem, path or page