relay-compiler 9.0.0 → 9.1.0
Sign up to get free protection for your applications and to get access to all the features.
- package/bin/RelayCompilerBin.js.flow +169 -0
- package/bin/RelayCompilerMain.js.flow +508 -0
- package/bin/__fixtures__/plugin-module.js.flow +17 -0
- package/bin/relay-compiler +2002 -1733
- package/codegen/CodegenDirectory.js.flow +375 -0
- package/codegen/CodegenRunner.js.flow +431 -0
- package/codegen/CodegenTypes.js.flow +28 -0
- package/codegen/CodegenWatcher.js.flow +254 -0
- package/codegen/NormalizationCodeGenerator.js.flow +499 -0
- package/codegen/ReaderCodeGenerator.js.flow +453 -0
- package/codegen/RelayCodeGenerator.js.flow +76 -0
- package/codegen/RelayFileWriter.js.flow +366 -0
- package/codegen/SourceControl.js.flow +58 -0
- package/codegen/compileRelayArtifacts.js.flow +182 -0
- package/codegen/createPrintRequireModuleDependency.js.flow +21 -0
- package/codegen/writeRelayGeneratedFile.js.flow +194 -0
- package/core/ASTCache.js.flow +73 -0
- package/core/ASTConvert.js.flow +233 -0
- package/core/CompilerContext.js.flow +190 -0
- package/core/CompilerError.js.flow +250 -0
- package/core/DotGraphQLParser.js.flow +39 -0
- package/core/GraphQLCompilerProfiler.js.flow +341 -0
- package/core/GraphQLDerivedFromMetadata.js.flow +48 -0
- package/core/GraphQLWatchmanClient.js.flow +111 -0
- package/core/IR.js.flow +329 -0
- package/core/IRPrinter.js.flow +488 -0
- package/core/IRTransformer.js.flow +377 -0
- package/core/IRValidator.js.flow +260 -0
- package/core/IRVisitor.js.flow +150 -0
- package/core/JSModuleParser.js.flow +24 -0
- package/core/RelayCompilerScope.js.flow +199 -0
- package/core/RelayFindGraphQLTags.js.flow +119 -0
- package/core/RelayGraphQLEnumsGenerator.js.flow +55 -0
- package/core/RelayIRTransforms.js.flow +130 -0
- package/core/RelayParser.js.flow +1759 -0
- package/core/RelaySourceModuleParser.js.flow +135 -0
- package/core/Schema.js.flow +1985 -0
- package/core/SchemaUtils.js.flow +109 -0
- package/core/filterContextForNode.js.flow +50 -0
- package/core/getFieldDefinition.js.flow +156 -0
- package/core/getIdentifierForArgumentValue.js.flow +49 -0
- package/core/getIdentifierForSelection.js.flow +69 -0
- package/core/getLiteralArgumentValues.js.flow +32 -0
- package/core/getNormalizationOperationName.js.flow +19 -0
- package/core/inferRootArgumentDefinitions.js.flow +323 -0
- package/index.js +1 -1
- package/index.js.flow +202 -0
- package/language/RelayLanguagePluginInterface.js.flow +283 -0
- package/language/javascript/FindGraphQLTags.js.flow +233 -0
- package/language/javascript/RelayFlowBabelFactories.js.flow +180 -0
- package/language/javascript/RelayFlowGenerator.js.flow +1040 -0
- package/language/javascript/RelayFlowTypeTransformers.js.flow +184 -0
- package/language/javascript/RelayLanguagePluginJavaScript.js.flow +34 -0
- package/language/javascript/formatGeneratedModule.js.flow +65 -0
- package/lib/bin/RelayCompilerBin.js +10 -0
- package/lib/bin/RelayCompilerMain.js +113 -119
- package/lib/codegen/CodegenDirectory.js +2 -6
- package/lib/codegen/CodegenRunner.js +34 -75
- package/lib/codegen/CodegenWatcher.js +13 -21
- package/lib/codegen/NormalizationCodeGenerator.js +43 -40
- package/lib/codegen/ReaderCodeGenerator.js +43 -35
- package/lib/codegen/RelayCodeGenerator.js +7 -5
- package/lib/codegen/RelayFileWriter.js +15 -36
- package/lib/codegen/compileRelayArtifacts.js +16 -30
- package/lib/codegen/writeRelayGeneratedFile.js +56 -98
- package/lib/core/ASTCache.js +1 -3
- package/lib/core/CompilerContext.js +1 -3
- package/lib/core/CompilerError.js +27 -54
- package/lib/core/GraphQLCompilerProfiler.js +8 -12
- package/lib/core/GraphQLWatchmanClient.js +4 -12
- package/lib/core/IRPrinter.js +5 -5
- package/lib/core/IRTransformer.js +8 -6
- package/lib/core/IRValidator.js +1 -3
- package/lib/core/RelayCompilerScope.js +4 -4
- package/lib/core/RelayGraphQLEnumsGenerator.js +12 -15
- package/lib/core/RelayIRTransforms.js +9 -5
- package/lib/core/RelayParser.js +44 -56
- package/lib/core/RelaySourceModuleParser.js +1 -3
- package/lib/core/Schema.js +78 -65
- package/lib/core/getFieldDefinition.js +12 -15
- package/lib/core/getIdentifierForSelection.js +1 -1
- package/lib/core/inferRootArgumentDefinitions.js +27 -36
- package/lib/language/javascript/RelayFlowGenerator.js +49 -78
- package/lib/language/javascript/RelayFlowTypeTransformers.js +1 -3
- package/lib/reporters/ConsoleReporter.js +1 -3
- package/lib/reporters/MultiReporter.js +1 -3
- package/lib/runner/Artifacts.js +69 -170
- package/lib/runner/BufferedFilesystem.js +32 -66
- package/lib/runner/GraphQLASTNodeGroup.js +54 -120
- package/lib/runner/GraphQLNodeMap.js +14 -19
- package/lib/runner/Sources.js +49 -78
- package/lib/runner/StrictMap.js +20 -36
- package/lib/runner/getChangedNodeNames.js +30 -62
- package/lib/transforms/ApplyFragmentArgumentTransform.js +33 -28
- package/lib/transforms/ClientExtensionsTransform.js +7 -12
- package/lib/transforms/ConnectionTransform.js +26 -24
- package/lib/transforms/DeferStreamTransform.js +20 -16
- package/lib/transforms/DisallowTypenameOnRoot.js +55 -0
- package/lib/transforms/FieldHandleTransform.js +6 -2
- package/lib/transforms/FlattenTransform.js +19 -14
- package/lib/transforms/GenerateIDFieldTransform.js +7 -3
- package/lib/transforms/GenerateTypeNameTransform.js +6 -2
- package/lib/transforms/InlineDataFragmentTransform.js +7 -3
- package/lib/transforms/MaskTransform.js +17 -17
- package/lib/transforms/MatchTransform.js +110 -32
- package/lib/transforms/RefetchableFragmentTransform.js +21 -17
- package/lib/transforms/RelayDirectiveTransform.js +11 -3
- package/lib/transforms/SkipClientExtensionsTransform.js +8 -0
- package/lib/transforms/SkipHandleFieldTransform.js +6 -2
- package/lib/transforms/SkipRedundantNodesTransform.js +6 -2
- package/lib/transforms/SkipSplitOperationTransform.js +32 -0
- package/lib/transforms/SkipUnreachableNodeTransform.js +9 -2
- package/lib/transforms/SkipUnusedVariablesTransform.js +18 -17
- package/lib/transforms/SplitModuleImportTransform.js +2 -2
- package/lib/transforms/TestOperationTransform.js +7 -3
- package/lib/transforms/ValidateGlobalVariablesTransform.js +18 -30
- package/lib/transforms/ValidateRequiredArgumentsTransform.js +12 -15
- package/lib/transforms/ValidateServerOnlyDirectivesTransform.js +16 -30
- package/lib/transforms/ValidateUnusedVariablesTransform.js +18 -30
- package/lib/transforms/query-generators/FetchableQueryGenerator.js +161 -0
- package/lib/transforms/query-generators/NodeQueryGenerator.js +7 -2
- package/lib/transforms/query-generators/QueryQueryGenerator.js +1 -0
- package/lib/transforms/query-generators/ViewerQueryGenerator.js +1 -0
- package/lib/transforms/query-generators/index.js +23 -6
- package/lib/transforms/query-generators/utils.js +12 -15
- package/lib/util/RelayCompilerCache.js +1 -3
- package/lib/util/dedupeJSONStringify.js +15 -12
- package/lib/util/getModuleName.js +1 -1
- package/package.json +2 -2
- package/relay-compiler.js +4 -4
- package/relay-compiler.min.js +4 -4
- package/reporters/ConsoleReporter.js.flow +81 -0
- package/reporters/MultiReporter.js.flow +43 -0
- package/reporters/Reporter.js.flow +19 -0
- package/runner/Artifacts.js.flow +219 -0
- package/runner/BufferedFilesystem.js.flow +194 -0
- package/runner/GraphQLASTNodeGroup.js.flow +176 -0
- package/runner/GraphQLASTUtils.js.flow +26 -0
- package/runner/GraphQLNodeMap.js.flow +55 -0
- package/runner/Sources.js.flow +218 -0
- package/runner/StrictMap.js.flow +96 -0
- package/runner/compileArtifacts.js.flow +76 -0
- package/runner/extractAST.js.flow +100 -0
- package/runner/getChangedNodeNames.js.flow +48 -0
- package/runner/getSchemaInstance.js.flow +36 -0
- package/runner/types.js.flow +37 -0
- package/transforms/ApplyFragmentArgumentTransform.js.flow +474 -0
- package/transforms/ClientExtensionsTransform.js.flow +220 -0
- package/transforms/ConnectionTransform.js.flow +869 -0
- package/transforms/DeferStreamTransform.js.flow +258 -0
- package/transforms/DisallowIdAsAlias.js.flow +47 -0
- package/transforms/DisallowTypenameOnRoot.js.flow +45 -0
- package/transforms/FieldHandleTransform.js.flow +80 -0
- package/transforms/FilterDirectivesTransform.js.flow +45 -0
- package/transforms/FlattenTransform.js.flow +456 -0
- package/transforms/GenerateIDFieldTransform.js.flow +134 -0
- package/transforms/GenerateTypeNameTransform.js.flow +81 -0
- package/transforms/InlineDataFragmentTransform.js.flow +124 -0
- package/transforms/InlineFragmentsTransform.js.flow +71 -0
- package/transforms/MaskTransform.js.flow +126 -0
- package/transforms/MatchTransform.js.flow +583 -0
- package/transforms/RefetchableFragmentTransform.js.flow +272 -0
- package/transforms/RelayDirectiveTransform.js.flow +99 -0
- package/transforms/SkipClientExtensionsTransform.js.flow +54 -0
- package/transforms/SkipHandleFieldTransform.js.flow +44 -0
- package/transforms/SkipRedundantNodesTransform.js.flow +253 -0
- package/transforms/SkipSplitOperationTransform.js.flow +37 -0
- package/transforms/SkipUnreachableNodeTransform.js.flow +149 -0
- package/transforms/SkipUnusedVariablesTransform.js.flow +59 -0
- package/transforms/SplitModuleImportTransform.js.flow +98 -0
- package/transforms/TestOperationTransform.js.flow +138 -0
- package/transforms/TransformUtils.js.flow +26 -0
- package/transforms/ValidateGlobalVariablesTransform.js.flow +81 -0
- package/transforms/ValidateRequiredArgumentsTransform.js.flow +127 -0
- package/transforms/ValidateServerOnlyDirectivesTransform.js.flow +112 -0
- package/transforms/ValidateUnusedVariablesTransform.js.flow +89 -0
- package/transforms/query-generators/FetchableQueryGenerator.js.flow +190 -0
- package/transforms/query-generators/NodeQueryGenerator.js.flow +206 -0
- package/transforms/query-generators/QueryQueryGenerator.js.flow +57 -0
- package/transforms/query-generators/ViewerQueryGenerator.js.flow +97 -0
- package/transforms/query-generators/index.js.flow +90 -0
- package/transforms/query-generators/utils.js.flow +72 -0
- package/util/CodeMarker.js.flow +79 -0
- package/util/DefaultHandleKey.js.flow +17 -0
- package/util/RelayCompilerCache.js.flow +88 -0
- package/util/Rollout.js.flow +39 -0
- package/util/TimeReporter.js.flow +79 -0
- package/util/areEqualOSS.js.flow +123 -0
- package/util/dedupeJSONStringify.js.flow +152 -0
- package/util/getDefinitionNodeHash.js.flow +25 -0
- package/util/getModuleName.js.flow +39 -0
- package/util/joinArgumentDefinitions.js.flow +99 -0
- package/util/md5.js.flow +22 -0
- package/util/murmurHash.js.flow +94 -0
- package/util/nullthrowsOSS.js.flow +25 -0
- package/util/orList.js.flow +37 -0
- package/util/partitionArray.js.flow +37 -0
@@ -14,6 +14,12 @@ var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefau
|
|
14
14
|
|
15
15
|
var _toConsumableArray2 = _interopRequireDefault(require("@babel/runtime/helpers/toConsumableArray"));
|
16
16
|
|
17
|
+
function _createForOfIteratorHelper(o) { if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (o = _unsupportedIterableToArray(o))) { var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var it, normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
|
18
|
+
|
19
|
+
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(n); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
|
20
|
+
|
21
|
+
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
|
22
|
+
|
17
23
|
var GraphQLNodeMap = require('./GraphQLNodeMap');
|
18
24
|
|
19
25
|
var _require = require('./GraphQLASTUtils'),
|
@@ -24,12 +30,12 @@ var _require2 = require('graphql'),
|
|
24
30
|
|
25
31
|
function buildDependencyMap(nodes) {
|
26
32
|
var dependencyMap = new Map();
|
27
|
-
|
28
|
-
var
|
29
|
-
|
33
|
+
|
34
|
+
var _iterator = _createForOfIteratorHelper(nodes.values()),
|
35
|
+
_step;
|
30
36
|
|
31
37
|
try {
|
32
|
-
for (
|
38
|
+
for (_iterator.s(); !(_step = _iterator.n()).done;) {
|
33
39
|
var node = _step.value;
|
34
40
|
var name = getName(node);
|
35
41
|
|
@@ -40,18 +46,9 @@ function buildDependencyMap(nodes) {
|
|
40
46
|
dependencyMap.set(name, findIncludedFragments(node));
|
41
47
|
}
|
42
48
|
} catch (err) {
|
43
|
-
|
44
|
-
_iteratorError = err;
|
49
|
+
_iterator.e(err);
|
45
50
|
} finally {
|
46
|
-
|
47
|
-
if (!_iteratorNormalCompletion && _iterator["return"] != null) {
|
48
|
-
_iterator["return"]();
|
49
|
-
}
|
50
|
-
} finally {
|
51
|
-
if (_didIteratorError) {
|
52
|
-
throw _iteratorError;
|
53
|
-
}
|
54
|
-
}
|
51
|
+
_iterator.f();
|
55
52
|
}
|
56
53
|
|
57
54
|
return dependencyMap;
|
@@ -59,19 +56,19 @@ function buildDependencyMap(nodes) {
|
|
59
56
|
|
60
57
|
function mergeMaps(maps) {
|
61
58
|
var result = new Map();
|
62
|
-
|
63
|
-
var
|
64
|
-
|
59
|
+
|
60
|
+
var _iterator2 = _createForOfIteratorHelper(maps),
|
61
|
+
_step2;
|
65
62
|
|
66
63
|
try {
|
67
|
-
for (
|
64
|
+
for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
|
68
65
|
var source = _step2.value;
|
69
|
-
|
70
|
-
var
|
71
|
-
|
66
|
+
|
67
|
+
var _iterator3 = _createForOfIteratorHelper(source.entries()),
|
68
|
+
_step3;
|
72
69
|
|
73
70
|
try {
|
74
|
-
for (
|
71
|
+
for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
|
75
72
|
var _step3$value = _step3.value,
|
76
73
|
key = _step3$value[0],
|
77
74
|
value = _step3$value[1];
|
@@ -83,33 +80,15 @@ function mergeMaps(maps) {
|
|
83
80
|
result.set(key, value);
|
84
81
|
}
|
85
82
|
} catch (err) {
|
86
|
-
|
87
|
-
_iteratorError3 = err;
|
83
|
+
_iterator3.e(err);
|
88
84
|
} finally {
|
89
|
-
|
90
|
-
if (!_iteratorNormalCompletion3 && _iterator3["return"] != null) {
|
91
|
-
_iterator3["return"]();
|
92
|
-
}
|
93
|
-
} finally {
|
94
|
-
if (_didIteratorError3) {
|
95
|
-
throw _iteratorError3;
|
96
|
-
}
|
97
|
-
}
|
85
|
+
_iterator3.f();
|
98
86
|
}
|
99
87
|
}
|
100
88
|
} catch (err) {
|
101
|
-
|
102
|
-
_iteratorError2 = err;
|
89
|
+
_iterator2.e(err);
|
103
90
|
} finally {
|
104
|
-
|
105
|
-
if (!_iteratorNormalCompletion2 && _iterator2["return"] != null) {
|
106
|
-
_iterator2["return"]();
|
107
|
-
}
|
108
|
-
} finally {
|
109
|
-
if (_didIteratorError2) {
|
110
|
-
throw _iteratorError2;
|
111
|
-
}
|
112
|
-
}
|
91
|
+
_iterator2.f();
|
113
92
|
}
|
114
93
|
|
115
94
|
return result;
|
@@ -133,12 +112,12 @@ function forChanges(nodes, changedNames) {
|
|
133
112
|
var directlyChangedAndAncestors = includeReachable(changedNames, invertedDependencyMap); // Now, we need to intersect obtained set with the project nodes
|
134
113
|
|
135
114
|
var directlyChangedRelatedToProject = new Set();
|
136
|
-
|
137
|
-
var
|
138
|
-
|
115
|
+
|
116
|
+
var _iterator4 = _createForOfIteratorHelper(directlyChangedAndAncestors),
|
117
|
+
_step4;
|
139
118
|
|
140
119
|
try {
|
141
|
-
for (
|
120
|
+
for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
|
142
121
|
var node = _step4.value;
|
143
122
|
|
144
123
|
if (nodes.has(node)) {
|
@@ -148,18 +127,9 @@ function forChanges(nodes, changedNames) {
|
|
148
127
|
// in the complete dependency map (project + base)
|
149
128
|
|
150
129
|
} catch (err) {
|
151
|
-
|
152
|
-
_iteratorError4 = err;
|
130
|
+
_iterator4.e(err);
|
153
131
|
} finally {
|
154
|
-
|
155
|
-
if (!_iteratorNormalCompletion4 && _iterator4["return"] != null) {
|
156
|
-
_iterator4["return"]();
|
157
|
-
}
|
158
|
-
} finally {
|
159
|
-
if (_didIteratorError4) {
|
160
|
-
throw _iteratorError4;
|
161
|
-
}
|
162
|
-
}
|
132
|
+
_iterator4.f();
|
163
133
|
}
|
164
134
|
|
165
135
|
var allRelated = includeReachable(directlyChangedRelatedToProject, dependencyMap);
|
@@ -169,12 +139,12 @@ function forChanges(nodes, changedNames) {
|
|
169
139
|
function buildResult(includedNames, nameToNode, baseNameToNode) {
|
170
140
|
var baseNames = new Set();
|
171
141
|
var nodes = [];
|
172
|
-
|
173
|
-
var
|
174
|
-
|
142
|
+
|
143
|
+
var _iterator5 = _createForOfIteratorHelper(includedNames),
|
144
|
+
_step5;
|
175
145
|
|
176
146
|
try {
|
177
|
-
for (
|
147
|
+
for (_iterator5.s(); !(_step5 = _iterator5.n()).done;) {
|
178
148
|
var name = _step5.value;
|
179
149
|
var baseNode = baseNameToNode.get(name);
|
180
150
|
|
@@ -190,18 +160,9 @@ function buildResult(includedNames, nameToNode, baseNameToNode) {
|
|
190
160
|
}
|
191
161
|
}
|
192
162
|
} catch (err) {
|
193
|
-
|
194
|
-
_iteratorError5 = err;
|
163
|
+
_iterator5.e(err);
|
195
164
|
} finally {
|
196
|
-
|
197
|
-
if (!_iteratorNormalCompletion5 && _iterator5["return"] != null) {
|
198
|
-
_iterator5["return"]();
|
199
|
-
}
|
200
|
-
} finally {
|
201
|
-
if (_didIteratorError5) {
|
202
|
-
throw _iteratorError5;
|
203
|
-
}
|
204
|
-
}
|
165
|
+
_iterator5.f();
|
205
166
|
}
|
206
167
|
|
207
168
|
return {
|
@@ -217,12 +178,12 @@ function includeReachable(changed, deps) {
|
|
217
178
|
while (toVisit.length > 0) {
|
218
179
|
var current = toVisit.pop();
|
219
180
|
visited.add(current);
|
220
|
-
|
221
|
-
var
|
222
|
-
|
181
|
+
|
182
|
+
var _iterator6 = _createForOfIteratorHelper(deps.get(current) || []),
|
183
|
+
_step6;
|
223
184
|
|
224
185
|
try {
|
225
|
-
for (
|
186
|
+
for (_iterator6.s(); !(_step6 = _iterator6.n()).done;) {
|
226
187
|
var dep = _step6.value;
|
227
188
|
|
228
189
|
if (!visited.has(dep)) {
|
@@ -230,18 +191,9 @@ function includeReachable(changed, deps) {
|
|
230
191
|
}
|
231
192
|
}
|
232
193
|
} catch (err) {
|
233
|
-
|
234
|
-
_iteratorError6 = err;
|
194
|
+
_iterator6.e(err);
|
235
195
|
} finally {
|
236
|
-
|
237
|
-
if (!_iteratorNormalCompletion6 && _iterator6["return"] != null) {
|
238
|
-
_iterator6["return"]();
|
239
|
-
}
|
240
|
-
} finally {
|
241
|
-
if (_didIteratorError6) {
|
242
|
-
throw _iteratorError6;
|
243
|
-
}
|
244
|
-
}
|
196
|
+
_iterator6.f();
|
245
197
|
}
|
246
198
|
}
|
247
199
|
|
@@ -260,22 +212,22 @@ function findIncludedFragments(node) {
|
|
260
212
|
|
261
213
|
function inverseDependencyMap(map) {
|
262
214
|
var invertedMap = new Map();
|
263
|
-
|
264
|
-
var
|
265
|
-
|
215
|
+
|
216
|
+
var _iterator7 = _createForOfIteratorHelper(map.entries()),
|
217
|
+
_step7;
|
266
218
|
|
267
219
|
try {
|
268
|
-
for (
|
220
|
+
for (_iterator7.s(); !(_step7 = _iterator7.n()).done;) {
|
269
221
|
var _step7$value = _step7.value,
|
270
222
|
source = _step7$value[0],
|
271
223
|
dests = _step7$value[1];
|
272
224
|
var inverseDest = source;
|
273
|
-
|
274
|
-
var
|
275
|
-
|
225
|
+
|
226
|
+
var _iterator8 = _createForOfIteratorHelper(dests),
|
227
|
+
_step8;
|
276
228
|
|
277
229
|
try {
|
278
|
-
for (
|
230
|
+
for (_iterator8.s(); !(_step8 = _iterator8.n()).done;) {
|
279
231
|
var dest = _step8.value;
|
280
232
|
var inverseSource = dest;
|
281
233
|
var inverseDests = invertedMap.get(inverseSource);
|
@@ -288,33 +240,15 @@ function inverseDependencyMap(map) {
|
|
288
240
|
inverseDests.push(inverseDest);
|
289
241
|
}
|
290
242
|
} catch (err) {
|
291
|
-
|
292
|
-
_iteratorError8 = err;
|
243
|
+
_iterator8.e(err);
|
293
244
|
} finally {
|
294
|
-
|
295
|
-
if (!_iteratorNormalCompletion8 && _iterator8["return"] != null) {
|
296
|
-
_iterator8["return"]();
|
297
|
-
}
|
298
|
-
} finally {
|
299
|
-
if (_didIteratorError8) {
|
300
|
-
throw _iteratorError8;
|
301
|
-
}
|
302
|
-
}
|
245
|
+
_iterator8.f();
|
303
246
|
}
|
304
247
|
}
|
305
248
|
} catch (err) {
|
306
|
-
|
307
|
-
_iteratorError7 = err;
|
249
|
+
_iterator7.e(err);
|
308
250
|
} finally {
|
309
|
-
|
310
|
-
if (!_iteratorNormalCompletion7 && _iterator7["return"] != null) {
|
311
|
-
_iterator7["return"]();
|
312
|
-
}
|
313
|
-
} finally {
|
314
|
-
if (_didIteratorError7) {
|
315
|
-
throw _iteratorError7;
|
316
|
-
}
|
317
|
-
}
|
251
|
+
_iterator7.f();
|
318
252
|
}
|
319
253
|
|
320
254
|
return invertedMap;
|
@@ -16,6 +16,12 @@ var _inheritsLoose2 = _interopRequireDefault(require("@babel/runtime/helpers/inh
|
|
16
16
|
|
17
17
|
var _wrapNativeSuper2 = _interopRequireDefault(require("@babel/runtime/helpers/wrapNativeSuper"));
|
18
18
|
|
19
|
+
function _createForOfIteratorHelper(o) { if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (o = _unsupportedIterableToArray(o))) { var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var it, normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
|
20
|
+
|
21
|
+
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(n); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
|
22
|
+
|
23
|
+
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
|
24
|
+
|
19
25
|
var _require = require('../core/CompilerError'),
|
20
26
|
createUserError = _require.createUserError,
|
21
27
|
createCompilerError = _require.createCompilerError;
|
@@ -23,9 +29,7 @@ var _require = require('../core/CompilerError'),
|
|
23
29
|
var _require2 = require('./GraphQLASTUtils'),
|
24
30
|
getName = _require2.getName;
|
25
31
|
|
26
|
-
var GraphQLNodeMap =
|
27
|
-
/*#__PURE__*/
|
28
|
-
function (_Map) {
|
32
|
+
var GraphQLNodeMap = /*#__PURE__*/function (_Map) {
|
29
33
|
(0, _inheritsLoose2["default"])(GraphQLNodeMap, _Map);
|
30
34
|
|
31
35
|
function GraphQLNodeMap() {
|
@@ -34,12 +38,12 @@ function (_Map) {
|
|
34
38
|
|
35
39
|
GraphQLNodeMap.from = function from(nodes) {
|
36
40
|
var result = new GraphQLNodeMap();
|
37
|
-
|
38
|
-
var
|
39
|
-
|
41
|
+
|
42
|
+
var _iterator = _createForOfIteratorHelper(nodes),
|
43
|
+
_step;
|
40
44
|
|
41
45
|
try {
|
42
|
-
for (
|
46
|
+
for (_iterator.s(); !(_step = _iterator.n()).done;) {
|
43
47
|
var node = _step.value;
|
44
48
|
var name = getName(node);
|
45
49
|
var prevNode = result.get(name);
|
@@ -51,18 +55,9 @@ function (_Map) {
|
|
51
55
|
result.set(name, node);
|
52
56
|
}
|
53
57
|
} catch (err) {
|
54
|
-
|
55
|
-
_iteratorError = err;
|
58
|
+
_iterator.e(err);
|
56
59
|
} finally {
|
57
|
-
|
58
|
-
if (!_iteratorNormalCompletion && _iterator["return"] != null) {
|
59
|
-
_iterator["return"]();
|
60
|
-
}
|
61
|
-
} finally {
|
62
|
-
if (_didIteratorError) {
|
63
|
-
throw _iteratorError;
|
64
|
-
}
|
65
|
-
}
|
60
|
+
_iterator.f();
|
66
61
|
}
|
67
62
|
|
68
63
|
return result;
|
@@ -85,6 +80,6 @@ function (_Map) {
|
|
85
80
|
};
|
86
81
|
|
87
82
|
return GraphQLNodeMap;
|
88
|
-
}((0, _wrapNativeSuper2["default"])(Map));
|
83
|
+
}( /*#__PURE__*/(0, _wrapNativeSuper2["default"])(Map));
|
89
84
|
|
90
85
|
module.exports = GraphQLNodeMap;
|
package/lib/runner/Sources.js
CHANGED
@@ -13,10 +13,22 @@
|
|
13
13
|
|
14
14
|
var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
|
15
15
|
|
16
|
-
var
|
16
|
+
var _defineProperty2 = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
|
17
|
+
|
18
|
+
function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }
|
19
|
+
|
20
|
+
function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { (0, _defineProperty2["default"])(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }
|
21
|
+
|
22
|
+
function _createForOfIteratorHelper(o) { if (typeof Symbol === "undefined" || o[Symbol.iterator] == null) { if (Array.isArray(o) || (o = _unsupportedIterableToArray(o))) { var i = 0; var F = function F() {}; return { s: F, n: function n() { if (i >= o.length) return { done: true }; return { done: false, value: o[i++] }; }, e: function e(_e) { throw _e; }, f: F }; } throw new TypeError("Invalid attempt to iterate non-iterable instance.\nIn order to be iterable, non-array objects must have a [Symbol.iterator]() method."); } var it, normalCompletion = true, didErr = false, err; return { s: function s() { it = o[Symbol.iterator](); }, n: function n() { var step = it.next(); normalCompletion = step.done; return step; }, e: function e(_e2) { didErr = true; err = _e2; }, f: function f() { try { if (!normalCompletion && it["return"] != null) it["return"](); } finally { if (didErr) throw err; } } }; }
|
23
|
+
|
24
|
+
function _unsupportedIterableToArray(o, minLen) { if (!o) return; if (typeof o === "string") return _arrayLikeToArray(o, minLen); var n = Object.prototype.toString.call(o).slice(8, -1); if (n === "Object" && o.constructor) n = o.constructor.name; if (n === "Map" || n === "Set") return Array.from(n); if (n === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(n)) return _arrayLikeToArray(o, minLen); }
|
25
|
+
|
26
|
+
function _arrayLikeToArray(arr, len) { if (len == null || len > arr.length) len = arr.length; for (var i = 0, arr2 = new Array(len); i < len; i++) { arr2[i] = arr[i]; } return arr2; }
|
17
27
|
|
18
28
|
var invariant = require("fbjs/lib/invariant");
|
19
29
|
|
30
|
+
var md5 = require('../util/md5');
|
31
|
+
|
20
32
|
var _require = require('./extractAST'),
|
21
33
|
toASTRecord = _require.toASTRecord;
|
22
34
|
|
@@ -24,20 +36,14 @@ var _require2 = require('graphql'),
|
|
24
36
|
Source = _require2.Source,
|
25
37
|
parse = _require2.parse;
|
26
38
|
|
27
|
-
function
|
28
|
-
|
29
|
-
|
30
|
-
|
31
|
-
var Sources =
|
32
|
-
/*#__PURE__*/
|
33
|
-
function () {
|
34
|
-
Sources.fromSavedState = function fromSavedState(_ref2) {
|
35
|
-
var extractFromFile = _ref2.extractFromFile,
|
36
|
-
savedState = _ref2.savedState;
|
39
|
+
var Sources = /*#__PURE__*/function () {
|
40
|
+
Sources.fromSavedState = function fromSavedState(_ref) {
|
41
|
+
var extractFromFile = _ref.extractFromFile,
|
42
|
+
savedState = _ref.savedState;
|
37
43
|
var state = {};
|
38
|
-
|
39
|
-
var
|
40
|
-
|
44
|
+
|
45
|
+
var _iterator = _createForOfIteratorHelper(savedState),
|
46
|
+
_step;
|
41
47
|
|
42
48
|
try {
|
43
49
|
var _loop = function _loop() {
|
@@ -46,12 +52,12 @@ function () {
|
|
46
52
|
savedStateSources = _step$value.sources;
|
47
53
|
var nodes = {};
|
48
54
|
var sources = [];
|
49
|
-
|
50
|
-
var
|
51
|
-
|
55
|
+
|
56
|
+
var _iterator2 = _createForOfIteratorHelper(savedStateSources),
|
57
|
+
_step2;
|
52
58
|
|
53
59
|
try {
|
54
|
-
for (
|
60
|
+
for (_iterator2.s(); !(_step2 = _iterator2.n()).done;) {
|
55
61
|
var text = _step2.value;
|
56
62
|
var doc = parse(new Source(text, file));
|
57
63
|
!doc.definitions.length ? process.env.NODE_ENV !== "production" ? invariant(false, 'expected not empty list of definitions') : invariant(false) : void 0;
|
@@ -64,18 +70,9 @@ function () {
|
|
64
70
|
sources.push(text);
|
65
71
|
}
|
66
72
|
} catch (err) {
|
67
|
-
|
68
|
-
_iteratorError2 = err;
|
73
|
+
_iterator2.e(err);
|
69
74
|
} finally {
|
70
|
-
|
71
|
-
if (!_iteratorNormalCompletion2 && _iterator2["return"] != null) {
|
72
|
-
_iterator2["return"]();
|
73
|
-
}
|
74
|
-
} finally {
|
75
|
-
if (_didIteratorError2) {
|
76
|
-
throw _iteratorError2;
|
77
|
-
}
|
78
|
-
}
|
75
|
+
_iterator2.f();
|
79
76
|
}
|
80
77
|
|
81
78
|
state[file] = {
|
@@ -84,22 +81,13 @@ function () {
|
|
84
81
|
};
|
85
82
|
};
|
86
83
|
|
87
|
-
for (
|
84
|
+
for (_iterator.s(); !(_step = _iterator.n()).done;) {
|
88
85
|
_loop();
|
89
86
|
}
|
90
87
|
} catch (err) {
|
91
|
-
|
92
|
-
_iteratorError = err;
|
88
|
+
_iterator.e(err);
|
93
89
|
} finally {
|
94
|
-
|
95
|
-
if (!_iteratorNormalCompletion && _iterator["return"] != null) {
|
96
|
-
_iterator["return"]();
|
97
|
-
}
|
98
|
-
} finally {
|
99
|
-
if (_didIteratorError) {
|
100
|
-
throw _iteratorError;
|
101
|
-
}
|
102
|
-
}
|
90
|
+
_iterator.f();
|
103
91
|
}
|
104
92
|
|
105
93
|
return new Sources({
|
@@ -108,11 +96,11 @@ function () {
|
|
108
96
|
});
|
109
97
|
};
|
110
98
|
|
111
|
-
function Sources(
|
112
|
-
var extractFromFile =
|
113
|
-
state =
|
99
|
+
function Sources(_ref2) {
|
100
|
+
var extractFromFile = _ref2.extractFromFile,
|
101
|
+
state = _ref2.state;
|
114
102
|
this._extractFromFile = extractFromFile;
|
115
|
-
this._state = (
|
103
|
+
this._state = _objectSpread({}, state);
|
116
104
|
}
|
117
105
|
|
118
106
|
var _proto = Sources.prototype;
|
@@ -120,14 +108,15 @@ function () {
|
|
120
108
|
_proto.processChanges = function processChanges(baseDir, files) {
|
121
109
|
var added = [];
|
122
110
|
var removed = [];
|
123
|
-
|
124
|
-
var
|
125
|
-
|
126
|
-
var
|
111
|
+
|
112
|
+
var state = _objectSpread({}, this._state);
|
113
|
+
|
114
|
+
var _iterator3 = _createForOfIteratorHelper(files),
|
115
|
+
_step3;
|
127
116
|
|
128
117
|
try {
|
129
|
-
for (
|
130
|
-
var
|
118
|
+
for (_iterator3.s(); !(_step3 = _iterator3.n()).done;) {
|
119
|
+
var _state$file$name$node, _state$file$name;
|
131
120
|
|
132
121
|
var _file = _step3.value;
|
133
122
|
var newDefs = void 0;
|
@@ -145,19 +134,19 @@ function () {
|
|
145
134
|
}
|
146
135
|
|
147
136
|
var hasEntry = state.hasOwnProperty(_file.name);
|
148
|
-
var oldEntry = (
|
137
|
+
var oldEntry = (_state$file$name$node = (_state$file$name = state[_file.name]) === null || _state$file$name === void 0 ? void 0 : _state$file$name.nodes) !== null && _state$file$name$node !== void 0 ? _state$file$name$node : {}; // First case, we have new changes in the file
|
149
138
|
// for example changed Query or Fragment
|
150
139
|
|
151
140
|
if (newDefs != null && newDefs.length > 0) {
|
152
141
|
// We need to add all entities from the changed file to added arrays
|
153
142
|
var newEntry = {};
|
154
143
|
var newTexts = new Set();
|
155
|
-
|
156
|
-
var
|
157
|
-
|
144
|
+
|
145
|
+
var _iterator4 = _createForOfIteratorHelper(newDefs),
|
146
|
+
_step4;
|
158
147
|
|
159
148
|
try {
|
160
|
-
for (
|
149
|
+
for (_iterator4.s(); !(_step4 = _iterator4.n()).done;) {
|
161
150
|
var _step4$value = _step4.value,
|
162
151
|
_ast = _step4$value.ast,
|
163
152
|
text = _step4$value.text;
|
@@ -181,18 +170,9 @@ function () {
|
|
181
170
|
// that are not included in the new changes
|
182
171
|
|
183
172
|
} catch (err) {
|
184
|
-
|
185
|
-
_iteratorError4 = err;
|
173
|
+
_iterator4.e(err);
|
186
174
|
} finally {
|
187
|
-
|
188
|
-
if (!_iteratorNormalCompletion4 && _iterator4["return"] != null) {
|
189
|
-
_iterator4["return"]();
|
190
|
-
}
|
191
|
-
} finally {
|
192
|
-
if (_didIteratorError4) {
|
193
|
-
throw _iteratorError4;
|
194
|
-
}
|
195
|
-
}
|
175
|
+
_iterator4.f();
|
196
176
|
}
|
197
177
|
|
198
178
|
if (hasEntry) {
|
@@ -236,18 +216,9 @@ function () {
|
|
236
216
|
}
|
237
217
|
}
|
238
218
|
} catch (err) {
|
239
|
-
|
240
|
-
_iteratorError3 = err;
|
219
|
+
_iterator3.e(err);
|
241
220
|
} finally {
|
242
|
-
|
243
|
-
if (!_iteratorNormalCompletion3 && _iterator3["return"] != null) {
|
244
|
-
_iterator3["return"]();
|
245
|
-
}
|
246
|
-
} finally {
|
247
|
-
if (_didIteratorError3) {
|
248
|
-
throw _iteratorError3;
|
249
|
-
}
|
250
|
-
}
|
221
|
+
_iterator3.f();
|
251
222
|
}
|
252
223
|
|
253
224
|
return {
|