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

fix(ludic.jobs): jobs_taken and jobs_shown fill a kept list per group (the map and the journal asked every frame, and the fence caught a list kept)

Browse source 
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This commit is contained in:
Orkun ÇAKILKAYA 2026-09-28 23:01:53 +03:00
parent f4233ba11d
commit 90dd603cee
2 changed files with 17 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

21
packages/ludic.jobs/lists.ludic
View file

@ -13,21 +13,32 @@ export function jobs_at(jobs_st: JobsState, group: int, vendor: int) -> []int {
} }
# every job of a group taken at some point, done ones too # every job of a group taken at some point, done ones too
export function jobs_taken(jobs_st: JobsState, group: int) -> []int { export function jobs_taken(jobs_st: mut JobsState, group: int) -> []int {
let out = new []int let out = jobs_st.jobs__lists[group * 2]
for i in 0 .. JOB_COUNT { if Jobs[i].group == group and jobs_state(jobs_st, i) != JOBS_OFFERED { push(out, i) } } List.clear(out)
for i in 0 .. JOB_COUNT {
@alloc_ok("a kept list, cleared each ask: grows once to the group's jobs")
if Jobs[i].group == group and jobs_state(jobs_st, i) != JOBS_OFFERED { push(out, i) }
}
return out return out
} }
# the first `most` of a group under way # the first `most` of a group under way
export function jobs_shown(jobs_st: JobsState, group: int, most: int) -> []int { export function jobs_shown(jobs_st: mut JobsState, group: int, most: int) -> []int {
let out = new []int let out = jobs_st.jobs__lists[group * 2 + 1]
List.clear(out)
for i in 0 .. JOB_COUNT { for i in 0 .. JOB_COUNT {
if len(out) >= most { break } if len(out) >= most { break }
@alloc_ok("a kept list, cleared each ask: grows once to `most`")
if Jobs[i].group == group and jobs_under_way(jobs_st, i) { push(out, i) } if Jobs[i].group == group and jobs_under_way(jobs_st, i) { push(out, i) }
} }
return out return out
} }
function jobs__lists_new(n: int) -> [][]int {
let out = new [][]int
for i in 0 .. n { push(out, new []int) }
return out
}
# the first under way and not yet met, or -1 # the first under way and not yet met, or -1
export function jobs_first_open(jobs_st: JobsState, group: int) -> int { export function jobs_first_open(jobs_st: JobsState, group: int) -> int {

1
packages/ludic.jobs/state.ludic
View file

@ -7,6 +7,7 @@ export state JobsState {
jobs__back: []int = jobs__ints(JOB_COUNT, 0) # given up: the first day it may be taken again jobs__back: []int = jobs__ints(JOB_COUNT, 0) # given up: the first day it may be taken again
jobs__primed: bool = false # the first tick after a reset learns the offers quietly jobs__primed: bool = false # the first tick after a reset learns the offers quietly
jobs__done_n: []int = jobs__ints(JOBS_GROUPS, 0) # handed in, per group jobs__done_n: []int = jobs__ints(JOBS_GROUPS, 0) # handed in, per group
jobs__lists: [][]int = jobs__lists_new(2 * JOBS_GROUPS) # jobs_taken's and jobs_shown's answers, per group, filled in place
jobs__off: []int = jobs__offsets() jobs__off: []int = jobs__offsets()
jobs__pk: []int = jobs__ints(jobs__slots(), -1) # kind, -1 empty jobs__pk: []int = jobs__ints(jobs__slots(), -1) # kind, -1 empty
jobs__pp: []int = jobs__ints(jobs__slots(), -1) jobs__pp: []int = jobs__ints(jobs__slots(), -1)