Repository navigation
chore: release 0.6.0 - #248
Merged
siracozmen01 merged 2 commits intoNov 5, 2026
Merged
Conversation
rawframe-release
Bot
force-pushed
the
release-please--branches--main--components--kest
branch
from
November 4, 2026 09:15
b28b3c0 to
4b17ecb
Compare
rawframe-release
Bot
force-pushed
the
release-please--branches--main--components--kest
branch
from
November 4, 2026 11:42
4b17ecb to
aa17375
Compare
siracozmen01
marked this pull request as ready for review
November 5, 2026 08:26
siracozmen01
deleted the
release-please--branches--main--components--kest
branch
November 5, 2026 09:30
Contributor
Author
|
🤖 Created releases: 🌻 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
🤖 I have created a release beep boop
0.6.0 (2026-11-04)
Changed
K0505("this leaves the stack 1 deep and a statement leaves it as it found it"): withstruct Row { tag: i32; count: [i32; 3] }, a function returningrows[k].count[at]did not compile, and now, withrowsholdingRow(7, [10, 20, 30]), it answers 30 fork0 andat2. The same held for a run ofbooland for a run inside a struct inside the element. A program that compiled before compiles to the same instructions. (#246)=,+=,-=,*=or/=. Every such write was refused as a fault in the compiler, withK0505("this assigns to something that is not a place, which the checker allowed"), whichever field the run was; only a run held in a local could be written at such an index. Withstruct Row { count: [i32; 3] },rowsholdingRow([10, 20, 30])andatworked out while running as 1,rows[0].count[at] = 99followed byrows[0].count[at - 1] += 5now leaves the run15 99 30. An index past the run is refused withK0604("index 3 is outside 3 of them"), the sentence a run in a local gets, in every engine and in a body compiled to C. A write whose right-hand side grows the array is written into the array as it is after it grew.kest emitwrites these as two new instructions,load.elem.runandstore.elem.run. A program that compiled before compiles to the same instructions. A run of runs written at two indexes worked out while running (grid[i][j] = 9) is still refused, in a local as well as in an element (#249). (#250)bool, or a set of flags, read through an address worked out before the read (load.at) is looked at only when the address is in memory a host lent, as a read that knows its array already was. Every such read was looked at, of the machine's own memory too. Nothing a program or a host sees changes: every read refused before is refused with the same line. A program readingrows[k].cells[i]800,000 times from a[Row]of 1000struct Row { cells: [bool; 4] }it filled itself runs in 131,499,448 instructions where it took 162,700,128, underperf stat -e instructions:uwith the program and commands the pull request gives. (#247)This PR was generated with Release Please. See documentation.