aup/tests/check.py, branch masterDeclarative systems language and compiler targeting verified Pure modules.
http://git.yeowoo.org/aup/atom?h=master2026-10-19T06:32:09ZTargets together compiled straight when they can be: S_TOGETHER holds the targets with their values; when no value may read what a target before it changes (a target's name, a fn's call, a parameter or a binding, an index or a for's item of a changed list), each target takes its value in order with no lets, else the values go through lets first as before; layout.aup's boxes 1,525.9 instructions a node through lets, 1,492.8 straight (the hand-written 1,493.9); frictions reads a changed item through a let's index and a for's item (a compiler always straight fails it)2026-10-19T06:32:09Zeunhhunecpition205@gmail.com2026-10-19T06:32:09Zurn:sha1:1c3b2475ca2008b7a68e7fbd6281b59fa84a286cLists declared together: three names or more made the statements a cycle (each copy took the first's next, the copy before it), so the compiler never ended (found writing linebreak.aup's nine lists as two lines); frictions declares four2026-10-19T06:23:29Zeunhhunecpition205@gmail.com2026-10-19T06:23:29Zurn:sha1:6463228d028a4755ef819dcfbbf6426e3a9f8626Hex literals are numbers where numbers go without a core change (140's UAX #14 friction): 0x... compared with a number, in its arithmetic, in min and max, given to a number's state, let or field is that number, past 2^53 refused; alone or meeting an i64 it is an i64 as before, bit operations as before; frictions in make check, two diagnostics; 002 records the frictions written away; no module of aup's, Pure's or Vega's changes2026-10-19T06:18:33Zeunhhunecpition205@gmail.com2026-10-19T06:18:33Zurn:sha1:b116cf7b59db6a90b2d5146742bb838144fa831fabs(x) and a timer's period without a core change (140's RFC 6298 frictions): abs of a number or an i64, x once (a PICK of it, its negation, MAX: -0's is +0, i64's least overflows); tick.period, an every input's milliseconds as now counts them, a constant anywhere; frictions in make check, a diagnostic; no module of aup's, Pure's or Vega's changes2026-10-19T06:15:34Zeunhhunecpition205@gmail.com2026-10-19T06:15:34Zurn:sha1:39d4a024f91a042c5ffe8f5f76faf02f77b86f33A list given a value whole without a core change (140's frictions): xs = a list value (a fn's, a let's) copies it first, empties xs and gives it the copy's items (added by key when keyed); xs = ys walks ys where it is, xs = xs leaves it; xs = [...] for a stored list too; xs, j = f(x) with a list among the names; a value of another kind or record refused by name ('xs' takes a list of F, not G); frictions in make check, diagnostics updated; no module of aup's, Pure's or Vega's changes2026-10-19T06:11:50Zeunhhunecpition205@gmail.com2026-10-19T06:11:50Zurn:sha1:11960e4e2353dc63660362660901183a2585cb08Names together without a core change (140's frictions): lets' lists declared together (let a, b: list of R, a let each, empty as it begins; given elements refused), and targets together with fields and items among them (xs[i].x, xs[i].y = a, b; a, xs[i] = ...): the values first, each into a let of its own (a literal straight), then each target left to right as Python's; names alone are S_ASSIGNS as before; frictions in make check, two diagnostics; no module of aup's, Pure's or Vega's changes2026-10-19T06:05:44Zeunhhunecpition205@gmail.com2026-10-19T06:05:44Zurn:sha1:24e3994b4c845831f867430cc4bb4c6e1e564a6dA message's rows read by position where they are, not from a copy of them: input.rows[k] made the rows a list value (LIST_VALUE copies every row) and read the copy, so each read cost the rows' count (140's box layout: 99,067 ns a node, 4,737 now, the answers the same); rows_at in make check (a literal, a computed and a looped position, through a let and a fn's argument, past the last failing the event); no other module of aup's, Pure's or Vega's changes2026-10-19T05:15:12Zeunhhunecpition205@gmail.com2026-10-19T05:15:12Zurn:sha1:e5a620916c8f13a5a22d24b7fd5a802139bf575fBytes alone as a state (Pure 028): state x: bytes (= "..." its UTF-8), held as a text state is and written to the module as type 6, its name read as a bytes value and x = ... setting it whole (a string meets bytes), cursors and marks in it, its insert and remove, its start and end refused with a bytes state's diagnostic, a text never set from it; test bytes_state (300 steps of random bytes with 0x00 and 0xff added and cut, started again from the store 15 times, against Python; the same name as a text from the store and by a replace: UTF-8 bytes kept, others anew, and back to bytes what the text held), three diagnostics; the 60 sources the same modules; 0022026-10-19T03:42:05Zeunhhunecpition205@gmail.com2026-10-19T03:42:05Zurn:sha1:096a70a7cd5a5785b1b52aa8512422b30f014c09Lets' lists in inner blocks and xs = [...] (after Pure 140's inflate): a let's list in an if's, a for's, a while's or a match's block (a handler's, a fn's or a view's body's) begins empty each time its let is run, one state let.NAME a name as before (gathered from inner blocks now), emptied there a item at a time (while xs.count > 0 remove the last: a list of numbers' by its place count - 1, others' .last; Pure has no op that empties a list); xs = [...] empties a let's list and gives it its elements ([] none), a stored list refused; a list literal in an expression keeps its elements (it dropped them: a field's [1, 2] was empty); folds and filters hold no let's list; test inner_lists (100 random events: a for's list, a keyed one, a fn's, a view body's, xs = [...] and [] against Python), a diagnostic retired (an inner block's list now reads as unknown past it), one added; the 60 sources the same modules; 0022026-10-19T03:04:09Zeunhhunecpition205@gmail.com2026-10-19T03:04:09Zurn:sha1:5f223bd45d9279982ec6e4ca334c089c07782639Bytes compared (Pure's TEXT_COMPARE with PURE_COMPARE_BYTES): ==, !=, <, <=, >, >= between bytes by their bytes; a string (a literal, or one with formats) where bytes are what it meets, compared or joined, is its UTF-8 bytes, as 1 is an i64 where i64s go, values of text and bytes mixing in neither (bytes(t) or text(b)); test bytes_compared (400 random pairs with 0x00 and 0xff in the six relations, literals on either side, a formatted string, joins with literals, against Python), two diagnostics; the 60 sources compiled before the same modules; 0022026-10-19T02:56:43Zeunhhunecpition205@gmail.com2026-10-19T02:56:43Zurn:sha1:4aefbab3cdbcb5a7c4b7598795baa276f82fd842