feat: random generators, frozenset and __hash__/__iter__/__getitem__/__contains__ in Ren'Py python
CI / frontend (push) Failing after 18s
CI / backend (push) Failing after 35s

renpy.random/random get choices, sample, randrange and Random(seed); frozenset, iter and hash
are builtins. User classes may define __hash__ (dict keys), __iter__, __getitem__ and
__contains__; the converter accepts them instead of rejecting the whole class, which
removes the Perk/Skill/Status wall in SaintlyCorruption.

Co-Authored-By: Claude Sonnet 5.5 <noreply@anthropic.com>
This commit is contained in:
mrleo1nidandClaude Sonnet 5.5 committed 2026-10-26 02:55:44 +03:00
1 parent f9eb5c1212
commit e1c596288e
8 files changed
+165 -18

No files matched your search

+62 -11
View File
@@ -338,18 +338,68 @@ export class Engine {
const kwless = (args: any[]) =>
args.length && args[args.length - 1]?.__kw ? args.slice(0, -1) : args;
const kwOf = (args: any[]) => (args.length && args[args.length - 1]?.__kw) || {};
const random = {
randint: (a: number, b: number) => a + Math.floor(Math.random() * (b - a + 1)),
random: () => Math.random(),
choice: (xs: any[]) => xs[Math.floor(Math.random() * xs.length)],
shuffle: (xs: any[]) => {
for (let i = xs.length - 1; i > 0; i--) {
const j = Math.floor(Math.random() * (i + 1));
[xs[i], xs[j]] = [xs[j], xs[i]];
}
},
uniform: (a: number, b: number) => a + Math.random() * (b - a),
const makeRandom = (next: () => number): Record<string, any> => {
const below = (n: number) => Math.floor(next() * n);
const self: Record<string, any> = {
randint: (a: number, b: number) => a + below(b - a + 1),
randrange: (a: number, b?: number, step = 1) => {
const [lo, hi] = b === undefined ? [0, a] : [a, b];
const count = Math.max(0, Math.ceil((hi - lo) / step));
if (!count) throw new Error("randrange: пустой диапазон");
return lo + below(count) * step;
},
random: () => next(),
choice: (xs: any[]) => {
if (!xs.length) throw new Error("choice: пустая последовательность");
return xs[below(xs.length)];
},
choices: (xs: any[], ...a: any[]) => {
const kw = kwOf(a);
const weights: number[] | null = kw.weights ?? kwless(a)[0] ?? null;
const k = kw.k ?? 1;
const total = weights ? weights.reduce((s, w) => s + w, 0) : xs.length;
const out: any[] = [];
for (let n = 0; n < k; n++) {
if (!weights) { out.push(xs[below(xs.length)]); continue; }
let roll = next() * total, i = 0;
while (i < xs.length - 1 && roll >= weights[i]) roll -= weights[i++];
out.push(xs[i]);
}
return out;
},
sample: (xs: any[], k: number) => {
const pool = [...xs];
if (k > pool.length) throw new Error("sample: выборка больше совокупности");
for (let i = 0; i < k; i++) {
const j = i + below(pool.length - i);
[pool[i], pool[j]] = [pool[j], pool[i]];
}
return pool.slice(0, k);
},
shuffle: (xs: any[]) => {
for (let i = xs.length - 1; i > 0; i--) {
const j = below(i + 1);
[xs[i], xs[j]] = [xs[j], xs[i]];
}
},
uniform: (a: number, b: number) => a + next() * (b - a),
seed: () => null,
};
// `rng = renpy.random.Random(seed)`: an independent generator; a given seed makes it repeatable
self.Random = (seed?: any) => {
if (seed === undefined || seed === null) return makeRandom(Math.random);
let state = [...String(seed)].reduce((h, c) => (Math.imul(h, 31) + c.charCodeAt(0)) | 0, 7) >>> 0;
return makeRandom(() => {
state = (state + 0x6d2b79f5) >>> 0;
let t = state;
t = Math.imul(t ^ (t >>> 15), t | 1);
t ^= t + Math.imul(t ^ (t >>> 7), t | 61);
return ((t ^ (t >>> 14)) >>> 0) / 4294967296;
});
};
return self;
};
const random = makeRandom(Math.random);
const music = (ch: string) => ({
play: (...a: any[]) => {
const kw = kwOf(a);
@@ -573,6 +623,7 @@ export class Engine {
list: (xs: any = []) => [...(xs instanceof PyDict ? xs.map.keys() : xs)],
tuple: (xs: any = []) => [...xs],
set: (xs: any = []) => [...new Set(xs)],
frozenset: (xs: any = []) => [...new Set(xs)],
dict: (...a: any[]) => {
const d = new PyDict(Array.isArray(kwless(a)[0]) ? kwless(a)[0] : []);
for (const [k, v] of Object.entries(kwOf(a))) d.set(k, v);
+30 -1
View File
@@ -25,9 +25,21 @@ export class PyDict {
// tuples used as dict keys must compare by value
function key(k: any) {
if (k instanceof PyInstance && activePython) {
// `__hash__` decides the key; instances whose hashes match are taken as equal (as with equal `__eq__`)
const found = k.cls.find("__hash__");
if (found && typeof found.value === "function") return `pyhash:${pyStr(found.value(k))}`;
}
return Array.isArray(k) ? JSON.stringify(k) : k;
}
/** A user class method for a special name (`__iter__`, `__getitem__`, `__contains__`), or null. */
function userMethod(o: any, name: string): ((...a: any[]) => any) | null {
if (!(o instanceof PyInstance) || !activePython) return null;
const found = o.cls.find(name);
return found && typeof found.value === "function" ? found.value : null;
}
export class JumpSignal {
constructor(public kind: "jump" | "call" | "return", public target: string) {}
}
@@ -54,7 +66,8 @@ export type Builtin = ((...args: any[]) => any) & { __py?: true };
// `class` statements of the game become PyClass objects. Instances keep their data in
// `attrs`, so a plain JSON round trip (saves) restores them given the class registry.
const SUPPORTED_DUNDERS = new Set(["__init__", "__str__", "__repr__", "__call__", "__eq__"]);
const SUPPORTED_DUNDERS = new Set(["__init__", "__str__", "__repr__", "__call__", "__eq__", "__hash__", "__iter__",
"__getitem__", "__contains__"]);
const MAX_CALL_DEPTH = 150;
export class PyClass {
@@ -369,6 +382,10 @@ function contains(container: any, item: any): boolean {
if (typeof container === "string") return container.includes(item);
if (Array.isArray(container)) return container.some((x) => pyEq(x, item));
if (container instanceof PyDict) return container.has(item);
const own = userMethod(container, "__contains__");
if (own) return truthy(own(container, item));
const walk = userMethod(container, "__iter__");
if (walk) return [...iterate(container)].some((x) => pyEq(x, item));
if (container && typeof container === "object") return item in container;
return false;
}
@@ -610,6 +627,8 @@ export class Python {
if (this.strict && !o.has(i)) this.raise("KeyError", pyStr(i));
return o.has(i) ? o.get(i) : null;
}
const getter = userMethod(o, "__getitem__");
if (getter) return getter(o, i);
if (!safeProperty(i) || typeof o === "function") return null;
if (this.strict && (Array.isArray(o) || typeof o === "string")) {
const at = index(o.length, i);
@@ -1408,6 +1427,11 @@ export class Python {
}
export function* iterate(v: any): Iterable<any> {
const own = userMethod(v, "__iter__");
if (own) {
yield* iterate(own(v));
return;
}
if (Array.isArray(v) || typeof v === "string") yield* v;
else if (v instanceof PyDict) yield* v.map.keys();
else if (v && typeof v[Symbol.iterator] === "function") yield* v;
@@ -1497,6 +1521,11 @@ export function userBuiltins(py: Python): Record<string, any> {
if (!safePythonProperty(o, name)) throw new Error("Служебный атрибут недоступен");
py.bind({ k: "attr", o: { k: "const", v: o }, a: name }, value);
},
iter: (x: any) => [...iterate(x)],
hash: (x: any) => {
const text = String(key(x));
return [...text].reduce((h, c) => (Math.imul(h, 31) + c.charCodeAt(0)) | 0, 7);
},
callable: (x: any) => typeof x === "function" || x instanceof PyClass || callableOf(x) !== null,
map: (f: any, xs: any) => [...iterate(xs)].map((x) => f(x)),
filter: (f: any, xs: any) => [...iterate(xs)].filter((x) => (f === null ? truthy(x) : truthy(f(x)))),