ludic.base, ludic.wildlife, ludic.npc: fact records reused, not made per fact
wl_fact made a new WildFact per fact, about one a frame, and Ludic never gives one back. ludic.base's q_unheld(q, pool, out) lists the records a queue no longer holds: neither waiting nor handed out by its last drain, which is good until the next drain. ludic.wildlife and ludic.npc now keep a pool, hand out a free record, and make a new one only when every record is held. Taking a record writes the state, so wl_fact / np_fact and the few callers holding their state read-only take it mut. Tests: q_unheld's rules (an empty drain holds on, the safe side); 3000 prints drained frame by frame use at most 4 records; 500 arrivals drained turn by turn use at most 4. base 37, wildlife 27, npc 17; all packages 420. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
This commit is contained in:
parent
3e3c6088fb
commit
fe2d2bacd7
13 changed files with 129 additions and 10 deletions
|
|
@ -56,6 +56,20 @@ export function q_clear<T>(q: Queue<T>) -> void {
|
|||
q.tag.pending = 0
|
||||
}
|
||||
|
||||
# pool's records the queue no longer holds - neither waiting nor handed out by the last drain - put
|
||||
# into out (cleared first): what a package may fill again instead of making a new record per fact
|
||||
export function q_unheld<T>(q: Queue<T>, pool: []T, out: []T) -> int {
|
||||
List.clear(out)
|
||||
for i in 0 .. len(pool) {
|
||||
let r = pool[i]
|
||||
var held = false
|
||||
for j in 0 .. len(q.items) { if q.items[j] == r { held = true } }
|
||||
for j in 0 .. len(q.spare) { if q.spare[j] == r { held = true } }
|
||||
if not held { push(out, r) }
|
||||
}
|
||||
return len(out)
|
||||
}
|
||||
|
||||
# a queue's tag, for core_undrained: queues of different facts in one list
|
||||
export function q_tag<T>(q: Queue<T>) -> QueueTag { return q.tag }
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue