Game development
Ren’Py fixed image attribute matches
Explain fixed-name image candidates, negative filters and ambiguity.
Your inputs
Start with an exampleYour result
Example resultHow it works
Retain fixed registration tuples in first-insertion order. Filter by positive membership and negative exclusions. Prefer the first surviving tuple whose length equals the positive request list length; otherwise require one candidate. Append the original negative tuple to a selected result.
Both eileen happy coat and eileen happy contain happy. A happy request selects the latter exact-length tuple. Repeating happy twice changes the native list-length test and can select the earlier two-attribute tuple.
Limits
Supplied ordinary fixed-name catalog only. Canonical ASCII tag/attribute components, up to 10000 names, 1000 queries, 64 components per name and 64 request attributes. Combined input up to 2 million UTF-8 bytes, 1 million candidate evaluations, 20 million attribute checks and a 4 million-byte report. Empty arrays are valid. Order, duplicates and negative markers are retained. No source evaluation, dynamic/layered chooser, sticky/default/current-scene state, show/can_show behavior, image existence or rendering check.