gremlin 3.5.2 → 3.5.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/.eslintrc.js +154 -0
- package/.prettierrc.js +29 -0
- package/Gruntfile.js +15 -16
- package/doc/AnonymousTraversalSource.html +4 -4
- package/doc/Authenticator.html +1 -1
- package/doc/Bytecode.html +6 -6
- package/doc/Client.html +137 -63
- package/doc/Connection.html +88 -4
- package/doc/DriverRemoteConnection.html +10 -10
- package/doc/EdgeLabelVerificationStrategy.html +1 -1
- package/doc/Graph.html +1 -1
- package/doc/GraphSON2Reader.html +3 -3
- package/doc/GraphSON2Writer.html +2 -2
- package/doc/GraphSON3Reader.html +2 -2
- package/doc/GraphSON3Writer.html +2 -2
- package/doc/GraphTraversal.html +106 -106
- package/doc/GraphTraversalSource.html +18 -18
- package/doc/HaltedTraverserStrategy.html +2 -2
- package/doc/MatchAlgorithmStrategy.html +2 -2
- package/doc/P.html +12 -12
- package/doc/PartitionStrategy.html +2 -2
- package/doc/Path.html +1 -1
- package/doc/PlainTextSaslAuthenticator.html +1 -1
- package/doc/ProductiveByStrategy.html +1 -1
- package/doc/RemoteConnection.html +9 -9
- package/doc/RemoteStrategy.html +3 -3
- package/doc/RemoteTraversal.html +2 -2
- package/doc/ReservedKeysVerificationStrategy.html +2 -2
- package/doc/ResponseError.html +1 -1
- package/doc/ResultSet.html +6 -6
- package/doc/SaslAuthenticator.html +1 -1
- package/doc/SaslMechanismBase.html +1 -1
- package/doc/SaslMechanismPlain.html +5 -5
- package/doc/SeedStrategy.html +2 -2
- package/doc/SubgraphStrategy.html +2 -2
- package/doc/TextP.html +9 -9
- package/doc/Transaction.html +5 -5
- package/doc/Translator.html +1 -1
- package/doc/TraversalStrategies.html +4 -4
- package/doc/TraversalStrategy.html +2 -2
- package/doc/TypeSerializer.html +1 -1
- package/doc/driver_auth_authenticator.js.html +3 -3
- package/doc/driver_auth_mechanisms_sasl-mechanism-base.js.html +2 -2
- package/doc/driver_auth_mechanisms_sasl-mechanism-plain.js.html +25 -16
- package/doc/driver_auth_plain-text-sasl-authenticator.js.html +6 -6
- package/doc/driver_auth_sasl-authenticator.js.html +2 -2
- package/doc/driver_client.js.html +69 -23
- package/doc/driver_connection.js.html +107 -88
- package/doc/driver_driver-remote-connection.js.html +11 -10
- package/doc/driver_remote-connection.js.html +3 -4
- package/doc/driver_response-error.js.html +4 -3
- package/doc/driver_result-set.js.html +3 -3
- package/doc/global.html +199 -2
- package/doc/index.html +1 -1
- package/doc/process_anonymous-traversal.js.html +3 -3
- package/doc/process_bytecode.js.html +10 -8
- package/doc/process_graph-traversal.js.html +193 -142
- package/doc/process_transaction.js.html +15 -8
- package/doc/process_translator.js.html +13 -10
- package/doc/process_traversal-strategy.js.html +59 -53
- package/doc/process_traversal.js.html +100 -107
- package/doc/structure_graph.js.html +6 -6
- package/doc/structure_io_graph-serializer.js.html +64 -17
- package/doc/structure_io_type-serializers.js.html +85 -88
- package/index.js +5 -5
- package/lib/driver/auth/authenticator.js +2 -2
- package/lib/driver/auth/mechanisms/sasl-mechanism-base.js +1 -1
- package/lib/driver/auth/mechanisms/sasl-mechanism-plain.js +24 -15
- package/lib/driver/auth/plain-text-sasl-authenticator.js +5 -5
- package/lib/driver/auth/sasl-authenticator.js +1 -1
- package/lib/driver/client.js +68 -22
- package/lib/driver/connection.js +106 -87
- package/lib/driver/driver-remote-connection.js +10 -9
- package/lib/driver/remote-connection.js +2 -3
- package/lib/driver/response-error.js +2 -2
- package/lib/driver/result-set.js +1 -2
- package/lib/process/anonymous-traversal.js +1 -2
- package/lib/process/bytecode.js +9 -7
- package/lib/process/graph-traversal.js +191 -141
- package/lib/process/transaction.js +13 -7
- package/lib/process/translator.js +11 -9
- package/lib/process/traversal-strategy.js +57 -52
- package/lib/process/traversal.js +99 -106
- package/lib/structure/graph.js +5 -5
- package/lib/structure/io/graph-serializer.js +62 -16
- package/lib/structure/io/type-serializers.js +84 -87
- package/lib/utils.js +15 -10
- package/package.json +10 -5
|
@@ -60,7 +60,6 @@ const { TraversalStrategies, VertexProgramStrategy, OptionsStrategy } = require(
|
|
|
60
60
|
* Represents the primary DSL of the Gremlin traversal machine.
|
|
61
61
|
*/
|
|
62
62
|
class GraphTraversalSource {
|
|
63
|
-
|
|
64
63
|
/**
|
|
65
64
|
* Creates a new instance of {@link GraphTraversalSource}.
|
|
66
65
|
* @param {Graph} graph
|
|
@@ -79,7 +78,7 @@ class GraphTraversalSource {
|
|
|
79
78
|
// in order to keep the constructor unchanged within 3.5.x we can try to pop the RemoteConnection out of the
|
|
80
79
|
// TraversalStrategies. keeping this unchanged will allow user DSLs to not take a break.
|
|
81
80
|
// TODO: refactor this to be nicer in 3.6.0 when we can take a breaking change
|
|
82
|
-
const strat = traversalStrategies.strategies.find(ts => ts.fqcn ===
|
|
81
|
+
const strat = traversalStrategies.strategies.find((ts) => ts.fqcn === 'js:RemoteStrategy');
|
|
83
82
|
this.remoteConnection = strat !== undefined ? strat.connection : undefined;
|
|
84
83
|
}
|
|
85
84
|
|
|
@@ -90,8 +89,13 @@ class GraphTraversalSource {
|
|
|
90
89
|
withRemote(remoteConnection) {
|
|
91
90
|
const traversalStrategy = new TraversalStrategies(this.traversalStrategies);
|
|
92
91
|
traversalStrategy.addStrategy(new remote.RemoteStrategy(remoteConnection));
|
|
93
|
-
return new this.graphTraversalSourceClass(
|
|
94
|
-
this.
|
|
92
|
+
return new this.graphTraversalSourceClass(
|
|
93
|
+
this.graph,
|
|
94
|
+
traversalStrategy,
|
|
95
|
+
new Bytecode(this.bytecode),
|
|
96
|
+
this.graphTraversalSourceClass,
|
|
97
|
+
this.graphTraversalClass,
|
|
98
|
+
);
|
|
95
99
|
}
|
|
96
100
|
|
|
97
101
|
/**
|
|
@@ -101,7 +105,7 @@ class GraphTraversalSource {
|
|
|
101
105
|
tx() {
|
|
102
106
|
// you can't do g.tx().begin().tx() - no child transactions
|
|
103
107
|
if (this.remoteConnection && this.remoteConnection.isSessionBound) {
|
|
104
|
-
throw new Error(
|
|
108
|
+
throw new Error('This TraversalSource is already bound to a transaction - child transactions are not supported');
|
|
105
109
|
}
|
|
106
110
|
|
|
107
111
|
return new Transaction(this);
|
|
@@ -118,9 +122,17 @@ class GraphTraversalSource {
|
|
|
118
122
|
* @returns {GraphTraversalSource}
|
|
119
123
|
*/
|
|
120
124
|
withComputer(graphComputer, workers, result, persist, vertices, edges, configuration) {
|
|
121
|
-
return this.withStrategies(
|
|
122
|
-
|
|
123
|
-
|
|
125
|
+
return this.withStrategies(
|
|
126
|
+
new VertexProgramStrategy({
|
|
127
|
+
graphComputer: graphComputer,
|
|
128
|
+
workers: workers,
|
|
129
|
+
result: result,
|
|
130
|
+
persist: persist,
|
|
131
|
+
vertices: vertices,
|
|
132
|
+
edges: edges,
|
|
133
|
+
configuration: configuration,
|
|
134
|
+
}),
|
|
135
|
+
);
|
|
124
136
|
}
|
|
125
137
|
|
|
126
138
|
/**
|
|
@@ -129,18 +141,23 @@ class GraphTraversalSource {
|
|
|
129
141
|
* @param {Object} value if not specified, the value with default to {@code true}
|
|
130
142
|
* @returns {GraphTraversalSource}
|
|
131
143
|
*/
|
|
132
|
-
with_(key, value=undefined) {
|
|
144
|
+
with_(key, value = undefined) {
|
|
133
145
|
const val = value === undefined ? true : value;
|
|
134
146
|
let optionsStrategy = this.bytecode.sourceInstructions.find(
|
|
135
|
-
|
|
147
|
+
(i) => i[0] === 'withStrategies' && i[1] instanceof OptionsStrategy,
|
|
148
|
+
);
|
|
136
149
|
if (optionsStrategy === undefined) {
|
|
137
|
-
optionsStrategy = new OptionsStrategy({[key]: val});
|
|
150
|
+
optionsStrategy = new OptionsStrategy({ [key]: val });
|
|
138
151
|
return this.withStrategies(optionsStrategy);
|
|
139
|
-
} else {
|
|
140
|
-
optionsStrategy[1].configuration[key] = val;
|
|
141
|
-
return new this.graphTraversalSourceClass(this.graph, new TraversalStrategies(this.traversalStrategies),
|
|
142
|
-
this.bytecode, this.graphTraversalSourceClass, this.graphTraversalClass);
|
|
143
152
|
}
|
|
153
|
+
optionsStrategy[1].configuration[key] = val;
|
|
154
|
+
return new this.graphTraversalSourceClass(
|
|
155
|
+
this.graph,
|
|
156
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
157
|
+
this.bytecode,
|
|
158
|
+
this.graphTraversalSourceClass,
|
|
159
|
+
this.graphTraversalClass,
|
|
160
|
+
);
|
|
144
161
|
}
|
|
145
162
|
|
|
146
163
|
/**
|
|
@@ -150,7 +167,7 @@ class GraphTraversalSource {
|
|
|
150
167
|
toString() {
|
|
151
168
|
return 'graphtraversalsource[' + this.graph.toString() + ']';
|
|
152
169
|
}
|
|
153
|
-
|
|
170
|
+
|
|
154
171
|
/**
|
|
155
172
|
* Graph Traversal Source withBulk method.
|
|
156
173
|
* @param {...Object} args
|
|
@@ -158,9 +175,15 @@ class GraphTraversalSource {
|
|
|
158
175
|
*/
|
|
159
176
|
withBulk(...args) {
|
|
160
177
|
const b = new Bytecode(this.bytecode).addSource('withBulk', args);
|
|
161
|
-
return new this.graphTraversalSourceClass(
|
|
178
|
+
return new this.graphTraversalSourceClass(
|
|
179
|
+
this.graph,
|
|
180
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
181
|
+
b,
|
|
182
|
+
this.graphTraversalSourceClass,
|
|
183
|
+
this.graphTraversalClass,
|
|
184
|
+
);
|
|
162
185
|
}
|
|
163
|
-
|
|
186
|
+
|
|
164
187
|
/**
|
|
165
188
|
* Graph Traversal Source withPath method.
|
|
166
189
|
* @param {...Object} args
|
|
@@ -168,9 +191,15 @@ class GraphTraversalSource {
|
|
|
168
191
|
*/
|
|
169
192
|
withPath(...args) {
|
|
170
193
|
const b = new Bytecode(this.bytecode).addSource('withPath', args);
|
|
171
|
-
return new this.graphTraversalSourceClass(
|
|
194
|
+
return new this.graphTraversalSourceClass(
|
|
195
|
+
this.graph,
|
|
196
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
197
|
+
b,
|
|
198
|
+
this.graphTraversalSourceClass,
|
|
199
|
+
this.graphTraversalClass,
|
|
200
|
+
);
|
|
172
201
|
}
|
|
173
|
-
|
|
202
|
+
|
|
174
203
|
/**
|
|
175
204
|
* Graph Traversal Source withSack method.
|
|
176
205
|
* @param {...Object} args
|
|
@@ -178,9 +207,15 @@ class GraphTraversalSource {
|
|
|
178
207
|
*/
|
|
179
208
|
withSack(...args) {
|
|
180
209
|
const b = new Bytecode(this.bytecode).addSource('withSack', args);
|
|
181
|
-
return new this.graphTraversalSourceClass(
|
|
210
|
+
return new this.graphTraversalSourceClass(
|
|
211
|
+
this.graph,
|
|
212
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
213
|
+
b,
|
|
214
|
+
this.graphTraversalSourceClass,
|
|
215
|
+
this.graphTraversalClass,
|
|
216
|
+
);
|
|
182
217
|
}
|
|
183
|
-
|
|
218
|
+
|
|
184
219
|
/**
|
|
185
220
|
* Graph Traversal Source withSideEffect method.
|
|
186
221
|
* @param {...Object} args
|
|
@@ -188,9 +223,15 @@ class GraphTraversalSource {
|
|
|
188
223
|
*/
|
|
189
224
|
withSideEffect(...args) {
|
|
190
225
|
const b = new Bytecode(this.bytecode).addSource('withSideEffect', args);
|
|
191
|
-
return new this.graphTraversalSourceClass(
|
|
226
|
+
return new this.graphTraversalSourceClass(
|
|
227
|
+
this.graph,
|
|
228
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
229
|
+
b,
|
|
230
|
+
this.graphTraversalSourceClass,
|
|
231
|
+
this.graphTraversalClass,
|
|
232
|
+
);
|
|
192
233
|
}
|
|
193
|
-
|
|
234
|
+
|
|
194
235
|
/**
|
|
195
236
|
* Graph Traversal Source withStrategies method.
|
|
196
237
|
* @param {...Object} args
|
|
@@ -198,9 +239,15 @@ class GraphTraversalSource {
|
|
|
198
239
|
*/
|
|
199
240
|
withStrategies(...args) {
|
|
200
241
|
const b = new Bytecode(this.bytecode).addSource('withStrategies', args);
|
|
201
|
-
return new this.graphTraversalSourceClass(
|
|
242
|
+
return new this.graphTraversalSourceClass(
|
|
243
|
+
this.graph,
|
|
244
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
245
|
+
b,
|
|
246
|
+
this.graphTraversalSourceClass,
|
|
247
|
+
this.graphTraversalClass,
|
|
248
|
+
);
|
|
202
249
|
}
|
|
203
|
-
|
|
250
|
+
|
|
204
251
|
/**
|
|
205
252
|
* Graph Traversal Source withoutStrategies method.
|
|
206
253
|
* @param {...Object} args
|
|
@@ -208,9 +255,15 @@ class GraphTraversalSource {
|
|
|
208
255
|
*/
|
|
209
256
|
withoutStrategies(...args) {
|
|
210
257
|
const b = new Bytecode(this.bytecode).addSource('withoutStrategies', args);
|
|
211
|
-
return new this.graphTraversalSourceClass(
|
|
258
|
+
return new this.graphTraversalSourceClass(
|
|
259
|
+
this.graph,
|
|
260
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
261
|
+
b,
|
|
262
|
+
this.graphTraversalSourceClass,
|
|
263
|
+
this.graphTraversalClass,
|
|
264
|
+
);
|
|
212
265
|
}
|
|
213
|
-
|
|
266
|
+
|
|
214
267
|
/**
|
|
215
268
|
* E GraphTraversalSource step method.
|
|
216
269
|
* @param {...Object} args
|
|
@@ -220,7 +273,7 @@ class GraphTraversalSource {
|
|
|
220
273
|
const b = new Bytecode(this.bytecode).addStep('E', args);
|
|
221
274
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
222
275
|
}
|
|
223
|
-
|
|
276
|
+
|
|
224
277
|
/**
|
|
225
278
|
* V GraphTraversalSource step method.
|
|
226
279
|
* @param {...Object} args
|
|
@@ -230,7 +283,7 @@ class GraphTraversalSource {
|
|
|
230
283
|
const b = new Bytecode(this.bytecode).addStep('V', args);
|
|
231
284
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
232
285
|
}
|
|
233
|
-
|
|
286
|
+
|
|
234
287
|
/**
|
|
235
288
|
* addE GraphTraversalSource step method.
|
|
236
289
|
* @param {...Object} args
|
|
@@ -240,7 +293,7 @@ class GraphTraversalSource {
|
|
|
240
293
|
const b = new Bytecode(this.bytecode).addStep('addE', args);
|
|
241
294
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
242
295
|
}
|
|
243
|
-
|
|
296
|
+
|
|
244
297
|
/**
|
|
245
298
|
* addV GraphTraversalSource step method.
|
|
246
299
|
* @param {...Object} args
|
|
@@ -250,7 +303,7 @@ class GraphTraversalSource {
|
|
|
250
303
|
const b = new Bytecode(this.bytecode).addStep('addV', args);
|
|
251
304
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
252
305
|
}
|
|
253
|
-
|
|
306
|
+
|
|
254
307
|
/**
|
|
255
308
|
* inject GraphTraversalSource step method.
|
|
256
309
|
* @param {...Object} args
|
|
@@ -260,7 +313,7 @@ class GraphTraversalSource {
|
|
|
260
313
|
const b = new Bytecode(this.bytecode).addStep('inject', args);
|
|
261
314
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
262
315
|
}
|
|
263
|
-
|
|
316
|
+
|
|
264
317
|
/**
|
|
265
318
|
* io GraphTraversalSource step method.
|
|
266
319
|
* @param {...Object} args
|
|
@@ -270,7 +323,6 @@ class GraphTraversalSource {
|
|
|
270
323
|
const b = new Bytecode(this.bytecode).addStep('io', args);
|
|
271
324
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
272
325
|
}
|
|
273
|
-
|
|
274
326
|
}
|
|
275
327
|
|
|
276
328
|
/**
|
|
@@ -288,7 +340,6 @@ class GraphTraversal extends Traversal {
|
|
|
288
340
|
return new GraphTraversal(this.graph, this.traversalStrategies, this.getBytecode());
|
|
289
341
|
}
|
|
290
342
|
|
|
291
|
-
|
|
292
343
|
/**
|
|
293
344
|
* Graph traversal V method.
|
|
294
345
|
* @param {...Object} args
|
|
@@ -298,7 +349,7 @@ class GraphTraversal extends Traversal {
|
|
|
298
349
|
this.bytecode.addStep('V', args);
|
|
299
350
|
return this;
|
|
300
351
|
}
|
|
301
|
-
|
|
352
|
+
|
|
302
353
|
/**
|
|
303
354
|
* Graph traversal addE method.
|
|
304
355
|
* @param {...Object} args
|
|
@@ -308,7 +359,7 @@ class GraphTraversal extends Traversal {
|
|
|
308
359
|
this.bytecode.addStep('addE', args);
|
|
309
360
|
return this;
|
|
310
361
|
}
|
|
311
|
-
|
|
362
|
+
|
|
312
363
|
/**
|
|
313
364
|
* Graph traversal addV method.
|
|
314
365
|
* @param {...Object} args
|
|
@@ -318,7 +369,7 @@ class GraphTraversal extends Traversal {
|
|
|
318
369
|
this.bytecode.addStep('addV', args);
|
|
319
370
|
return this;
|
|
320
371
|
}
|
|
321
|
-
|
|
372
|
+
|
|
322
373
|
/**
|
|
323
374
|
* Graph traversal aggregate method.
|
|
324
375
|
* @param {...Object} args
|
|
@@ -328,7 +379,7 @@ class GraphTraversal extends Traversal {
|
|
|
328
379
|
this.bytecode.addStep('aggregate', args);
|
|
329
380
|
return this;
|
|
330
381
|
}
|
|
331
|
-
|
|
382
|
+
|
|
332
383
|
/**
|
|
333
384
|
* Graph traversal and method.
|
|
334
385
|
* @param {...Object} args
|
|
@@ -338,7 +389,7 @@ class GraphTraversal extends Traversal {
|
|
|
338
389
|
this.bytecode.addStep('and', args);
|
|
339
390
|
return this;
|
|
340
391
|
}
|
|
341
|
-
|
|
392
|
+
|
|
342
393
|
/**
|
|
343
394
|
* Graph traversal as method.
|
|
344
395
|
* @param {...Object} args
|
|
@@ -348,7 +399,7 @@ class GraphTraversal extends Traversal {
|
|
|
348
399
|
this.bytecode.addStep('as', args);
|
|
349
400
|
return this;
|
|
350
401
|
}
|
|
351
|
-
|
|
402
|
+
|
|
352
403
|
/**
|
|
353
404
|
* Graph traversal barrier method.
|
|
354
405
|
* @param {...Object} args
|
|
@@ -358,7 +409,7 @@ class GraphTraversal extends Traversal {
|
|
|
358
409
|
this.bytecode.addStep('barrier', args);
|
|
359
410
|
return this;
|
|
360
411
|
}
|
|
361
|
-
|
|
412
|
+
|
|
362
413
|
/**
|
|
363
414
|
* Graph traversal both method.
|
|
364
415
|
* @param {...Object} args
|
|
@@ -368,7 +419,7 @@ class GraphTraversal extends Traversal {
|
|
|
368
419
|
this.bytecode.addStep('both', args);
|
|
369
420
|
return this;
|
|
370
421
|
}
|
|
371
|
-
|
|
422
|
+
|
|
372
423
|
/**
|
|
373
424
|
* Graph traversal bothE method.
|
|
374
425
|
* @param {...Object} args
|
|
@@ -378,7 +429,7 @@ class GraphTraversal extends Traversal {
|
|
|
378
429
|
this.bytecode.addStep('bothE', args);
|
|
379
430
|
return this;
|
|
380
431
|
}
|
|
381
|
-
|
|
432
|
+
|
|
382
433
|
/**
|
|
383
434
|
* Graph traversal bothV method.
|
|
384
435
|
* @param {...Object} args
|
|
@@ -388,7 +439,7 @@ class GraphTraversal extends Traversal {
|
|
|
388
439
|
this.bytecode.addStep('bothV', args);
|
|
389
440
|
return this;
|
|
390
441
|
}
|
|
391
|
-
|
|
442
|
+
|
|
392
443
|
/**
|
|
393
444
|
* Graph traversal branch method.
|
|
394
445
|
* @param {...Object} args
|
|
@@ -398,7 +449,7 @@ class GraphTraversal extends Traversal {
|
|
|
398
449
|
this.bytecode.addStep('branch', args);
|
|
399
450
|
return this;
|
|
400
451
|
}
|
|
401
|
-
|
|
452
|
+
|
|
402
453
|
/**
|
|
403
454
|
* Graph traversal by method.
|
|
404
455
|
* @param {...Object} args
|
|
@@ -408,7 +459,7 @@ class GraphTraversal extends Traversal {
|
|
|
408
459
|
this.bytecode.addStep('by', args);
|
|
409
460
|
return this;
|
|
410
461
|
}
|
|
411
|
-
|
|
462
|
+
|
|
412
463
|
/**
|
|
413
464
|
* Graph traversal cap method.
|
|
414
465
|
* @param {...Object} args
|
|
@@ -418,7 +469,7 @@ class GraphTraversal extends Traversal {
|
|
|
418
469
|
this.bytecode.addStep('cap', args);
|
|
419
470
|
return this;
|
|
420
471
|
}
|
|
421
|
-
|
|
472
|
+
|
|
422
473
|
/**
|
|
423
474
|
* Graph traversal choose method.
|
|
424
475
|
* @param {...Object} args
|
|
@@ -428,7 +479,7 @@ class GraphTraversal extends Traversal {
|
|
|
428
479
|
this.bytecode.addStep('choose', args);
|
|
429
480
|
return this;
|
|
430
481
|
}
|
|
431
|
-
|
|
482
|
+
|
|
432
483
|
/**
|
|
433
484
|
* Graph traversal coalesce method.
|
|
434
485
|
* @param {...Object} args
|
|
@@ -438,7 +489,7 @@ class GraphTraversal extends Traversal {
|
|
|
438
489
|
this.bytecode.addStep('coalesce', args);
|
|
439
490
|
return this;
|
|
440
491
|
}
|
|
441
|
-
|
|
492
|
+
|
|
442
493
|
/**
|
|
443
494
|
* Graph traversal coin method.
|
|
444
495
|
* @param {...Object} args
|
|
@@ -448,7 +499,7 @@ class GraphTraversal extends Traversal {
|
|
|
448
499
|
this.bytecode.addStep('coin', args);
|
|
449
500
|
return this;
|
|
450
501
|
}
|
|
451
|
-
|
|
502
|
+
|
|
452
503
|
/**
|
|
453
504
|
* Graph traversal connectedComponent method.
|
|
454
505
|
* @param {...Object} args
|
|
@@ -458,7 +509,7 @@ class GraphTraversal extends Traversal {
|
|
|
458
509
|
this.bytecode.addStep('connectedComponent', args);
|
|
459
510
|
return this;
|
|
460
511
|
}
|
|
461
|
-
|
|
512
|
+
|
|
462
513
|
/**
|
|
463
514
|
* Graph traversal constant method.
|
|
464
515
|
* @param {...Object} args
|
|
@@ -468,7 +519,7 @@ class GraphTraversal extends Traversal {
|
|
|
468
519
|
this.bytecode.addStep('constant', args);
|
|
469
520
|
return this;
|
|
470
521
|
}
|
|
471
|
-
|
|
522
|
+
|
|
472
523
|
/**
|
|
473
524
|
* Graph traversal count method.
|
|
474
525
|
* @param {...Object} args
|
|
@@ -478,7 +529,7 @@ class GraphTraversal extends Traversal {
|
|
|
478
529
|
this.bytecode.addStep('count', args);
|
|
479
530
|
return this;
|
|
480
531
|
}
|
|
481
|
-
|
|
532
|
+
|
|
482
533
|
/**
|
|
483
534
|
* Graph traversal cyclicPath method.
|
|
484
535
|
* @param {...Object} args
|
|
@@ -488,7 +539,7 @@ class GraphTraversal extends Traversal {
|
|
|
488
539
|
this.bytecode.addStep('cyclicPath', args);
|
|
489
540
|
return this;
|
|
490
541
|
}
|
|
491
|
-
|
|
542
|
+
|
|
492
543
|
/**
|
|
493
544
|
* Graph traversal dedup method.
|
|
494
545
|
* @param {...Object} args
|
|
@@ -498,7 +549,7 @@ class GraphTraversal extends Traversal {
|
|
|
498
549
|
this.bytecode.addStep('dedup', args);
|
|
499
550
|
return this;
|
|
500
551
|
}
|
|
501
|
-
|
|
552
|
+
|
|
502
553
|
/**
|
|
503
554
|
* Graph traversal drop method.
|
|
504
555
|
* @param {...Object} args
|
|
@@ -508,7 +559,7 @@ class GraphTraversal extends Traversal {
|
|
|
508
559
|
this.bytecode.addStep('drop', args);
|
|
509
560
|
return this;
|
|
510
561
|
}
|
|
511
|
-
|
|
562
|
+
|
|
512
563
|
/**
|
|
513
564
|
* Graph traversal elementMap method.
|
|
514
565
|
* @param {...Object} args
|
|
@@ -518,7 +569,7 @@ class GraphTraversal extends Traversal {
|
|
|
518
569
|
this.bytecode.addStep('elementMap', args);
|
|
519
570
|
return this;
|
|
520
571
|
}
|
|
521
|
-
|
|
572
|
+
|
|
522
573
|
/**
|
|
523
574
|
* Graph traversal emit method.
|
|
524
575
|
* @param {...Object} args
|
|
@@ -528,7 +579,7 @@ class GraphTraversal extends Traversal {
|
|
|
528
579
|
this.bytecode.addStep('emit', args);
|
|
529
580
|
return this;
|
|
530
581
|
}
|
|
531
|
-
|
|
582
|
+
|
|
532
583
|
/**
|
|
533
584
|
* Graph traversal filter method.
|
|
534
585
|
* @param {...Object} args
|
|
@@ -538,7 +589,7 @@ class GraphTraversal extends Traversal {
|
|
|
538
589
|
this.bytecode.addStep('filter', args);
|
|
539
590
|
return this;
|
|
540
591
|
}
|
|
541
|
-
|
|
592
|
+
|
|
542
593
|
/**
|
|
543
594
|
* Graph traversal flatMap method.
|
|
544
595
|
* @param {...Object} args
|
|
@@ -548,7 +599,7 @@ class GraphTraversal extends Traversal {
|
|
|
548
599
|
this.bytecode.addStep('flatMap', args);
|
|
549
600
|
return this;
|
|
550
601
|
}
|
|
551
|
-
|
|
602
|
+
|
|
552
603
|
/**
|
|
553
604
|
* Graph traversal fold method.
|
|
554
605
|
* @param {...Object} args
|
|
@@ -558,7 +609,7 @@ class GraphTraversal extends Traversal {
|
|
|
558
609
|
this.bytecode.addStep('fold', args);
|
|
559
610
|
return this;
|
|
560
611
|
}
|
|
561
|
-
|
|
612
|
+
|
|
562
613
|
/**
|
|
563
614
|
* Graph traversal from method.
|
|
564
615
|
* @param {...Object} args
|
|
@@ -568,7 +619,7 @@ class GraphTraversal extends Traversal {
|
|
|
568
619
|
this.bytecode.addStep('from', args);
|
|
569
620
|
return this;
|
|
570
621
|
}
|
|
571
|
-
|
|
622
|
+
|
|
572
623
|
/**
|
|
573
624
|
* Graph traversal group method.
|
|
574
625
|
* @param {...Object} args
|
|
@@ -578,7 +629,7 @@ class GraphTraversal extends Traversal {
|
|
|
578
629
|
this.bytecode.addStep('group', args);
|
|
579
630
|
return this;
|
|
580
631
|
}
|
|
581
|
-
|
|
632
|
+
|
|
582
633
|
/**
|
|
583
634
|
* Graph traversal groupCount method.
|
|
584
635
|
* @param {...Object} args
|
|
@@ -588,7 +639,7 @@ class GraphTraversal extends Traversal {
|
|
|
588
639
|
this.bytecode.addStep('groupCount', args);
|
|
589
640
|
return this;
|
|
590
641
|
}
|
|
591
|
-
|
|
642
|
+
|
|
592
643
|
/**
|
|
593
644
|
* Graph traversal has method.
|
|
594
645
|
* @param {...Object} args
|
|
@@ -598,7 +649,7 @@ class GraphTraversal extends Traversal {
|
|
|
598
649
|
this.bytecode.addStep('has', args);
|
|
599
650
|
return this;
|
|
600
651
|
}
|
|
601
|
-
|
|
652
|
+
|
|
602
653
|
/**
|
|
603
654
|
* Graph traversal hasId method.
|
|
604
655
|
* @param {...Object} args
|
|
@@ -608,7 +659,7 @@ class GraphTraversal extends Traversal {
|
|
|
608
659
|
this.bytecode.addStep('hasId', args);
|
|
609
660
|
return this;
|
|
610
661
|
}
|
|
611
|
-
|
|
662
|
+
|
|
612
663
|
/**
|
|
613
664
|
* Graph traversal hasKey method.
|
|
614
665
|
* @param {...Object} args
|
|
@@ -618,7 +669,7 @@ class GraphTraversal extends Traversal {
|
|
|
618
669
|
this.bytecode.addStep('hasKey', args);
|
|
619
670
|
return this;
|
|
620
671
|
}
|
|
621
|
-
|
|
672
|
+
|
|
622
673
|
/**
|
|
623
674
|
* Graph traversal hasLabel method.
|
|
624
675
|
* @param {...Object} args
|
|
@@ -628,7 +679,7 @@ class GraphTraversal extends Traversal {
|
|
|
628
679
|
this.bytecode.addStep('hasLabel', args);
|
|
629
680
|
return this;
|
|
630
681
|
}
|
|
631
|
-
|
|
682
|
+
|
|
632
683
|
/**
|
|
633
684
|
* Graph traversal hasNot method.
|
|
634
685
|
* @param {...Object} args
|
|
@@ -638,7 +689,7 @@ class GraphTraversal extends Traversal {
|
|
|
638
689
|
this.bytecode.addStep('hasNot', args);
|
|
639
690
|
return this;
|
|
640
691
|
}
|
|
641
|
-
|
|
692
|
+
|
|
642
693
|
/**
|
|
643
694
|
* Graph traversal hasValue method.
|
|
644
695
|
* @param {...Object} args
|
|
@@ -648,7 +699,7 @@ class GraphTraversal extends Traversal {
|
|
|
648
699
|
this.bytecode.addStep('hasValue', args);
|
|
649
700
|
return this;
|
|
650
701
|
}
|
|
651
|
-
|
|
702
|
+
|
|
652
703
|
/**
|
|
653
704
|
* Graph traversal id method.
|
|
654
705
|
* @param {...Object} args
|
|
@@ -658,7 +709,7 @@ class GraphTraversal extends Traversal {
|
|
|
658
709
|
this.bytecode.addStep('id', args);
|
|
659
710
|
return this;
|
|
660
711
|
}
|
|
661
|
-
|
|
712
|
+
|
|
662
713
|
/**
|
|
663
714
|
* Graph traversal identity method.
|
|
664
715
|
* @param {...Object} args
|
|
@@ -668,7 +719,7 @@ class GraphTraversal extends Traversal {
|
|
|
668
719
|
this.bytecode.addStep('identity', args);
|
|
669
720
|
return this;
|
|
670
721
|
}
|
|
671
|
-
|
|
722
|
+
|
|
672
723
|
/**
|
|
673
724
|
* Graph traversal in method.
|
|
674
725
|
* @param {...Object} args
|
|
@@ -678,7 +729,7 @@ class GraphTraversal extends Traversal {
|
|
|
678
729
|
this.bytecode.addStep('in', args);
|
|
679
730
|
return this;
|
|
680
731
|
}
|
|
681
|
-
|
|
732
|
+
|
|
682
733
|
/**
|
|
683
734
|
* Graph traversal inE method.
|
|
684
735
|
* @param {...Object} args
|
|
@@ -688,7 +739,7 @@ class GraphTraversal extends Traversal {
|
|
|
688
739
|
this.bytecode.addStep('inE', args);
|
|
689
740
|
return this;
|
|
690
741
|
}
|
|
691
|
-
|
|
742
|
+
|
|
692
743
|
/**
|
|
693
744
|
* Graph traversal inV method.
|
|
694
745
|
* @param {...Object} args
|
|
@@ -698,7 +749,7 @@ class GraphTraversal extends Traversal {
|
|
|
698
749
|
this.bytecode.addStep('inV', args);
|
|
699
750
|
return this;
|
|
700
751
|
}
|
|
701
|
-
|
|
752
|
+
|
|
702
753
|
/**
|
|
703
754
|
* Graph traversal index method.
|
|
704
755
|
* @param {...Object} args
|
|
@@ -708,7 +759,7 @@ class GraphTraversal extends Traversal {
|
|
|
708
759
|
this.bytecode.addStep('index', args);
|
|
709
760
|
return this;
|
|
710
761
|
}
|
|
711
|
-
|
|
762
|
+
|
|
712
763
|
/**
|
|
713
764
|
* Graph traversal inject method.
|
|
714
765
|
* @param {...Object} args
|
|
@@ -718,7 +769,7 @@ class GraphTraversal extends Traversal {
|
|
|
718
769
|
this.bytecode.addStep('inject', args);
|
|
719
770
|
return this;
|
|
720
771
|
}
|
|
721
|
-
|
|
772
|
+
|
|
722
773
|
/**
|
|
723
774
|
* Graph traversal is method.
|
|
724
775
|
* @param {...Object} args
|
|
@@ -728,7 +779,7 @@ class GraphTraversal extends Traversal {
|
|
|
728
779
|
this.bytecode.addStep('is', args);
|
|
729
780
|
return this;
|
|
730
781
|
}
|
|
731
|
-
|
|
782
|
+
|
|
732
783
|
/**
|
|
733
784
|
* Graph traversal key method.
|
|
734
785
|
* @param {...Object} args
|
|
@@ -738,7 +789,7 @@ class GraphTraversal extends Traversal {
|
|
|
738
789
|
this.bytecode.addStep('key', args);
|
|
739
790
|
return this;
|
|
740
791
|
}
|
|
741
|
-
|
|
792
|
+
|
|
742
793
|
/**
|
|
743
794
|
* Graph traversal label method.
|
|
744
795
|
* @param {...Object} args
|
|
@@ -748,7 +799,7 @@ class GraphTraversal extends Traversal {
|
|
|
748
799
|
this.bytecode.addStep('label', args);
|
|
749
800
|
return this;
|
|
750
801
|
}
|
|
751
|
-
|
|
802
|
+
|
|
752
803
|
/**
|
|
753
804
|
* Graph traversal limit method.
|
|
754
805
|
* @param {...Object} args
|
|
@@ -758,7 +809,7 @@ class GraphTraversal extends Traversal {
|
|
|
758
809
|
this.bytecode.addStep('limit', args);
|
|
759
810
|
return this;
|
|
760
811
|
}
|
|
761
|
-
|
|
812
|
+
|
|
762
813
|
/**
|
|
763
814
|
* Graph traversal local method.
|
|
764
815
|
* @param {...Object} args
|
|
@@ -768,7 +819,7 @@ class GraphTraversal extends Traversal {
|
|
|
768
819
|
this.bytecode.addStep('local', args);
|
|
769
820
|
return this;
|
|
770
821
|
}
|
|
771
|
-
|
|
822
|
+
|
|
772
823
|
/**
|
|
773
824
|
* Graph traversal loops method.
|
|
774
825
|
* @param {...Object} args
|
|
@@ -778,7 +829,7 @@ class GraphTraversal extends Traversal {
|
|
|
778
829
|
this.bytecode.addStep('loops', args);
|
|
779
830
|
return this;
|
|
780
831
|
}
|
|
781
|
-
|
|
832
|
+
|
|
782
833
|
/**
|
|
783
834
|
* Graph traversal map method.
|
|
784
835
|
* @param {...Object} args
|
|
@@ -788,7 +839,7 @@ class GraphTraversal extends Traversal {
|
|
|
788
839
|
this.bytecode.addStep('map', args);
|
|
789
840
|
return this;
|
|
790
841
|
}
|
|
791
|
-
|
|
842
|
+
|
|
792
843
|
/**
|
|
793
844
|
* Graph traversal match method.
|
|
794
845
|
* @param {...Object} args
|
|
@@ -798,7 +849,7 @@ class GraphTraversal extends Traversal {
|
|
|
798
849
|
this.bytecode.addStep('match', args);
|
|
799
850
|
return this;
|
|
800
851
|
}
|
|
801
|
-
|
|
852
|
+
|
|
802
853
|
/**
|
|
803
854
|
* Graph traversal math method.
|
|
804
855
|
* @param {...Object} args
|
|
@@ -808,7 +859,7 @@ class GraphTraversal extends Traversal {
|
|
|
808
859
|
this.bytecode.addStep('math', args);
|
|
809
860
|
return this;
|
|
810
861
|
}
|
|
811
|
-
|
|
862
|
+
|
|
812
863
|
/**
|
|
813
864
|
* Graph traversal max method.
|
|
814
865
|
* @param {...Object} args
|
|
@@ -818,7 +869,7 @@ class GraphTraversal extends Traversal {
|
|
|
818
869
|
this.bytecode.addStep('max', args);
|
|
819
870
|
return this;
|
|
820
871
|
}
|
|
821
|
-
|
|
872
|
+
|
|
822
873
|
/**
|
|
823
874
|
* Graph traversal mean method.
|
|
824
875
|
* @param {...Object} args
|
|
@@ -828,7 +879,7 @@ class GraphTraversal extends Traversal {
|
|
|
828
879
|
this.bytecode.addStep('mean', args);
|
|
829
880
|
return this;
|
|
830
881
|
}
|
|
831
|
-
|
|
882
|
+
|
|
832
883
|
/**
|
|
833
884
|
* Graph traversal min method.
|
|
834
885
|
* @param {...Object} args
|
|
@@ -838,7 +889,7 @@ class GraphTraversal extends Traversal {
|
|
|
838
889
|
this.bytecode.addStep('min', args);
|
|
839
890
|
return this;
|
|
840
891
|
}
|
|
841
|
-
|
|
892
|
+
|
|
842
893
|
/**
|
|
843
894
|
* Graph traversal none method.
|
|
844
895
|
* @param {...Object} args
|
|
@@ -848,7 +899,7 @@ class GraphTraversal extends Traversal {
|
|
|
848
899
|
this.bytecode.addStep('none', args);
|
|
849
900
|
return this;
|
|
850
901
|
}
|
|
851
|
-
|
|
902
|
+
|
|
852
903
|
/**
|
|
853
904
|
* Graph traversal not method.
|
|
854
905
|
* @param {...Object} args
|
|
@@ -858,7 +909,7 @@ class GraphTraversal extends Traversal {
|
|
|
858
909
|
this.bytecode.addStep('not', args);
|
|
859
910
|
return this;
|
|
860
911
|
}
|
|
861
|
-
|
|
912
|
+
|
|
862
913
|
/**
|
|
863
914
|
* Graph traversal option method.
|
|
864
915
|
* @param {...Object} args
|
|
@@ -868,7 +919,7 @@ class GraphTraversal extends Traversal {
|
|
|
868
919
|
this.bytecode.addStep('option', args);
|
|
869
920
|
return this;
|
|
870
921
|
}
|
|
871
|
-
|
|
922
|
+
|
|
872
923
|
/**
|
|
873
924
|
* Graph traversal optional method.
|
|
874
925
|
* @param {...Object} args
|
|
@@ -878,7 +929,7 @@ class GraphTraversal extends Traversal {
|
|
|
878
929
|
this.bytecode.addStep('optional', args);
|
|
879
930
|
return this;
|
|
880
931
|
}
|
|
881
|
-
|
|
932
|
+
|
|
882
933
|
/**
|
|
883
934
|
* Graph traversal or method.
|
|
884
935
|
* @param {...Object} args
|
|
@@ -888,7 +939,7 @@ class GraphTraversal extends Traversal {
|
|
|
888
939
|
this.bytecode.addStep('or', args);
|
|
889
940
|
return this;
|
|
890
941
|
}
|
|
891
|
-
|
|
942
|
+
|
|
892
943
|
/**
|
|
893
944
|
* Graph traversal order method.
|
|
894
945
|
* @param {...Object} args
|
|
@@ -898,7 +949,7 @@ class GraphTraversal extends Traversal {
|
|
|
898
949
|
this.bytecode.addStep('order', args);
|
|
899
950
|
return this;
|
|
900
951
|
}
|
|
901
|
-
|
|
952
|
+
|
|
902
953
|
/**
|
|
903
954
|
* Graph traversal otherV method.
|
|
904
955
|
* @param {...Object} args
|
|
@@ -908,7 +959,7 @@ class GraphTraversal extends Traversal {
|
|
|
908
959
|
this.bytecode.addStep('otherV', args);
|
|
909
960
|
return this;
|
|
910
961
|
}
|
|
911
|
-
|
|
962
|
+
|
|
912
963
|
/**
|
|
913
964
|
* Graph traversal out method.
|
|
914
965
|
* @param {...Object} args
|
|
@@ -918,7 +969,7 @@ class GraphTraversal extends Traversal {
|
|
|
918
969
|
this.bytecode.addStep('out', args);
|
|
919
970
|
return this;
|
|
920
971
|
}
|
|
921
|
-
|
|
972
|
+
|
|
922
973
|
/**
|
|
923
974
|
* Graph traversal outE method.
|
|
924
975
|
* @param {...Object} args
|
|
@@ -928,7 +979,7 @@ class GraphTraversal extends Traversal {
|
|
|
928
979
|
this.bytecode.addStep('outE', args);
|
|
929
980
|
return this;
|
|
930
981
|
}
|
|
931
|
-
|
|
982
|
+
|
|
932
983
|
/**
|
|
933
984
|
* Graph traversal outV method.
|
|
934
985
|
* @param {...Object} args
|
|
@@ -938,7 +989,7 @@ class GraphTraversal extends Traversal {
|
|
|
938
989
|
this.bytecode.addStep('outV', args);
|
|
939
990
|
return this;
|
|
940
991
|
}
|
|
941
|
-
|
|
992
|
+
|
|
942
993
|
/**
|
|
943
994
|
* Graph traversal pageRank method.
|
|
944
995
|
* @param {...Object} args
|
|
@@ -948,7 +999,7 @@ class GraphTraversal extends Traversal {
|
|
|
948
999
|
this.bytecode.addStep('pageRank', args);
|
|
949
1000
|
return this;
|
|
950
1001
|
}
|
|
951
|
-
|
|
1002
|
+
|
|
952
1003
|
/**
|
|
953
1004
|
* Graph traversal path method.
|
|
954
1005
|
* @param {...Object} args
|
|
@@ -958,7 +1009,7 @@ class GraphTraversal extends Traversal {
|
|
|
958
1009
|
this.bytecode.addStep('path', args);
|
|
959
1010
|
return this;
|
|
960
1011
|
}
|
|
961
|
-
|
|
1012
|
+
|
|
962
1013
|
/**
|
|
963
1014
|
* Graph traversal peerPressure method.
|
|
964
1015
|
* @param {...Object} args
|
|
@@ -968,7 +1019,7 @@ class GraphTraversal extends Traversal {
|
|
|
968
1019
|
this.bytecode.addStep('peerPressure', args);
|
|
969
1020
|
return this;
|
|
970
1021
|
}
|
|
971
|
-
|
|
1022
|
+
|
|
972
1023
|
/**
|
|
973
1024
|
* Graph traversal profile method.
|
|
974
1025
|
* @param {...Object} args
|
|
@@ -978,7 +1029,7 @@ class GraphTraversal extends Traversal {
|
|
|
978
1029
|
this.bytecode.addStep('profile', args);
|
|
979
1030
|
return this;
|
|
980
1031
|
}
|
|
981
|
-
|
|
1032
|
+
|
|
982
1033
|
/**
|
|
983
1034
|
* Graph traversal program method.
|
|
984
1035
|
* @param {...Object} args
|
|
@@ -988,7 +1039,7 @@ class GraphTraversal extends Traversal {
|
|
|
988
1039
|
this.bytecode.addStep('program', args);
|
|
989
1040
|
return this;
|
|
990
1041
|
}
|
|
991
|
-
|
|
1042
|
+
|
|
992
1043
|
/**
|
|
993
1044
|
* Graph traversal project method.
|
|
994
1045
|
* @param {...Object} args
|
|
@@ -998,7 +1049,7 @@ class GraphTraversal extends Traversal {
|
|
|
998
1049
|
this.bytecode.addStep('project', args);
|
|
999
1050
|
return this;
|
|
1000
1051
|
}
|
|
1001
|
-
|
|
1052
|
+
|
|
1002
1053
|
/**
|
|
1003
1054
|
* Graph traversal properties method.
|
|
1004
1055
|
* @param {...Object} args
|
|
@@ -1008,7 +1059,7 @@ class GraphTraversal extends Traversal {
|
|
|
1008
1059
|
this.bytecode.addStep('properties', args);
|
|
1009
1060
|
return this;
|
|
1010
1061
|
}
|
|
1011
|
-
|
|
1062
|
+
|
|
1012
1063
|
/**
|
|
1013
1064
|
* Graph traversal property method.
|
|
1014
1065
|
* @param {...Object} args
|
|
@@ -1018,7 +1069,7 @@ class GraphTraversal extends Traversal {
|
|
|
1018
1069
|
this.bytecode.addStep('property', args);
|
|
1019
1070
|
return this;
|
|
1020
1071
|
}
|
|
1021
|
-
|
|
1072
|
+
|
|
1022
1073
|
/**
|
|
1023
1074
|
* Graph traversal propertyMap method.
|
|
1024
1075
|
* @param {...Object} args
|
|
@@ -1028,7 +1079,7 @@ class GraphTraversal extends Traversal {
|
|
|
1028
1079
|
this.bytecode.addStep('propertyMap', args);
|
|
1029
1080
|
return this;
|
|
1030
1081
|
}
|
|
1031
|
-
|
|
1082
|
+
|
|
1032
1083
|
/**
|
|
1033
1084
|
* Graph traversal range method.
|
|
1034
1085
|
* @param {...Object} args
|
|
@@ -1038,7 +1089,7 @@ class GraphTraversal extends Traversal {
|
|
|
1038
1089
|
this.bytecode.addStep('range', args);
|
|
1039
1090
|
return this;
|
|
1040
1091
|
}
|
|
1041
|
-
|
|
1092
|
+
|
|
1042
1093
|
/**
|
|
1043
1094
|
* Graph traversal read method.
|
|
1044
1095
|
* @param {...Object} args
|
|
@@ -1048,7 +1099,7 @@ class GraphTraversal extends Traversal {
|
|
|
1048
1099
|
this.bytecode.addStep('read', args);
|
|
1049
1100
|
return this;
|
|
1050
1101
|
}
|
|
1051
|
-
|
|
1102
|
+
|
|
1052
1103
|
/**
|
|
1053
1104
|
* Graph traversal repeat method.
|
|
1054
1105
|
* @param {...Object} args
|
|
@@ -1058,7 +1109,7 @@ class GraphTraversal extends Traversal {
|
|
|
1058
1109
|
this.bytecode.addStep('repeat', args);
|
|
1059
1110
|
return this;
|
|
1060
1111
|
}
|
|
1061
|
-
|
|
1112
|
+
|
|
1062
1113
|
/**
|
|
1063
1114
|
* Graph traversal sack method.
|
|
1064
1115
|
* @param {...Object} args
|
|
@@ -1068,7 +1119,7 @@ class GraphTraversal extends Traversal {
|
|
|
1068
1119
|
this.bytecode.addStep('sack', args);
|
|
1069
1120
|
return this;
|
|
1070
1121
|
}
|
|
1071
|
-
|
|
1122
|
+
|
|
1072
1123
|
/**
|
|
1073
1124
|
* Graph traversal sample method.
|
|
1074
1125
|
* @param {...Object} args
|
|
@@ -1078,7 +1129,7 @@ class GraphTraversal extends Traversal {
|
|
|
1078
1129
|
this.bytecode.addStep('sample', args);
|
|
1079
1130
|
return this;
|
|
1080
1131
|
}
|
|
1081
|
-
|
|
1132
|
+
|
|
1082
1133
|
/**
|
|
1083
1134
|
* Graph traversal select method.
|
|
1084
1135
|
* @param {...Object} args
|
|
@@ -1088,7 +1139,7 @@ class GraphTraversal extends Traversal {
|
|
|
1088
1139
|
this.bytecode.addStep('select', args);
|
|
1089
1140
|
return this;
|
|
1090
1141
|
}
|
|
1091
|
-
|
|
1142
|
+
|
|
1092
1143
|
/**
|
|
1093
1144
|
* Graph traversal shortestPath method.
|
|
1094
1145
|
* @param {...Object} args
|
|
@@ -1098,7 +1149,7 @@ class GraphTraversal extends Traversal {
|
|
|
1098
1149
|
this.bytecode.addStep('shortestPath', args);
|
|
1099
1150
|
return this;
|
|
1100
1151
|
}
|
|
1101
|
-
|
|
1152
|
+
|
|
1102
1153
|
/**
|
|
1103
1154
|
* Graph traversal sideEffect method.
|
|
1104
1155
|
* @param {...Object} args
|
|
@@ -1108,7 +1159,7 @@ class GraphTraversal extends Traversal {
|
|
|
1108
1159
|
this.bytecode.addStep('sideEffect', args);
|
|
1109
1160
|
return this;
|
|
1110
1161
|
}
|
|
1111
|
-
|
|
1162
|
+
|
|
1112
1163
|
/**
|
|
1113
1164
|
* Graph traversal simplePath method.
|
|
1114
1165
|
* @param {...Object} args
|
|
@@ -1118,7 +1169,7 @@ class GraphTraversal extends Traversal {
|
|
|
1118
1169
|
this.bytecode.addStep('simplePath', args);
|
|
1119
1170
|
return this;
|
|
1120
1171
|
}
|
|
1121
|
-
|
|
1172
|
+
|
|
1122
1173
|
/**
|
|
1123
1174
|
* Graph traversal skip method.
|
|
1124
1175
|
* @param {...Object} args
|
|
@@ -1128,7 +1179,7 @@ class GraphTraversal extends Traversal {
|
|
|
1128
1179
|
this.bytecode.addStep('skip', args);
|
|
1129
1180
|
return this;
|
|
1130
1181
|
}
|
|
1131
|
-
|
|
1182
|
+
|
|
1132
1183
|
/**
|
|
1133
1184
|
* Graph traversal store method.
|
|
1134
1185
|
* @param {...Object} args
|
|
@@ -1138,7 +1189,7 @@ class GraphTraversal extends Traversal {
|
|
|
1138
1189
|
this.bytecode.addStep('store', args);
|
|
1139
1190
|
return this;
|
|
1140
1191
|
}
|
|
1141
|
-
|
|
1192
|
+
|
|
1142
1193
|
/**
|
|
1143
1194
|
* Graph traversal subgraph method.
|
|
1144
1195
|
* @param {...Object} args
|
|
@@ -1148,7 +1199,7 @@ class GraphTraversal extends Traversal {
|
|
|
1148
1199
|
this.bytecode.addStep('subgraph', args);
|
|
1149
1200
|
return this;
|
|
1150
1201
|
}
|
|
1151
|
-
|
|
1202
|
+
|
|
1152
1203
|
/**
|
|
1153
1204
|
* Graph traversal sum method.
|
|
1154
1205
|
* @param {...Object} args
|
|
@@ -1158,7 +1209,7 @@ class GraphTraversal extends Traversal {
|
|
|
1158
1209
|
this.bytecode.addStep('sum', args);
|
|
1159
1210
|
return this;
|
|
1160
1211
|
}
|
|
1161
|
-
|
|
1212
|
+
|
|
1162
1213
|
/**
|
|
1163
1214
|
* Graph traversal tail method.
|
|
1164
1215
|
* @param {...Object} args
|
|
@@ -1168,7 +1219,7 @@ class GraphTraversal extends Traversal {
|
|
|
1168
1219
|
this.bytecode.addStep('tail', args);
|
|
1169
1220
|
return this;
|
|
1170
1221
|
}
|
|
1171
|
-
|
|
1222
|
+
|
|
1172
1223
|
/**
|
|
1173
1224
|
* Graph traversal timeLimit method.
|
|
1174
1225
|
* @param {...Object} args
|
|
@@ -1178,7 +1229,7 @@ class GraphTraversal extends Traversal {
|
|
|
1178
1229
|
this.bytecode.addStep('timeLimit', args);
|
|
1179
1230
|
return this;
|
|
1180
1231
|
}
|
|
1181
|
-
|
|
1232
|
+
|
|
1182
1233
|
/**
|
|
1183
1234
|
* Graph traversal times method.
|
|
1184
1235
|
* @param {...Object} args
|
|
@@ -1188,7 +1239,7 @@ class GraphTraversal extends Traversal {
|
|
|
1188
1239
|
this.bytecode.addStep('times', args);
|
|
1189
1240
|
return this;
|
|
1190
1241
|
}
|
|
1191
|
-
|
|
1242
|
+
|
|
1192
1243
|
/**
|
|
1193
1244
|
* Graph traversal to method.
|
|
1194
1245
|
* @param {...Object} args
|
|
@@ -1198,7 +1249,7 @@ class GraphTraversal extends Traversal {
|
|
|
1198
1249
|
this.bytecode.addStep('to', args);
|
|
1199
1250
|
return this;
|
|
1200
1251
|
}
|
|
1201
|
-
|
|
1252
|
+
|
|
1202
1253
|
/**
|
|
1203
1254
|
* Graph traversal toE method.
|
|
1204
1255
|
* @param {...Object} args
|
|
@@ -1208,7 +1259,7 @@ class GraphTraversal extends Traversal {
|
|
|
1208
1259
|
this.bytecode.addStep('toE', args);
|
|
1209
1260
|
return this;
|
|
1210
1261
|
}
|
|
1211
|
-
|
|
1262
|
+
|
|
1212
1263
|
/**
|
|
1213
1264
|
* Graph traversal toV method.
|
|
1214
1265
|
* @param {...Object} args
|
|
@@ -1218,7 +1269,7 @@ class GraphTraversal extends Traversal {
|
|
|
1218
1269
|
this.bytecode.addStep('toV', args);
|
|
1219
1270
|
return this;
|
|
1220
1271
|
}
|
|
1221
|
-
|
|
1272
|
+
|
|
1222
1273
|
/**
|
|
1223
1274
|
* Graph traversal tree method.
|
|
1224
1275
|
* @param {...Object} args
|
|
@@ -1228,7 +1279,7 @@ class GraphTraversal extends Traversal {
|
|
|
1228
1279
|
this.bytecode.addStep('tree', args);
|
|
1229
1280
|
return this;
|
|
1230
1281
|
}
|
|
1231
|
-
|
|
1282
|
+
|
|
1232
1283
|
/**
|
|
1233
1284
|
* Graph traversal unfold method.
|
|
1234
1285
|
* @param {...Object} args
|
|
@@ -1238,7 +1289,7 @@ class GraphTraversal extends Traversal {
|
|
|
1238
1289
|
this.bytecode.addStep('unfold', args);
|
|
1239
1290
|
return this;
|
|
1240
1291
|
}
|
|
1241
|
-
|
|
1292
|
+
|
|
1242
1293
|
/**
|
|
1243
1294
|
* Graph traversal union method.
|
|
1244
1295
|
* @param {...Object} args
|
|
@@ -1248,7 +1299,7 @@ class GraphTraversal extends Traversal {
|
|
|
1248
1299
|
this.bytecode.addStep('union', args);
|
|
1249
1300
|
return this;
|
|
1250
1301
|
}
|
|
1251
|
-
|
|
1302
|
+
|
|
1252
1303
|
/**
|
|
1253
1304
|
* Graph traversal until method.
|
|
1254
1305
|
* @param {...Object} args
|
|
@@ -1258,7 +1309,7 @@ class GraphTraversal extends Traversal {
|
|
|
1258
1309
|
this.bytecode.addStep('until', args);
|
|
1259
1310
|
return this;
|
|
1260
1311
|
}
|
|
1261
|
-
|
|
1312
|
+
|
|
1262
1313
|
/**
|
|
1263
1314
|
* Graph traversal value method.
|
|
1264
1315
|
* @param {...Object} args
|
|
@@ -1268,7 +1319,7 @@ class GraphTraversal extends Traversal {
|
|
|
1268
1319
|
this.bytecode.addStep('value', args);
|
|
1269
1320
|
return this;
|
|
1270
1321
|
}
|
|
1271
|
-
|
|
1322
|
+
|
|
1272
1323
|
/**
|
|
1273
1324
|
* Graph traversal valueMap method.
|
|
1274
1325
|
* @param {...Object} args
|
|
@@ -1278,7 +1329,7 @@ class GraphTraversal extends Traversal {
|
|
|
1278
1329
|
this.bytecode.addStep('valueMap', args);
|
|
1279
1330
|
return this;
|
|
1280
1331
|
}
|
|
1281
|
-
|
|
1332
|
+
|
|
1282
1333
|
/**
|
|
1283
1334
|
* Graph traversal values method.
|
|
1284
1335
|
* @param {...Object} args
|
|
@@ -1288,7 +1339,7 @@ class GraphTraversal extends Traversal {
|
|
|
1288
1339
|
this.bytecode.addStep('values', args);
|
|
1289
1340
|
return this;
|
|
1290
1341
|
}
|
|
1291
|
-
|
|
1342
|
+
|
|
1292
1343
|
/**
|
|
1293
1344
|
* Graph traversal where method.
|
|
1294
1345
|
* @param {...Object} args
|
|
@@ -1298,7 +1349,7 @@ class GraphTraversal extends Traversal {
|
|
|
1298
1349
|
this.bytecode.addStep('where', args);
|
|
1299
1350
|
return this;
|
|
1300
1351
|
}
|
|
1301
|
-
|
|
1352
|
+
|
|
1302
1353
|
/**
|
|
1303
1354
|
* Graph traversal with method.
|
|
1304
1355
|
* @param {...Object} args
|
|
@@ -1308,7 +1359,7 @@ class GraphTraversal extends Traversal {
|
|
|
1308
1359
|
this.bytecode.addStep('with', args);
|
|
1309
1360
|
return this;
|
|
1310
1361
|
}
|
|
1311
|
-
|
|
1362
|
+
|
|
1312
1363
|
/**
|
|
1313
1364
|
* Graph traversal write method.
|
|
1314
1365
|
* @param {...Object} args
|
|
@@ -1318,7 +1369,6 @@ class GraphTraversal extends Traversal {
|
|
|
1318
1369
|
this.bytecode.addStep('write', args);
|
|
1319
1370
|
return this;
|
|
1320
1371
|
}
|
|
1321
|
-
|
|
1322
1372
|
}
|
|
1323
1373
|
|
|
1324
1374
|
function callOnEmptyTraversal(fnName, args) {
|
|
@@ -1420,14 +1470,15 @@ const statics = {
|
|
|
1420
1470
|
value: (...args) => callOnEmptyTraversal('value', args),
|
|
1421
1471
|
valueMap: (...args) => callOnEmptyTraversal('valueMap', args),
|
|
1422
1472
|
values: (...args) => callOnEmptyTraversal('values', args),
|
|
1423
|
-
where: (...args) => callOnEmptyTraversal('where', args)
|
|
1473
|
+
where: (...args) => callOnEmptyTraversal('where', args),
|
|
1424
1474
|
};
|
|
1425
1475
|
|
|
1426
1476
|
module.exports = {
|
|
1427
1477
|
GraphTraversal,
|
|
1428
1478
|
GraphTraversalSource,
|
|
1429
|
-
statics
|
|
1430
|
-
}
|
|
1479
|
+
statics,
|
|
1480
|
+
};
|
|
1481
|
+
</code></pre>
|
|
1431
1482
|
</article>
|
|
1432
1483
|
</section>
|
|
1433
1484
|
|
|
@@ -1443,7 +1494,7 @@ module.exports = {
|
|
|
1443
1494
|
<br class="clear">
|
|
1444
1495
|
|
|
1445
1496
|
<footer>
|
|
1446
|
-
Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.
|
|
1497
|
+
Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.10</a> on Mon Apr 11 2022 07:21:14 GMT-0400 (Eastern Daylight Time)
|
|
1447
1498
|
</footer>
|
|
1448
1499
|
|
|
1449
1500
|
<script> prettyPrint(); </script>
|