summaryrefslogtreecommitdiff
path: root/includes/external/school/node_modules/graphql/validation/rules/NoFragmentCyclesRule.js.flow
diff options
context:
space:
mode:
authorMinteck <contact@minteck.org>2023-02-23 19:34:56 +0100
committerMinteck <contact@minteck.org>2023-02-23 19:34:56 +0100
commit3d1cd02f27518f1a04374c7c8320cd5d82ede6e9 (patch)
tree75be5fba4368472fb11c8015aee026b2b9a71888 /includes/external/school/node_modules/graphql/validation/rules/NoFragmentCyclesRule.js.flow
parent8cc1f13c17fa2fb5a4410542d39e650e02945634 (diff)
downloadpluralconnect-3d1cd02f27518f1a04374c7c8320cd5d82ede6e9.tar.gz
pluralconnect-3d1cd02f27518f1a04374c7c8320cd5d82ede6e9.tar.bz2
pluralconnect-3d1cd02f27518f1a04374c7c8320cd5d82ede6e9.zip
Updated 40 files, added 37 files, deleted 1103 files and renamed 3905 files (automated)
Diffstat (limited to 'includes/external/school/node_modules/graphql/validation/rules/NoFragmentCyclesRule.js.flow')
-rw-r--r--includes/external/school/node_modules/graphql/validation/rules/NoFragmentCyclesRule.js.flow78
1 files changed, 78 insertions, 0 deletions
diff --git a/includes/external/school/node_modules/graphql/validation/rules/NoFragmentCyclesRule.js.flow b/includes/external/school/node_modules/graphql/validation/rules/NoFragmentCyclesRule.js.flow
new file mode 100644
index 0000000..5687322
--- /dev/null
+++ b/includes/external/school/node_modules/graphql/validation/rules/NoFragmentCyclesRule.js.flow
@@ -0,0 +1,78 @@
+// @flow strict
+import { GraphQLError } from '../../error/GraphQLError';
+
+import type { ASTVisitor } from '../../language/visitor';
+import type { FragmentDefinitionNode } from '../../language/ast';
+
+import type { ASTValidationContext } from '../ValidationContext';
+
+export function NoFragmentCyclesRule(
+ context: ASTValidationContext,
+): ASTVisitor {
+ // Tracks already visited fragments to maintain O(N) and to ensure that cycles
+ // are not redundantly reported.
+ const visitedFrags = Object.create(null);
+
+ // Array of AST nodes used to produce meaningful errors
+ const spreadPath = [];
+
+ // Position in the spread path
+ const spreadPathIndexByName = Object.create(null);
+
+ return {
+ OperationDefinition: () => false,
+ FragmentDefinition(node) {
+ detectCycleRecursive(node);
+ return false;
+ },
+ };
+
+ // This does a straight-forward DFS to find cycles.
+ // It does not terminate when a cycle was found but continues to explore
+ // the graph to find all possible cycles.
+ function detectCycleRecursive(fragment: FragmentDefinitionNode): void {
+ if (visitedFrags[fragment.name.value]) {
+ return;
+ }
+
+ const fragmentName = fragment.name.value;
+ visitedFrags[fragmentName] = true;
+
+ const spreadNodes = context.getFragmentSpreads(fragment.selectionSet);
+ if (spreadNodes.length === 0) {
+ return;
+ }
+
+ spreadPathIndexByName[fragmentName] = spreadPath.length;
+
+ for (const spreadNode of spreadNodes) {
+ const spreadName = spreadNode.name.value;
+ const cycleIndex = spreadPathIndexByName[spreadName];
+
+ spreadPath.push(spreadNode);
+ if (cycleIndex === undefined) {
+ const spreadFragment = context.getFragment(spreadName);
+ if (spreadFragment) {
+ detectCycleRecursive(spreadFragment);
+ }
+ } else {
+ const cyclePath = spreadPath.slice(cycleIndex);
+ const viaPath = cyclePath
+ .slice(0, -1)
+ .map((s) => '"' + s.name.value + '"')
+ .join(', ');
+
+ context.reportError(
+ new GraphQLError(
+ `Cannot spread fragment "${spreadName}" within itself` +
+ (viaPath !== '' ? ` via ${viaPath}.` : '.'),
+ cyclePath,
+ ),
+ );
+ }
+ spreadPath.pop();
+ }
+
+ spreadPathIndexByName[fragmentName] = undefined;
+ }
+}