@jantstack/adonis-authz 2.5.0-alpha.2 → 2.5.0-alpha.3

package/build/src/relations/tuple_order.js

@@ -0,0 +1,598 @@
+/**
+ * **El ORDEN de las escrituras y de los borrados de relaciones — punto de paso ÚNICO** (plan 2.5 · lote D; linaje L10
+ * «el estado intermedio de una operación multi-request concede», PROMOVIDO: 3b-2f R3, 3b-6 P1, D1 🟠 1 —la purga de
+ * `openfga`—, D2 🟠 1 —el reconcile— y, en el cierre 2 de D2, 🟡 N3 —escrituras y poda COMPUESTAS—). Lo usan los DOS
+ * caminos que escriben o borran relaciones en varias requests: `applyPartition` del reconcile
+ * (`src/relations/reconcile.ts`) y `purgeWrites` de las purgas de `openfga` (`src/drivers/openfga_relations_driver.ts`).
+ *
+ * **Cierre 2 de D2 · 🟡 N3 (estructural).** Hasta aquí había DOS órdenes (uno de escritura y otro de borrado) y el reconcile
+ * los encadenaba: TODAS las escrituras y luego TODA la poda. Un ex-miembro componía con un allow nuevo (U ∈ g sobra,
+ * `g#member viewer X` es nuevo: cortada tras la 1.ª escritura, U concedía sobre X y ni el inicial ni el final lo hacían).
+ * Ahora hay UNA función, `relationTransitionOrder`, que ordena la TRANSICIÓN entera (escrituras, borrados y renovaciones)
+ * y una propiedad que se DEMUESTRA por fuerza bruta (`tests/helpers/order_bruteforce.ts`, propiedad
+ * `relations.order.exhaustive` de la guardia y `tests/relations_order_exhaustive.spec.ts`).
+ *
+ * **Cinco fases** (las cuatro de los extremos solo restringen o solo amplían; lo difícil es la de en medio):
+ *
+ *  1. escribir los DENIES nuevos (y rehacer los que cambian) — solo restringe;
+ *  2. borrar los ALLOWS sobrantes sobre objetos que no son `group` — solo restringe;
+ *  3. las MEMBRESÍAS `group:*#member` que entran y que salen, en el orden de un GRAFO DE PRECEDENCIAS (abajo); con los
+ *     allows reducidos a los que están en los dos estados y TODOS los denies de los dos estados presentes, que es el
+ *     contexto más restrictivo posible para el paso difícil;
+ *  4. escribir los ALLOWS nuevos (y las renovaciones que no son denies) — con las membresías y los denies finales
+ *     presentes, solo puede conceder lo que concede el final;
+ *  5. borrar los DENIES sobrantes, los ÚLTIMOS — idem.
+ *
+ * **El grafo de la fase 3.** Para cada membresía que cambia (arista `sujeto → grupo`) se calcula, en el grafo UNIÓN de
+ * los dos estados, qué objetos DENIEGA lo que alcanza su grupo (`D`) y qué objetos le CONCEDE de forma efectiva (`A`: los
+ * allows que están en los dos estados, menos los que cortan los denies que su grupo alcanza por aristas que no cambian —
+ * el «auto-corte», que solo se aplica con el predicado `cuts` de la config: sin él, ningún allow se da por cortado, lo
+ * conservador). Las precedencias, entre aristas que comparten algún sujeto:
+ *
+ *  - **C1** (dos que entran): la que trae un deny sobre X antes que la que trae un allow sobre X;
+ *  - **C2** (dos que salen): la que lleva un allow sobre X antes que la que lleva un deny sobre X (salvo que el sujeto
+ *    solo alcance la primera a través de la segunda);
+ *  - **C3** (una que sale y otra que entra en el MISMO camino anidado, `U ∈ h` sobra y `h ⊂ g` es nueva): la que sale
+ *    antes, si el camino compuesto llevaría un allow efectivo — es el 🟡 N3 con anidamiento;
+ *  - **C4** (una que entra y otra que sale y las dos traen un deny sobre X que protege un allow del sujeto): la que entra
+ *    antes — el sujeto cambia de grupo denegado sin un instante sin deny.
+ *
+ * Se ordena por componentes fuertemente conexas (Tarjan) en orden topológico; entre las disponibles, escrituras antes que
+ * borrados, las escrituras de más lejos del sujeto primero y los borrados de más cerca primero, y (objeto, sujeto): el
+ * reparto NO depende del orden de enumeración del origen ni del `Read`.
+ *
+ * **Lo que garantiza, exactamente** (demostrado por fuerza bruta; README «Denies migrate as denies»): **si el grafo de
+ * precedencias no tiene un CICLO, ningún estado intermedio concede algo que no concedían el estado inicial o el final, y
+ * ningún sujeto denegado en los dos concede en ninguno.** El RESIDUO es exactamente el ciclo (`residue`): dos membresías
+ * que cambian en la misma pasada cuyas exigencias se contradicen —la forma típica: el mismo sujeto entra (o sale) a la
+ * vez en dos grupos y cada uno trae un deny que corta un allow que trae el otro—. Ahí NO existe en general ningún orden
+ * seguro (la fuerza bruta lo mide: de los casos del ciclo que conceden, una parte no admite NINGUNA permutación del diff
+ * segura), así que el orden aplica las aristas del ciclo en el orden de prioridad y lo DEVUELVE para que la pasada lo diga.
+ *
+ * Pura (regla 2 de pureza): no importa nada del paquete. Coste: lineal en las tuplas más los pares de membresías que
+ * cambian de un MISMO sujeto, y los de cada arista anidada (`group:x#member`) con las de los sujetos que tiene debajo.
+ */
+/** El tipo built-in que transporta usersets (`group:g#member`). */
+const GROUP_PREFIX = 'group:';
+const MEMBER_SUFFIX = '#member';
+export function relationOrderClass(view) {
+    if (view.deny)
+        return 'deny';
+    return view.object.startsWith(GROUP_PREFIX) ? 'membership' : 'allow';
+}
+/** `group:<id>#member` ⇒ `group:<id>`; cualquier otro sujeto ⇒ `null`. */
+function usersetGroup(user) {
+    return user.startsWith(GROUP_PREFIX) && user.endsWith(MEMBER_SUFFIX) ? user.slice(0, -MEMBER_SUFFIX.length) : null;
+}
+function viewKey(v) {
+    return `${v.deny ? 'd' : 'a'}\u0000${v.object}\u0000${v.user}\u0000${v.relation ?? ''}`;
+}
+function objectTypeOf(object) {
+    const colon = object.indexOf(':');
+    return colon < 0 ? object : object.slice(0, colon);
+}
+/**
+ * Los grupos PORTADORES de deny: el `#member` de cada uno es sujeto de algún deny de `views`, más el cierre por la
+ * anidación (`group:G#member@group:H#member` con G portador ⇒ H portador). Devuelve los OBJETOS (`group:<id>`). Lo usa
+ * el reconcile para clasificar la renovación de una membresía PORTADORA (cierre 2 de D2 · 🟠 N1, `renewal-unsafe`).
+ */
+export function denyCarrierGroups(views) {
+    const all = [...views];
+    const carriers = new Set();
+    for (const v of all) {
+        const group = v.deny ? usersetGroup(v.user) : null;
+        if (group !== null)
+            carriers.add(group);
+    }
+    const nested = all.filter((v) => relationOrderClass(v) === 'membership' && usersetGroup(v.user) !== null);
+    for (let grew = true; grew;) {
+        grew = false;
+        for (const v of nested) {
+            const inner = usersetGroup(v.user);
+            if (carriers.has(v.object) && !carriers.has(inner)) {
+                carriers.add(inner);
+                grew = true;
+            }
+        }
+    }
+    return carriers;
+}
+/**
+ * **Los denies que TRANSPORTA un grupo** (cierre 6 de D2 · ⚪ D5-3, para la letra): los `deny` cuyo sujeto es el `#member`
+ * del grupo o de un grupo que lo contiene, transitivamente (`group:G#member@group:H#member`: los miembros de H heredan los
+ * denies de G). Devuelve las VISTAS de esos denies, en el orden de entrada. Misma regla que `denyCarrierGroups`, al revés.
+ */
+export function carriedDenies(views, group) {
+    const all = [...views];
+    const reach = new Set([group]);
+    const nested = all.filter((v) => relationOrderClass(v) === 'membership' && usersetGroup(v.user) !== null);
+    for (let grew = true; grew;) {
+        grew = false;
+        for (const v of nested) {
+            if (reach.has(usersetGroup(v.user)) && !reach.has(v.object)) {
+                reach.add(v.object);
+                grew = true;
+            }
+        }
+    }
+    return all.filter((v) => v.deny && reach.has(usersetGroup(v.user) ?? ''));
+}
+/** Un grafo de membresías (aristas `sujeto → grupo`): hacia arriba (`up`), hacia abajo (`below`) y altura. */
+class MembershipGraph {
+    #parents = new Map();
+    #into = new Map();
+    #childGroups = new Map();
+    #up = new Map();
+    #below = new Map();
+    #height = new Map();
+    constructor(edges) {
+        for (const e of edges) {
+            let list = this.#into.get(e.object);
+            if (!list)
+                this.#into.set(e.object, (list = []));
+            list.push(e);
+            const child = usersetGroup(e.user);
+            if (child === null)
+                continue;
+            let parents = this.#parents.get(child);
+            if (!parents)
+                this.#parents.set(child, (parents = new Set()));
+            parents.add(e.object);
+            let children = this.#childGroups.get(e.object);
+            if (!children)
+                this.#childGroups.set(e.object, (children = new Set()));
+            children.add(child);
+        }
+    }
+    /** Los grupos que alcanza `group` (él incluido). */
+    up(group) {
+        let seen = this.#up.get(group);
+        if (seen)
+            return seen;
+        seen = new Set([group]);
+        const stack = [group];
+        while (stack.length > 0) {
+            for (const parent of this.#parents.get(stack.pop()) ?? []) {
+                if (!seen.has(parent)) {
+                    seen.add(parent);
+                    stack.push(parent);
+                }
+            }
+        }
+        this.#up.set(group, seen);
+        return seen;
+    }
+    /** Los sujetos (holders y usersets) que alcanzan al sujeto `user` (él incluido), opcionalmente SIN la arista `without`. */
+    below(user, without) {
+        if (usersetGroup(user) === null)
+            return new Set([user]);
+        if (without === undefined) {
+            const memo = this.#below.get(user);
+            if (memo)
+                return memo;
+        }
+        const out = new Set([user]);
+        const stack = [user];
+        while (stack.length > 0) {
+            const group = usersetGroup(stack.pop());
+            if (group === null)
+                continue;
+            for (const e of this.#into.get(group) ?? []) {
+                if (without !== undefined && viewKey(e) === without)
+                    continue;
+                if (!out.has(e.user)) {
+                    out.add(e.user);
+                    stack.push(e.user);
+                }
+            }
+        }
+        if (without === undefined)
+            this.#below.set(user, out);
+        return out;
+    }
+    /** Distancia de un sujeto a los holders: 0 un holder; un userset, 1 + la de su grupo hijo más profundo. */
+    depth(user) {
+        const group = usersetGroup(user);
+        return group === null ? 0 : this.#groupHeight(group, new Set());
+    }
+    #groupHeight(group, path) {
+        const memo = this.#height.get(group);
+        if (memo !== undefined)
+            return memo;
+        if (path.has(group))
+            return 1;
+        path.add(group);
+        let height = 1;
+        for (const child of this.#childGroups.get(group) ?? [])
+            height = Math.max(height, 1 + this.#groupHeight(child, path));
+        path.delete(group);
+        this.#height.set(group, height);
+        return height;
+    }
+}
+/** Índice de tuplas (allows o denies) por sujeto: `sujeto → objeto → relaciones`. */
+function bySubject(views) {
+    const out = new Map();
+    for (const v of views) {
+        let objects = out.get(v.user);
+        if (!objects)
+            out.set(v.user, (objects = new Map()));
+        let relations = objects.get(v.object);
+        if (!relations)
+            objects.set(v.object, (relations = new Set()));
+        relations.add(v.relation ?? '');
+    }
+    return out;
+}
+/** Lo que alcanza un grupo por un grafo: `objeto → relaciones` (los `#member` de los grupos de `up`). */
+function reach(graph, index, group) {
+    const out = new Map();
+    for (const g of graph.up(group)) {
+        for (const [object, relations] of index.get(g + MEMBER_SUFFIX) ?? []) {
+            let set = out.get(object);
+            if (!set)
+                out.set(object, (set = new Set()));
+            for (const r of relations)
+                set.add(r);
+        }
+    }
+    return out;
+}
+/**
+ * **El orden de una TRANSICIÓN** (cierre 2 de D2 · 🟡 N3): ver el docblock del módulo. `residue` = las membresías de los
+ * ciclos del grafo de precedencias (sin garantía); vacío ⇒ ningún estado intermedio concede fuera de inicial ∪ final.
+ */
+export function relationTransitionOrder(transition, view, options = {}) {
+    const writes = (transition.writes ?? []).map((item) => ({ item, view: view(item) }));
+    const deletes = (transition.deletes ?? []).map((item) => ({ item, view: view(item) }));
+    const renewals = (transition.renewals ?? []).map((item) => ({ item, view: view(item) }));
+    const shortening = new Set(transition.shortening ?? []);
+    const renewedMemberships = renewals.filter((r) => relationOrderClass(r.view) === 'membership');
+    const changing = new Set([...writes, ...deletes, ...renewedMemberships].map((w) => viewKey(w.view)));
+    const everything = new Map();
+    for (const v of [...(transition.context ?? []), ...writes.map((w) => w.view), ...deletes.map((d) => d.view), ...renewals.map((r) => r.view)]) {
+        everything.set(viewKey(v), v);
+    }
+    const edges = [];
+    const keptAllows = [];
+    const denies = [];
+    for (const [key, v] of everything) {
+        const cls = relationOrderClass(v);
+        if (cls === 'deny')
+            denies.push(v);
+        else if (cls === 'membership')
+            edges.push(v);
+        else if (!changing.has(key))
+            keptAllows.push(v);
+    }
+    const renewedAs = (r) => (shortening.has(r.item) ? 'delete' : 'write');
+    const membership = planMemberships([
+        ...writes.filter((w) => relationOrderClass(w.view) === 'membership').map((w) => ({ ...w, emit: 'write' })),
+        ...renewedMemberships.filter((r) => renewedAs(r) === 'write').map((r) => ({ ...r, emit: 'renew' })),
+    ], [
+        ...deletes.filter((d) => relationOrderClass(d.view) === 'membership').map((d) => ({ ...d, emit: 'delete' })),
+        ...renewedMemberships.filter((r) => renewedAs(r) === 'delete').map((r) => ({ ...r, emit: 'renew' })),
+    ], { edges, keptAllows, denies, changing, cuts: options.cuts });
+    const steps = [];
+    // 1. denies nuevos (y los que se rehacen: un deny no caduca, D3) — solo restringen.
+    for (const w of writes)
+        if (w.view.deny)
+            steps.push({ item: w.item, op: 'write' });
+    for (const r of renewals)
+        if (r.view.deny)
+            steps.push({ item: r.item, op: 'renew' });
+    // 2. allows sobrantes sobre objetos que no son `group` — solo restringen; y (cierre 4) las renovaciones de allows que
+    //    ACORTAN: en su caducidad nueva salen.
+    for (const d of deletes)
+        if (relationOrderClass(d.view) === 'allow')
+            steps.push({ item: d.item, op: 'delete' });
+    for (const r of renewals)
+        if (relationOrderClass(r.view) === 'allow' && renewedAs(r) === 'delete')
+            steps.push({ item: r.item, op: 'renew' });
+    // 3. membresías (y, cierre 4, sus renovaciones como la entrada o la salida que son en el horizonte), por el grafo.
+    steps.push(...membership.steps);
+    // 4. allows nuevos y las renovaciones de allows que ALARGAN (en `now` no cambian lo que se concede).
+    for (const w of writes)
+        if (relationOrderClass(w.view) === 'allow')
+            steps.push({ item: w.item, op: 'write' });
+    for (const r of renewals)
+        if (relationOrderClass(r.view) === 'allow' && renewedAs(r) === 'write')
+            steps.push({ item: r.item, op: 'renew' });
+    // 5. denies sobrantes, los ÚLTIMOS.
+    for (const d of deletes)
+        if (d.view.deny)
+            steps.push({ item: d.item, op: 'delete' });
+    return { steps, residue: membership.residue };
+}
+function planMemberships(writes, deletes, context) {
+    if (writes.length + deletes.length === 0)
+        return { steps: [], residue: [] };
+    const union = new MembershipGraph(context.edges);
+    const kept = new MembershipGraph(context.edges.filter((e) => !context.changing.has(viewKey(e))));
+    const allowIndex = bySubject(context.keptAllows);
+    const denyIndex = bySubject(context.denies);
+    const cuts = context.cuts;
+    const deniedBy = new Map();
+    /** Objetos denegados por lo que alcanza `group` en el grafo unión. */
+    const deniedObjects = (group) => {
+        let out = deniedBy.get(group);
+        if (!out)
+            deniedBy.set(group, (out = new Set(reach(union, denyIndex, group).keys())));
+        return out;
+    };
+    /**
+     * Objetos que concede de forma EFECTIVA lo que alcanza `group` (grafo unión, allows de los dos estados), menos los que
+     * corta TODO lo que deniegan, por aristas que NO cambian, los grupos `cutters` (el auto-corte). Sin `cuts`, nada se corta.
+     */
+    const effective = (group, cutters) => {
+        const allowed = reach(union, allowIndex, group);
+        if (!cuts)
+            return new Set(allowed.keys());
+        const keptDenies = new Map();
+        for (const cutter of cutters) {
+            for (const [object, relations] of reach(kept, denyIndex, cutter)) {
+                let set = keptDenies.get(object);
+                if (!set)
+                    keptDenies.set(object, (set = new Set()));
+                for (const r of relations)
+                    set.add(r);
+            }
+        }
+        const out = new Set();
+        for (const [object, relations] of allowed) {
+            const denied = keptDenies.get(object);
+            const type = objectTypeOf(object);
+            const cut = denied !== undefined && [...relations].every((a) => [...denied].some((d) => cuts(type, d, a)));
+            if (!cut)
+                out.add(object);
+        }
+        return out;
+    };
+    const effectiveMemo = new Map();
+    const ops = [];
+    for (const [list, op] of [
+        [writes, 'write'],
+        [deletes, 'delete'],
+    ]) {
+        for (const { item, view, emit } of list) {
+            let allows = effectiveMemo.get(view.object);
+            if (!allows)
+                effectiveMemo.set(view.object, (allows = effective(view.object, [view.object])));
+            ops.push({
+                item,
+                view,
+                op,
+                emit,
+                key: viewKey(view),
+                head: view.object,
+                tail: usersetGroup(view.user),
+                denies: deniedObjects(view.object),
+                allows,
+                depth: union.depth(view.user),
+            });
+        }
+    }
+    const subjectAllows = new Map();
+    /** Los objetos con algún allow (de los dos estados) que alcanza el sujeto, directo o por cualquier grupo (grafo unión). */
+    const allowsOfSubject = (subject) => {
+        let out = subjectAllows.get(subject);
+        if (out)
+            return out;
+        out = new Set([...(allowIndex.get(subject)?.keys() ?? [])]);
+        for (const e of context.edges) {
+            if (e.user !== subject)
+                continue;
+            for (const object of reach(union, allowIndex, e.object).keys())
+                out.add(object);
+        }
+        subjectAllows.set(subject, out);
+        return out;
+    };
+    const intersects = (a, b) => {
+        const [small, large] = a.size <= b.size ? [a, b] : [b, a];
+        for (const x of small)
+            if (large.has(x))
+                return true;
+        return false;
+    };
+    /**
+     * C3: ¿`d` (sale) y `w` (entra) componen un camino NUEVO? Cierre 5 de D2 (D4-2; el oráculo cuenta los objetos `group:`):
+     * el camino compuesto concede SIEMPRE algo —la propia membresía del sujeto en el grupo de arriba (`check(member)`,
+     * `membersOf`)—, así que ya no se exige un allow efectivo al final del camino (hasta el cierre 4 sí, y un corte entre
+     * `+U∈h` y `-h⊂g` hacía a U miembro de g, cosa que ni el inicial ni el final hacían).
+     */
+    const composes = (d, w) => {
+        if (w.tail !== null && union.up(d.head).has(w.tail))
+            return true;
+        if (d.tail !== null && union.up(w.head).has(d.tail))
+            return true;
+        return false;
+    };
+    /** ¿`a` va ANTES que `b`? (C1–C4). */
+    const before = (a, b) => {
+        if (a.op === 'write' && b.op === 'write') {
+            return [...a.denies].some((x) => b.allows.has(x)) && intersects(union.below(a.view.user), union.below(b.view.user));
+        }
+        if (a.op === 'delete' && b.op === 'delete') {
+            return [...a.allows].some((x) => b.denies.has(x)) && intersects(union.below(a.view.user, b.key), union.below(b.view.user));
+        }
+        if (a.op === 'delete')
+            return composes(a, b);
+        // C4, con la exclusión de C2 (cierre 5 de D2): un sujeto que solo alcanza la que sale A TRAVÉS de la que entra (o la
+        // que entra a través de la que sale) no tenía ese deny en el inicial (o no lo tiene en el final): no hay «instante sin
+        // deny» que evitar. Sin la exclusión, C4 chocaba con C3 —que ahora cuenta la membresía como concesión— en ciclos
+        // espurios (`+U∈h`, `-h⊂g` con el deny en g: U nunca estuvo en g).
+        const belowB = union.below(b.view.user, a.key);
+        const common = [...union.below(a.view.user, b.key)].filter((s) => belowB.has(s));
+        if (common.length === 0)
+            return false;
+        return [...a.denies].some((x) => b.denies.has(x) && common.some((s) => allowsOfSubject(s).has(x)));
+    };
+    // Los pares que pueden tener precedencia: los de un MISMO sujeto holder, y los de cada arista anidada con todas las
+    // que tienen un sujeto por debajo de ella o un grupo en su camino.
+    const succ = ops.map(() => []);
+    const link = (i, j) => {
+        if (before(ops[i], ops[j]))
+            succ[i].push(j);
+    };
+    const byHolder = new Map();
+    const nested = [];
+    ops.forEach((o, i) => {
+        if (o.tail !== null)
+            nested.push(i);
+        else {
+            let list = byHolder.get(o.view.user);
+            if (!list)
+                byHolder.set(o.view.user, (list = []));
+            list.push(i);
+        }
+    });
+    for (const list of byHolder.values())
+        for (const i of list)
+            for (const j of list)
+                if (i !== j)
+                    link(i, j);
+    for (const i of nested) {
+        for (let j = 0; j < ops.length; j++) {
+            if (i === j || (ops[j].tail !== null && j < i))
+                continue;
+            link(i, j);
+            link(j, i);
+        }
+    }
+    const order = orderByPrecedence(ops, succ);
+    return {
+        steps: order.order.map((i) => ({ item: ops[i].item, op: ops[i].emit })),
+        residue: order.cyclic.map((i) => ops[i].item),
+    };
+}
+/** Prioridad entre disponibles: escrituras antes que borrados; escrituras de lejos primero, borrados de cerca; (objeto, sujeto). */
+function priority(a, b) {
+    if (a.op !== b.op)
+        return a.op === 'write' ? -1 : 1;
+    if (a.depth !== b.depth)
+        return a.op === 'write' ? b.depth - a.depth : a.depth - b.depth;
+    if (a.view.object !== b.view.object)
+        return a.view.object < b.view.object ? -1 : 1;
+    if (a.view.user !== b.view.user)
+        return a.view.user < b.view.user ? -1 : 1;
+    return 0;
+}
+/**
+ * Orden topológico por componentes fuertemente conexas (Tarjan, iterativo): una componente sale cuando no le queda
+ * ninguna predecesora; entre las disponibles, la de mayor prioridad. Dentro de una componente con CICLO, Kahn sobre sus
+ * aristas internas y, cuando se atasca, la de mayor prioridad (`cyclic` las devuelve todas: el residuo).
+ */
+function orderByPrecedence(ops, succ) {
+    const n = ops.length;
+    const index = new Array(n).fill(-1);
+    const low = new Array(n).fill(0);
+    const onStack = new Array(n).fill(false);
+    const component = new Array(n).fill(-1);
+    const stack = [];
+    const members = [];
+    let counter = 0;
+    for (let root = 0; root < n; root++) {
+        if (index[root] !== -1)
+            continue;
+        const work = [{ v: root, next: 0 }];
+        index[root] = low[root] = counter++;
+        stack.push(root);
+        onStack[root] = true;
+        while (work.length > 0) {
+            const frame = work[work.length - 1];
+            const edges = succ[frame.v];
+            if (frame.next < edges.length) {
+                const w = edges[frame.next++];
+                if (index[w] === -1) {
+                    index[w] = low[w] = counter++;
+                    stack.push(w);
+                    onStack[w] = true;
+                    work.push({ v: w, next: 0 });
+                }
+                else if (onStack[w])
+                    low[frame.v] = Math.min(low[frame.v], index[w]);
+                continue;
+            }
+            work.pop();
+            if (work.length > 0)
+                low[work[work.length - 1].v] = Math.min(low[work[work.length - 1].v], low[frame.v]);
+            if (low[frame.v] === index[frame.v]) {
+                const list = [];
+                let w;
+                do {
+                    w = stack.pop();
+                    onStack[w] = false;
+                    component[w] = members.length;
+                    list.push(w);
+                } while (w !== frame.v);
+                members.push(list);
+            }
+        }
+    }
+    const pending = new Array(members.length).fill(0);
+    for (let v = 0; v < n; v++)
+        for (const w of succ[v])
+            if (component[v] !== component[w])
+                pending[component[w]]++;
+    const best = members.map((list) => list.reduce((a, b) => (priority(ops[a], ops[b]) <= 0 ? a : b)));
+    const ready = members.map((_, c) => c).filter((c) => pending[c] === 0);
+    const order = [];
+    const cyclic = [];
+    while (ready.length > 0) {
+        let pick = 0;
+        for (let k = 1; k < ready.length; k++)
+            if (priority(ops[best[ready[k]]], ops[best[ready[pick]]]) < 0)
+                pick = k;
+        const c = ready.splice(pick, 1)[0];
+        const list = members[c];
+        if (list.length === 1)
+            order.push(list[0]);
+        else {
+            cyclic.push(...list);
+            const inside = new Set(list);
+            const done = new Set();
+            const preds = new Map(list.map((v) => [v, 0]));
+            for (const v of list)
+                for (const w of succ[v])
+                    if (inside.has(w))
+                        preds.set(w, preds.get(w) + 1);
+            while (done.size < list.length) {
+                const left = list.filter((v) => !done.has(v));
+                const free = left.filter((v) => preds.get(v) === 0);
+                const pool = free.length > 0 ? free : left;
+                const v = pool.reduce((a, b) => (priority(ops[a], ops[b]) <= 0 ? a : b));
+                done.add(v);
+                order.push(v);
+                for (const w of succ[v])
+                    if (inside.has(w) && !done.has(w))
+                        preds.set(w, preds.get(w) - 1);
+            }
+        }
+        for (const v of list)
+            for (const w of succ[v])
+                if (component[w] !== c && --pending[component[w]] === 0)
+                    ready.push(component[w]);
+    }
+    return { order, cyclic };
+}
+/**
+ * **El orden de ESCRITURA** de un conjunto que solo ENTRA (atajo de `relationTransitionOrder` sin borrados): `context` =
+ * las tuplas que existen y no se escriben.
+ */
+export function relationWriteOrder(items, view, context = []) {
+    return relationTransitionOrder({ writes: items, context }, view).steps.map((s) => s.item);
+}
+/** **El orden de BORRADO** de un conjunto que solo SALE (las purgas de `openfga`): allows → membresías → denies. */
+export function relationDeleteOrder(items, view, context = []) {
+    return relationTransitionOrder({ deletes: items, context }, view).steps.map((s) => s.item);
+}
+/*
+ * Cierre 5 de D2 (decisión del dueño §2026-10-16 (10), opción A): aquí vivía `relationWithheldWrites` (cierre 4), la
+ * RETENCIÓN de lo que un deny que no viaja (`renewal-unsafe`, `deny-conditional`) dejaría conceder. Se fue entera: en vez
+ * de retener tupla a tupla —con su cascada, su conflicto global `carrier-conflict` y el hueco D4-1 que el auditor midió—,
+ * la PARTICIÓN afectada recibe CERO escrituras y cero borrados (`src/relations/reconcile.ts`, `planPartition` ⇒
+ * `refusal`), y el resto migra. Una partición negada queda exactamente como estaba, que es lo único que se puede
+ * certificar sin una escritura atómica de la renovación (openfga/openfga#2151).
+ */
+//# sourceMappingURL=tuple_order.js.map

package/build/src/relations/tuple_order.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tuple_order.js","sourceRoot":"","sources":["../../../src/relations/tuple_order.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqDG;AAoDH,mEAAmE;AACnE,MAAM,YAAY,GAAG,QAAQ,CAAA;AAC7B,MAAM,aAAa,GAAG,SAAS,CAAA;AAE/B,MAAM,UAAU,kBAAkB,CAAC,IAAuB;IACxD,IAAI,IAAI,CAAC,IAAI;QAAE,OAAO,MAAM,CAAA;IAC5B,OAAO,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAA;AACtE,CAAC;AAED,0EAA0E;AAC1E,SAAS,YAAY,CAAC,IAAY;IAChC,OAAO,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;AACpH,CAAC;AAED,SAAS,OAAO,CAAC,CAAoB;IACnC,OAAO,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,MAAM,SAAS,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAA;AACzF,CAAC;AAED,SAAS,YAAY,CAAC,MAAc;IAClC,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAA;IACjC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;AACpD,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAkC;IAClE,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAA;IACtB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAA;IAClC,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;QACpB,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAA;QAClD,IAAI,KAAK,KAAK,IAAI;YAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IACzC,CAAC;IACD,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,KAAK,YAAY,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAA;IACzG,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,IAAI,GAAI,CAAC;QAC7B,IAAI,GAAG,KAAK,CAAA;QACZ,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAE,CAAA;YACnC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACnD,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;gBACnB,IAAI,GAAG,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,KAAkC,EAAE,KAAa;IAC7E,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAA;IACtB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;IAC9B,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,KAAK,YAAY,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAA;IACzG,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,IAAI,GAAI,CAAC;QAC7B,IAAI,GAAG,KAAK,CAAA;QACZ,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC7D,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;gBACnB,IAAI,GAAG,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;AAC3E,CAAC;AAED,8GAA8G;AAC9G,MAAM,eAAe;IACV,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAA;IACzC,KAAK,GAAG,IAAI,GAAG,EAA+B,CAAA;IAC9C,YAAY,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC7C,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAA;IACpC,MAAM,GAAG,IAAI,GAAG,EAAuB,CAAA;IACvC,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAA;IAE5C,YAAY,KAAkC;QAC5C,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,IAAI,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;YACnC,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;YAChD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACZ,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;YAClC,IAAI,KAAK,KAAK,IAAI;gBAAE,SAAQ;YAC5B,IAAI,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YACtC,IAAI,CAAC,OAAO;gBAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;YAC7D,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;YACrB,IAAI,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;YAC9C,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;YACtE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACrB,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,EAAE,CAAC,KAAa;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAC9B,IAAI,IAAI;YAAE,OAAO,IAAI,CAAA;QACrB,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;QACvB,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAA;QACrB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC3D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;oBACtB,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;oBAChB,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;QACzB,OAAO,IAAI,CAAA;IACb,CAAC;IAED,2HAA2H;IAC3H,KAAK,CAAC,IAAY,EAAE,OAAgB;QAClC,IAAI,YAAY,CAAC,IAAI,CAAC,KAAK,IAAI;YAAE,OAAO,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QACvD,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAClC,IAAI,IAAI;gBAAE,OAAO,IAAI,CAAA;QACvB,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAA;QAC3B,MAAM,KAAK,GAAG,CAAC,IAAI,CAAC,CAAA;QACpB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,CAAC,GAAG,EAAG,CAAC,CAAA;YACxC,IAAI,KAAK,KAAK,IAAI;gBAAE,SAAQ;YAC5B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC5C,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,OAAO;oBAAE,SAAQ;gBAC7D,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;oBACrB,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;oBACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,OAAO,KAAK,SAAS;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACrD,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,2GAA2G;IAC3G,KAAK,CAAC,IAAY;QAChB,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAA;QAChC,OAAO,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;IACjE,CAAC;IAED,YAAY,CAAC,KAAa,EAAE,IAAiB;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACpC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,IAAI,CAAA;QACnC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,OAAO,CAAC,CAAA;QAC7B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACf,IAAI,MAAM,GAAG,CAAC,CAAA;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE;YAAE,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAA;QACrH,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QAClB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAA;QAC/B,OAAO,MAAM,CAAA;IACf,CAAC;CACF;AAED,qFAAqF;AACrF,SAAS,SAAS,CAAC,KAAkC;IACnD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoC,CAAA;IACvD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAI,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QAC7B,IAAI,CAAC,OAAO;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,OAAO,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;QACpD,IAAI,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAA;QACrC,IAAI,CAAC,SAAS;YAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;QAC9D,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAA;IACjC,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,yGAAyG;AACzG,SAAS,KAAK,CAAC,KAAsB,EAAE,KAA4C,EAAE,KAAa;IAChG,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC1C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;QAChC,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,aAAa,CAAC,IAAI,EAAE,EAAE,CAAC;YACrE,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YACzB,IAAI,CAAC,GAAG;gBAAE,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;YAC5C,KAAK,MAAM,CAAC,IAAI,SAAS;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACvC,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAkBD;;;GAGG;AACH,MAAM,UAAU,uBAAuB,CACrC,UAAiC,EACjC,IAAoC,EACpC,UAAmC,EAAE;IAErC,MAAM,MAAM,GAAG,CAAC,UAAU,CAAC,MAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;IACpF,MAAM,OAAO,GAAG,CAAC,UAAU,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;IACtF,MAAM,QAAQ,GAAG,CAAC,UAAU,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;IACxF,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,UAAU,IAAI,EAAE,CAAC,CAAA;IACvD,MAAM,kBAAkB,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,YAAY,CAAC,CAAA;IAC9F,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,EAAE,GAAG,OAAO,EAAE,GAAG,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACpG,MAAM,UAAU,GAAG,IAAI,GAAG,EAA6B,CAAA;IACvD,KAAK,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,OAAO,IAAI,EAAE,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;QAC7I,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IAC/B,CAAC;IACD,MAAM,KAAK,GAAwB,EAAE,CAAA;IACrC,MAAM,UAAU,GAAwB,EAAE,CAAA;IAC1C,MAAM,MAAM,GAAwB,EAAE,CAAA;IACtC,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,UAAU,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAA;QACjC,IAAI,GAAG,KAAK,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;aAC7B,IAAI,GAAG,KAAK,YAAY;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;aACvC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACjD,CAAC;IACD,MAAM,SAAS,GAAG,CAAC,CAAc,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAuB,CAAA;IACzG,MAAM,UAAU,GAAG,eAAe,CAChC;QACE,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,OAAgB,EAAE,CAAC,CAAC;QACnH,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,OAAgB,EAAE,CAAC,CAAC;KAC7G,EACD;QACE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,QAAiB,EAAE,CAAC,CAAC;QACrH,GAAG,kBAAkB,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,OAAgB,EAAE,CAAC,CAAC;KAC9G,EACD,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,CAAC,IAAI,EAAE,CAC5D,CAAA;IACD,MAAM,KAAK,GAA2B,EAAE,CAAA;IACxC,oFAAoF;IACpF,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAA;IAClF,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAA;IACpF,sHAAsH;IACtH,2CAA2C;IAC3C,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,IAAI,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAA;IAC/G,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,IAAI,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,QAAQ;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAA;IAC5I,mHAAmH;IACnH,KAAK,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAA;IAC/B,qGAAqG;IACrG,KAAK,MAAM,CAAC,IAAI,MAAM;QAAE,IAAI,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAA;IAC7G,KAAK,MAAM,CAAC,IAAI,QAAQ;QAAE,IAAI,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,OAAO,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,OAAO;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAA;IAC3I,oCAAoC;IACpC,KAAK,MAAM,CAAC,IAAI,OAAO;QAAE,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,CAAC,CAAA;IACpF,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,UAAU,CAAC,OAAO,EAAE,CAAA;AAC/C,CAAC;AAED,SAAS,eAAe,CACtB,MAA4E,EAC5E,OAA8E,EAC9E,OAAiJ;IAEjJ,IAAI,MAAM,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAA;IAC3E,MAAM,KAAK,GAAG,IAAI,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAChD,MAAM,IAAI,GAAG,IAAI,eAAe,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAChG,MAAM,UAAU,GAAG,SAAS,CAAC,OAAO,CAAC,UAAU,CAAC,CAAA;IAChD,MAAM,SAAS,GAAG,SAAS,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;IAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAA;IACzB,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC/C,sEAAsE;IACtE,MAAM,aAAa,GAAG,CAAC,KAAa,EAAe,EAAE;QACnD,IAAI,GAAG,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAC7B,IAAI,CAAC,GAAG;YAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;QACrF,OAAO,GAAG,CAAA;IACZ,CAAC,CAAA;IACD;;;OAGG;IACH,MAAM,SAAS,GAAG,CAAC,KAAa,EAAE,OAAiB,EAAe,EAAE;QAClE,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,CAAC,CAAA;QAC/C,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAA;QACzC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAA;QACjD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,SAAS,EAAE,MAAM,CAAC,EAAE,CAAC;gBACjE,IAAI,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;gBAChC,IAAI,CAAC,GAAG;oBAAE,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;gBACnD,KAAK,MAAM,CAAC,IAAI,SAAS;oBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACvC,CAAC;QACH,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;QAC7B,KAAK,MAAM,CAAC,MAAM,EAAE,SAAS,CAAC,IAAI,OAAO,EAAE,CAAC;YAC1C,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YACrC,MAAM,IAAI,GAAG,YAAY,CAAC,MAAM,CAAC,CAAA;YACjC,MAAM,GAAG,GAAG,MAAM,KAAK,SAAS,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAC1G,IAAI,CAAC,GAAG;gBAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAC3B,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC,CAAA;IACD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAA;IACpD,MAAM,GAAG,GAAsB,EAAE,CAAA;IACjC,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI;QACvB,CAAC,MAAM,EAAE,OAAO,CAAC;QACjB,CAAC,OAAO,EAAE,QAAQ,CAAC;KACX,EAAE,CAAC;QACX,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;YACxC,IAAI,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAC3C,IAAI,CAAC,MAAM;gBAAE,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;YAC7F,GAAG,CAAC,IAAI,CAAC;gBACP,IAAI;gBACJ,IAAI;gBACJ,EAAE;gBACF,IAAI;gBACJ,GAAG,EAAE,OAAO,CAAC,IAAI,CAAC;gBAClB,IAAI,EAAE,IAAI,CAAC,MAAM;gBACjB,IAAI,EAAE,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;gBAC7B,MAAM,EAAE,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC;gBAClC,MAAM;gBACN,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC;aAC9B,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IACD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAuB,CAAA;IACpD,2HAA2H;IAC3H,MAAM,eAAe,GAAG,CAAC,OAAe,EAAe,EAAE;QACvD,IAAI,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACpC,IAAI,GAAG;YAAE,OAAO,GAAG,CAAA;QACnB,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;QAC3D,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO;gBAAE,SAAQ;YAChC,KAAK,MAAM,MAAM,IAAI,KAAK,CAAC,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE;gBAAE,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QACjF,CAAC;QACD,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;QAC/B,OAAO,GAAG,CAAA;IACZ,CAAC,CAAA;IACD,MAAM,UAAU,GAAG,CAAC,CAAc,EAAE,CAAc,EAAW,EAAE;QAC7D,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACzD,KAAK,MAAM,CAAC,IAAI,KAAK;YAAE,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAA;QACpD,OAAO,KAAK,CAAA;IACd,CAAC,CAAA;IACD;;;;;OAKG;IACH,MAAM,QAAQ,GAAG,CAAC,CAAkB,EAAE,CAAkB,EAAW,EAAE;QACnE,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAA;QAChE,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAA;QAChE,OAAO,KAAK,CAAA;IACd,CAAC,CAAA;IACD,sCAAsC;IACtC,MAAM,MAAM,GAAG,CAAC,CAAkB,EAAE,CAAkB,EAAW,EAAE;QACjE,IAAI,CAAC,CAAC,EAAE,KAAK,OAAO,IAAI,CAAC,CAAC,EAAE,KAAK,OAAO,EAAE,CAAC;YACzC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;QACrH,CAAC;QACD,IAAI,CAAC,CAAC,EAAE,KAAK,QAAQ,IAAI,CAAC,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;YAC3C,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;QAC5H,CAAC;QACD,IAAI,CAAC,CAAC,EAAE,KAAK,QAAQ;YAAE,OAAO,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QAC5C,qHAAqH;QACrH,uHAAuH;QACvH,iHAAiH;QACjH,mEAAmE;QACnE,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAA;QAC9C,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QAChF,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAA;QACrC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACpG,CAAC,CAAA;IACD,oHAAoH;IACpH,mEAAmE;IACnE,MAAM,IAAI,GAAe,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAA;IAC1C,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE;QACpC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IAC7C,CAAC,CAAA;IACD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC5C,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACnB,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;aAC9B,CAAC;YACJ,IAAI,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACpC,IAAI,CAAC,IAAI;gBAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC,CAAA;YACjD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACd,CAAC;IACH,CAAC,CAAC,CAAA;IACF,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,MAAM,EAAE;QAAE,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,IAAI,CAAC,KAAK,CAAC;oBAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;IACzG,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC;gBAAE,SAAQ;YACxD,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACV,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACZ,CAAC;IACH,CAAC;IACD,MAAM,KAAK,GAAG,iBAAiB,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;IAC1C,OAAO;QACL,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACvE,OAAO,EAAE,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;KAC9C,CAAA;AACH,CAAC;AAED,oIAAoI;AACpI,SAAS,QAAQ,CAAI,CAAkB,EAAE,CAAkB;IACzD,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACnD,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK;QAAE,OAAO,CAAC,CAAC,EAAE,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAA;IACxF,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM;QAAE,OAAO,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAClF,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAC1E,OAAO,CAAC,CAAA;AACV,CAAC;AAED;;;;GAIG;AACH,SAAS,iBAAiB,CAAI,GAAsB,EAAE,IAAgB;IACpE,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAA;IACpB,MAAM,KAAK,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAC3C,MAAM,GAAG,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACxC,MAAM,OAAO,GAAG,IAAI,KAAK,CAAU,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;IACjD,MAAM,SAAS,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;IAC/C,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,MAAM,OAAO,GAAe,EAAE,CAAA;IAC9B,IAAI,OAAO,GAAG,CAAC,CAAA;IACf,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAAE,SAAQ;QAChC,MAAM,IAAI,GAAuC,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;QACvE,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,EAAE,CAAA;QACnC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAChB,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAA;QACpB,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAA;YAC3B,IAAI,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;gBAC7B,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;oBACpB,KAAK,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,OAAO,EAAE,CAAA;oBAC7B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;oBACb,OAAO,CAAC,CAAC,CAAC,GAAG,IAAI,CAAA;oBACjB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAA;gBAC9B,CAAC;qBAAM,IAAI,OAAO,CAAC,CAAC,CAAC;oBAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;gBACtE,SAAQ;YACV,CAAC;YACD,IAAI,CAAC,GAAG,EAAE,CAAA;YACV,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAA;YACxG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpC,MAAM,IAAI,GAAa,EAAE,CAAA;gBACzB,IAAI,CAAS,CAAA;gBACb,GAAG,CAAC;oBACF,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAA;oBAChB,OAAO,CAAC,CAAC,CAAC,GAAG,KAAK,CAAA;oBAClB,SAAS,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAA;oBAC7B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACd,CAAC,QAAQ,CAAC,KAAK,KAAK,CAAC,CAAC,EAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,OAAO,GAAG,IAAI,KAAK,CAAS,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YAAE,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC;gBAAE,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IAC/G,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IAClG,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;IACtE,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,MAAM,MAAM,GAAa,EAAE,CAAA;IAC3B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,IAAI,IAAI,GAAG,CAAC,CAAA;QACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;gBAAE,IAAI,GAAG,CAAC,CAAA;QAC9G,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAClC,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAA;QACvB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAA;aACrC,CAAC;YACJ,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;YACpB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,CAAA;YAC5B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAA;YAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;YAC9C,KAAK,MAAM,CAAC,IAAI,IAAI;gBAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;oBAAE,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAA;YACjG,OAAO,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAA;gBACnD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAA;gBAC1C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;gBACxE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACX,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACb,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;oBAAE,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;wBAAE,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,CAAC,CAAC,CAAA;YAC7F,CAAC;QACH,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,IAAI;YAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;gBAAE,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAA;IAClI,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,CAAA;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAI,KAAmB,EAAE,IAAoC,EAAE,UAAwC,EAAE;IACzI,OAAO,uBAAuB,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;AAC3F,CAAC;AAED,oHAAoH;AACpH,MAAM,UAAU,mBAAmB,CAAI,KAAmB,EAAE,IAAoC,EAAE,UAAwC,EAAE;IAC1I,OAAO,uBAAuB,CAAC,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;AAC5F,CAAC;AAED;;;;;;;GAOG"}

package/build/src/shared/backend_guard.d.ts

@@ -51,6 +51,14 @@ export declare function isUniqueViolation(error: unknown): boolean;
  * crudo del motor ni un 503 disfrazado de indeterminado.
  */
 export declare function isDeadlock(error: unknown): boolean;
+/**
+ * **¿Es el 400 del tope de operaciones por `Write` del servidor OpenFGA?** MEDIDO en v1.19.0 (cierre 2 de D1 · ⚪ N3):
+ * el SDK lanza `FgaApiValidationError` con `statusCode` 400 y `apiErrorCode` `exceeded_entity_limit` («The number of
+ * write operations exceeds the allowed limit of N»). Se mira el error y su `cause` directa (los dos drivers lo envuelven
+ * en un `AuthorizationBackendError`). PUNTO DE PASO ÚNICO de los dos puertos (lote D · D2, el gemelo de roles de N3):
+ * un despliegue con `--max-tuples-per-write` < 100 no es transitorio y no puede salir como 503.
+ */
+export declare function isServerWriteLimit(error: unknown): boolean;
 /**
  * ¿El error viene de un deadline vencido? knex lanza `KnexTimeoutError` (o, si
  * además falló la cancelación, el error de cancelación con `timeout` puesto);