shoney.arickathil
d24c705860
- Float full stack: literals (fraction/exponent; `0..10` still a range), f64
opcodes 34-41, @table column, WAL bit-exact replay, json fractions in and
shortest-round-trip out. IEEE-quiet — FDIV never traps where DIV does.
- Bytes: a wo_str with its own class id, so alloc/free/copy are shared but no
Text builtin accepts one; len/at/slice/eq/concat, base64 both ways, json
boundary as base64; TEXT_COPY preserves the kind.
- No implicit Int/Float mixing (WO-E201 in the typechecker, not the emitter,
which picks the opcode from one side and would misread the other).
- One IEEE deviation: float_cmp total order (NaN last, -0.0 == +0.0) for
indexes and order-by, keys canonicalized to match. `?Float` nil is a
reserved quiet NaN — the zero word is +0.0, WO_NIL_SCALAR's bits are -2.0.
- Renderer prefers fixed over exponential in 1e-6..1e21: pure shortest makes
a price of 900.0 read `9e+02`. One renderer for interp/json/float_to_text.
- Fixed en route: lexer double-counted the leading digit; is_scalar_shaped
took Float/Bytes as Int-shaped; Bytes ownership needed a shared heap-scalar
predicate or temps never dropped; order-by bit-compared negatives backwards.
- Iteration 17: `kind = "library"` (absent = program; bad value = WO-E109),
entry-less check mode retiring the `--emit` workaround, Go's `internal/` as
WO-E108 at the consumer's `use`. Driver-only; VM/.wob/GC untouched.
- Framework reorg: internal/{parse,serve}.wo; http/form.wo split out to keep
media_type/form_values public (parse.wo had grown public surface).
- Docs: link audit (97 -> 88 broken, conflict markers resolved, 2 duplicate
stories removed), 00-code-review verified 26/27, iterations re-sequenced.
- Also carries the pre-staged pub(read)/using/#if work from the index.
- Gates: corpus 103/0, test_wal 156/0, web-app 26/0, oop-accept ALL MET.
Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com>
40 lines
1.5 KiB
Text
40 lines
1.5 KiB
Text
-- Iteration 19, the storage half: a Float is a real @table column. It is
|
|
-- stored, read back bit-exact, indexed (unique, on the TOTAL order — so
|
|
-- -0.0 and +0.0 are the same key), and order-by sorts by that total order
|
|
-- rather than by raw bits, which would put negatives backwards and drop NaN
|
|
-- wherever the comparison sequence happened to leave it.
|
|
@table(name: "readings", index: [at])
|
|
class Reading {
|
|
at: Float
|
|
label: Text
|
|
}
|
|
|
|
class Priced {
|
|
cost: Float @unique
|
|
}
|
|
|
|
fn main() {
|
|
insert Reading { at: 1.5, label: "b" }
|
|
insert Reading { at: -2.5, label: "a" }
|
|
insert Reading { at: 0.25, label: "c" }
|
|
|
|
-- ascending: -2.5 < 0.25 < 1.5. Raw-bit ordering would put -2.5 last.
|
|
for r in from x in Reading order by x.at select x { print("${r.at} ${r.label}") }
|
|
print("--")
|
|
for r in from x in Reading order by x.at desc select x { print("${r.at} ${r.label}") }
|
|
print("--")
|
|
|
|
-- edge values survive storage and come back bit-exact
|
|
insert Reading { at: 1.0 / 0.0, label: "inf" }
|
|
insert Reading { at: 0.0 / 0.0, label: "nan" }
|
|
insert Reading { at: -0.0, label: "negzero" }
|
|
for r in from x in Reading order by x.at select x { print("${r.at} ${r.label}") }
|
|
print("--")
|
|
|
|
-- a unique Float index keys on the total order: -0.0 and +0.0 are the
|
|
-- SAME key, so the second insert is refused
|
|
print_int(insert Priced { cost: -0.0 })
|
|
let dup = try insert Priced { cost: 0.0 } catch (e) nil
|
|
if dup == nil { print("ZERO-SIGN-DUP-REFUSED") }
|
|
print_int(insert Priced { cost: 0.5 })
|
|
}
|