interscript 2.4.1 → 3.0.0

package/dist/stdlib/ml.js

@@ -0,0 +1,114 @@
+/**
+ * Rababa function — wired into the stdlib function registry.
+ *
+ * Called from rule executors when a map invokes `rababa config: "200"`.
+ * Loads the model on first use via the ML registry.
+ *
+ * Config keys (e.g. "200") map to a (model URL, rababa-specific config)
+ * pair via a registry. The registry is populated from
+ * `interscript-maps.yaml`'s `rababa-configs` section, the same source
+ * the Ruby runtime uses. Callers can override at runtime via
+ * `setRababaConfig(key, ...)`.
+ */
+import { createSession } from "../ml/session/index.js";
+import { createRababaModel } from "../ml/models/rababa/diacritizer.js";
+const DEFAULT_RABABA_CONFIGS = Object.freeze({
+    "200": Object.freeze({
+        model: "https://github.com/secryst/rababa-models/releases/download/0.1/diacritization_model_arabic.onnx",
+        config: Object.freeze({
+            session_name: "base",
+            text_encoder: "ArabicEncoderWithStartSymbol",
+            text_cleaner: "valid_arabic_cleaners",
+            max_len: 200,
+            batch_size: 32,
+        }),
+    }),
+});
+let rababaConfigs = new Map(Object.entries(DEFAULT_RABABA_CONFIGS));
+/**
+ * Register or replace a rababa config entry. Useful for tests and for
+ * air-gapped environments that need to point at a local model file.
+ *
+ *   setRababaConfig("200", {
+ *     model: "file:///path/to/model.onnx",
+ *     config: { max_len: 200, batch_size: 32, ... },
+ *   })
+ */
+export function setRababaConfig(key, entry) {
+    rababaConfigs.set(key, entry);
+}
+/**
+ * Reset the rababa config registry to the defaults shipped with the
+ * library. Tests use this to undo `setRababaConfig` between cases.
+ */
+export function resetRababaConfigs() {
+    rababaConfigs = new Map(Object.entries(DEFAULT_RABABA_CONFIGS));
+}
+function resolveConfig(key) {
+    const entry = rababaConfigs.get(key);
+    if (!entry) {
+        throw new Error(`No rababa config registered under '${key}'. ` +
+            `Register one via setRababaConfig() before invoking rababa.`);
+    }
+    return entry;
+}
+function buildRababaConfig(raw) {
+    return {
+        maxLen: Number(raw.max_len ?? raw.maxLen ?? 200),
+        batchSize: Number(raw.batch_size ?? raw.batchSize ?? 32),
+        textEncoder: (raw.text_encoder ??
+            "ArabicEncoderWithStartSymbol"),
+        textCleaner: (raw.text_cleaner ?? "valid_arabic_cleaners"),
+    };
+}
+const rababaCache = new Map();
+async function getRababa(configKey) {
+    let cached = rababaCache.get(configKey);
+    if (!cached) {
+        const entry = resolveConfig(configKey);
+        cached = (async () => {
+            const bytes = await fetchBytesLocal(entry.model);
+            const session = await createSession(bytes);
+            const config = buildRababaConfig(entry.config);
+            return createRababaModel({ session, artifacts: {}, config });
+        })();
+        rababaCache.set(configKey, cached);
+        cached.catch(() => rababaCache.delete(configKey));
+    }
+    return cached;
+}
+// Local fetch helper that handles file:// and https:// URLs.
+async function fetchBytesLocal(url) {
+    if (url.startsWith("file:") || url.startsWith(".")) {
+        const { readFile } = await import("node:fs/promises");
+        const path = url.startsWith("file:") ? url.slice(5) : url;
+        return new Uint8Array(await readFile(path));
+    }
+    const res = await fetch(url);
+    if (!res.ok)
+        throw new Error(`Failed to fetch ${url}: ${res.status}`);
+    return new Uint8Array(await res.arrayBuffer());
+}
+/**
+ * Run rababa diacritization on the input.
+ *
+ * Maps call this as `rababa config: "200"` (the Interscript DSL).
+ * The function registry in `executor.ts` dispatches funcalls with
+ * `name: "rababa"` to this function.
+ *
+ * Async — the function executor must use `transliterateAsync` when
+ * a map's stage contains a rababa call (see #67).
+ */
+export async function rababa(input, opts = {}) {
+    const configKey = opts.config ?? "200";
+    const model = await getRababa(configKey);
+    return model.diacritize(input);
+}
+/**
+ * Strip haraqat from text. Pure — no model required.
+ * Used by `rababa_reverse` in maps.
+ */
+export function rababaReverse(input) {
+    return input.replace(/[ًٌٍَُِّْ]/g, "");
+}
+//# sourceMappingURL=ml.js.map

package/dist/stdlib/ml.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ml.js","sourceRoot":"","sources":["../../src/stdlib/ml.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAA;AACtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAA;AAatE,MAAM,sBAAsB,GAAgD,MAAM,CAAC,MAAM,CAAC;IACxF,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC;QACnB,KAAK,EACH,iGAAiG;QACnG,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC;YACpB,YAAY,EAAE,MAAM;YACpB,YAAY,EAAE,8BAA8B;YAC5C,YAAY,EAAE,uBAAuB;YACrC,OAAO,EAAE,GAAG;YACZ,UAAU,EAAE,EAAE;SACf,CAAC;KACH,CAAC;CACH,CAAC,CAAA;AAEF,IAAI,aAAa,GAAmC,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC,CAAA;AAEnG;;;;;;;;GAQG;AACH,MAAM,UAAU,eAAe,CAAC,GAAW,EAAE,KAAwB;IACnE,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAA;AAC/B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB;IAChC,aAAa,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,sBAAsB,CAAC,CAAC,CAAA;AACjE,CAAC;AAED,SAAS,aAAa,CAAC,GAAW;IAChC,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;IACpC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CACb,sCAAsC,GAAG,KAAK;YAC5C,4DAA4D,CAC/D,CAAA;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,iBAAiB,CAAC,GAAsC;IAC/D,OAAO;QACL,MAAM,EAAE,MAAM,CAAC,GAAG,CAAC,OAAO,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC;QAChD,SAAS,EAAE,MAAM,CAAC,GAAG,CAAC,UAAU,IAAI,GAAG,CAAC,SAAS,IAAI,EAAE,CAAC;QACxD,WAAW,EAAE,CAAC,GAAG,CAAC,YAAY;YAC5B,8BAA8B,CAAgC;QAChE,WAAW,EAAE,CAAC,GAAG,CAAC,YAAY,IAAI,uBAAuB,CAAgC;KAC1F,CAAA;AACH,CAAC;AAED,MAAM,WAAW,GAAG,IAAI,GAAG,EAAgC,CAAA;AAE3D,KAAK,UAAU,SAAS,CAAC,SAAiB;IACxC,IAAI,MAAM,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IACvC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,KAAK,GAAG,aAAa,CAAC,SAAS,CAAC,CAAA;QACtC,MAAM,GAAG,CAAC,KAAK,IAAI,EAAE;YACnB,MAAM,KAAK,GAAG,MAAM,eAAe,CAAC,KAAK,CAAC,KAAK,CAAC,CAAA;YAChD,MAAM,OAAO,GAAG,MAAM,aAAa,CAAC,KAAK,CAAC,CAAA;YAC1C,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAA;YAC9C,OAAO,iBAAiB,CAAC,EAAE,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,MAAM,EAAE,CAAC,CAAA;QAC9D,CAAC,CAAC,EAAE,CAAA;QACJ,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,MAAM,CAAC,CAAA;QAClC,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAA;IACnD,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,6DAA6D;AAC7D,KAAK,UAAU,eAAe,CAAC,GAAW;IACxC,IAAI,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACnD,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM,MAAM,CAAC,kBAAkB,CAAC,CAAA;QACrD,MAAM,IAAI,GAAG,GAAG,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAA;QACzD,OAAO,IAAI,UAAU,CAAC,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;IAC7C,CAAC;IACD,MAAM,GAAG,GAAG,MAAM,KAAK,CAAC,GAAG,CAAC,CAAA;IAC5B,IAAI,CAAC,GAAG,CAAC,EAAE;QAAE,MAAM,IAAI,KAAK,CAAC,mBAAmB,GAAG,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC,CAAA;IACrE,OAAO,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,WAAW,EAAE,CAAC,CAAA;AAChD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,KAAa,EAAE,OAA4B,EAAE;IACxE,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,IAAI,KAAK,CAAA;IACtC,MAAM,KAAK,GAAG,MAAM,SAAS,CAAC,SAAS,CAAC,CAAA;IACxC,OAAO,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;AAChC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAa;IACzC,OAAO,KAAK,CAAC,OAAO,CAAC,aAAa,EAAE,EAAE,CAAC,CAAA;AACzC,CAAC"}

package/dist/stdlib.d.ts

@@ -0,0 +1,96 @@
+/**
+ * Standard library helpers — direct port of
+ * `interscript-ruby/lib/interscript/stdlib.rb`.
+ *
+ * Pure functions: no global state, no side effects. Easy to test in
+ * isolation. Each function has exactly one responsibility (MECE).
+ */
+/**
+ * Apply parallel string replacements in a single pass.
+ *
+ * Replaces all (from, to) pairs simultaneously, longest-from-first to
+ * avoid ambiguity. Tree-based for O(n log n) on input length.
+ *
+ * Port of `Interscript::Stdlib.parallel_replace`.
+ */
+export declare function parallelReplace(input: string, pairs: readonly (readonly [string, string])[]): string;
+/**
+ * Trie node for parallel replacement. Maps char code → child node.
+ * `match` holds the replacement string when this node is the end of a
+ * complete "from" pattern.
+ *
+ * Port of Ruby's nested-hash tree with `nil` sentinel for matches.
+ */
+export interface ParallelTrieNode {
+    readonly children: Map<number, ParallelTrieNode>;
+    match: string | null;
+}
+export declare function emptyTrieNode(): ParallelTrieNode;
+/**
+ * Build a trie from (from, to) pairs. Each "from" string becomes a path
+ * from root through character codes; the final node holds `match = to`.
+ *
+ * Multiple "from"s can share prefixes naturally. Longest match wins at
+ * runtime (handled by `parallelReplaceTree`).
+ *
+ * Port of `Interscript::Stdlib.parallel_replace_compile_tree`.
+ */
+export declare function compileParallelTree(pairs: readonly (readonly [string, string])[]): ParallelTrieNode;
+/**
+ * Walk `input` against the trie, emitting the longest match at each
+ * position. Falls back to passing through the character unchanged.
+ *
+ * Port of `Interscript::Stdlib.parallel_replace_tree`.
+ */
+export declare function parallelReplaceTree(input: string, tree: ParallelTrieNode): string;
+/**
+ * Escape a string so it matches literally inside a RegExp.
+ * Port of Ruby's `Regexp.escape`.
+ */
+export declare function regexpEscape(input: string): string;
+/**
+ * Lowercase a string. Maps to `Interscript.functions.downcase`.
+ */
+export declare function downcase(input: string): string;
+/**
+ * Uppercase a string. Maps to `Interscript.functions.upcase`.
+ */
+export declare function upcase(input: string): string;
+/**
+ * Capitalise each word; honours custom word separator.
+ * Maps to `Interscript.functions.title_case`.
+ */
+export declare function titleCase(input: string, opts?: {
+    wordSeparator?: string;
+}): string;
+/**
+ * Insert a separator between every character.
+ * Maps to `Interscript.functions.separate`.
+ */
+export declare function separate(input: string, opts?: {
+    separator?: string;
+}): string;
+/**
+ * Unicode NFC normalisation via String.prototype.normalize.
+ */
+export declare function compose(input: string): string;
+export declare function decompose(input: string): string;
+/**
+ * Megaregexp parallel replace — Ruby's fallback for parallel blocks
+ * where any rule has `before`/`after`/`not_before`/`not_after` constraints.
+ *
+ * Mirrors `Interscript::Stdlib.parallel_regexp_compile` + `parallel_regexp_gsub`:
+ * all rules join into one alternation `(?<g0>p0)|(?<g1>p1)|...` and a single
+ * gsub decides which alternative matched via the named group. Rule order is
+ * pre-sorted by the caller (longest `max_length` first, declaration order
+ * as tiebreaker — matching Ruby's `deterministic_sort_by_max_length`).
+ *
+ * Onigmo and V8 share alternation semantics: at each scan position,
+ * alternatives are tried in declaration order and the first match wins.
+ */
+export interface MegaregexpRule {
+    readonly pattern: string;
+    readonly replace: (match: string, groups: (string | undefined)[]) => string;
+}
+export declare function parallelMegaregexp(input: string, rules: readonly MegaregexpRule[]): string;
+//# sourceMappingURL=stdlib.d.ts.map

package/dist/stdlib.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"stdlib.d.ts","sourceRoot":"","sources":["../src/stdlib.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;;;;;GAOG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,MAAM,EACb,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,GAC5C,MAAM,CAGR;AAED;;;;;;GAMG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,gBAAgB,CAAC,CAAA;IAChD,KAAK,EAAE,MAAM,GAAG,IAAI,CAAA;CACrB;AAED,wBAAgB,aAAa,IAAI,gBAAgB,CAEhD;AAED;;;;;;;;GAQG;AACH,wBAAgB,mBAAmB,CACjC,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,GAC5C,gBAAgB,CAuBlB;AAED;;;;;GAKG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,gBAAgB,GAAG,MAAM,CA8BjF;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAElD;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE9C;AAED;;GAEG;AACH,wBAAgB,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE5C;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,GAAE;IAAE,aAAa,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,MAAM,CAOtF;AAED;;;GAGG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,CAAA;CAAO,GAAG,MAAM,CAGjF;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE7C;AAED,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CAE/C;AAED;;;;;;;;;;;;GAYG;AACH,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;IACxB,QAAQ,CAAC,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,EAAE,KAAK,MAAM,CAAA;CAC5E;AAED,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,cAAc,EAAE,GAAG,MAAM,CAe1F"}

package/dist/stdlib.js

@@ -0,0 +1,160 @@
+/**
+ * Standard library helpers — direct port of
+ * `interscript-ruby/lib/interscript/stdlib.rb`.
+ *
+ * Pure functions: no global state, no side effects. Easy to test in
+ * isolation. Each function has exactly one responsibility (MECE).
+ */
+/**
+ * Apply parallel string replacements in a single pass.
+ *
+ * Replaces all (from, to) pairs simultaneously, longest-from-first to
+ * avoid ambiguity. Tree-based for O(n log n) on input length.
+ *
+ * Port of `Interscript::Stdlib.parallel_replace`.
+ */
+export function parallelReplace(input, pairs) {
+    if (pairs.length === 0)
+        return input;
+    return parallelReplaceTree(input, compileParallelTree(pairs));
+}
+export function emptyTrieNode() {
+    return { children: new Map(), match: null };
+}
+/**
+ * Build a trie from (from, to) pairs. Each "from" string becomes a path
+ * from root through character codes; the final node holds `match = to`.
+ *
+ * Multiple "from"s can share prefixes naturally. Longest match wins at
+ * runtime (handled by `parallelReplaceTree`).
+ *
+ * Port of `Interscript::Stdlib.parallel_replace_compile_tree`.
+ */
+export function compileParallelTree(pairs) {
+    const root = emptyTrieNode();
+    for (const [from, to] of pairs) {
+        if (from.length === 0)
+            continue;
+        let branch = root;
+        for (let i = 0; i < from.length - 1; i++) {
+            const code = from.charCodeAt(i);
+            let next = branch.children.get(code);
+            if (!next) {
+                next = emptyTrieNode();
+                branch.children.set(code, next);
+            }
+            branch = next;
+        }
+        const last = from.charCodeAt(from.length - 1);
+        let leaf = branch.children.get(last);
+        if (!leaf) {
+            leaf = emptyTrieNode();
+            branch.children.set(last, leaf);
+        }
+        leaf.match = to;
+    }
+    return root;
+}
+/**
+ * Walk `input` against the trie, emitting the longest match at each
+ * position. Falls back to passing through the character unchanged.
+ *
+ * Port of `Interscript::Stdlib.parallel_replace_tree`.
+ */
+export function parallelReplaceTree(input, tree) {
+    let out = "";
+    const len = input.length;
+    let i = 0;
+    while (i < len) {
+        let branch = tree;
+        let matchEnd = 0;
+        let matchReplacement = null;
+        for (let j = 0; i + j < len; j++) {
+            const code = input.charCodeAt(i + j);
+            const next = branch.children.get(code);
+            if (!next)
+                break;
+            branch = next;
+            if (branch.match !== null) {
+                matchEnd = j + 1;
+                matchReplacement = branch.match;
+            }
+        }
+        if (matchReplacement !== null && matchEnd > 0) {
+            out += matchReplacement;
+            i += matchEnd;
+        }
+        else {
+            out += input[i];
+            i += 1;
+        }
+    }
+    return out;
+}
+/**
+ * Escape a string so it matches literally inside a RegExp.
+ * Port of Ruby's `Regexp.escape`.
+ */
+export function regexpEscape(input) {
+    return input.replace(/[.*+?^${}()|[\]\\]/g, "\\$&");
+}
+/**
+ * Lowercase a string. Maps to `Interscript.functions.downcase`.
+ */
+export function downcase(input) {
+    return input.toLowerCase();
+}
+/**
+ * Uppercase a string. Maps to `Interscript.functions.upcase`.
+ */
+export function upcase(input) {
+    return input.toUpperCase();
+}
+/**
+ * Capitalise each word; honours custom word separator.
+ * Maps to `Interscript.functions.title_case`.
+ */
+export function titleCase(input, opts = {}) {
+    const sep = opts.wordSeparator ?? " ";
+    if (sep === "")
+        return input.charAt(0).toUpperCase() + input.slice(1).toLowerCase();
+    return input
+        .split(sep)
+        .map((w) => (w.length === 0 ? w : w.charAt(0).toUpperCase() + w.slice(1).toLowerCase()))
+        .join(sep);
+}
+/**
+ * Insert a separator between every character.
+ * Maps to `Interscript.functions.separate`.
+ */
+export function separate(input, opts = {}) {
+    const sep = opts.separator ?? " ";
+    return input.split("").join(sep);
+}
+/**
+ * Unicode NFC normalisation via String.prototype.normalize.
+ */
+export function compose(input) {
+    return input.normalize("NFC");
+}
+export function decompose(input) {
+    return input.normalize("NFD");
+}
+export function parallelMegaregexp(input, rules) {
+    if (rules.length === 0)
+        return input;
+    const parts = rules.map((r, i) => `(?<__r${i}>${r.pattern})`);
+    const re = new RegExp(parts.join("|"), "gmu");
+    return input.replace(re, (...args) => {
+        const groups = args[args.length - 1];
+        for (let i = 0; i < rules.length; i++) {
+            if (groups[`__r${i}`] !== undefined) {
+                const match = args[0];
+                const captures = args.slice(1, -2);
+                return rules[i].replace(match, captures);
+            }
+        }
+        return args[0];
+    });
+}
+//# sourceMappingURL=stdlib.js.map

package/dist/stdlib.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stdlib.js","sourceRoot":"","sources":["../src/stdlib.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH;;;;;;;GAOG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAa,EACb,KAA6C;IAE7C,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAA;IACpC,OAAO,mBAAmB,CAAC,KAAK,EAAE,mBAAmB,CAAC,KAAK,CAAC,CAAC,CAAA;AAC/D,CAAC;AAcD,MAAM,UAAU,aAAa;IAC3B,OAAO,EAAE,QAAQ,EAAE,IAAI,GAAG,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;AAC7C,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAA6C;IAE7C,MAAM,IAAI,GAAG,aAAa,EAAE,CAAA;IAC5B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,KAAK,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,SAAQ;QAC/B,IAAI,MAAM,GAAG,IAAI,CAAA;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;YAC/B,IAAI,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACpC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,IAAI,GAAG,aAAa,EAAE,CAAA;gBACtB,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACjC,CAAC;YACD,MAAM,GAAG,IAAI,CAAA;QACf,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;QAC7C,IAAI,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACpC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,GAAG,aAAa,EAAE,CAAA;YACtB,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QACjC,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,EAAE,CAAA;IACjB,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAa,EAAE,IAAsB;IACvE,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,MAAM,GAAG,GAAG,KAAK,CAAC,MAAM,CAAA;IACxB,IAAI,CAAC,GAAG,CAAC,CAAA;IAET,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;QACf,IAAI,MAAM,GAAG,IAAI,CAAA;QACjB,IAAI,QAAQ,GAAG,CAAC,CAAA;QAChB,IAAI,gBAAgB,GAAkB,IAAI,CAAA;QAE1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;YACpC,MAAM,IAAI,GAAG,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACtC,IAAI,CAAC,IAAI;gBAAE,MAAK;YAChB,MAAM,GAAG,IAAI,CAAA;YACb,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;gBAC1B,QAAQ,GAAG,CAAC,GAAG,CAAC,CAAA;gBAChB,gBAAgB,GAAG,MAAM,CAAC,KAAK,CAAA;YACjC,CAAC;QACH,CAAC;QAED,IAAI,gBAAgB,KAAK,IAAI,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YAC9C,GAAG,IAAI,gBAAgB,CAAA;YACvB,CAAC,IAAI,QAAQ,CAAA;QACf,CAAC;aAAM,CAAC;YACN,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAA;YACf,CAAC,IAAI,CAAC,CAAA;QACR,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa;IACxC,OAAO,KAAK,CAAC,OAAO,CAAC,qBAAqB,EAAE,MAAM,CAAC,CAAA;AACrD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAa;IACpC,OAAO,KAAK,CAAC,WAAW,EAAE,CAAA;AAC5B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,MAAM,CAAC,KAAa;IAClC,OAAO,KAAK,CAAC,WAAW,EAAE,CAAA;AAC5B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,KAAa,EAAE,OAAmC,EAAE;IAC5E,MAAM,GAAG,GAAG,IAAI,CAAC,aAAa,IAAI,GAAG,CAAA;IACrC,IAAI,GAAG,KAAK,EAAE;QAAE,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAA;IACnF,OAAO,KAAK;SACT,KAAK,CAAC,GAAG,CAAC;SACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;SACvF,IAAI,CAAC,GAAG,CAAC,CAAA;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAa,EAAE,OAA+B,EAAE;IACvE,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,IAAI,GAAG,CAAA;IACjC,OAAO,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AAClC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,KAAa;IACnC,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;AAC/B,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,OAAO,KAAK,CAAC,SAAS,CAAC,KAAK,CAAC,CAAA;AAC/B,CAAC;AAoBD,MAAM,UAAU,kBAAkB,CAAC,KAAa,EAAE,KAAgC;IAChF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAA;IACpC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,OAAO,GAAG,CAAC,CAAA;IAC7D,MAAM,EAAE,GAAG,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAA;IAC7C,OAAO,KAAK,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,GAAG,IAAe,EAAE,EAAE;QAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAuC,CAAA;QAC1E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,IAAI,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,SAAS,EAAE,CAAC;gBACpC,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAW,CAAA;gBAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAA2B,CAAA;gBAC5D,OAAO,KAAK,CAAC,CAAC,CAAE,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,CAAC,CAAW,CAAA;IAC1B,CAAC,CAAC,CAAA;AACJ,CAAC"}

package/dist/types.d.ts

@@ -0,0 +1,167 @@
+/**
+ * Domain model for Interscript — TypeScript-native port of the Ruby AST.
+ *
+ * Design principles (per OCP):
+ *   - AST nodes are discriminated unions, not class hierarchies. Adding a
+ *     new node kind = adding a new variant + a new executor registration.
+ *     Existing executors never need to change.
+ *   - Each type maps to exactly one Ruby AST concept (MECE).
+ *   - Public types live here so consumers can pattern-match without
+ *     depending on internal file layout.
+ */
+/** Identifier of a transliteration system, e.g. "bgnpcgn-ukr-Cyrl-Latn-2019". */
+export type SystemCode = string;
+/** Metadata about a transliteration map. */
+export interface MapInfo {
+    systemCode: SystemCode;
+    displayName?: string;
+    authority?: string;
+    sourceScript?: string;
+    destinationScript?: string;
+}
+/** Result of a detect() call — one candidate system with its distance. */
+export interface DetectionResult {
+    mapName: SystemCode;
+    distance: number;
+}
+/** Options for detect(). */
+export interface DetectOptions {
+    mapPattern?: string;
+}
+/**
+ * JSON IR shape emitted by `Interscript::Compiler::JsonIR` (Ruby).
+ *
+ * `aliases` and `functions` are serialised as plain JSON objects (not
+ * Maps) because JSON has no Map type. The runtime reconstructs them
+ * into Maps at load time via `normaliseMap()`.
+ */
+export interface CompiledMapJson {
+    readonly schemaVersion: 1;
+    readonly systemCode: SystemCode;
+    readonly dependencies: readonly SystemCode[];
+    readonly metadata?: Readonly<Record<string, unknown>>;
+    readonly stages: readonly Stage[];
+    readonly aliases: Readonly<Record<string, Item>>;
+    readonly functions: Readonly<Record<string, unknown>>;
+}
+/**
+ * Runtime form of a compiled map.
+ *
+ * Public consumers should treat this as opaque; the loader produces it
+ * from `CompiledMapJson` via `normaliseMap()`.
+ */
+export interface CompiledMap {
+    readonly schemaVersion: 1;
+    readonly systemCode: SystemCode;
+    readonly dependencies: readonly SystemCode[];
+    readonly metadata?: Readonly<Record<string, unknown>>;
+    readonly stages: readonly Stage[];
+    readonly aliases: ReadonlyMap<string, Item>;
+    readonly functions: ReadonlyMap<string, FunctionDef>;
+}
+/** Mutable builder form — produced by `normaliseMap`, frozen before use. */
+export type CompiledMapBuilder = {
+    -readonly [K in keyof CompiledMap]: CompiledMap[K];
+};
+export interface FunctionDef {
+    readonly name: string;
+    /** Native function reference. JSON IR serialises names; runtime resolves. */
+    readonly impl?: (input: string, opts?: Record<string, unknown>) => string;
+}
+/** A stage is a sequence of rules applied in order to a string. */
+export interface Stage {
+    readonly kind: "stage";
+    readonly name: string;
+    readonly rules: readonly Rule[];
+}
+/**
+ * Discriminated union of all rule kinds.
+ * Adding a new rule kind = adding a variant here + an executor.
+ */
+export type Rule = SubRule | RunRule | FuncallRule | ParallelRule | SequentialRule;
+export interface SubRule {
+    readonly kind: "sub";
+    readonly from?: Item;
+    readonly to?: Item | FuncallInline;
+    readonly before?: Item;
+    readonly after?: Item;
+    readonly notBefore?: Item;
+    readonly notAfter?: Item;
+    readonly priority?: number;
+}
+export interface RunRule {
+    readonly kind: "run";
+    readonly stage: string;
+    readonly docName?: string;
+}
+export interface FuncallRule {
+    readonly kind: "funcall";
+    readonly name: string;
+    readonly kwargs?: Readonly<Record<string, unknown>>;
+}
+/** Parallel rule group — all subs inside apply in a single pass. */
+export interface ParallelRule {
+    readonly kind: "parallel";
+    readonly rules: readonly Rule[];
+}
+/** Sequential rule group — applies rules in order, like a sub-stage. */
+export interface SequentialRule {
+    readonly kind: "sequential";
+    readonly rules: readonly Rule[];
+}
+/** Inline function call used as a SubRule's `to` (e.g. `:upcase`). */
+export interface FuncallInline {
+    readonly kind: "funcall_inline";
+    readonly name: string;
+}
+/** Items are the building blocks of pattern/replace expressions. */
+export type Item = StringItem | CaptureGroupItem | CaptureRefItem | AliasItem | AnyItem | AnyCharClassItem | GroupItem | RepeatItem | StageItem;
+export interface StringItem {
+    readonly kind: "string";
+    readonly value: string;
+}
+/** A capture group `(...)` — defines a new capture. */
+export interface CaptureGroupItem {
+    readonly kind: "capture_group";
+    readonly data: Item;
+}
+/** A back-reference to a previously-defined capture group (`\1`). */
+export interface CaptureRefItem {
+    readonly kind: "capture_ref";
+    readonly id: number;
+}
+export interface AliasItem {
+    readonly kind: "alias";
+    readonly name: string;
+    readonly map?: string;
+}
+export interface AnyItem {
+    readonly kind: "any";
+    readonly of: readonly Item[];
+}
+/**
+ * Character class — `[a-z]`, `[abc]`, etc. Mirrors Ruby's Any node when
+ * constructed from a String or Range payload. Kept distinct from
+ * `AnyItem` because Ruby's interpreter compiles them differently:
+ * `Any(["a","b"])` → `(?:a|b)`, `Any("ab")` → `[ab]`, `Any("a".."z")` → `[a-z]`.
+ */
+export interface AnyCharClassItem {
+    readonly kind: "any_char_class";
+    readonly range?: readonly [string, string];
+    readonly chars?: readonly string[];
+}
+export interface GroupItem {
+    readonly kind: "group";
+    readonly items: readonly Item[];
+}
+export interface RepeatItem {
+    readonly kind: "repeat";
+    readonly item: Item;
+    readonly min: number;
+    readonly max: number | null;
+}
+export interface StageItem {
+    readonly kind: "stage_ref";
+    readonly name: string;
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,iFAAiF;AACjF,MAAM,MAAM,UAAU,GAAG,MAAM,CAAA;AAE/B,4CAA4C;AAC5C,MAAM,WAAW,OAAO;IACtB,UAAU,EAAE,UAAU,CAAA;IACtB,WAAW,CAAC,EAAE,MAAM,CAAA;IACpB,SAAS,CAAC,EAAE,MAAM,CAAA;IAClB,YAAY,CAAC,EAAE,MAAM,CAAA;IACrB,iBAAiB,CAAC,EAAE,MAAM,CAAA;CAC3B;AAED,0EAA0E;AAC1E,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,UAAU,CAAA;IACnB,QAAQ,EAAE,MAAM,CAAA;CACjB;AAED,4BAA4B;AAC5B,MAAM,WAAW,aAAa;IAC5B,UAAU,CAAC,EAAE,MAAM,CAAA;CACpB;AAED;;;;;;GAMG;AACH,MAAM,WAAW,eAAe;IAC9B,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAA;IACzB,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAA;IAC/B,QAAQ,CAAC,YAAY,EAAE,SAAS,UAAU,EAAE,CAAA;IAC5C,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;IACrD,QAAQ,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAA;IACjC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;IAChD,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;CACtD;AAED;;;;;GAKG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,aAAa,EAAE,CAAC,CAAA;IACzB,QAAQ,CAAC,UAAU,EAAE,UAAU,CAAA;IAC/B,QAAQ,CAAC,YAAY,EAAE,SAAS,UAAU,EAAE,CAAA;IAC5C,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;IACrD,QAAQ,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAA;IACjC,QAAQ,CAAC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;IAC3C,QAAQ,CAAC,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,WAAW,CAAC,CAAA;CACrD;AAED,4EAA4E;AAC5E,MAAM,MAAM,kBAAkB,GAAG;IAC/B,CAAC,UAAU,CAAC,IAAI,MAAM,WAAW,GAAG,WAAW,CAAC,CAAC,CAAC;CACnD,CAAA;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,6EAA6E;IAC7E,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,MAAM,CAAA;CAC1E;AAED,mEAAmE;AACnE,MAAM,WAAW,KAAK;IACpB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAA;CAChC;AAED;;;GAGG;AACH,MAAM,MAAM,IAAI,GAAG,OAAO,GAAG,OAAO,GAAG,WAAW,GAAG,YAAY,GAAG,cAAc,CAAA;AAElF,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAA;IACpB,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,CAAA;IACpB,QAAQ,CAAC,EAAE,CAAC,EAAE,IAAI,GAAG,aAAa,CAAA;IAClC,QAAQ,CAAC,MAAM,CAAC,EAAE,IAAI,CAAA;IACtB,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,CAAA;IACrB,QAAQ,CAAC,SAAS,CAAC,EAAE,IAAI,CAAA;IACzB,QAAQ,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAA;IACxB,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAA;CAC3B;AAED,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAA;IACpB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;IACtB,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAA;CAC1B;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;IACxB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,MAAM,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;CACpD;AAED,oEAAoE;AACpE,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAA;IACzB,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAA;CAChC;AAED,wEAAwE;AACxE,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAA;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAA;CAChC;AAED,sEAAsE;AACtE,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAA;IAC/B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CACtB;AAED,oEAAoE;AACpE,MAAM,MAAM,IAAI,GACZ,UAAU,GACV,gBAAgB,GAChB,cAAc,GACd,SAAS,GACT,OAAO,GACP,gBAAgB,GAChB,SAAS,GACT,UAAU,GACV,SAAS,CAAA;AAEb,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CACvB;AAED,uDAAuD;AACvD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,eAAe,CAAA;IAC9B,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;CACpB;AAED,qEAAqE;AACrE,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,aAAa,CAAA;IAC5B,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAA;CACpB;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,GAAG,CAAC,EAAE,MAAM,CAAA;CACtB;AAED,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,IAAI,EAAE,KAAK,CAAA;IACpB,QAAQ,CAAC,EAAE,EAAE,SAAS,IAAI,EAAE,CAAA;CAC7B;AAED;;;;;GAKG;AACH,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,gBAAgB,CAAA;IAC/B,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAC1C,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAA;CACnC;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAA;IACtB,QAAQ,CAAC,KAAK,EAAE,SAAS,IAAI,EAAE,CAAA;CAChC;AAED,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;IACnB,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;IACpB,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAA;CAC5B;AAED,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,IAAI,EAAE,WAAW,CAAA;IAC1B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;CACtB"}

package/dist/types.js

@@ -0,0 +1,13 @@
+/**
+ * Domain model for Interscript — TypeScript-native port of the Ruby AST.
+ *
+ * Design principles (per OCP):
+ *   - AST nodes are discriminated unions, not class hierarchies. Adding a
+ *     new node kind = adding a new variant + a new executor registration.
+ *     Existing executors never need to change.
+ *   - Each type maps to exactly one Ruby AST concept (MECE).
+ *   - Public types live here so consumers can pattern-match without
+ *     depending on internal file layout.
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../src/types.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG"}