@wundergraph/composition 0.46.0 → 0.46.1

package/dist/resolvability-graph/walker/entity-walker/entity-walker.js

@@ -0,0 +1,194 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.EntityWalker = void 0;
+const node_resolution_data_1 = require("../../node-resolution-data/node-resolution-data");
+const utils_1 = require("../../../utils/utils");
+class EntityWalker {
+    // Prevents registering the same entity node before there has been a chance to validate it.
+    encounteredEntityNodeNames;
+    index;
+    resDataByNodeName;
+    resDataByRelativeOriginPath;
+    selectionPathByEntityNodeName = new Map();
+    // The subgraph name is so the propagated errors accurately reflect which subgraph cannot reach the node.
+    subgraphNameByUnresolvablePath;
+    visitedEntities;
+    relativeOriginPaths;
+    constructor({ encounteredEntityNodeNames, index, relativeOriginPaths, resDataByNodeName, resDataByRelativeOriginPath, subgraphNameByUnresolvablePath, visitedEntities, }) {
+        this.encounteredEntityNodeNames = encounteredEntityNodeNames;
+        this.index = index;
+        this.relativeOriginPaths = relativeOriginPaths;
+        this.resDataByNodeName = resDataByNodeName;
+        this.resDataByRelativeOriginPath = resDataByRelativeOriginPath;
+        this.visitedEntities = visitedEntities;
+        this.subgraphNameByUnresolvablePath = subgraphNameByUnresolvablePath;
+    }
+    getNodeResolutionData({ node: { fieldDataByName, nodeName, typeName }, selectionPath, }) {
+        const dataByNodeName = (0, utils_1.getValueOrDefault)(this.resDataByNodeName, nodeName, () => new node_resolution_data_1.NodeResolutionData({ fieldDataByName, typeName }));
+        if (!this.relativeOriginPaths || this.relativeOriginPaths.size < 1) {
+            return (0, utils_1.getValueOrDefault)(this.resDataByRelativeOriginPath, selectionPath, () => dataByNodeName.copy());
+        }
+        let returnData = undefined;
+        for (const path of this.relativeOriginPaths) {
+            const data = (0, utils_1.getValueOrDefault)(this.resDataByRelativeOriginPath, `${path}${selectionPath}`, () => dataByNodeName.copy());
+            returnData ??= data;
+        }
+        return returnData;
+    }
+    visitEntityDescendantEdge({ edge, selectionPath }) {
+        if (edge.isInaccessible || edge.node.isInaccessible) {
+            return { visited: false, areDescendantsResolved: false };
+        }
+        if (edge.node.isLeaf) {
+            return { visited: true, areDescendantsResolved: true };
+        }
+        if (!(0, utils_1.add)(edge.visitedIndices, this.index)) {
+            /* This check is necessary to avoid infinite loops inexpensively.
+             * If the edge has been visited before, any unresolvable will be propagated by the first instance.
+             * Descendant paths need to be cleaned up to avoid false positives.
+             */
+            this.removeUnresolvablePaths({
+                selectionPath: `${selectionPath}.${edge.edgeName}`,
+                removeDescendantPaths: true,
+            });
+            return { visited: true, areDescendantsResolved: true, isRevisitedNode: true };
+        }
+        if (edge.node.hasEntitySiblings) {
+            /* This check prevents infinite loops.
+             * The entity is only propagated into this map after it has been assessed for resolvability.
+             * Consequently, only a valid node would appear here.
+             *  */
+            if (this.visitedEntities.has(edge.node.nodeName) || this.encounteredEntityNodeNames.has(edge.node.nodeName)) {
+                return { visited: true, areDescendantsResolved: true };
+            }
+            this.encounteredEntityNodeNames.add(edge.node.nodeName);
+            (0, utils_1.getValueOrDefault)(this.selectionPathByEntityNodeName, edge.node.nodeName, () => `${selectionPath}.${edge.edgeName}`);
+            return { visited: true, areDescendantsResolved: false };
+        }
+        if (edge.node.isAbstract) {
+            return this.visitEntityDescendantAbstractNode({
+                node: edge.node,
+                selectionPath: `${selectionPath}.${edge.edgeName}`,
+            });
+        }
+        return this.visitEntityDescendantConcreteNode({
+            node: edge.node,
+            selectionPath: `${selectionPath}.${edge.edgeName}`,
+        });
+    }
+    visitEntityDescendantConcreteNode({ node, selectionPath }) {
+        if (node.headToTailEdges.size < 1) {
+            node.isLeaf = true;
+            return { visited: true, areDescendantsResolved: true };
+        }
+        const data = this.getNodeResolutionData({ node, selectionPath });
+        if (data.isResolved()) {
+            if (data.areDescendantsResolved()) {
+                return { visited: true, areDescendantsResolved: true };
+            }
+        }
+        let removeDescendantPaths = undefined;
+        for (const [fieldName, edge] of node.headToTailEdges) {
+            const { visited, areDescendantsResolved, isRevisitedNode } = this.visitEntityDescendantEdge({
+                edge,
+                selectionPath,
+            });
+            removeDescendantPaths ??= isRevisitedNode;
+            this.propagateVisitedField({
+                areDescendantsResolved,
+                fieldName,
+                data,
+                nodeName: node.nodeName,
+                selectionPath,
+                visited,
+            });
+        }
+        if (data.isResolved()) {
+            this.removeUnresolvablePaths({ removeDescendantPaths, selectionPath });
+        }
+        else {
+            this.addUnresolvablePaths({ selectionPath, subgraphName: node.subgraphName });
+        }
+        return {
+            visited: true,
+            areDescendantsResolved: data.areDescendantsResolved(),
+        };
+    }
+    visitEntityDescendantAbstractNode({ node, selectionPath }) {
+        if (node.headToTailEdges.size < 1) {
+            return { visited: true, areDescendantsResolved: true };
+        }
+        let resolvedDescendants = 0;
+        for (const edge of node.headToTailEdges.values()) {
+            // Propagate any one of the abstract path failures.
+            if (this.visitEntityDescendantEdge({ edge, selectionPath }).areDescendantsResolved) {
+                resolvedDescendants += 1;
+            }
+        }
+        return { visited: true, areDescendantsResolved: resolvedDescendants === node.headToTailEdges.size };
+    }
+    propagateVisitedField({ areDescendantsResolved, data, fieldName, nodeName, selectionPath, visited, }) {
+        if (!visited) {
+            return;
+        }
+        const dataByNodeName = (0, utils_1.getValueOrDefault)(this.resDataByNodeName, nodeName, () => data.copy());
+        data.addResolvedFieldName(fieldName);
+        dataByNodeName.addResolvedFieldName(fieldName);
+        if (areDescendantsResolved) {
+            /* Cannot propagate`areDescendantsResolved` to `dataByNodeName` because the context
+             * of `data` is not isolated to the graph being walked only.
+             */
+            data.resolvedDescendantNames.add(fieldName);
+        }
+        if (this.relativeOriginPaths) {
+            for (const originPath of this.relativeOriginPaths) {
+                const originData = (0, utils_1.getValueOrDefault)(this.resDataByRelativeOriginPath, `${originPath}${selectionPath}`, () => data.copy());
+                originData.addResolvedFieldName(fieldName);
+                if (areDescendantsResolved) {
+                    originData.resolvedDescendantNames.add(fieldName);
+                }
+            }
+            return;
+        }
+        const originData = (0, utils_1.getValueOrDefault)(this.resDataByRelativeOriginPath, selectionPath, () => data.copy());
+        originData.addResolvedFieldName(fieldName);
+        if (areDescendantsResolved) {
+            originData.resolvedDescendantNames.add(fieldName);
+        }
+    }
+    addUnresolvablePaths({ selectionPath, subgraphName }) {
+        if (!this.relativeOriginPaths) {
+            (0, utils_1.getValueOrDefault)(this.subgraphNameByUnresolvablePath, selectionPath, () => subgraphName);
+            return;
+        }
+        for (const path of this.relativeOriginPaths) {
+            (0, utils_1.getValueOrDefault)(this.subgraphNameByUnresolvablePath, `${path}${selectionPath}`, () => subgraphName);
+        }
+    }
+    removeUnresolvablePaths({ selectionPath, removeDescendantPaths }) {
+        if (!this.relativeOriginPaths) {
+            this.subgraphNameByUnresolvablePath.delete(selectionPath);
+            if (removeDescendantPaths) {
+                for (const unresolvablePath of this.subgraphNameByUnresolvablePath.keys()) {
+                    if (unresolvablePath.startsWith(selectionPath)) {
+                        this.subgraphNameByUnresolvablePath.delete(unresolvablePath);
+                    }
+                }
+            }
+            return;
+        }
+        for (const originPath of this.relativeOriginPaths) {
+            const fullPath = `${originPath}${selectionPath}`;
+            this.subgraphNameByUnresolvablePath.delete(fullPath);
+            if (removeDescendantPaths) {
+                for (const unresolvablePath of this.subgraphNameByUnresolvablePath.keys()) {
+                    if (unresolvablePath.startsWith(fullPath)) {
+                        this.subgraphNameByUnresolvablePath.delete(unresolvablePath);
+                    }
+                }
+            }
+        }
+    }
+}
+exports.EntityWalker = EntityWalker;
+//# sourceMappingURL=entity-walker.js.map

package/dist/resolvability-graph/walker/entity-walker/entity-walker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entity-walker.js","sourceRoot":"","sources":["../../../../src/resolvability-graph/walker/entity-walker/entity-walker.ts"],"names":[],"mappings":";;;AAAA,0FAAqF;AAWrF,gDAA8D;AAE9D,MAAa,YAAY;IACvB,2FAA2F;IAC3F,0BAA0B,CAAgB;IAC1C,KAAK,CAAS;IACd,iBAAiB,CAAoC;IACrD,2BAA2B,CAAyC;IACpE,6BAA6B,GAAG,IAAI,GAAG,EAA2B,CAAC;IACnE,yGAAyG;IACzG,8BAA8B,CAAmC;IACjE,eAAe,CAAgB;IAC/B,mBAAmB,CAAsB;IAEzC,YAAY,EACV,0BAA0B,EAC1B,KAAK,EACL,mBAAmB,EACnB,iBAAiB,EACjB,2BAA2B,EAC3B,8BAA8B,EAC9B,eAAe,GACI;QACnB,IAAI,CAAC,0BAA0B,GAAG,0BAA0B,CAAC;QAC7D,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,CAAC;QAC/C,IAAI,CAAC,iBAAiB,GAAG,iBAAiB,CAAC;QAC3C,IAAI,CAAC,2BAA2B,GAAG,2BAA2B,CAAC;QAC/D,IAAI,CAAC,eAAe,GAAG,eAAe,CAAC;QACvC,IAAI,CAAC,8BAA8B,GAAG,8BAA8B,CAAC;IACvE,CAAC;IAED,qBAAqB,CAAC,EACpB,IAAI,EAAE,EAAE,eAAe,EAAE,QAAQ,EAAE,QAAQ,EAAE,EAC7C,aAAa,GACe;QAC5B,MAAM,cAAc,GAAG,IAAA,yBAAiB,EACtC,IAAI,CAAC,iBAAiB,EACtB,QAAQ,EACR,GAAG,EAAE,CAAC,IAAI,yCAAkB,CAAC,EAAE,eAAe,EAAE,QAAQ,EAAE,CAAC,CAC5D,CAAC;QACF,IAAI,CAAC,IAAI,CAAC,mBAAmB,IAAI,IAAI,CAAC,mBAAmB,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACnE,OAAO,IAAA,yBAAiB,EAAC,IAAI,CAAC,2BAA2B,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC;QACzG,CAAC;QACD,IAAI,UAAU,GAAmC,SAAS,CAAC;QAC3D,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC5C,MAAM,IAAI,GAAG,IAAA,yBAAiB,EAAC,IAAI,CAAC,2BAA2B,EAAE,GAAG,IAAI,GAAG,aAAa,EAAE,EAAE,GAAG,EAAE,CAC/F,cAAc,CAAC,IAAI,EAAE,CACtB,CAAC;YACF,UAAU,KAAK,IAAI,CAAC;QACtB,CAAC;QACD,OAAO,UAAW,CAAC;IACrB,CAAC;IAED,yBAAyB,CAAC,EAAE,IAAI,EAAE,aAAa,EAAmC;QAChF,IAAI,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YACpD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,CAAC;QAC3D,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACrB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD,IAAI,CAAC,IAAA,WAAG,EAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1C;;;eAGG;YACH,IAAI,CAAC,uBAAuB,CAAC;gBAC3B,aAAa,EAAE,GAAG,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE;gBAClD,qBAAqB,EAAE,IAAI;aAC5B,CAAC,CAAC;YACH,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,eAAe,EAAE,IAAI,EAAE,CAAC;QAChF,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAChC;;;kBAGM;YACN,IAAI,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC5G,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;YACzD,CAAC;YACD,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACxD,IAAA,yBAAiB,EACf,IAAI,CAAC,6BAA6B,EAClC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,GAAG,EAAE,CAAC,GAAG,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE,CAC1C,CAAC;YACF,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,KAAK,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,iCAAiC,CAAC;gBAC5C,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,aAAa,EAAE,GAAG,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE;aACnD,CAAC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC,iCAAiC,CAAC;YAC5C,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,aAAa,EAAE,GAAG,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE;SACnD,CAAC,CAAC;IACL,CAAC;IAED,iCAAiC,CAAC,EAAE,IAAI,EAAE,aAAa,EAAmC;QACxF,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,qBAAqB,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;QACjE,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACtB,IAAI,IAAI,CAAC,sBAAsB,EAAE,EAAE,CAAC;gBAClC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;YACzD,CAAC;QACH,CAAC;QACD,IAAI,qBAAqB,GAAqB,SAAS,CAAC;QACxD,KAAK,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YACrD,MAAM,EAAE,OAAO,EAAE,sBAAsB,EAAE,eAAe,EAAE,GAAG,IAAI,CAAC,yBAAyB,CAAC;gBAC1F,IAAI;gBACJ,aAAa;aACd,CAAC,CAAC;YACH,qBAAqB,KAAK,eAAe,CAAC;YAC1C,IAAI,CAAC,qBAAqB,CAAC;gBACzB,sBAAsB;gBACtB,SAAS;gBACT,IAAI;gBACJ,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,aAAa;gBACb,OAAO;aACR,CAAC,CAAC;QACL,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACtB,IAAI,CAAC,uBAAuB,CAAC,EAAE,qBAAqB,EAAE,aAAa,EAAE,CAAC,CAAC;QACzE,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,oBAAoB,CAAC,EAAE,aAAa,EAAE,YAAY,EAAE,IAAI,CAAC,YAAY,EAAE,CAAC,CAAC;QAChF,CAAC;QACD,OAAO;YACL,OAAO,EAAE,IAAI;YACb,sBAAsB,EAAE,IAAI,CAAC,sBAAsB,EAAE;SACtD,CAAC;IACJ,CAAC;IAED,iCAAiC,CAAC,EAAE,IAAI,EAAE,aAAa,EAAmC;QACxF,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAClC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,mDAAmD;YACnD,IAAI,IAAI,CAAC,yBAAyB,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC,sBAAsB,EAAE,CAAC;gBACnF,mBAAmB,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,mBAAmB,KAAK,IAAI,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;IACtG,CAAC;IAED,qBAAqB,CAAC,EACpB,sBAAsB,EACtB,IAAI,EACJ,SAAS,EACT,QAAQ,EACR,aAAa,EACb,OAAO,GACqB;QAC5B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QACD,MAAM,cAAc,GAAG,IAAA,yBAAiB,EAAC,IAAI,CAAC,iBAAiB,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9F,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QACrC,cAAc,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,sBAAsB,EAAE,CAAC;YAC3B;;eAEG;YACH,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC9C,CAAC;QACD,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC7B,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;gBAClD,MAAM,UAAU,GAAG,IAAA,yBAAiB,EAAC,IAAI,CAAC,2BAA2B,EAAE,GAAG,UAAU,GAAG,aAAa,EAAE,EAAE,GAAG,EAAE,CAC3G,IAAI,CAAC,IAAI,EAAE,CACZ,CAAC;gBACF,UAAU,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;gBAC3C,IAAI,sBAAsB,EAAE,CAAC;oBAC3B,UAAU,CAAC,uBAAuB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACpD,CAAC;YACH,CAAC;YACD,OAAO;QACT,CAAC;QACD,MAAM,UAAU,GAAG,IAAA,yBAAiB,EAAC,IAAI,CAAC,2BAA2B,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACzG,UAAU,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAC3C,IAAI,sBAAsB,EAAE,CAAC;YAC3B,UAAU,CAAC,uBAAuB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACpD,CAAC;IACH,CAAC;IAED,oBAAoB,CAAC,EAAE,aAAa,EAAE,YAAY,EAA8B;QAC9E,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC9B,IAAA,yBAAiB,EAAC,IAAI,CAAC,8BAA8B,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;YAC1F,OAAO;QACT,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC5C,IAAA,yBAAiB,EAAC,IAAI,CAAC,8BAA8B,EAAE,GAAG,IAAI,GAAG,aAAa,EAAE,EAAE,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC;QACxG,CAAC;IACH,CAAC;IAED,uBAAuB,CAAC,EAAE,aAAa,EAAE,qBAAqB,EAAiC;QAC7F,IAAI,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC9B,IAAI,CAAC,8BAA8B,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;YAC1D,IAAI,qBAAqB,EAAE,CAAC;gBAC1B,KAAK,MAAM,gBAAgB,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,EAAE,CAAC;oBAC1E,IAAI,gBAAgB,CAAC,UAAU,CAAC,aAAa,CAAC,EAAE,CAAC;wBAC/C,IAAI,CAAC,8BAA8B,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;oBAC/D,CAAC;gBACH,CAAC;YACH,CAAC;YACD,OAAO;QACT,CAAC;QACD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAClD,MAAM,QAAQ,GAAG,GAAG,UAAU,GAAG,aAAa,EAAE,CAAC;YACjD,IAAI,CAAC,8BAA8B,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YACrD,IAAI,qBAAqB,EAAE,CAAC;gBAC1B,KAAK,MAAM,gBAAgB,IAAI,IAAI,CAAC,8BAA8B,CAAC,IAAI,EAAE,EAAE,CAAC;oBAC1E,IAAI,gBAAgB,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC1C,IAAI,CAAC,8BAA8B,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC;oBAC/D,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AA/ND,oCA+NC"}

package/dist/resolvability-graph/walker/entity-walker/types/params.d.ts

@@ -0,0 +1,40 @@
+import { FieldName, NodeName, SelectionPath, SubgraphName } from '../../../types/types';
+import { Edge, GraphNode } from '../../../graph-nodes';
+import { NodeResolutionData } from '../../../node-resolution-data/node-resolution-data';
+export type EntityWalkerParams = {
+    encounteredEntityNodeNames: Set<NodeName>;
+    index: number;
+    resDataByNodeName: Map<NodeName, NodeResolutionData>;
+    resDataByRelativeOriginPath: Map<SelectionPath, NodeResolutionData>;
+    relativeOriginPaths?: Set<SelectionPath>;
+    subgraphNameByUnresolvablePath: Map<SelectionPath, SubgraphName>;
+    visitedEntities: Set<NodeName>;
+};
+export type VisitEntityDescendantEdgeParams = {
+    edge: Edge;
+    selectionPath: SelectionPath;
+};
+export type VisitEntityDescendantNodeParams = {
+    node: GraphNode;
+    selectionPath: SelectionPath;
+};
+export type PropagateVisitedFieldParams = {
+    areDescendantsResolved: boolean;
+    data: NodeResolutionData;
+    fieldName: FieldName;
+    nodeName: NodeName;
+    selectionPath: SelectionPath;
+    visited: boolean;
+};
+export type GetNodeResolutionDataParams = {
+    node: GraphNode;
+    selectionPath: SelectionPath;
+};
+export type AddUnresolvablePathsParams = {
+    selectionPath: SelectionPath;
+    subgraphName: SubgraphName;
+};
+export type RemoveUnresolvablePathsParams = {
+    selectionPath: SelectionPath;
+    removeDescendantPaths?: boolean;
+};

package/dist/resolvability-graph/walker/entity-walker/types/params.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=params.js.map

package/dist/resolvability-graph/walker/entity-walker/types/params.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"params.js","sourceRoot":"","sources":["../../../../../src/resolvability-graph/walker/entity-walker/types/params.ts"],"names":[],"mappings":""}

package/dist/resolvability-graph/walker/root-field-walkers/root-field-walker.d.ts

@@ -0,0 +1,23 @@
+import { GetNodeResolutionDataParams, PropagateVisitedFieldParams, PropagateVisitedSharedFieldParams, RootFieldWalkerParams, VisitEdgeParams, VisitNodeParams, VisitRootFieldEdgesParams } from './types/params';
+import { NodeName, VisitNodeResult } from '../../types/types';
+import { NodeResolutionData } from '../../node-resolution-data/node-resolution-data';
+export declare class RootFieldWalker {
+    index: number;
+    resDataByNodeName: Map<NodeName, NodeResolutionData>;
+    resDataByPath: Map<string, NodeResolutionData>;
+    entityNodeNamesByPath: Map<string, Set<`${string}.${string}`>>;
+    pathsByEntityNodeName: Map<`${string}.${string}`, Set<string>>;
+    unresolvablePaths: Set<string>;
+    constructor({ index, nodeResolutionDataByNodeName }: RootFieldWalkerParams);
+    visitEdge({ edge, selectionPath }: VisitEdgeParams): VisitNodeResult;
+    visitAbstractNode({ node, selectionPath }: VisitNodeParams): VisitNodeResult;
+    visitConcreteNode({ node, selectionPath }: VisitNodeParams): VisitNodeResult;
+    visitSharedEdge({ edge, selectionPath }: VisitEdgeParams): VisitNodeResult;
+    visitSharedAbstractNode({ node, selectionPath }: VisitNodeParams): VisitNodeResult;
+    visitSharedConcreteNode({ node, selectionPath }: VisitNodeParams): VisitNodeResult;
+    getNodeResolutionData({ node, selectionPath }: GetNodeResolutionDataParams): NodeResolutionData;
+    getSharedNodeResolutionData({ node, selectionPath }: GetNodeResolutionDataParams): NodeResolutionData;
+    propagateVisitedField({ areDescendantsResolved, data, fieldName, node, selectionPath, visited, }: PropagateVisitedFieldParams): void;
+    propagateSharedVisitedField({ areDescendantsResolved, data, fieldName, node, visited, }: PropagateVisitedSharedFieldParams): void;
+    visitRootFieldEdges({ edges, rootTypeName }: VisitRootFieldEdgesParams): VisitNodeResult;
+}

package/dist/resolvability-graph/walker/root-field-walkers/root-field-walker.js

@@ -0,0 +1,250 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.RootFieldWalker = void 0;
+const utils_1 = require("../../../utils/utils");
+const node_resolution_data_1 = require("../../node-resolution-data/node-resolution-data");
+class RootFieldWalker {
+    index;
+    resDataByNodeName;
+    resDataByPath = new Map();
+    // Used by shared root fields.
+    entityNodeNamesByPath = new Map();
+    // Used by unshared root fields.
+    pathsByEntityNodeName = new Map();
+    unresolvablePaths = new Set();
+    constructor({ index, nodeResolutionDataByNodeName }) {
+        this.index = index;
+        this.resDataByNodeName = nodeResolutionDataByNodeName;
+    }
+    visitEdge({ edge, selectionPath }) {
+        if (edge.isInaccessible || edge.node.isInaccessible) {
+            return { visited: false, areDescendantsResolved: true };
+        }
+        if (edge.node.isLeaf) {
+            return { visited: true, areDescendantsResolved: true };
+        }
+        if (!(0, utils_1.add)(edge.visitedIndices, this.index)) {
+            return { visited: true, areDescendantsResolved: true };
+        }
+        /* Check for siblings rather than entity edges.
+         * This is because resolvable: false and unsatisfied edges are not propagated.
+         * In these cases, the error message explains the specific reason the jump cannot happen.
+         */
+        if (edge.node.hasEntitySiblings) {
+            /* This check prevents infinite loops.
+             * The entity is only propagated into this map after it has been assessed for resolvability.
+             * Consequently, only a valid node would appear here.
+             *  */
+            if (this.resDataByNodeName.has(edge.node.nodeName)) {
+                return { visited: true, areDescendantsResolved: true };
+            }
+            (0, utils_1.getValueOrDefault)(this.pathsByEntityNodeName, edge.node.nodeName, () => new Set()).add(`${selectionPath}.${edge.edgeName}`);
+            return { visited: true, areDescendantsResolved: false };
+        }
+        if (edge.node.isAbstract) {
+            return this.visitAbstractNode({
+                node: edge.node,
+                selectionPath: `${selectionPath}.${edge.edgeName}`,
+            });
+        }
+        return this.visitConcreteNode({
+            node: edge.node,
+            selectionPath: `${selectionPath}.${edge.edgeName}`,
+        });
+    }
+    visitAbstractNode({ node, selectionPath }) {
+        if (node.headToTailEdges.size < 1) {
+            return { visited: true, areDescendantsResolved: true };
+        }
+        let resolvedDescendants = 0;
+        for (const edge of node.headToTailEdges.values()) {
+            // Propagate any one of the abstract path failures.
+            if (this.visitEdge({ edge, selectionPath }).areDescendantsResolved) {
+                resolvedDescendants += 1;
+            }
+        }
+        return {
+            visited: true,
+            areDescendantsResolved: resolvedDescendants === node.headToTailEdges.size,
+        };
+    }
+    visitConcreteNode({ node, selectionPath }) {
+        if (node.headToTailEdges.size < 1) {
+            node.isLeaf = true;
+            return { visited: true, areDescendantsResolved: true };
+        }
+        const existingData = this.resDataByNodeName.get(node.nodeName);
+        if (existingData) {
+            return { visited: true, areDescendantsResolved: existingData.areDescendantsResolved() };
+        }
+        const data = this.getNodeResolutionData({ node, selectionPath });
+        if (data.isResolved() && data.areDescendantsResolved()) {
+            return {
+                visited: true,
+                areDescendantsResolved: true,
+            };
+        }
+        for (const [fieldName, edge] of node.headToTailEdges) {
+            const { visited, areDescendantsResolved } = this.visitEdge({ edge, selectionPath });
+            this.propagateVisitedField({
+                areDescendantsResolved,
+                fieldName,
+                data,
+                node,
+                selectionPath,
+                visited,
+            });
+        }
+        if (data.isResolved()) {
+            this.unresolvablePaths.delete(selectionPath);
+        }
+        else {
+            this.unresolvablePaths.add(selectionPath);
+        }
+        return {
+            visited: true,
+            areDescendantsResolved: data.areDescendantsResolved(),
+        };
+    }
+    visitSharedEdge({ edge, selectionPath }) {
+        if (edge.isInaccessible || edge.node.isInaccessible) {
+            return { visited: false, areDescendantsResolved: true };
+        }
+        if (edge.node.isLeaf) {
+            return { visited: true, areDescendantsResolved: true };
+        }
+        if (!(0, utils_1.add)(edge.visitedIndices, this.index)) {
+            return { visited: true, areDescendantsResolved: true };
+        }
+        /* Check for siblings rather than entity edges.
+         * This is because resolvable: false and unsatisfied edges are not propagated.
+         * In these cases, the error message explains the specific reason the jump cannot happen.
+         */
+        if (edge.node.hasEntitySiblings) {
+            (0, utils_1.getValueOrDefault)(this.entityNodeNamesByPath, `${selectionPath}.${edge.edgeName}`, () => new Set()).add(edge.node.nodeName);
+        }
+        if (edge.node.isAbstract) {
+            return this.visitSharedAbstractNode({
+                node: edge.node,
+                selectionPath: `${selectionPath}.${edge.edgeName}`,
+            });
+        }
+        return this.visitSharedConcreteNode({
+            node: edge.node,
+            selectionPath: `${selectionPath}.${edge.edgeName}`,
+        });
+    }
+    visitSharedAbstractNode({ node, selectionPath }) {
+        if (node.headToTailEdges.size < 1) {
+            return { visited: true, areDescendantsResolved: true };
+        }
+        let resolvedDescendants = 0;
+        for (const edge of node.headToTailEdges.values()) {
+            // Propagate any one of the abstract path failures.
+            if (this.visitSharedEdge({ edge, selectionPath }).areDescendantsResolved) {
+                resolvedDescendants += 1;
+            }
+        }
+        return {
+            visited: true,
+            areDescendantsResolved: resolvedDescendants === node.headToTailEdges.size,
+        };
+    }
+    visitSharedConcreteNode({ node, selectionPath }) {
+        if (node.headToTailEdges.size < 1) {
+            node.isLeaf = true;
+            return { visited: true, areDescendantsResolved: true };
+        }
+        const data = this.getSharedNodeResolutionData({ node, selectionPath });
+        if (data.isResolved() && data.areDescendantsResolved()) {
+            return {
+                visited: true,
+                areDescendantsResolved: true,
+            };
+        }
+        for (const [fieldName, edge] of node.headToTailEdges) {
+            const { visited, areDescendantsResolved } = this.visitSharedEdge({ edge, selectionPath });
+            this.propagateSharedVisitedField({
+                areDescendantsResolved,
+                data,
+                fieldName,
+                node,
+                visited,
+            });
+        }
+        if (data.isResolved()) {
+            this.unresolvablePaths.delete(selectionPath);
+        }
+        else {
+            this.unresolvablePaths.add(selectionPath);
+        }
+        return {
+            visited: true,
+            areDescendantsResolved: data.areDescendantsResolved(),
+        };
+    }
+    getNodeResolutionData({ node, selectionPath }) {
+        const data = (0, utils_1.getValueOrDefault)(this.resDataByNodeName, node.nodeName, () => new node_resolution_data_1.NodeResolutionData({
+            fieldDataByName: node.fieldDataByName,
+            typeName: node.typeName,
+        }));
+        (0, utils_1.getValueOrDefault)(this.resDataByPath, selectionPath, () => data.copy());
+        return data;
+    }
+    getSharedNodeResolutionData({ node, selectionPath }) {
+        const dataByNodeName = (0, utils_1.getValueOrDefault)(this.resDataByNodeName, node.nodeName, () => new node_resolution_data_1.NodeResolutionData({
+            fieldDataByName: node.fieldDataByName,
+            typeName: node.typeName,
+        }));
+        return (0, utils_1.getValueOrDefault)(this.resDataByPath, selectionPath, () => dataByNodeName.copy());
+    }
+    propagateVisitedField({ areDescendantsResolved, data, fieldName, node, selectionPath, visited, }) {
+        if (!visited) {
+            return;
+        }
+        data.addResolvedFieldName(fieldName);
+        const dataBySelectionPath = (0, utils_1.getValueOrDefault)(this.resDataByPath, selectionPath, () => new node_resolution_data_1.NodeResolutionData({
+            fieldDataByName: node.fieldDataByName,
+            typeName: node.typeName,
+        }));
+        dataBySelectionPath.addResolvedFieldName(fieldName);
+        if (!areDescendantsResolved) {
+            return;
+        }
+        data.resolvedDescendantNames.add(fieldName);
+        dataBySelectionPath.resolvedDescendantNames.add(fieldName);
+    }
+    propagateSharedVisitedField({ areDescendantsResolved, data, fieldName, node, visited, }) {
+        if (!visited) {
+            return;
+        }
+        data.addResolvedFieldName(fieldName);
+        const dataByNodeName = (0, utils_1.getValueOrDefault)(this.resDataByNodeName, node.nodeName, () => new node_resolution_data_1.NodeResolutionData({
+            fieldDataByName: node.fieldDataByName,
+            typeName: node.typeName,
+        }));
+        dataByNodeName.addResolvedFieldName(fieldName);
+        if (!areDescendantsResolved) {
+            return;
+        }
+        data.resolvedDescendantNames.add(fieldName);
+        dataByNodeName.resolvedDescendantNames.add(fieldName);
+    }
+    visitRootFieldEdges({ edges, rootTypeName }) {
+        const isShared = edges.length > 1;
+        for (const edge of edges) {
+            if (edge.isInaccessible) {
+                return { visited: false, areDescendantsResolved: false };
+            }
+            const result = isShared
+                ? this.visitSharedEdge({ edge, selectionPath: rootTypeName })
+                : this.visitEdge({ edge, selectionPath: rootTypeName });
+            if (result.areDescendantsResolved) {
+                return result;
+            }
+        }
+        return { visited: true, areDescendantsResolved: false };
+    }
+}
+exports.RootFieldWalker = RootFieldWalker;
+//# sourceMappingURL=root-field-walker.js.map

package/dist/resolvability-graph/walker/root-field-walkers/root-field-walker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"root-field-walker.js","sourceRoot":"","sources":["../../../../src/resolvability-graph/walker/root-field-walkers/root-field-walker.ts"],"names":[],"mappings":";;;AASA,gDAA8D;AAE9D,0FAAqF;AAErF,MAAa,eAAe;IAC1B,KAAK,CAAS;IACd,iBAAiB,CAAoC;IACrD,aAAa,GAAG,IAAI,GAAG,EAAqC,CAAC;IAC7D,8BAA8B;IAC9B,qBAAqB,GAAG,IAAI,GAAG,EAAgC,CAAC;IAChE,gCAAgC;IAChC,qBAAqB,GAAG,IAAI,GAAG,EAAgC,CAAC;IAChE,iBAAiB,GAAG,IAAI,GAAG,EAAiB,CAAC;IAE7C,YAAY,EAAE,KAAK,EAAE,4BAA4B,EAAyB;QACxE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,iBAAiB,GAAG,4BAA4B,CAAC;IACxD,CAAC;IAED,SAAS,CAAC,EAAE,IAAI,EAAE,aAAa,EAAmB;QAChD,IAAI,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YACpD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACrB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD,IAAI,CAAC,IAAA,WAAG,EAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD;;;WAGG;QACH,IAAI,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAChC;;;kBAGM;YACN,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACnD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;YACzD,CAAC;YACD,IAAA,yBAAiB,EAAC,IAAI,CAAC,qBAAqB,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,IAAI,GAAG,EAAiB,CAAC,CAAC,GAAG,CACnG,GAAG,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE,CACpC,CAAC;YACF,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,KAAK,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,iBAAiB,CAAC;gBAC5B,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,aAAa,EAAE,GAAG,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE;aACnD,CAAC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC,iBAAiB,CAAC;YAC5B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,aAAa,EAAE,GAAG,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE;SACnD,CAAC,CAAC;IACL,CAAC;IAED,iBAAiB,CAAC,EAAE,IAAI,EAAE,aAAa,EAAmB;QACxD,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAClC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,mDAAmD;YACnD,IAAI,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC,sBAAsB,EAAE,CAAC;gBACnE,mBAAmB,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO;YACL,OAAO,EAAE,IAAI;YACb,sBAAsB,EAAE,mBAAmB,KAAK,IAAI,CAAC,eAAe,CAAC,IAAI;SAC1E,CAAC;IACJ,CAAC;IAED,iBAAiB,CAAC,EAAE,IAAI,EAAE,aAAa,EAAmB;QACxD,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD,MAAM,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/D,IAAI,YAAY,EAAE,CAAC;YACjB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,YAAY,CAAC,sBAAsB,EAAE,EAAE,CAAC;QAC1F,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,qBAAqB,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;QACjE,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,sBAAsB,EAAE,EAAE,CAAC;YACvD,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,sBAAsB,EAAE,IAAI;aAC7B,CAAC;QACJ,CAAC;QACD,KAAK,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YACrD,MAAM,EAAE,OAAO,EAAE,sBAAsB,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;YACpF,IAAI,CAAC,qBAAqB,CAAC;gBACzB,sBAAsB;gBACtB,SAAS;gBACT,IAAI;gBACJ,IAAI;gBACJ,aAAa;gBACb,OAAO;aACR,CAAC,CAAC;QACL,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACtB,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QAC/C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO;YACL,OAAO,EAAE,IAAI;YACb,sBAAsB,EAAE,IAAI,CAAC,sBAAsB,EAAE;SACtD,CAAC;IACJ,CAAC;IAED,eAAe,CAAC,EAAE,IAAI,EAAE,aAAa,EAAmB;QACtD,IAAI,IAAI,CAAC,cAAc,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YACpD,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QAC1D,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACrB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD,IAAI,CAAC,IAAA,WAAG,EAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1C,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD;;;WAGG;QACH,IAAI,IAAI,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC;YAChC,IAAA,yBAAiB,EACf,IAAI,CAAC,qBAAqB,EAC1B,GAAG,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE,EACnC,GAAG,EAAE,CAAC,IAAI,GAAG,EAAiB,CAC/B,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC5B,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,uBAAuB,CAAC;gBAClC,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,aAAa,EAAE,GAAG,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE;aACnD,CAAC,CAAC;QACL,CAAC;QACD,OAAO,IAAI,CAAC,uBAAuB,CAAC;YAClC,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,aAAa,EAAE,GAAG,aAAa,IAAI,IAAI,CAAC,QAAQ,EAAE;SACnD,CAAC,CAAC;IACL,CAAC;IAED,uBAAuB,CAAC,EAAE,IAAI,EAAE,aAAa,EAAmB;QAC9D,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAClC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD,IAAI,mBAAmB,GAAG,CAAC,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,mDAAmD;YACnD,IAAI,IAAI,CAAC,eAAe,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC,sBAAsB,EAAE,CAAC;gBACzE,mBAAmB,IAAI,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO;YACL,OAAO,EAAE,IAAI;YACb,sBAAsB,EAAE,mBAAmB,KAAK,IAAI,CAAC,eAAe,CAAC,IAAI;SAC1E,CAAC;IACJ,CAAC;IAED,uBAAuB,CAAC,EAAE,IAAI,EAAE,aAAa,EAAmB;QAC9D,IAAI,IAAI,CAAC,eAAe,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;YACnB,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,IAAI,EAAE,CAAC;QACzD,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,2BAA2B,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;QACvE,IAAI,IAAI,CAAC,UAAU,EAAE,IAAI,IAAI,CAAC,sBAAsB,EAAE,EAAE,CAAC;YACvD,OAAO;gBACL,OAAO,EAAE,IAAI;gBACb,sBAAsB,EAAE,IAAI;aAC7B,CAAC;QACJ,CAAC;QACD,KAAK,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,eAAe,EAAE,CAAC;YACrD,MAAM,EAAE,OAAO,EAAE,sBAAsB,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;YAC1F,IAAI,CAAC,2BAA2B,CAAC;gBAC/B,sBAAsB;gBACtB,IAAI;gBACJ,SAAS;gBACT,IAAI;gBACJ,OAAO;aACR,CAAC,CAAC;QACL,CAAC;QACD,IAAI,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;YACtB,IAAI,CAAC,iBAAiB,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;QAC/C,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO;YACL,OAAO,EAAE,IAAI;YACb,sBAAsB,EAAE,IAAI,CAAC,sBAAsB,EAAE;SACtD,CAAC;IACJ,CAAC;IACD,qBAAqB,CAAC,EAAE,IAAI,EAAE,aAAa,EAA+B;QACxE,MAAM,IAAI,GAAG,IAAA,yBAAiB,EAC5B,IAAI,CAAC,iBAAiB,EACtB,IAAI,CAAC,QAAQ,EACb,GAAG,EAAE,CACH,IAAI,yCAAkB,CAAC;YACrB,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC,CACL,CAAC;QACF,IAAA,yBAAiB,EAAC,IAAI,CAAC,aAAa,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACxE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2BAA2B,CAAC,EAAE,IAAI,EAAE,aAAa,EAA+B;QAC9E,MAAM,cAAc,GAAG,IAAA,yBAAiB,EACtC,IAAI,CAAC,iBAAiB,EACtB,IAAI,CAAC,QAAQ,EACb,GAAG,EAAE,CACH,IAAI,yCAAkB,CAAC;YACrB,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC,CACL,CAAC;QACF,OAAO,IAAA,yBAAiB,EAAC,IAAI,CAAC,aAAa,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC,CAAC;IAC3F,CAAC;IAED,qBAAqB,CAAC,EACpB,sBAAsB,EACtB,IAAI,EACJ,SAAS,EACT,IAAI,EACJ,aAAa,EACb,OAAO,GACqB;QAC5B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QACD,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QACrC,MAAM,mBAAmB,GAAG,IAAA,yBAAiB,EAC3C,IAAI,CAAC,aAAa,EAClB,aAAa,EACb,GAAG,EAAE,CACH,IAAI,yCAAkB,CAAC;YACrB,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC,CACL,CAAC;QACF,mBAAmB,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QACpD,IAAI,CAAC,sBAAsB,EAAE,CAAC;YAC5B,OAAO;QACT,CAAC;QACD,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,mBAAmB,CAAC,uBAAuB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC7D,CAAC;IAED,2BAA2B,CAAC,EAC1B,sBAAsB,EACtB,IAAI,EACJ,SAAS,EACT,IAAI,EACJ,OAAO,GAC2B;QAClC,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO;QACT,CAAC;QACD,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QACrC,MAAM,cAAc,GAAG,IAAA,yBAAiB,EACtC,IAAI,CAAC,iBAAiB,EACtB,IAAI,CAAC,QAAQ,EACb,GAAG,EAAE,CACH,IAAI,yCAAkB,CAAC;YACrB,eAAe,EAAE,IAAI,CAAC,eAAe;YACrC,QAAQ,EAAE,IAAI,CAAC,QAAQ;SACxB,CAAC,CACL,CAAC;QACF,cAAc,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;QAC/C,IAAI,CAAC,sBAAsB,EAAE,CAAC;YAC5B,OAAO;QACT,CAAC;QACD,IAAI,CAAC,uBAAuB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC5C,cAAc,CAAC,uBAAuB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IACxD,CAAC;IAED,mBAAmB,CAAC,EAAE,KAAK,EAAE,YAAY,EAA6B;QACpE,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC;QAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;gBACxB,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,sBAAsB,EAAE,KAAK,EAAE,CAAC;YAC3D,CAAC;YACD,MAAM,MAAM,GAAG,QAAQ;gBACrB,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC;gBAC7D,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC;YAC1D,IAAI,MAAM,CAAC,sBAAsB,EAAE,CAAC;gBAClC,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,sBAAsB,EAAE,KAAK,EAAE,CAAC;IAC1D,CAAC;CACF;AAlSD,0CAkSC"}

package/dist/resolvability-graph/walker/root-field-walkers/types/params.d.ts

@@ -0,0 +1,38 @@
+import { Edge, GraphNode } from '../../../graph-nodes';
+import { FieldName, NodeName, SelectionPath, TypeName } from '../../../types/types';
+import { NodeResolutionData } from '../../../node-resolution-data/node-resolution-data';
+export type RootFieldWalkerParams = {
+    index: number;
+    nodeResolutionDataByNodeName: Map<NodeName, NodeResolutionData>;
+};
+export type VisitEdgeParams = {
+    edge: Edge;
+    selectionPath: SelectionPath;
+};
+export type VisitNodeParams = {
+    node: GraphNode;
+    selectionPath: SelectionPath;
+};
+export type PropagateVisitedFieldParams = {
+    areDescendantsResolved: boolean;
+    data: NodeResolutionData;
+    fieldName: FieldName;
+    node: GraphNode;
+    selectionPath: SelectionPath;
+    visited: boolean;
+};
+export type PropagateVisitedSharedFieldParams = {
+    areDescendantsResolved: boolean;
+    data: NodeResolutionData;
+    fieldName: FieldName;
+    node: GraphNode;
+    visited: boolean;
+};
+export type VisitRootFieldEdgesParams = {
+    edges: Array<Edge>;
+    rootTypeName: TypeName;
+};
+export type GetNodeResolutionDataParams = {
+    node: GraphNode;
+    selectionPath: SelectionPath;
+};

package/dist/resolvability-graph/walker/root-field-walkers/types/params.js

@@ -0,0 +1,3 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+//# sourceMappingURL=params.js.map

package/dist/resolvability-graph/walker/root-field-walkers/types/params.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"params.js","sourceRoot":"","sources":["../../../../../src/resolvability-graph/walker/root-field-walkers/types/params.ts"],"names":[],"mappings":""}