Skip to main content

Module search

Module search 

Source
Expand description

A limit’s need (docs/plans/extract.md X13): the least value at which a run meets no refusal of it. least brackets and bisects a refusal predicate, then checks it is monotone where the bisection assumed it: at the need’s adjacent values and at sampled values on both sides, besides every value the bisection itself tried. A run’s allocation path adapts (a growth retried smaller, an eviction), so monotonicity is checked, not assumed; a Counterexample is no need, and comes back for a spec ruling instead of a squeeze result.

Structs§

Counterexample
A value whose answer the need contradicts: refused at or above it, or not refused below it; or a top value that is itself refused.
Least
What least found.

Functions§

least
The least value in [lo, hi] that refused answers false for, by bracketing (hi must be clear) and bisection, then checked at the need’s adjacent values, at samples spaced values on each side and at powers of two away from it.