Orkuncakilkaya
71735b10a2
ludic.base's Queue<T> carries a QueueTag (its name and pending count): queue_new(name), q_push(q, v), q_drain(q), q_clear(q) take no BaseState, and core_undrained(tags) names the given queues still holding facts. A reducer on a package's state can now call that package's verbs (wallet_earn(wallet_st, n)). ludic migrate state --prune (ludicc --migrate-prune) takes out each state parameter a function no longer uses, nor anything it calls, and the argument that fills it - including an argument for a parameter the callee has dropped, which is taken out before the call is checked, so a generic's T is told by the argument that says it. A reducer keeps its state. --dry-run now counts the edits it would make. Every package was moved with it: 608 base_st parameters and their arguments, 1889 edits. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
83 lines
2.8 KiB
Text
83 lines
2.8 KiB
Text
# state.ludic - the port, the kinds' shapes and pools, the facts, and the arc being played
|
|
# what a step kind measures, asked of the game: a count, a mask, or 1 / 0, for one player (0 is
|
|
# this machine's own); whether a party is playing, and whether a seat in it is taken
|
|
export port StepsWorld {
|
|
value: fn(int, int, int) -> int
|
|
party: fn() -> bool = fn steps__solo
|
|
present: fn(int) -> bool = fn steps__only_me
|
|
}
|
|
|
|
function steps__solo() -> bool { return false }
|
|
function steps__only_me(p: int) -> bool { return p == 0 }
|
|
|
|
# a kind's shape: met or not; a number against the need; a mask whose bits are counted against
|
|
# the need; every bit of the mask in `param`
|
|
export const STEPS_SHAPE_YES: int = 0
|
|
export const STEPS_SHAPE_COUNT: int = 1
|
|
export const STEPS_SHAPE_MASK: int = 2
|
|
export const STEPS_SHAPE_MASK_ALL: int = 3
|
|
|
|
# how a party combines a kind: the same for everyone already (asked of this machine); anyone
|
|
# having done it; the counts add up; the masks union; the best one; every player needs their own
|
|
export const STEPS_POOL_WORLD: int = 0
|
|
export const STEPS_POOL_ANY: int = 1
|
|
export const STEPS_POOL_SUM: int = 2
|
|
export const STEPS_POOL_OR: int = 3
|
|
export const STEPS_POOL_MAX: int = 4
|
|
export const STEPS_POOL_EACH: int = 5
|
|
|
|
# the most steps a chapter carries: its done steps are a bit mask
|
|
export const STEPS_PER_CHAPTER: int = 6
|
|
|
|
export property StepsKind {
|
|
key: string = ""
|
|
shape: int = STEPS_SHAPE_YES
|
|
pool: int = STEPS_POOL_WORLD
|
|
shows: bool = false # a panel shows its count against what it wants
|
|
}
|
|
|
|
export const STEPS_MET: int = 0 # a step of the current chapter was met (chapter, step)
|
|
export const STEPS_CHAPTER: int = 1 # every step of a chapter is met, and the next one is open
|
|
|
|
export property StepsFact {
|
|
what: int = 0
|
|
chapter: int = 0
|
|
step: int = 0
|
|
}
|
|
|
|
export state StepsState {
|
|
steps__players: int = 12
|
|
steps__col: []int = null # players * STEPS_PER_CHAPTER shares
|
|
steps__col_ch: int = -1 # the chapter they are about
|
|
steps__kinds: []StepsKind = null
|
|
steps__n: []int = null # steps per chapter
|
|
steps__kind: []int = null # STEPS_PER_CHAPTER per chapter
|
|
steps__param: []int = null
|
|
steps__need: []int = null
|
|
steps__cur: int = 0
|
|
steps__done: int = 0
|
|
steps__facts: Queue<StepsFact> = null
|
|
}
|
|
|
|
export function steps_facts(steps_st: mut StepsState) -> Queue<StepsFact> {
|
|
if steps_st.steps__facts == null { steps_st.steps__facts = queue_new("steps.facts") }
|
|
return steps_st.steps__facts
|
|
}
|
|
|
|
function steps__fact(steps_st: mut StepsState, what: int, ch: int, i: int) -> void {
|
|
let f = new StepsFact
|
|
f.what = what
|
|
f.chapter = ch
|
|
f.step = i
|
|
q_push(steps_facts(steps_st), f)
|
|
}
|
|
|
|
export function steps_popcount(m: int) -> int {
|
|
var n = 0
|
|
var v = m
|
|
while v != 0 {
|
|
n += v & 1
|
|
v = (v >> 1) & 0x7FFFFFFF
|
|
}
|
|
return n
|
|
}
|