The Prove tab gives each routine 3 seconds on the clock, and on a slow or busy machine that runs out before the proof does: claims stay open with nothing to say why. Now the prover marks a unit it ran out of time on (timedOut, and an out-of-time note), checkProperties says when the clock cut its inputs short, and ProofReport.clock carries the budget and the routines it stopped, so a caller can offer more time.
This commit is contained in:
9 files changed
+40
-11
No files matched your search
@@ -23,6 +23,7 @@ Mojo 1.2.0, held to the real compiler on the machine as well as on godbolt.org,
|
||||
|
||||
### Added
|
||||
|
||||
- A proof report says when the time on the clock, not the proof, stopped a routine: `ProofReport.clock` has the budget and the routines it stopped, each such unit has `timedOut` and a note, and `checkProperties` answers `timedOut` when the clock cut its inputs short. The site uses it to offer more time.
|
||||
- `pixi run mojo-local` builds every Mojo program core holds or generates on the pinned local compiler and holds the checker, the interpreter and the translator to it; `pixi run mojo-fuzz` does the same with generated programs.
|
||||
- `pixi run mojo-fuzz --statements` generates whole programs (loops, branches, collections, records, routines with BYREF), builds each with the pinned compiler and holds its output to the pseudo's line by line; `pixi run prove-fuzz` holds the prover to runs of generated programs. `pixi run ci` runs both on a fixed and a moving seed, and `pixi run nightly` runs them longer.
|
||||
- The Mojo interpreter runs what the translator writes: typed list literals, `List[T](slice)`, `ord` and `chr`, std.math's exact functions (`gcd`, `lcm`, `comb`, `hypot`, `fma`, `nextafter`, `ulp`, `copysign`, `isinf` and the others), `atof` of a decimal, and the `match` statement. What it declines on purpose (a fractional power, the transcendental functions, random numbers) says why.
|
||||
|
||||
Reference in new issue
Block a user