Expand description
Short-circuiting Boolean combinators over concurrently polled futures.
The fixed-arity forms poll their inputs in the order given, and a pass ends
at the first input to decide the result, leaving those after it unpolled.
An unpolled input runs none of the work its future defers to poll, which
for a database read is the pool dispatch and the storage I/O. The elision
needs the deciding input ready on its first poll, since a pending one does
not end the pass. Order the arguments cheapest and likeliest to decide
first; the iterator forms promise no such order.
Traits§
- BoolExt
- Combines Boolean futures with concurrent short-circuit logic.
Functions§
- and
- Computes the conjunction of an iterator of Boolean futures.
- and4
- Computes the conjunction of four Boolean futures.
- and5
- Computes the conjunction of five Boolean futures.
- and6
- Computes the conjunction of six Boolean futures.
- and7
- Computes the conjunction of seven Boolean futures.
- or
- Computes the disjunction of an iterator of Boolean futures.
- test 🔒