@nexus_js/graphql 0.9.3

package/dist/complexity.d.ts

@@ -0,0 +1,75 @@
+/**
+ * Nexus GraphQL Complexity Shield
+ *
+ * Analyses the parsed GraphQL AST *before* execution to prevent:
+ *
+ *  1. Deep-nesting attacks  — a query like user { friends { friends { … } } }
+ *     that reaches N levels can cause O(N) database round-trips.
+ *
+ *  2. Breadth/cost attacks — selecting 50 high-cost fields at once.
+ *
+ *  3. Introspection leaks  — schema exposure in production.
+ *
+ * Algorithm
+ * ─────────
+ *  For every FieldNode we add its `fieldCost` to the running total.
+ *  If the field resolves to a list type we multiply children by `listMultiplier`
+ *  (default 10) to model the N×M fan-out.
+ *  Inline fragments and fragment spreads are expanded transparently.
+ *  The visitor is purely synchronous (no I/O).
+ *
+ * Usage
+ * ─────
+ *  import { analyseComplexity } from '@nexus_js/graphql';
+ *
+ *  const { cost, depth, errors } = analyseComplexity(document, schema, {
+ *    maxCost:  1000,
+ *    maxDepth: 10,
+ *    fieldCosts: { 'Query.analytics': 50, 'User.posts': 5 },
+ *  });
+ *  if (errors.length) return respondWithErrors(errors);
+ */
+import type { DocumentNode, GraphQLSchema } from 'graphql';
+export interface ComplexityConfig {
+    /** Hard limit on total query cost. Default: 1000. */
+    maxCost?: number;
+    /** Hard limit on selection-set nesting depth. Default: 12. */
+    maxDepth?: number;
+    /**
+     * Base cost multiplier for list fields (models N-row fan-out).
+     * Default: 10. Set to 1 to disable.
+     */
+    listMultiplier?: number;
+    /**
+     * Per-field cost overrides. Key: "TypeName.fieldName" (e.g. "Query.analytics").
+     * Default cost per field is 1.
+     */
+    fieldCosts?: Record<string, number>;
+    /**
+     * Allow introspection queries (__schema, __type, __typename).
+     * Default: true (disable in production with false).
+     */
+    allowIntrospection?: boolean;
+    /**
+     * Per-operation-type limits override maxCost for mutations (which are often
+     * more expensive than queries). Set to a lower number to tighten mutations.
+     */
+    mutationCostMultiplier?: number;
+}
+export interface ComplexityResult {
+    cost: number;
+    depth: number;
+    /** Non-empty if any limit was exceeded. Pass these to GraphQL `errors` array. */
+    errors: Array<{
+        message: string;
+        extensions: {
+            code: string;
+        };
+    }>;
+}
+/**
+ * Analyse a parsed GraphQL document against a schema.
+ * Returns cost + depth + validation errors without executing anything.
+ */
+export declare function analyseComplexity(document: DocumentNode, schema: GraphQLSchema, config?: ComplexityConfig): ComplexityResult;
+//# sourceMappingURL=complexity.d.ts.map

package/dist/complexity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexity.d.ts","sourceRoot":"","sources":["../src/complexity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,OAAO,KAAK,EACV,YAAY,EAKZ,aAAa,EAGd,MAAM,SAAS,CAAC;AAIjB,MAAM,WAAW,gBAAgB;IAC/B,qDAAqD;IACrD,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,8DAA8D;IAC9D,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB;;;OAGG;IACH,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACpC;;;OAGG;IACH,kBAAkB,CAAC,EAAE,OAAO,CAAC;IAC7B;;;OAGG;IACH,sBAAsB,CAAC,EAAE,MAAM,CAAC;CACjC;AAED,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,iFAAiF;IACjF,MAAM,EAAE,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,UAAU,EAAE;YAAE,IAAI,EAAE,MAAM,CAAA;SAAE,CAAA;KAAE,CAAC,CAAC;CAClE;AAQD;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,QAAQ,EAAE,YAAY,EACtB,MAAM,EAAE,aAAa,EACrB,MAAM,GAAE,gBAAqB,GAC5B,gBAAgB,CA8DlB"}

package/dist/complexity.js

@@ -0,0 +1,182 @@
+/**
+ * Nexus GraphQL Complexity Shield
+ *
+ * Analyses the parsed GraphQL AST *before* execution to prevent:
+ *
+ *  1. Deep-nesting attacks  — a query like user { friends { friends { … } } }
+ *     that reaches N levels can cause O(N) database round-trips.
+ *
+ *  2. Breadth/cost attacks — selecting 50 high-cost fields at once.
+ *
+ *  3. Introspection leaks  — schema exposure in production.
+ *
+ * Algorithm
+ * ─────────
+ *  For every FieldNode we add its `fieldCost` to the running total.
+ *  If the field resolves to a list type we multiply children by `listMultiplier`
+ *  (default 10) to model the N×M fan-out.
+ *  Inline fragments and fragment spreads are expanded transparently.
+ *  The visitor is purely synchronous (no I/O).
+ *
+ * Usage
+ * ─────
+ *  import { analyseComplexity } from '@nexus_js/graphql';
+ *
+ *  const { cost, depth, errors } = analyseComplexity(document, schema, {
+ *    maxCost:  1000,
+ *    maxDepth: 10,
+ *    fieldCosts: { 'Query.analytics': 50, 'User.posts': 5 },
+ *  });
+ *  if (errors.length) return respondWithErrors(errors);
+ */
+// ── Introspection field names ────────────────────────────────────────────────
+const INTROSPECTION_FIELDS = new Set(['__schema', '__type', '__typename', '__typeName']);
+// ── Core visitor ────────────────────────────────────────────────────────────
+/**
+ * Analyse a parsed GraphQL document against a schema.
+ * Returns cost + depth + validation errors without executing anything.
+ */
+export function analyseComplexity(document, schema, config = {}) {
+    const { maxCost = 1000, maxDepth = 12, listMultiplier = 10, fieldCosts = {}, allowIntrospection = true, mutationCostMultiplier = 1, } = config;
+    const errors = [];
+    // Build named-fragment map for inline expansion
+    const fragments = new Map();
+    for (const def of document.definitions) {
+        if (def.kind === 'FragmentDefinition') {
+            fragments.set(def.name.value, def.selectionSet);
+        }
+    }
+    let globalMaxDepth = 0;
+    let totalCost = 0;
+    for (const def of document.definitions) {
+        if (def.kind !== 'OperationDefinition')
+            continue;
+        const isMutation = def.operation === 'mutation';
+        const costMul = isMutation ? mutationCostMultiplier : 1;
+        const rootType = getOperationRootType(schema, def.operation);
+        if (!rootType)
+            continue;
+        const { cost, depth } = visitSelectionSet(def.selectionSet, rootType, schema, fragments, fieldCosts, listMultiplier, 0, allowIntrospection, errors);
+        totalCost += cost * costMul;
+        if (depth > globalMaxDepth)
+            globalMaxDepth = depth;
+    }
+    if (totalCost > maxCost) {
+        errors.push({
+            message: `Query complexity ${totalCost} exceeds maximum allowed cost of ${maxCost}.`,
+            extensions: { code: 'COMPLEXITY_LIMIT_EXCEEDED' },
+        });
+    }
+    if (globalMaxDepth > maxDepth) {
+        errors.push({
+            message: `Query depth ${globalMaxDepth} exceeds maximum allowed depth of ${maxDepth}.`,
+            extensions: { code: 'DEPTH_LIMIT_EXCEEDED' },
+        });
+    }
+    return { cost: totalCost, depth: globalMaxDepth, errors };
+}
+function visitSelectionSet(selectionSet, parentType, schema, fragments, fieldCosts, listMultiplier, currentDepth, allowIntrospection, errors) {
+    let cost = 0;
+    let depth = currentDepth;
+    for (const selection of selectionSet.selections) {
+        if (selection.kind === 'Field') {
+            const result = visitField(selection, parentType, schema, fragments, fieldCosts, listMultiplier, currentDepth, allowIntrospection, errors);
+            cost += result.cost;
+            if (result.depth > depth)
+                depth = result.depth;
+        }
+        else if (selection.kind === 'InlineFragment') {
+            const fragmentType = selection.typeCondition
+                ? schema.getType(selection.typeCondition.name.value)
+                : parentType;
+            if (fragmentType && 'getFields' in fragmentType) {
+                const result = visitSelectionSet(selection.selectionSet, fragmentType, schema, fragments, fieldCosts, listMultiplier, currentDepth, allowIntrospection, errors);
+                cost += result.cost;
+                if (result.depth > depth)
+                    depth = result.depth;
+            }
+        }
+        else if (selection.kind === 'FragmentSpread') {
+            const frag = fragments.get(selection.name.value);
+            if (frag) {
+                const result = visitSelectionSet(frag, parentType, schema, fragments, fieldCosts, listMultiplier, currentDepth, allowIntrospection, errors);
+                cost += result.cost;
+                if (result.depth > depth)
+                    depth = result.depth;
+            }
+        }
+    }
+    return { cost, depth };
+}
+function visitField(field, parentType, schema, fragments, fieldCosts, listMultiplier, currentDepth, allowIntrospection, errors) {
+    const fieldName = field.name.value;
+    // Introspection gate
+    if (INTROSPECTION_FIELDS.has(fieldName)) {
+        if (!allowIntrospection) {
+            errors.push({
+                message: `Introspection is disabled in this environment.`,
+                extensions: { code: 'INTROSPECTION_DISABLED' },
+            });
+        }
+        return { cost: 0, depth: currentDepth };
+    }
+    const typeName = parentType.name;
+    const costKey = `${typeName}.${fieldName}`;
+    const fieldCost = fieldCosts[costKey] ?? fieldCosts[fieldName] ?? 1;
+    const thisDepth = currentDepth + 1;
+    let cost = fieldCost;
+    let depth = thisDepth;
+    if (field.selectionSet) {
+        // Resolve the field's return type to determine multiplier
+        const fieldDef = parentType.getFields()[fieldName];
+        const isList = fieldDef ? typeIsList(fieldDef.type) : false;
+        const mul = isList ? listMultiplier : 1;
+        const childType = fieldDef
+            ? namedObjectType(fieldDef.type, schema)
+            : null;
+        if (childType) {
+            const childResult = visitSelectionSet(field.selectionSet, childType, schema, fragments, fieldCosts, listMultiplier, thisDepth, allowIntrospection, errors);
+            cost += childResult.cost * mul;
+            if (childResult.depth > depth)
+                depth = childResult.depth;
+        }
+    }
+    return { cost, depth };
+}
+// ── Schema helpers ───────────────────────────────────────────────────────────
+function getOperationRootType(schema, operation) {
+    switch (operation) {
+        case 'query': return schema.getQueryType() ?? undefined;
+        case 'mutation': return schema.getMutationType() ?? undefined;
+        case 'subscription': return schema.getSubscriptionType() ?? undefined;
+        default: return undefined;
+    }
+}
+/** Recursively unwrap NonNull/List wrappers to check if a list is present. */
+function typeIsList(type) {
+    if ('ofType' in type && type.ofType != null) {
+        if (type.kind === 'LIST')
+            return true;
+        return typeIsList(type.ofType);
+    }
+    return false;
+}
+/**
+ * Unwrap NonNull / List wrappers to reach the named ObjectType (if any).
+ * Returns null for scalars, enums, unions, interfaces.
+ */
+function namedObjectType(type, schema) {
+    // Unwrap wrappers
+    let t = type;
+    while ('ofType' in t && t.ofType != null) {
+        t = t.ofType;
+    }
+    // Named type lookup
+    if ('name' in t) {
+        const named = schema.getType(t.name);
+        if (named && 'getFields' in named)
+            return named;
+    }
+    return null;
+}
+//# sourceMappingURL=complexity.js.map

package/dist/complexity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexity.js","sourceRoot":"","sources":["../src/complexity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAiDH,gFAAgF;AAEhF,MAAM,oBAAoB,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,EAAE,QAAQ,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,CAAC;AAEzF,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAC/B,QAAsB,EACtB,MAAqB,EACrB,SAA2B,EAAE;IAE7B,MAAM,EACJ,OAAO,GAAW,IAAI,EACtB,QAAQ,GAAU,EAAE,EACpB,cAAc,GAAI,EAAE,EACpB,UAAU,GAAQ,EAAE,EACpB,kBAAkB,GAAG,IAAI,EACzB,sBAAsB,GAAG,CAAC,GAC3B,GAAG,MAAM,CAAC;IAEX,MAAM,MAAM,GAA+B,EAAE,CAAC;IAE9C,gDAAgD;IAChD,MAAM,SAAS,GAAG,IAAI,GAAG,EAA4B,CAAC;IACtD,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC;QACvC,IAAI,GAAG,CAAC,IAAI,KAAK,oBAAoB,EAAE,CAAC;YACtC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,MAAM,GAAG,IAAI,QAAQ,CAAC,WAAW,EAAE,CAAC;QACvC,IAAI,GAAG,CAAC,IAAI,KAAK,qBAAqB;YAAE,SAAS;QAEjD,MAAM,UAAU,GAAG,GAAG,CAAC,SAAS,KAAK,UAAU,CAAC;QAChD,MAAM,OAAO,GAAG,UAAU,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC,CAAC;QACxD,MAAM,QAAQ,GAAG,oBAAoB,CAAC,MAAM,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QAC7D,IAAI,CAAC,QAAQ;YAAE,SAAS;QAExB,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,iBAAiB,CACvC,GAAG,CAAC,YAAY,EAChB,QAAQ,EACR,MAAM,EACN,SAAS,EACT,UAAU,EACV,cAAc,EACd,CAAC,EACD,kBAAkB,EAClB,MAAM,CACP,CAAC;QAEF,SAAS,IAAI,IAAI,GAAG,OAAO,CAAC;QAC5B,IAAI,KAAK,GAAG,cAAc;YAAE,cAAc,GAAG,KAAK,CAAC;IACrD,CAAC;IAED,IAAI,SAAS,GAAG,OAAO,EAAE,CAAC;QACxB,MAAM,CAAC,IAAI,CAAC;YACV,OAAO,EAAE,oBAAoB,SAAS,oCAAoC,OAAO,GAAG;YACpF,UAAU,EAAE,EAAE,IAAI,EAAE,2BAA2B,EAAE;SAClD,CAAC,CAAC;IACL,CAAC;IAED,IAAI,cAAc,GAAG,QAAQ,EAAE,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC;YACV,OAAO,EAAE,eAAe,cAAc,qCAAqC,QAAQ,GAAG;YACtF,UAAU,EAAE,EAAE,IAAI,EAAE,sBAAsB,EAAE;SAC7C,CAAC,CAAC;IACL,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,CAAC;AAC5D,CAAC;AAMD,SAAS,iBAAiB,CACxB,YAA8B,EAC9B,UAA6B,EAC7B,MAAqB,EACrB,SAAwC,EACxC,UAAkC,EAClC,cAAsB,EACtB,YAAoB,EACpB,kBAA2B,EAC3B,MAAkC;IAElC,IAAI,IAAI,GAAI,CAAC,CAAC;IACd,IAAI,KAAK,GAAG,YAAY,CAAC;IAEzB,KAAK,MAAM,SAAS,IAAI,YAAY,CAAC,UAAU,EAAE,CAAC;QAChD,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC/B,MAAM,MAAM,GAAG,UAAU,CACvB,SAAS,EACT,UAAU,EACV,MAAM,EACN,SAAS,EACT,UAAU,EACV,cAAc,EACd,YAAY,EACZ,kBAAkB,EAClB,MAAM,CACP,CAAC;YACF,IAAI,IAAK,MAAM,CAAC,IAAI,CAAC;YACrB,IAAI,MAAM,CAAC,KAAK,GAAG,KAAK;gBAAE,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAEjD,CAAC;aAAM,IAAI,SAAS,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;YAC/C,MAAM,YAAY,GAAG,SAAS,CAAC,aAAa;gBAC1C,CAAC,CAAE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAmC;gBACvF,CAAC,CAAC,UAAU,CAAC;YAEf,IAAI,YAAY,IAAI,WAAW,IAAI,YAAY,EAAE,CAAC;gBAChD,MAAM,MAAM,GAAG,iBAAiB,CAC9B,SAAS,CAAC,YAAY,EACtB,YAAY,EACZ,MAAM,EACN,SAAS,EACT,UAAU,EACV,cAAc,EACd,YAAY,EACZ,kBAAkB,EAClB,MAAM,CACP,CAAC;gBACF,IAAI,IAAK,MAAM,CAAC,IAAI,CAAC;gBACrB,IAAI,MAAM,CAAC,KAAK,GAAG,KAAK;oBAAE,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;YACjD,CAAC;QAEH,CAAC;aAAM,IAAI,SAAS,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;YAC/C,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjD,IAAI,IAAI,EAAE,CAAC;gBACT,MAAM,MAAM,GAAG,iBAAiB,CAC9B,IAAI,EACJ,UAAU,EACV,MAAM,EACN,SAAS,EACT,UAAU,EACV,cAAc,EACd,YAAY,EACZ,kBAAkB,EAClB,MAAM,CACP,CAAC;gBACF,IAAI,IAAK,MAAM,CAAC,IAAI,CAAC;gBACrB,IAAI,MAAM,CAAC,KAAK,GAAG,KAAK;oBAAE,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;YACjD,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACzB,CAAC;AAED,SAAS,UAAU,CACjB,KAAgB,EAChB,UAA6B,EAC7B,MAAqB,EACrB,SAAwC,EACxC,UAAkC,EAClC,cAAsB,EACtB,YAAoB,EACpB,kBAA2B,EAC3B,MAAkC;IAElC,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;IAEnC,qBAAqB;IACrB,IAAI,oBAAoB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;QACxC,IAAI,CAAC,kBAAkB,EAAE,CAAC;YACxB,MAAM,CAAC,IAAI,CAAC;gBACV,OAAO,EAAE,gDAAgD;gBACzD,UAAU,EAAE,EAAE,IAAI,EAAE,wBAAwB,EAAE;aAC/C,CAAC,CAAC;QACL,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC;IAC1C,CAAC;IAED,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC;IACjC,MAAM,OAAO,GAAI,GAAG,QAAQ,IAAI,SAAS,EAAE,CAAC;IAC5C,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;IAEpE,MAAM,SAAS,GAAG,YAAY,GAAG,CAAC,CAAC;IACnC,IAAI,IAAI,GAAI,SAAS,CAAC;IACtB,IAAI,KAAK,GAAG,SAAS,CAAC;IAEtB,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QACvB,0DAA0D;QAC1D,MAAM,QAAQ,GAAG,UAAU,CAAC,SAAS,EAAE,CAAC,SAAS,CAAC,CAAC;QACnD,MAAM,MAAM,GAAK,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QAC9D,MAAM,GAAG,GAAQ,MAAM,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7C,MAAM,SAAS,GAAG,QAAQ;YACxB,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;YACxC,CAAC,CAAC,IAAI,CAAC;QAET,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,WAAW,GAAG,iBAAiB,CACnC,KAAK,CAAC,YAAY,EAClB,SAAS,EACT,MAAM,EACN,SAAS,EACT,UAAU,EACV,cAAc,EACd,SAAS,EACT,kBAAkB,EAClB,MAAM,CACP,CAAC;YACF,IAAI,IAAK,WAAW,CAAC,IAAI,GAAG,GAAG,CAAC;YAChC,IAAI,WAAW,CAAC,KAAK,GAAG,KAAK;gBAAE,KAAK,GAAG,WAAW,CAAC,KAAK,CAAC;QAC3D,CAAC;IACH,CAAC;IAED,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACzB,CAAC;AAED,gFAAgF;AAEhF,SAAS,oBAAoB,CAC3B,MAAqB,EACrB,SAAiB;IAEjB,QAAQ,SAAS,EAAE,CAAC;QAClB,KAAK,OAAO,CAAC,CAAQ,OAAO,MAAM,CAAC,YAAY,EAAE,IAAW,SAAS,CAAC;QACtE,KAAK,UAAU,CAAC,CAAK,OAAO,MAAM,CAAC,eAAe,EAAE,IAAQ,SAAS,CAAC;QACtE,KAAK,cAAc,CAAC,CAAC,OAAO,MAAM,CAAC,mBAAmB,EAAE,IAAI,SAAS,CAAC;QACtE,OAAO,CAAC,CAAa,OAAO,SAAS,CAAC;IACxC,CAAC;AACH,CAAC;AAED,8EAA8E;AAC9E,SAAS,UAAU,CAAC,IAAuB;IACzC,IAAI,QAAQ,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;QAC5C,IAAK,IAA0B,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC;QAC7D,OAAO,UAAU,CAAC,IAAI,CAAC,MAA2B,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,eAAe,CACtB,IAAuB,EACvB,MAAqB;IAErB,kBAAkB;IAClB,IAAI,CAAC,GAAsB,IAAI,CAAC;IAChC,OAAO,QAAQ,IAAI,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,IAAI,EAAE,CAAC;QACzC,CAAC,GAAG,CAAC,CAAC,MAA2B,CAAC;IACpC,CAAC;IACD,oBAAoB;IACpB,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;QAChB,MAAM,KAAK,GAAG,MAAM,CAAC,OAAO,CAAE,CAAsB,CAAC,IAAI,CAAC,CAAC;QAC3D,IAAI,KAAK,IAAI,WAAW,IAAI,KAAK;YAAE,OAAO,KAA0B,CAAC;IACvE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/dataloader.d.ts

@@ -0,0 +1,96 @@
+/**
+ * Nexus DataLoader — N+1 Query Prevention
+ *
+ * Batches individual loads that occur within the same microtask tick into a
+ * single call to your `batchFn`. This eliminates the N+1 problem in GraphQL
+ * resolvers without requiring a database ORM.
+ *
+ * Comparison to the popular `dataloader` npm package:
+ *  - Same API surface: `loader.load(key)` → `Promise<Value>`
+ *  - Same batching model: deduplication + microtask coalescing
+ *  - No external dependency — uses only built-in `queueMicrotask`
+ *  - Typed with generics
+ *  - `loadMany(keys)` helper for bulk lookups
+ *
+ * Usage
+ * ─────
+ *  // Create per-request (critical: not a singleton!) inside the GraphQL context factory.
+ *
+ *  const userLoader = createBatchLoader<string, User>(async (ids) => {
+ *    const rows = await db.users.findMany({ where: { id: { in: ids } } });
+ *    // IMPORTANT: return values in the SAME ORDER as `ids`.
+ *    return ids.map(id => rows.find(r => r.id === id) ?? new Error(`User ${id} not found`));
+ *  });
+ *
+ *  // In resolver:
+ *  const user = await ctx.loaders.user.load(userId);
+ *
+ * Key ordering contract
+ * ─────────────────────
+ *  Your `batchFn` MUST return an array of the same length as `keys`, in the
+ *  same order. Return an `Error` instance for individual failures without
+ *  rejecting the whole batch.
+ */
+/**
+ * Batch function: receives deduplicated keys, returns values in the same order.
+ * Individual errors: return an `Error` in place of the value for that position.
+ */
+export type BatchFn<K, V> = (keys: readonly K[]) => Promise<ReadonlyArray<V | Error>>;
+/** Cache key serialiser — defaults to `JSON.stringify`. Override for non-primitive keys. */
+export type CacheKeyFn<K> = (key: K) => string;
+export interface BatchLoaderOptions<K> {
+    /** Custom key serialiser for non-primitive key types. Default: JSON.stringify. */
+    cacheKeyFn?: CacheKeyFn<K>;
+    /** Disable in-flight deduplication (each load always queues a new item). Default: false. */
+    disableCache?: boolean;
+    /**
+     * Maximum batch size. When exceeded, flush immediately and start a new batch.
+     * Default: Infinity (unbounded).
+     */
+    maxBatchSize?: number;
+}
+export declare class BatchLoader<K, V> {
+    private readonly batchFn;
+    private readonly cacheKeyFn;
+    private readonly disableCache;
+    private readonly maxBatchSize;
+    /** In-flight dedup cache: cacheKey → pending promise */
+    private readonly cache;
+    /** Current batch queue */
+    private queue;
+    private flushScheduled;
+    constructor(batchFn: BatchFn<K, V>, options?: BatchLoaderOptions<K>);
+    /** Load a single value by key. Deduplicates concurrent loads for the same key. */
+    load(key: K): Promise<V>;
+    /** Load multiple keys — convenience wrapper. */
+    loadMany(keys: readonly K[]): Promise<Array<V | Error>>;
+    /** Remove a specific key from the deduplication cache (force a fresh load). */
+    clear(key: K): this;
+    /** Wipe the entire dedup cache. */
+    clearAll(): this;
+    /** Prime the cache with a known value (avoids a future batch call). */
+    prime(key: K, value: V): this;
+    private scheduleFlush;
+    private flush;
+}
+/**
+ * Convenience factory — same as `new BatchLoader(batchFn, opts)`.
+ *
+ * @example
+ *   const userLoader = createBatchLoader(async (ids) => db.users.findMany({ where: { id: { in: ids } } }));
+ */
+export declare function createBatchLoader<K, V>(batchFn: BatchFn<K, V>, options?: BatchLoaderOptions<K>): BatchLoader<K, V>;
+/**
+ * Create a per-request loader registry.
+ * Pass the factory as your GraphQL context `loaders` field.
+ *
+ * @example
+ *   const loaders = createLoaderRegistry({
+ *     user:    createBatchLoader(ids => db.users.findMany(...)),
+ *     product: createBatchLoader(ids => db.products.findMany(...)),
+ *   });
+ *
+ *   // In resolver: ctx.loaders.user.load(userId)
+ */
+export declare function createLoaderRegistry<T extends Record<string, BatchLoader<unknown, unknown>>>(loaders: T): T;
+//# sourceMappingURL=dataloader.d.ts.map

package/dist/dataloader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dataloader.d.ts","sourceRoot":"","sources":["../src/dataloader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAIH;;;GAGG;AACH,MAAM,MAAM,OAAO,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,KAAK,OAAO,CAAC,aAAa,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;AAEtF,4FAA4F;AAC5F,MAAM,MAAM,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,KAAK,MAAM,CAAC;AAE/C,MAAM,WAAW,kBAAkB,CAAC,CAAC;IACnC,kFAAkF;IAClF,UAAU,CAAC,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC;IAC3B,4FAA4F;IAC5F,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB;;;OAGG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;CACvB;AAUD,qBAAa,WAAW,CAAC,CAAC,EAAE,CAAC;IAC3B,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAqB;IAC7C,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAkB;IAC7C,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAU;IACvC,OAAO,CAAC,QAAQ,CAAC,YAAY,CAAS;IAEtC,wDAAwD;IACxD,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAiC;IAEvD,0BAA0B;IAC1B,OAAO,CAAC,KAAK,CAAyB;IACtC,OAAO,CAAC,cAAc,CAAS;gBAEnB,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,GAAE,kBAAkB,CAAC,CAAC,CAAM;IAOvE,kFAAkF;IAClF,IAAI,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAoBxB,gDAAgD;IAChD,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;IAUvD,+EAA+E;IAC/E,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI;IAKnB,mCAAmC;IACnC,QAAQ,IAAI,IAAI;IAKhB,uEAAuE;IACvE,KAAK,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAU7B,OAAO,CAAC,aAAa;YAYP,KAAK;CAoDpB;AAED;;;;;GAKG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,CAAC,EACpC,OAAO,EAAE,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,EACtB,OAAO,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAC9B,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAEnB;AAED;;;;;;;;;;;GAWG;AACH,wBAAgB,oBAAoB,CAClC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,EACvD,OAAO,EAAE,CAAC,GAAG,CAAC,CAEf"}

package/dist/dataloader.js

@@ -0,0 +1,177 @@
+/**
+ * Nexus DataLoader — N+1 Query Prevention
+ *
+ * Batches individual loads that occur within the same microtask tick into a
+ * single call to your `batchFn`. This eliminates the N+1 problem in GraphQL
+ * resolvers without requiring a database ORM.
+ *
+ * Comparison to the popular `dataloader` npm package:
+ *  - Same API surface: `loader.load(key)` → `Promise<Value>`
+ *  - Same batching model: deduplication + microtask coalescing
+ *  - No external dependency — uses only built-in `queueMicrotask`
+ *  - Typed with generics
+ *  - `loadMany(keys)` helper for bulk lookups
+ *
+ * Usage
+ * ─────
+ *  // Create per-request (critical: not a singleton!) inside the GraphQL context factory.
+ *
+ *  const userLoader = createBatchLoader<string, User>(async (ids) => {
+ *    const rows = await db.users.findMany({ where: { id: { in: ids } } });
+ *    // IMPORTANT: return values in the SAME ORDER as `ids`.
+ *    return ids.map(id => rows.find(r => r.id === id) ?? new Error(`User ${id} not found`));
+ *  });
+ *
+ *  // In resolver:
+ *  const user = await ctx.loaders.user.load(userId);
+ *
+ * Key ordering contract
+ * ─────────────────────
+ *  Your `batchFn` MUST return an array of the same length as `keys`, in the
+ *  same order. Return an `Error` instance for individual failures without
+ *  rejecting the whole batch.
+ */
+export class BatchLoader {
+    batchFn;
+    cacheKeyFn;
+    disableCache;
+    maxBatchSize;
+    /** In-flight dedup cache: cacheKey → pending promise */
+    cache = new Map();
+    /** Current batch queue */
+    queue = [];
+    flushScheduled = false;
+    constructor(batchFn, options = {}) {
+        this.batchFn = batchFn;
+        this.cacheKeyFn = options.cacheKeyFn ?? ((k) => JSON.stringify(k));
+        this.disableCache = options.disableCache ?? false;
+        this.maxBatchSize = options.maxBatchSize ?? Infinity;
+    }
+    /** Load a single value by key. Deduplicates concurrent loads for the same key. */
+    load(key) {
+        const cacheKey = this.cacheKeyFn(key);
+        if (!this.disableCache) {
+            const cached = this.cache.get(cacheKey);
+            if (cached)
+                return cached;
+        }
+        const promise = new Promise((resolve, reject) => {
+            this.queue.push({ key, resolve, reject });
+            this.scheduleFlush();
+        });
+        if (!this.disableCache) {
+            this.cache.set(cacheKey, promise);
+        }
+        return promise;
+    }
+    /** Load multiple keys — convenience wrapper. */
+    loadMany(keys) {
+        return Promise.all(keys.map(k => this.load(k).catch((err) => err instanceof Error ? err : new Error(String(err)))));
+    }
+    /** Remove a specific key from the deduplication cache (force a fresh load). */
+    clear(key) {
+        this.cache.delete(this.cacheKeyFn(key));
+        return this;
+    }
+    /** Wipe the entire dedup cache. */
+    clearAll() {
+        this.cache.clear();
+        return this;
+    }
+    /** Prime the cache with a known value (avoids a future batch call). */
+    prime(key, value) {
+        const cacheKey = this.cacheKeyFn(key);
+        if (!this.cache.has(cacheKey)) {
+            this.cache.set(cacheKey, Promise.resolve(value));
+        }
+        return this;
+    }
+    // ── Private ────────────────────────────────────────────────────────────────
+    scheduleFlush() {
+        if (this.queue.length >= this.maxBatchSize) {
+            // Flush immediately when the batch limit is reached
+            void this.flush();
+            return;
+        }
+        if (!this.flushScheduled) {
+            this.flushScheduled = true;
+            queueMicrotask(() => void this.flush());
+        }
+    }
+    async flush() {
+        this.flushScheduled = false;
+        if (this.queue.length === 0)
+            return;
+        // Drain the current queue
+        const batch = this.queue.splice(0);
+        // Deduplicate keys (preserving order for the result map)
+        const seen = new Map();
+        const keyList = [];
+        for (const item of batch) {
+            const ck = this.cacheKeyFn(item.key);
+            if (!seen.has(ck)) {
+                seen.set(ck, item.key);
+                keyList.push(item.key);
+            }
+        }
+        let values;
+        try {
+            values = await this.batchFn(keyList);
+        }
+        catch (err) {
+            // Entire batch failed — reject all items
+            const error = err instanceof Error ? err : new Error(String(err));
+            for (const item of batch) {
+                item.reject(error);
+                this.cache.delete(this.cacheKeyFn(item.key));
+            }
+            return;
+        }
+        // Build key → value map
+        const resultMap = new Map();
+        keyList.forEach((k, i) => {
+            resultMap.set(this.cacheKeyFn(k), values[i] ?? new Error(`Missing value for key at index ${i}`));
+        });
+        // Resolve / reject each original queue item
+        for (const item of batch) {
+            const result = resultMap.get(this.cacheKeyFn(item.key));
+            if (result === undefined) {
+                const err = new Error(`[Nexus DataLoader] batchFn returned no value for key: ${this.cacheKeyFn(item.key)}`);
+                item.reject(err);
+                this.cache.delete(this.cacheKeyFn(item.key));
+            }
+            else if (result instanceof Error) {
+                item.reject(result);
+                this.cache.delete(this.cacheKeyFn(item.key));
+            }
+            else {
+                item.resolve(result);
+            }
+        }
+    }
+}
+/**
+ * Convenience factory — same as `new BatchLoader(batchFn, opts)`.
+ *
+ * @example
+ *   const userLoader = createBatchLoader(async (ids) => db.users.findMany({ where: { id: { in: ids } } }));
+ */
+export function createBatchLoader(batchFn, options) {
+    return new BatchLoader(batchFn, options);
+}
+/**
+ * Create a per-request loader registry.
+ * Pass the factory as your GraphQL context `loaders` field.
+ *
+ * @example
+ *   const loaders = createLoaderRegistry({
+ *     user:    createBatchLoader(ids => db.users.findMany(...)),
+ *     product: createBatchLoader(ids => db.products.findMany(...)),
+ *   });
+ *
+ *   // In resolver: ctx.loaders.user.load(userId)
+ */
+export function createLoaderRegistry(loaders) {
+    return loaders;
+}
+//# sourceMappingURL=dataloader.js.map

package/dist/dataloader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dataloader.js","sourceRoot":"","sources":["../src/dataloader.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AAiCH,MAAM,OAAO,WAAW;IACL,OAAO,CAAqB;IAC5B,UAAU,CAAkB;IAC5B,YAAY,CAAU;IACtB,YAAY,CAAS;IAEtC,wDAAwD;IACvC,KAAK,GAAG,IAAI,GAAG,EAAsB,CAAC;IAEvD,0BAA0B;IAClB,KAAK,GAAsB,EAAE,CAAC;IAC9B,cAAc,GAAG,KAAK,CAAC;IAE/B,YAAY,OAAsB,EAAE,UAAiC,EAAE;QACrE,IAAI,CAAC,OAAO,GAAQ,OAAO,CAAC;QAC5B,IAAI,CAAC,UAAU,GAAK,OAAO,CAAC,UAAU,IAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,KAAK,CAAC;QAClD,IAAI,CAAC,YAAY,GAAG,OAAO,CAAC,YAAY,IAAI,QAAQ,CAAC;IACvD,CAAC;IAED,kFAAkF;IAClF,IAAI,CAAC,GAAM;QACT,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QAEtC,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACvB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACxC,IAAI,MAAM;gBAAE,OAAO,MAAM,CAAC;QAC5B,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,OAAO,CAAI,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE;YACjD,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC;YAC1C,IAAI,CAAC,aAAa,EAAE,CAAC;QACvB,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QACpC,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,gDAAgD;IAChD,QAAQ,CAAC,IAAkB;QACzB,OAAO,OAAO,CAAC,GAAG,CAChB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CACX,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAY,EAAE,EAAE,CAClC,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CACpD,CACF,CACF,CAAC;IACJ,CAAC;IAED,+EAA+E;IAC/E,KAAK,CAAC,GAAM;QACV,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,mCAAmC;IACnC,QAAQ;QACN,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uEAAuE;IACvE,KAAK,CAAC,GAAM,EAAE,KAAQ;QACpB,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8EAA8E;IAEtE,aAAa;QACnB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,IAAI,CAAC,YAAY,EAAE,CAAC;YAC3C,oDAAoD;YACpD,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;YAClB,OAAO;QACT,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;YAC3B,cAAc,CAAC,GAAG,EAAE,CAAC,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC;IAEO,KAAK,CAAC,KAAK;QACjB,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC;QAC5B,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEpC,0BAA0B;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QAEnC,yDAAyD;QACzD,MAAM,IAAI,GAAM,IAAI,GAAG,EAAa,CAAC;QACrC,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAClB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;gBACvB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;QAED,IAAI,MAAgC,CAAC;QACrC,IAAI,CAAC;YACH,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACvC,CAAC;QAAC,OAAO,GAAG,EAAE,CAAC;YACb,yCAAyC;YACzC,MAAM,KAAK,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;YAClE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBACnB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/C,CAAC;YACD,OAAO;QACT,CAAC;QAED,wBAAwB;QACxB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;QAC/C,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACvB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,IAAI,KAAK,CAAC,kCAAkC,CAAC,EAAE,CAAC,CAAC,CAAC;QACnG,CAAC,CAAC,CAAC;QAEH,4CAA4C;QAC5C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YACxD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;gBACzB,MAAM,GAAG,GAAG,IAAI,KAAK,CAAC,yDAAyD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC5G,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACjB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/C,CAAC;iBAAM,IAAI,MAAM,YAAY,KAAK,EAAE,CAAC;gBACnC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACpB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;YAC/C,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED;;;;;GAKG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAAsB,EACtB,OAA+B;IAE/B,OAAO,IAAI,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;AAC3C,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,oBAAoB,CAElC,OAAU;IACV,OAAO,OAAO,CAAC;AACjB,CAAC"}