workshopsoft/ludic
2
0
Fork 0
Code Issues Pull requests Projects Releases 26 Packages Wiki Activity Actions

ludic.base: the growth paths push through kept_push, whose statement-level @alloc_ok says the bound

Browse source 
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This commit is contained in:
Orkun ÇAKILKAYA 2026-09-28 16:01:28 +03:00
parent 3f32bfda7c
commit eb25f24c96
4 changed files with 19 additions and 18 deletions
Download patch file Download diff file Expand all files Collapse all files

6
packages/ludic.base/ecs_grid.ludic
View file

@ -42,9 +42,9 @@ export function tb_grid<T>(tb: Table<T>, cx: int, cz: int, gate: int, cell: floa
export function grid_count(g: Grid) -> int { return g.count } export function grid_count(g: Grid) -> int { return g.count }
function grid_grow(g: Grid) -> void { function grid_grow(g: Grid) -> void {
push(g.next, 0) kept_push(g.next, 0)
push(g.prev, 0) kept_push(g.prev, 0)
push(g.key, -1) kept_push(g.key, -1)
} }
function grid_shrink(g: Grid) -> void { function grid_shrink(g: Grid) -> void {

4
packages/ludic.base/ecs_index.ludic
View file

@ -39,8 +39,8 @@ export function ix_first(ix: IntIndex, v: int) -> int {
} }
function ix_grow(ix: IntIndex) -> void { function ix_grow(ix: IntIndex) -> void {
push(ix.pos, -1) kept_push(ix.pos, -1)
push(ix.val, -1) kept_push(ix.val, -1)
} }
function ix_shrink(ix: IntIndex) -> void { function ix_shrink(ix: IntIndex) -> void {

21
packages/ludic.base/ecs_table_reserve.ludic
View file

@ -20,24 +20,23 @@ export function tb_reserve<T>(tb: Table<T>, rows: int) -> void {
for g in 0 .. len(tb.grids) { grid_reserve(tb.grids[g], rows) } for g in 0 .. len(tb.grids) { grid_reserve(tb.grids[g], rows) }
} }
# a row on every column, grid and index # a row on every column, grid and index; past tb_reserve's rows each is a kept list's growth
@alloc_ok("past tb_reserve's rows only: a table grows to its high-water once and keeps it")
function tb_push_row<T>(tb: Table<T>, r: T, h: int) -> void { function tb_push_row<T>(tb: Table<T>, r: T, h: int) -> void {
push(tb.rec, r) kept_push(tb.rec, r)
push(tb.ent, h) kept_push(tb.ent, h)
push(tb.added, tb.tick) kept_push(tb.added, tb.tick)
push(tb.changed, tb.tick) kept_push(tb.changed, tb.tick)
for c in 0 .. len(tb.f) { push(tb.f[c], 0.0) } for c in 0 .. len(tb.f) { kept_push(tb.f[c], 0.0) }
for c in 0 .. len(tb.i) { push(tb.i[c], 0) } for c in 0 .. len(tb.i) { kept_push(tb.i[c], 0) }
tb.n += 1 tb.n += 1
for g in 0 .. len(tb.grids) { grid_grow(tb.grids[g]) } for g in 0 .. len(tb.grids) { grid_grow(tb.grids[g]) }
for k in 0 .. len(tb.idx) { ix_grow(tb.idx[k]) } for k in 0 .. len(tb.idx) { ix_grow(tb.idx[k]) }
} }
@alloc_ok("past tb_reserve's rows only: a slot is made once and reused through the free list") # a slot is made once and reused through the free list
function tb_new_slot<T>(tb: Table<T>) -> int { function tb_new_slot<T>(tb: Table<T>) -> int {
let s = len(tb.slot_gen) let s = len(tb.slot_gen)
push(tb.slot_gen, 0) kept_push(tb.slot_gen, 0)
push(tb.slot_row, -1) kept_push(tb.slot_row, -1)
return s return s
} }

4
packages/ludic.base/kept.ludic
View file

@ -1,4 +1,6 @@
# ludic.base/kept.ludic - the one push the frame is allowed: into a list its owner keeps and clears, # ludic.base/kept.ludic - the one push the frame is allowed: into a list its owner keeps and clears,
# which grows to the most it has ever held and stays there (a queue's halves, a query's out list) # which grows to the most it has ever held and stays there (a queue's halves, a query's out list)
export function kept_push<T>(xs: []T, v: T) -> void {
@alloc_ok("a kept list: it grows to the most it has held once, is cleared and reused, never dropped") @alloc_ok("a kept list: it grows to the most it has held once, is cleared and reused, never dropped")
export function kept_push<T>(xs: []T, v: T) -> void { push(xs, v) } push(xs, v)
}