@wundergraph/protographic 0.15.5 → 0.16.0

package/dist/src/abstract-selection-rewriter.js

@@ -0,0 +1,585 @@
+/**
+ * @file abstract-selection-rewriter.ts
+ *
+ * This module provides functionality to normalize GraphQL field set selections
+ * when dealing with abstract types (interfaces and unions). It ensures that fields selected
+ * at the interface level are properly distributed into each inline fragment,
+ * maintaining correct selection semantics for proto mapping generation.
+ */
+import { visit, isInterfaceType, Kind, getNamedType, isObjectType, isUnionType, isAbstractType, isCompositeType, } from 'graphql';
+/**
+ * Rewrites GraphQL selection sets to normalize abstract type selections.
+ *
+ * When a field returns an interface type, selections can be made both at the
+ * interface level and within inline fragments for concrete types. This class
+ * normalizes such selections by moving interface-level fields into each inline
+ * fragment, ensuring consistent selection structure for downstream processing.
+ * This is required to generate the proper proto message definitions as in protobuf
+ * we define abstract types as oneof fields in in a message definition, which defines
+ * the possible concrete types that can be selected.
+ *
+ * As we can select on Interfaces and Unions directly, we need to normalize the selection set
+ * to determine the allowed concrete types that can be selected.
+ *
+ *
+ * @example
+ * Input selection:
+ * ```graphql
+ * media {
+ *   id          # interface-level field
+ *   ... on Book { title }
+ *   ... on Movie { duration }
+ * }
+ * ```
+ *
+ * Output after normalization:
+ * ```graphql
+ * media {
+ *   ... on Book { id title }
+ *   ... on Movie { id duration }
+ * }
+ * ```
+ */
+export class AbstractSelectionRewriter {
+    /**
+     * Creates a new AbstractSelectionRewriter instance.
+     *
+     * @param fieldSetDoc - The parsed GraphQL document containing the field set to rewrite
+     * @param schema - The GraphQL schema used for type resolution
+     * @param objectType - The root object type where the field set originates
+     */
+    constructor(fieldSetDoc, schema, objectType) {
+        this.compositeTypeStack = [];
+        this.ancestorStacks = [];
+        /** Stack for tracking parent types during nested field traversal */
+        this.typeStack = [];
+        /** Boolean stack indicating whether to restore type/selection context when leaving a selection set */
+        this.rebalanceStack = [];
+        /** Stack for preserving parent selection set context during nested traversal */
+        this.selectionSetStack = [];
+        this.inlineFragmentStack = [];
+        /** Stack tracking enclosing concrete type inline fragments for correct parent resolution
+         * when unfolding unions/abstracts nested inside concrete type fragments */
+        this.concreteFragmentStack = [];
+        this.fieldSetDoc = fieldSetDoc;
+        this.schema = schema;
+        this.currentType = objectType;
+        this.visitor = this.createASTVisitor();
+    }
+    /**
+     * Creates the AST visitor that processes selection sets during traversal.
+     *
+     * @returns An ASTVisitor configured to handle SelectionSet nodes
+     */
+    createASTVisitor() {
+        return {
+            SelectionSet: {
+                enter: (node, key, parent, path, ancestors) => this.onEnterSelectionSet({ node, key, parent, path, ancestors }),
+                leave: (node, key, parent, path, ancestors) => this.onLeaveSelectionSet({ node, key, parent, path, ancestors }),
+            },
+            InlineFragment: {
+                enter: (node, key, parent, path, ancestors) => this.onEnterInlineFragment({ node, key, parent, path, ancestors }),
+                leave: (node, key, parent, path, ancestors) => this.onLeaveInlineFragment({ node, key, parent, path, ancestors }),
+            },
+        };
+    }
+    /**
+     * Executes the normalization process on the field set document.
+     *
+     * This method traverses the AST and rewrites any selection sets that target
+     * interface types, distributing interface-level fields into inline fragments.
+     * The modification is performed in-place on the provided document.
+     */
+    normalize() {
+        visit(this.fieldSetDoc, this.visitor);
+    }
+    /**
+     * Handles the entry into a SelectionSet node during AST traversal.
+     *
+     * If the selection set's parent field returns an interface type, this method:
+     * 1. Extracts all direct field selections (interface-level fields)
+     * 2. Removes them from the selection set, leaving only inline fragments
+     * 3. Prepends the interface-level fields to each inline fragment's selections
+     *    (unless the fragment already contains that field)
+     *
+     * @param ctx - The visitor context containing the current node and its position in the AST
+     */
+    onEnterSelectionSet(ctx) {
+        if (!ctx.parent) {
+            return;
+        }
+        if (!this.isFieldNode(ctx.parent)) {
+            this.rebalanceStack.push(false);
+            return;
+        }
+        const fieldType = this.findNamedTypeForField(ctx.parent.name.value);
+        if (!fieldType) {
+            this.rebalanceStack.push(false);
+            return;
+        }
+        if (!this.isTypeWithFields(fieldType)) {
+            this.rebalanceStack.push(false);
+            return;
+        }
+        this.typeStack.push(this.currentType);
+        this.rebalanceStack.push(true);
+        this.currentType = fieldType;
+        if (this.currentSelectionSet) {
+            this.selectionSetStack.push(this.currentSelectionSet);
+        }
+        this.currentSelectionSet = ctx.node;
+        if (this.compositeTypeStack.length > 0) {
+            this.ancestorStacks.push([...this.compositeTypeStack]);
+            this.compositeTypeStack = [];
+        }
+        this.currentCompositeRoot = fieldType;
+        this.compositeTypeStack.push(this.currentCompositeRoot);
+        // Only process selection sets for interface and union types
+        if (isAbstractType(fieldType)) {
+            this.appendValidInlineFragments(ctx.node);
+            this.distributeFieldsIntoInlineFragments(ctx.node);
+        }
+    }
+    /**
+     * Handles leaving a SelectionSet node during AST traversal.
+     *
+     * This method performs cleanup operations:
+     * 1. Merges duplicate inline fragments with the same type condition
+     * 2. Removes empty inline fragments (those with no selections)
+     * 3. Restores the previous type and selection set context from stacks
+     *
+     * @param ctx - The visitor context containing the current node and its position in the AST
+     */
+    onLeaveSelectionSet(ctx) {
+        var _a, _b, _c, _d;
+        if (!ctx.parent) {
+            return;
+        }
+        this.collapseRedundantFragments(ctx.node, ctx.parent);
+        this.mergeInlineFragments(ctx.node);
+        this.removeEmptyInlineFragments(ctx.node);
+        if ((_a = this.rebalanceStack.pop()) !== null && _a !== void 0 ? _a : false) {
+            this.currentType = (_b = this.typeStack.pop()) !== null && _b !== void 0 ? _b : this.currentType;
+            this.currentSelectionSet = this.selectionSetStack.pop();
+        }
+        if (!this.isFieldNode(ctx.parent)) {
+            return;
+        }
+        const fieldType = this.findNamedTypeForField(ctx.parent.name.value);
+        if (!fieldType || !this.isTypeWithFields(fieldType)) {
+            return;
+        }
+        if (isCompositeType(fieldType) &&
+            fieldType.name === ((_c = this.currentCompositeRoot) === null || _c === void 0 ? void 0 : _c.name) &&
+            this.compositeTypeStack.length === 1) {
+            this.compositeTypeStack = (_d = this.ancestorStacks.pop()) !== null && _d !== void 0 ? _d : [];
+            if (this.compositeTypeStack.length > 0) {
+                this.currentCompositeRoot = this.compositeTypeStack[0];
+            }
+        }
+    }
+    /**
+     * Handles entering an InlineFragment node during AST traversal.
+     *
+     * This method processes inline fragments in two ways:
+     *
+     * 1. For concrete type fragments (e.g., `... on Book`):
+     *    - Validates if the fragment type implements the current interface
+     *    - Removes invalid fragments (those targeting types that don't implement the interface)
+     *    - Tracks the fragment for nested union/abstract type resolution
+     *
+     * 2. For interface type conditions (e.g., `... on Employee`):
+     *    - Recursively processes nested interface selections
+     *    - Distributes interface-level fields into concrete type fragments
+     *    - Unwraps the inline fragment by replacing it with its selections
+     *    - Ensures nested interface fields are properly distributed
+     *
+     * @param ctx - The visitor context containing the current inline fragment node
+     * @returns undefined to continue traversal, or nothing to skip
+     */
+    onEnterInlineFragment(ctx) {
+        var _a, _b;
+        if (!ctx.parent || !this.currentSelectionSet) {
+            return;
+        }
+        this.inlineFragmentStack.push(ctx.node);
+        const type = this.schema.getType((_b = (_a = ctx.node.typeCondition) === null || _a === void 0 ? void 0 : _a.name.value) !== null && _b !== void 0 ? _b : '');
+        if (isUnionType(type)) {
+            this.unfoldUnionType(ctx);
+            this.compositeTypeStack.push(type);
+            this.rebalanceStack.push(false);
+            return;
+        }
+        if (!type || !this.isTypeWithFields(type)) {
+            return;
+        }
+        if (!this.inlineFragmentIsAbstractType(ctx.node)) {
+            this.rebalanceStack.push(true);
+            this.typeStack.push(this.currentType);
+            this.compositeTypeStack.push(type);
+            this.currentType = type;
+            // Returning undefined continues traversal without deleting the node.
+            // If the inline fragment targets a type that doesn't implement the current interface,
+            // we remove it from the selections.
+            if (!this.inlineFragmentIsValidForCurrentAbstractRoot(ctx.node)) {
+                let parent = this.currentSelectionSet;
+                if (this.inlineFragmentStack.length > 1) {
+                    const inlineFragment = this.inlineFragmentStack.at(-2);
+                    if (!inlineFragment) {
+                        return;
+                    }
+                    parent = inlineFragment.selectionSet;
+                }
+                parent.selections = parent.selections.filter((s) => { var _a, _b; return s.kind !== Kind.INLINE_FRAGMENT || ((_a = s.typeCondition) === null || _a === void 0 ? void 0 : _a.name.value) !== ((_b = ctx.node.typeCondition) === null || _b === void 0 ? void 0 : _b.name.value); });
+            }
+            // Track this concrete fragment so nested union/abstract processing can find
+            // the correct parent selection set when unfolding.
+            this.concreteFragmentStack.push(ctx.node);
+            this.inlineFragmentStack.pop();
+            return;
+        }
+        this.rebalanceStack.push(false);
+        if (!isAbstractType(type)) {
+            return;
+        }
+        this.compositeTypeStack.push(type);
+        this.appendValidInlineFragments(ctx.node.selectionSet);
+        this.distributeFieldsIntoInlineFragments(ctx.node.selectionSet);
+        const parent = this.getEnclosingSelectionSet(ctx.node);
+        if (!parent) {
+            this.inlineFragmentStack.pop();
+            return;
+        }
+        this.unfoldSelectionNodeToParent(ctx.node, parent);
+        this.inlineFragmentStack.pop();
+    }
+    onLeaveInlineFragment(ctx) {
+        var _a, _b;
+        if (!ctx.parent || !this.currentSelectionSet) {
+            return;
+        }
+        this.inlineFragmentStack.pop();
+        if ((_a = this.rebalanceStack.pop()) !== null && _a !== void 0 ? _a : false) {
+            this.currentType = (_b = this.typeStack.pop()) !== null && _b !== void 0 ? _b : this.currentType;
+            this.compositeTypeStack.pop();
+            // Pop the concrete fragment stack (pushed during enter for concrete types)
+            this.concreteFragmentStack.pop();
+        }
+        else {
+            this.compositeTypeStack.pop();
+        }
+    }
+    unfoldUnionType(ctx) {
+        const parent = this.getEnclosingSelectionSet(ctx.node);
+        if (!parent) {
+            return;
+        }
+        this.unfoldSelectionNodeToParent(ctx.node, parent);
+        this.inlineFragmentStack.pop();
+    }
+    unfoldSelectionNodeToParent(node, parent) {
+        const index = parent.selections.findIndex((s) => { var _a, _b; return s.kind === Kind.INLINE_FRAGMENT && ((_a = s.typeCondition) === null || _a === void 0 ? void 0 : _a.name.value) === ((_b = node.typeCondition) === null || _b === void 0 ? void 0 : _b.name.value); });
+        if (index < 0) {
+            return;
+        }
+        parent.selections = [
+            ...parent.selections.slice(0, index),
+            ...node.selectionSet.selections,
+            ...parent.selections.slice(index + 1),
+        ];
+    }
+    /**
+     * Resolves the correct enclosing selection set for union/abstract type unfolding.
+     *
+     * The resolution order is:
+     * 1. If `inlineFragmentStack` has depth > 1, use the parent fragment's selection set
+     * 2. If the node can be found in `currentSelectionSet`, use it
+     * 3. If inside a concrete type inline fragment (tracked by concreteFragmentStack)
+     *    and the node can be found there, use that fragment's selection set
+     * 4. Fall back to `currentSelectionSet`
+     */
+    getEnclosingSelectionSet(node) {
+        var _a, _b, _c, _d, _e, _f, _g;
+        if (this.inlineFragmentStack.length > 1) {
+            return (_a = this.inlineFragmentStack.at(-2)) === null || _a === void 0 ? void 0 : _a.selectionSet;
+        }
+        const typeName = (_c = (_b = node.typeCondition) === null || _b === void 0 ? void 0 : _b.name) === null || _c === void 0 ? void 0 : _c.value;
+        // Check if the node is a direct child of currentSelectionSet
+        if ((_e = (_d = this.currentSelectionSet) === null || _d === void 0 ? void 0 : _d.selections) === null || _e === void 0 ? void 0 : _e.some((s) => { var _a, _b; return s.kind === Kind.INLINE_FRAGMENT && ((_b = (_a = s.typeCondition) === null || _a === void 0 ? void 0 : _a.name) === null || _b === void 0 ? void 0 : _b.value) === typeName; })) {
+            return this.currentSelectionSet;
+        }
+        // Fall back to the enclosing concrete fragment's selection set
+        // (e.g., when a union is directly inside a concrete type inline fragment)
+        if (this.concreteFragmentStack.length > 0) {
+            const concreteFragment = this.concreteFragmentStack.at(-1);
+            if ((_g = (_f = concreteFragment === null || concreteFragment === void 0 ? void 0 : concreteFragment.selectionSet) === null || _f === void 0 ? void 0 : _f.selections) === null || _g === void 0 ? void 0 : _g.some((s) => { var _a, _b; return s.kind === Kind.INLINE_FRAGMENT && ((_b = (_a = s.typeCondition) === null || _a === void 0 ? void 0 : _a.name) === null || _b === void 0 ? void 0 : _b.value) === typeName; })) {
+                return concreteFragment.selectionSet;
+            }
+        }
+        return this.currentSelectionSet;
+    }
+    /**
+     * Merges duplicate inline fragments with the same type condition.
+     *
+     * When multiple inline fragments target the same concrete type, this method
+     * combines them into a single fragment with all selections merged together.
+     * The merged fragment replaces all duplicate fragments in the selection set.
+     *
+     * @param node - The selection set node containing inline fragments to merge
+     */
+    mergeInlineFragments(node) {
+        const selectedInlineFragments = node.selections.filter((s) => s.kind === Kind.INLINE_FRAGMENT);
+        if (selectedInlineFragments.length === 0) {
+            return;
+        }
+        const uniqueInlineFragments = [];
+        for (const selectedFragment of selectedInlineFragments) {
+            const uniqueFragment = uniqueInlineFragments.find((f) => { var _a, _b; return ((_a = f.typeCondition) === null || _a === void 0 ? void 0 : _a.name.value) === ((_b = selectedFragment.typeCondition) === null || _b === void 0 ? void 0 : _b.name.value); });
+            if (!uniqueFragment) {
+                uniqueInlineFragments.push(selectedFragment);
+                continue;
+            }
+            const existingFieldNames = new Set(uniqueFragment.selectionSet.selections.filter((s) => s.kind === Kind.FIELD).map((s) => s.name.value));
+            const missingFields = selectedFragment.selectionSet.selections.filter((s) => s.kind === Kind.FIELD && !existingFieldNames.has(s.name.value));
+            uniqueFragment.selectionSet.selections = [...uniqueFragment.selectionSet.selections, ...missingFields];
+        }
+        // Put the fields back in the selection set. If there are any fields that were not included in the inline fragments.
+        const fields = node.selections.filter((s) => s.kind === Kind.FIELD);
+        node.selections = [...fields, ...uniqueInlineFragments];
+    }
+    /**
+     * Collapses redundant nested inline fragments whose type condition matches
+     * the enclosing inline fragment's type condition.
+     *
+     * When processing abstract types inside a concrete type inline fragment,
+     * the normalization may produce nested fragments like:
+     *   `... on Intern { ... on Intern { scope } }`
+     * This method unwraps the inner fragment, yielding:
+     *   `... on Intern { scope }`
+     *
+     * @param node - The selection set node to clean up
+     * @param parent - The parent AST node (checked for InlineFragment type)
+     */
+    collapseRedundantFragments(node, parent) {
+        var _a, _b;
+        if (Array.isArray(parent) || parent.kind !== Kind.INLINE_FRAGMENT) {
+            return;
+        }
+        const parentFragment = parent;
+        const parentTypeName = (_b = (_a = parentFragment.typeCondition) === null || _a === void 0 ? void 0 : _a.name) === null || _b === void 0 ? void 0 : _b.value;
+        if (!parentTypeName) {
+            return;
+        }
+        node.selections = node.selections.flatMap((s) => {
+            var _a, _b;
+            return s.kind === Kind.INLINE_FRAGMENT && ((_b = (_a = s.typeCondition) === null || _a === void 0 ? void 0 : _a.name) === null || _b === void 0 ? void 0 : _b.value) === parentTypeName
+                ? s.selectionSet.selections
+                : [s];
+        });
+    }
+    /**
+     * Removes empty inline fragments from a selection set.
+     *
+     * Filters out any inline fragment that has no selections in its selection set.
+     * This cleanup step is performed after field distribution and merging operations
+     * to ensure only meaningful fragments remain in the AST.
+     *
+     * @param node - The selection set node to clean up
+     */
+    removeEmptyInlineFragments(node) {
+        node.selections = node.selections.filter((s) => s.kind !== Kind.INLINE_FRAGMENT || s.selectionSet.selections.length > 0);
+    }
+    /**
+     * Appends inline fragments for all possible types that implement the current interface.
+     *
+     * When processing an interface type selection with interface-level fields, this method
+     * ensures that every concrete type implementing the interface has a corresponding
+     * inline fragment. Creates new fragments only for types that don't already have one.
+     *
+     * This guarantees that interface-level fields can be distributed to all implementing
+     * types, even if the original query didn't explicitly include fragments for them.
+     *
+     * @param node - The selection set node to append inline fragments to
+     */
+    appendValidInlineFragments(node) {
+        if (this.compositeTypeStack.length === 0) {
+            return;
+        }
+        const fields = node.selections.filter((s) => s.kind === Kind.FIELD);
+        if (fields.length === 0) {
+            return;
+        }
+        const currentStack = [...this.compositeTypeStack];
+        const currentInterface = currentStack.pop();
+        if (!currentInterface) {
+            return;
+        }
+        const selectedInlineFragments = node.selections.filter((s) => s.kind === Kind.INLINE_FRAGMENT);
+        const possibleTypes = this.getPossibleIntersectingTypes(currentInterface, currentStack);
+        const newInlineFragments = [];
+        for (const possibleType of possibleTypes) {
+            if (!selectedInlineFragments.some((s) => { var _a; return ((_a = s.typeCondition) === null || _a === void 0 ? void 0 : _a.name.value) === possibleType.name; })) {
+                newInlineFragments.push(this.createInlineFragment(possibleType, fields));
+            }
+        }
+        node.selections = [...fields, ...newInlineFragments, ...selectedInlineFragments];
+    }
+    getPossibleIntersectingTypes(currentCompositeRoot, ancestors) {
+        let possibleTypes = [];
+        possibleTypes = isObjectType(currentCompositeRoot)
+            ? [currentCompositeRoot]
+            : this.schema.getPossibleTypes(currentCompositeRoot);
+        const lastAncestor = ancestors.pop();
+        if (!lastAncestor) {
+            return possibleTypes;
+        }
+        const parentPossibleTypes = this.getPossibleIntersectingTypes(lastAncestor, ancestors);
+        return possibleTypes.filter((t) => parentPossibleTypes.some((p) => p.name === t.name));
+    }
+    /**
+     * Creates an inline fragment AST node for a specific concrete type.
+     *
+     * Constructs a minimal InlineFragmentNode with:
+     * - Type condition targeting the specified object type
+     * - Filtered field selections (only includes fields that exist on the target type)
+     * - Simple field nodes with name only (no aliases, arguments, or directives)
+     *
+     * @param type - The concrete object type to create a fragment for
+     * @param fields - The interface-level fields to include in the fragment
+     * @returns A new InlineFragmentNode with the filtered field selections
+     */
+    createInlineFragment(type, fields) {
+        return {
+            kind: Kind.INLINE_FRAGMENT,
+            directives: [],
+            typeCondition: {
+                kind: Kind.NAMED_TYPE,
+                name: { kind: Kind.NAME, value: type.name },
+            },
+            selectionSet: {
+                kind: Kind.SELECTION_SET,
+                selections: fields.filter((f) => type.getFields()[f.name.value]),
+            },
+        };
+    }
+    /**
+     * Distributes interface-level fields into all inline fragments.
+     *
+     * This is the core normalization logic that:
+     * 1. Extracts all direct field selections from the selection set
+     * 2. Removes those fields from the parent selection set
+     * 3. Adds each field to the inline fragments where it doesn't already exist
+     * 4. Validates that each field exists on the fragment's concrete type
+     *
+     * Fields are prepended to maintain their original order relative to fragment-specific fields.
+     * Duplicate fields within a fragment are avoided by checking existing selections.
+     *
+     * @param node - The selection set node containing fields and inline fragments
+     */
+    distributeFieldsIntoInlineFragments(node) {
+        var _a, _b, _c;
+        const fields = node.selections.filter((s) => s.kind === Kind.FIELD);
+        if (fields.length === 0) {
+            return;
+        }
+        const inlineFragments = node.selections.filter((s) => s.kind === Kind.INLINE_FRAGMENT);
+        // Keep only the inline fragments in the selection set.
+        node.selections = [...inlineFragments];
+        for (const fragment of inlineFragments) {
+            const inlineFragmentType = this.schema.getType((_b = (_a = fragment.typeCondition) === null || _a === void 0 ? void 0 : _a.name.value) !== null && _b !== void 0 ? _b : '');
+            if (!inlineFragmentType || !this.isTypeWithFields(inlineFragmentType)) {
+                continue;
+            }
+            const existingFields = new Set((_c = fragment.selectionSet.selections.filter((s) => s.kind === Kind.FIELD).map((s) => s.name.value)) !== null && _c !== void 0 ? _c : []);
+            // Add interface fields to the inline fragment, but only if the fragment type defines the field.
+            // During normalization we might have parent inline fragments that include fields that would be added to
+            // the wrong inline fragments.
+            const fieldsToAdd = fields
+                .filter((field) => !existingFields.has(field.name.value))
+                .filter((field) => inlineFragmentType.getFields()[field.name.value]);
+            // Add the interface fields to the fragment. We always prepend them for now.
+            // TODO: Check if fields should be inserted in the order of appearance in the selection set.
+            fragment.selectionSet.selections = [...fieldsToAdd, ...fragment.selectionSet.selections];
+        }
+    }
+    /**
+     * Checks if an inline fragment's type condition targets an interface type.
+     *
+     * @param node - The inline fragment node to check
+     * @returns true if the fragment targets an interface type, false otherwise
+     */
+    inlineFragmentIsAbstractType(node) {
+        var _a, _b;
+        const type = this.schema.getType((_b = (_a = node.typeCondition) === null || _a === void 0 ? void 0 : _a.name.value) !== null && _b !== void 0 ? _b : '');
+        return isInterfaceType(type) || isUnionType(type);
+    }
+    /**
+     * Validates whether an inline fragment is valid for the current interface type.
+     *
+     * An inline fragment is considered valid if:
+     * - The current type is not an interface (always valid)
+     * - The fragment's type is an object type that implements the current interface
+     *
+     * Invalid fragments (those targeting types that don't implement the interface)
+     * should be removed from the selection set.
+     *
+     * @param node - The inline fragment node to validate
+     * @returns true if the fragment is valid for the current interface root context, false otherwise
+     */
+    inlineFragmentIsValidForCurrentAbstractRoot(node) {
+        var _a, _b, _c;
+        const type = this.schema.getType((_b = (_a = node.typeCondition) === null || _a === void 0 ? void 0 : _a.name.value) !== null && _b !== void 0 ? _b : '');
+        if (!type) {
+            // Type not found in schema - invalid fragment
+            return false;
+        }
+        // TODO: Check if we need to check for interface types as well because interfaces can also implement interfaces.
+        if (!isObjectType(type)) {
+            // Non-object types cannot implement interfaces
+            return false;
+        }
+        if (isObjectType(this.currentCompositeRoot)) {
+            return type.name === ((_c = this.currentCompositeRoot) === null || _c === void 0 ? void 0 : _c.name);
+        }
+        return type.getInterfaces().some((i) => { var _a; return i.name === ((_a = this.currentCompositeRoot) === null || _a === void 0 ? void 0 : _a.name); });
+    }
+    /**
+     * Type guard to check if an AST node is a FieldNode.
+     *
+     * @param node - The AST node or array of nodes to check
+     * @returns true if the node is a FieldNode, false otherwise
+     */
+    isFieldNode(node) {
+        if (Array.isArray(node)) {
+            return false;
+        }
+        return node.kind === Kind.FIELD;
+    }
+    /**
+     * Finds the named (unwrapped) type for a field by its name.
+     *
+     * This method looks up the field in the current type's fields and returns
+     * the named type (stripping away any List or NonNull wrappers).
+     *
+     * @param fieldName - The name of the field to look up
+     * @returns The named GraphQL type, or undefined if the field doesn't exist
+     */
+    findNamedTypeForField(fieldName) {
+        const fields = this.currentType.getFields();
+        const field = fields[fieldName];
+        if (!field) {
+            return undefined;
+        }
+        return getNamedType(field.type);
+    }
+    /**
+     * Type guard to check if a GraphQL type has fields.
+     *
+     * @param type - The GraphQL type to check
+     * @returns true if the type is an object type or interface type (both have getFields method)
+     */
+    isTypeWithFields(type) {
+        return isObjectType(type) || isInterfaceType(type);
+    }
+}
+//# sourceMappingURL=abstract-selection-rewriter.js.map

package/dist/src/abstract-selection-rewriter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"abstract-selection-rewriter.js","sourceRoot":"","sources":["../../src/abstract-selection-rewriter.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,EAKL,KAAK,EAEL,eAAe,EACf,IAAI,EAIJ,YAAY,EAEZ,YAAY,EAEZ,WAAW,EAEX,cAAc,EAMd,eAAe,GAChB,MAAM,SAAS,CAAC;AAMjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,OAAO,yBAAyB;IAsBpC;;;;;;OAMG;IACH,YAAY,WAAyB,EAAE,MAAqB,EAAE,UAAiC;QAvBvF,uBAAkB,GAA2B,EAAE,CAAC;QAChD,mBAAc,GAA6B,EAAE,CAAC;QACtD,oEAAoE;QAC5D,cAAS,GAA4B,EAAE,CAAC;QAChD,sGAAsG;QAC9F,mBAAc,GAAc,EAAE,CAAC;QAGvC,gFAAgF;QACxE,sBAAiB,GAAuB,EAAE,CAAC;QAE3C,wBAAmB,GAAyB,EAAE,CAAC;QACvD;mFAC2E;QACnE,0BAAqB,GAAyB,EAAE,CAAC;QAUvD,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QAC9B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,gBAAgB,EAAE,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACK,gBAAgB;QACtB,OAAO;YACL,YAAY,EAAE;gBACZ,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;gBAC/G,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;aAChH;YACD,cAAc,EAAE;gBACd,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAC5C,IAAI,CAAC,qBAAqB,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;gBACpE,KAAK,EAAE,CAAC,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,CAC5C,IAAI,CAAC,qBAAqB,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;aACrE;SACF,CAAC;IACJ,CAAC;IAED;;;;;;OAMG;IACI,SAAS;QACd,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IACxC,CAAC;IAED;;;;;;;;;;OAUG;IACK,mBAAmB,CAAC,GAAmC;QAC7D,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,OAAO;QACT,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,OAAO;QACT,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,EAAE,CAAC;YACtC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,OAAO;QACT,CAAC;QAED,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;QACtC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;QAE7B,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QACxD,CAAC;QACD,IAAI,CAAC,mBAAmB,GAAG,GAAG,CAAC,IAAI,CAAC;QAEpC,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC;YACvD,IAAI,CAAC,kBAAkB,GAAG,EAAE,CAAC;QAC/B,CAAC;QAED,IAAI,CAAC,oBAAoB,GAAG,SAAS,CAAC;QACtC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QAExD,4DAA4D;QAC5D,IAAI,cAAc,CAAC,SAAS,CAAC,EAAE,CAAC;YAC9B,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC1C,IAAI,CAAC,mCAAmC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED;;;;;;;;;OASG;IACK,mBAAmB,CAAC,GAAmC;;QAC7D,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC;YAChB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAE1C,IAAI,MAAA,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,mCAAI,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,WAAW,GAAG,MAAA,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,mCAAI,IAAI,CAAC,WAAW,CAAC;YAC5D,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,CAAC;QAC1D,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YAClC,OAAO;QACT,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,SAAS,CAAC,EAAE,CAAC;YACpD,OAAO;QACT,CAAC;QAED,IACE,eAAe,CAAC,SAAS,CAAC;YAC1B,SAAS,CAAC,IAAI,MAAK,MAAA,IAAI,CAAC,oBAAoB,0CAAE,IAAI,CAAA;YAClD,IAAI,CAAC,kBAAkB,CAAC,MAAM,KAAK,CAAC,EACpC,CAAC;YACD,IAAI,CAAC,kBAAkB,GAAG,MAAA,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,mCAAI,EAAE,CAAC;YAC1D,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC;YACzD,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;;;;;;OAkBG;IACK,qBAAqB,CAAC,GAAqC;;QACjE,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7C,OAAO;QACT,CAAC;QAED,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAExC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAA,MAAA,GAAG,CAAC,IAAI,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,mCAAI,EAAE,CAAC,CAAC;QAE3E,IAAI,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAChC,OAAO;QACT,CAAC;QAED,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1C,OAAO;QACT,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,4BAA4B,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACjD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACtC,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;YAExB,qEAAqE;YACrE,sFAAsF;YACtF,oCAAoC;YACpC,IAAI,CAAC,IAAI,CAAC,2CAA2C,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChE,IAAI,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC;gBACtC,IAAI,IAAI,CAAC,mBAAmB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACxC,MAAM,cAAc,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;oBACvD,IAAI,CAAC,cAAc,EAAE,CAAC;wBACpB,OAAO;oBACT,CAAC;oBAED,MAAM,GAAG,cAAc,CAAC,YAAY,CAAC;gBACvC,CAAC;gBAED,MAAM,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,CAC1C,CAAC,CAAC,EAAE,EAAE,eAAC,OAAA,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,IAAI,CAAA,MAAA,CAAC,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,OAAK,MAAA,GAAG,CAAC,IAAI,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,CAAA,CAAA,EAAA,CAC7G,CAAC;YACJ,CAAC;YAED,4EAA4E;YAC5E,mDAAmD;YACnD,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAE1C,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC;YAC/B,OAAO;QACT,CAAC;QAED,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEhC,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,OAAO;QACT,CAAC;QAED,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACvD,IAAI,CAAC,mCAAmC,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAEhE,MAAM,MAAM,GAAG,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC;YAC/B,OAAO;QACT,CAAC;QAED,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC;IACjC,CAAC;IAEO,qBAAqB,CAAC,GAAqC;;QACjE,IAAI,CAAC,GAAG,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7C,OAAO;QACT,CAAC;QAED,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC;QAE/B,IAAI,MAAA,IAAI,CAAC,cAAc,CAAC,GAAG,EAAE,mCAAI,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,WAAW,GAAG,MAAA,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,mCAAI,IAAI,CAAC,WAAW,CAAC;YAC5D,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,CAAC;YAC9B,2EAA2E;YAC3E,IAAI,CAAC,qBAAqB,CAAC,GAAG,EAAE,CAAC;QACnC,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,kBAAkB,CAAC,GAAG,EAAE,CAAC;QAChC,CAAC;IACH,CAAC;IAEO,eAAe,CAAC,GAAqC;QAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAEvD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO;QACT,CAAC;QAED,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;QACnD,IAAI,CAAC,mBAAmB,CAAC,GAAG,EAAE,CAAC;IACjC,CAAC;IAEO,2BAA2B,CAAC,IAAwB,EAAE,MAAwB;QACpF,MAAM,KAAK,GAAG,MAAM,CAAC,UAAU,CAAC,SAAS,CACvC,CAAC,CAAC,EAAE,EAAE,eAAC,OAAA,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,IAAI,CAAA,MAAA,CAAC,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,OAAK,MAAA,IAAI,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,CAAA,CAAA,EAAA,CACzG,CAAC;QACF,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,OAAO;QACT,CAAC;QAED,MAAM,CAAC,UAAU,GAAG;YAClB,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC;YACpC,GAAG,IAAI,CAAC,YAAY,CAAC,UAAU;YAC/B,GAAG,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;SACtC,CAAC;IACJ,CAAC;IAED;;;;;;;;;OASG;IACK,wBAAwB,CAAC,IAAwB;;QACvD,IAAI,IAAI,CAAC,mBAAmB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxC,OAAO,MAAA,IAAI,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,0CAAE,YAAY,CAAC;QACvD,CAAC;QAED,MAAM,QAAQ,GAAG,MAAA,MAAA,IAAI,CAAC,aAAa,0CAAE,IAAI,0CAAE,KAAK,CAAC;QAEjD,6DAA6D;QAC7D,IACE,MAAA,MAAA,IAAI,CAAC,mBAAmB,0CAAE,UAAU,0CAAE,IAAI,CACxC,CAAC,CAAC,EAAE,EAAE,eAAC,OAAA,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,IAAI,CAAA,MAAA,MAAA,CAAC,CAAC,aAAa,0CAAE,IAAI,0CAAE,KAAK,MAAK,QAAQ,CAAA,EAAA,CACpF,EACD,CAAC;YACD,OAAO,IAAI,CAAC,mBAAmB,CAAC;QAClC,CAAC;QAED,+DAA+D;QAC/D,0EAA0E;QAC1E,IAAI,IAAI,CAAC,qBAAqB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1C,MAAM,gBAAgB,GAAG,IAAI,CAAC,qBAAqB,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3D,IACE,MAAA,MAAA,gBAAgB,aAAhB,gBAAgB,uBAAhB,gBAAgB,CAAE,YAAY,0CAAE,UAAU,0CAAE,IAAI,CAC9C,CAAC,CAAC,EAAE,EAAE,eAAC,OAAA,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,IAAI,CAAA,MAAA,MAAA,CAAC,CAAC,aAAa,0CAAE,IAAI,0CAAE,KAAK,MAAK,QAAQ,CAAA,EAAA,CACpF,EACD,CAAC;gBACD,OAAO,gBAAgB,CAAC,YAAY,CAAC;YACvC,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,mBAAmB,CAAC;IAClC,CAAC;IAED;;;;;;;;OAQG;IACK,oBAAoB,CAAC,IAAsB;QACjD,MAAM,uBAAuB,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,CAAC,CAAC;QAC/F,IAAI,uBAAuB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzC,OAAO;QACT,CAAC;QAED,MAAM,qBAAqB,GAAyB,EAAE,CAAC;QAEvD,KAAK,MAAM,gBAAgB,IAAI,uBAAuB,EAAE,CAAC;YACvD,MAAM,cAAc,GAAG,qBAAqB,CAAC,IAAI,CAC/C,CAAC,CAAC,EAAE,EAAE,eAAC,OAAA,CAAA,MAAA,CAAC,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,OAAK,MAAA,gBAAgB,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,CAAA,CAAA,EAAA,CAClF,CAAC;YACF,IAAI,CAAC,cAAc,EAAE,CAAC;gBACpB,qBAAqB,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;gBAC7C,SAAS;YACX,CAAC;YAED,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAChC,cAAc,CAAC,YAAY,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CACrG,CAAC;YAEF,MAAM,aAAa,GAAG,gBAAgB,CAAC,YAAY,CAAC,UAAU,CAAC,MAAM,CACnE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CACtE,CAAC;YAEF,cAAc,CAAC,YAAY,CAAC,UAAU,GAAG,CAAC,GAAG,cAAc,CAAC,YAAY,CAAC,UAAU,EAAE,GAAG,aAAa,CAAC,CAAC;QACzG,CAAC;QAED,oHAAoH;QACpH,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,IAAI,CAAC,UAAU,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,qBAAqB,CAAC,CAAC;IAC1D,CAAC;IAED;;;;;;;;;;;;OAYG;IACK,0BAA0B,CAAC,IAAsB,EAAE,MAAwC;;QACjG,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAK,MAAkB,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,EAAE,CAAC;YAC/E,OAAO;QACT,CAAC;QAED,MAAM,cAAc,GAAG,MAA4B,CAAC;QACpD,MAAM,cAAc,GAAG,MAAA,MAAA,cAAc,CAAC,aAAa,0CAAE,IAAI,0CAAE,KAAK,CAAC;QACjE,IAAI,CAAC,cAAc,EAAE,CAAC;YACpB,OAAO;QACT,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;YAC9C,OAAA,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,IAAI,CAAA,MAAA,MAAA,CAAC,CAAC,aAAa,0CAAE,IAAI,0CAAE,KAAK,MAAK,cAAc;gBAChF,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,UAAU;gBAC3B,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;SAAA,CACR,CAAC;IACJ,CAAC;IAED;;;;;;;;OAQG;IACK,0BAA0B,CAAC,IAAsB;QACvD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,IAAI,CAAC,CAAC,YAAY,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAC/E,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;OAWG;IACK,0BAA0B,CAAC,IAAsB;QACvD,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzC,OAAO;QACT,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QAED,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,CAAC;QAClD,MAAM,gBAAgB,GAAG,YAAY,CAAC,GAAG,EAAE,CAAC;QAC5C,IAAI,CAAC,gBAAgB,EAAE,CAAC;YACtB,OAAO;QACT,CAAC;QAED,MAAM,uBAAuB,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,CAAC,CAAC;QAC/F,MAAM,aAAa,GAAG,IAAI,CAAC,4BAA4B,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;QACxF,MAAM,kBAAkB,GAAyB,EAAE,CAAC;QAEpD,KAAK,MAAM,YAAY,IAAI,aAAa,EAAE,CAAC;YACzC,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,WAAC,OAAA,CAAA,MAAA,CAAC,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,MAAK,YAAY,CAAC,IAAI,CAAA,EAAA,CAAC,EAAE,CAAC;gBAC5F,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC;YAC3E,CAAC;QACH,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,kBAAkB,EAAE,GAAG,uBAAuB,CAAC,CAAC;IACnF,CAAC;IAEO,4BAA4B,CAClC,oBAA0C,EAC1C,SAAiC;QAEjC,IAAI,aAAa,GAAqC,EAAE,CAAC;QACzD,aAAa,GAAG,YAAY,CAAC,oBAAoB,CAAC;YAChD,CAAC,CAAC,CAAC,oBAAoB,CAAC;YACxB,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,CAAC;QAEvD,MAAM,YAAY,GAAG,SAAS,CAAC,GAAG,EAAE,CAAC;QACrC,IAAI,CAAC,YAAY,EAAE,CAAC;YAClB,OAAO,aAAa,CAAC;QACvB,CAAC;QAED,MAAM,mBAAmB,GAAG,IAAI,CAAC,4BAA4B,CAAC,YAAY,EAAE,SAAS,CAAC,CAAC;QACvF,OAAO,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACzF,CAAC;IAED;;;;;;;;;;;OAWG;IACK,oBAAoB,CAAC,IAAuB,EAAE,MAAmB;QACvE,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,eAAe;YAC1B,UAAU,EAAE,EAAE;YACd,aAAa,EAAE;gBACb,IAAI,EAAE,IAAI,CAAC,UAAU;gBACrB,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE;aAC5C;YACD,YAAY,EAAE;gBACZ,IAAI,EAAE,IAAI,CAAC,aAAa;gBACxB,UAAU,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aACjE;SACF,CAAC;IACJ,CAAC;IAED;;;;;;;;;;;;;OAaG;IACK,mCAAmC,CAAC,IAAsB;;QAChE,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC;QACpE,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,OAAO;QACT,CAAC;QAED,MAAM,eAAe,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,eAAe,CAAC,CAAC;QAEvF,uDAAuD;QACvD,IAAI,CAAC,UAAU,GAAG,CAAC,GAAG,eAAe,CAAC,CAAC;QAEvC,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,kBAAkB,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAA,MAAA,QAAQ,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,mCAAI,EAAE,CAAC,CAAC;YACzF,IAAI,CAAC,kBAAkB,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,kBAAkB,CAAC,EAAE,CAAC;gBACtE,SAAS;YACX,CAAC;YAED,MAAM,cAAc,GAAG,IAAI,GAAG,CAC5B,MAAA,QAAQ,CAAC,YAAY,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,mCAAI,EAAE,CACrG,CAAC;YAEF,gGAAgG;YAChG,wGAAwG;YACxG,8BAA8B;YAC9B,MAAM,WAAW,GAAG,MAAM;iBACvB,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBACxD,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,kBAAkB,CAAC,SAAS,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAEvE,4EAA4E;YAC5E,4FAA4F;YAC5F,QAAQ,CAAC,YAAY,CAAC,UAAU,GAAG,CAAC,GAAG,WAAW,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;QAC3F,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,4BAA4B,CAAC,IAAwB;;QAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAA,MAAA,IAAI,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,mCAAI,EAAE,CAAC,CAAC;QACvE,OAAO,eAAe,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;IACpD,CAAC;IAED;;;;;;;;;;;;OAYG;IACK,2CAA2C,CAAC,IAAwB;;QAC1E,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAA,MAAA,IAAI,CAAC,aAAa,0CAAE,IAAI,CAAC,KAAK,mCAAI,EAAE,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,8CAA8C;YAC9C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,gHAAgH;QAChH,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,+CAA+C;YAC/C,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,YAAY,CAAC,IAAI,CAAC,oBAAoB,CAAC,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC,IAAI,MAAK,MAAA,IAAI,CAAC,oBAAoB,0CAAE,IAAI,CAAA,CAAC;QACvD,CAAC;QAED,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,WAAC,OAAA,CAAC,CAAC,IAAI,MAAK,MAAA,IAAI,CAAC,oBAAoB,0CAAE,IAAI,CAAA,CAAA,EAAA,CAAC,CAAC;IACtF,CAAC;IAED;;;;;OAKG;IACK,WAAW,CAAC,IAAsC;QACxD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACxB,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAQ,IAAgB,CAAC,IAAI,KAAK,IAAI,CAAC,KAAK,CAAC;IAC/C,CAAC;IAED;;;;;;;;OAQG;IACK,qBAAqB,CAAC,SAAiB;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,OAAO,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IAED;;;;;OAKG;IACK,gBAAgB,CAAC,IAAiB;QACxC,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,eAAe,CAAC,IAAI,CAAC,CAAC;IACrD,CAAC;CACF"}

package/dist/src/index.d.ts

@@ -40,6 +40,7 @@ export declare function compileGraphQLToProto(schemaOrSDL: GraphQLSchema | strin
 export declare function validateGraphQLSDL(sdl: string): ValidationResult;
 export * from './sdl-to-mapping-visitor.js';
 export { GraphQLToProtoTextVisitor } from './sdl-to-proto-visitor.js';
+export { RequiredFieldsVisitor } from './required-fields-visitor.js';
 export { ProtoLockManager } from './proto-lock.js';
 export { SDLValidationVisitor } from './sdl-validation-visitor.js';
 export { compileOperationsToProto } from './operation-to-proto.js';
@@ -60,4 +61,5 @@ export type { ProtoOptions } from './proto-options.js';
 export type { ProtoLock } from './proto-lock.js';
 export type { ValidationResult } from './sdl-validation-visitor.js';
 export { GRPCMapping, OperationMapping, EntityMapping, TypeFieldMapping, FieldMapping, ArgumentMapping, EnumMapping, EnumValueMapping, OperationType, } from '@wundergraph/cosmo-connect/dist/node/v1/node_pb';
+export { CONNECT_FIELD_RESOLVER, CONTEXT, EXTERNAL_DIRECTIVE_NAME, FIELDS, FIELD_ARGS, KEY_DIRECTIVE_NAME, REQUIRES_DIRECTIVE_NAME, RESULT, } from './string-constants.js';
 export { default as protobuf } from 'protobufjs';

package/dist/src/index.js

@@ -1,5 +1,5 @@
 import { buildSchema } from 'graphql';
-import { GraphQLToProtoVisitor } from './sdl-to-mapping-visitor.js';
+import { GraphQLToMappingVisitor } from './sdl-to-mapping-visitor.js';
 import { GraphQLToProtoTextVisitor } from './sdl-to-proto-visitor.js';
 import { SDLValidationVisitor } from './sdl-validation-visitor.js';
 /**
@@ -18,7 +18,7 @@ export function compileGraphQLToMapping(schemaOrSDL, serviceName = 'DefaultServi
         })
         : schemaOrSDL;
     // Create and run the visitor
-    const visitor = new GraphQLToProtoVisitor(schema, serviceName);
+    const visitor = new GraphQLToMappingVisitor(schema, serviceName);
     return visitor.visit();
 }
 /**
@@ -60,6 +60,7 @@ export function validateGraphQLSDL(sdl) {
 }
 export * from './sdl-to-mapping-visitor.js';
 export { GraphQLToProtoTextVisitor } from './sdl-to-proto-visitor.js';
+export { RequiredFieldsVisitor } from './required-fields-visitor.js';
 export { ProtoLockManager } from './proto-lock.js';
 export { SDLValidationVisitor } from './sdl-validation-visitor.js';
 // Export operation-to-proto functionality
@@ -71,6 +72,7 @@ export { buildMessageFromSelectionSet, buildFieldDefinition, buildNestedMessage,
 export { buildRequestMessage, buildInputObjectMessage, buildEnumType } from './operations/request-builder.js';
 export { rootToProtoText, serviceToProtoText, messageToProtoText, enumToProtoText, formatField, } from './operations/proto-text-generator.js';
 export { GRPCMapping, OperationMapping, EntityMapping, TypeFieldMapping, FieldMapping, ArgumentMapping, EnumMapping, EnumValueMapping, OperationType, } from '@wundergraph/cosmo-connect/dist/node/v1/node_pb';
+export { CONNECT_FIELD_RESOLVER, CONTEXT, EXTERNAL_DIRECTIVE_NAME, FIELDS, FIELD_ARGS, KEY_DIRECTIVE_NAME, REQUIRES_DIRECTIVE_NAME, RESULT, } from './string-constants.js';
 // Export protobufjs for AST manipulation
 export { default as protobuf } from 'protobufjs';
 //# sourceMappingURL=index.js.map