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

wip(0.S2): migrate - a var nothing writes becomes a let; a state is keyed by its module, directory or program, so every program's plan agrees; paths normalized; program states named SceneDemoState / scene_demo_st; the LSP reads state, mut and entry/handler parameters

Browse source 
Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This commit is contained in:
Orkun ÇAKILKAYA 2026-09-25 15:31:34 +03:00
parent 3eda72e8c2
commit 5ffe50ed02
463 changed files with 72045 additions and 67421 deletions
Download patch file Download diff file Expand all files Collapse all files

20
packages/ludic.steps/each.ludic
View file

@ -1,27 +1,27 @@
# each.ludic - a step every player must meet in their own pack: how many seats are taken, how
# many of them carry it, and which do not
export function steps_players(steps_st: StepsState) -> int {
export function steps_players() -> int {
var n = 0
for p in 0 .. steps_st.steps__players { if StepsWorld.present(p) { n += 1 } }
for p in 0 .. steps__players { if StepsWorld.present(p) { n += 1 } }
return n
}
# how many seats taken have step i's thing (seat 0 counted live)
export function steps_each(steps_st: mut StepsState, i: int) -> int {
steps__cols(steps_st)
export function steps_each(i: int) -> int {
steps__cols()
var n = 0
for p in 0 .. steps_st.steps__players {
if StepsWorld.present(p) and steps_st.steps__col[p * STEPS_PER_CHAPTER + i] != 0 { n += 1 }
for p in 0 .. steps__players {
if StepsWorld.present(p) and steps__col[p * STEPS_PER_CHAPTER + i] != 0 { n += 1 }
}
return n
}
# the seats that do not have it yet
export function steps_lacking(steps_st: mut StepsState, i: int) -> []int {
steps__cols(steps_st)
export function steps_lacking(i: int) -> []int {
steps__cols()
let out = new []int
for p in 0 .. steps_st.steps__players {
if StepsWorld.present(p) and steps_st.steps__col[p * STEPS_PER_CHAPTER + i] == 0 { push(out, p) }
for p in 0 .. steps__players {
if StepsWorld.present(p) and steps__col[p * STEPS_PER_CHAPTER + i] == 0 { push(out, p) }
}
return out
}