gremlin 3.5.1 → 3.6.0

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.
Files changed (89) hide show
  1. package/.eslintrc.js +154 -0
  2. package/.prettierrc.js +29 -0
  3. package/Gruntfile.js +15 -16
  4. package/README.md +2 -2
  5. package/doc/AnonymousTraversalSource.html +5 -5
  6. package/doc/Authenticator.html +2 -2
  7. package/doc/Bytecode.html +7 -7
  8. package/doc/Client.html +138 -64
  9. package/doc/Connection.html +89 -5
  10. package/doc/DriverRemoteConnection.html +11 -11
  11. package/doc/EdgeLabelVerificationStrategy.html +3 -3
  12. package/doc/Graph.html +2 -2
  13. package/doc/GraphSON2Reader.html +4 -4
  14. package/doc/GraphSON2Writer.html +3 -3
  15. package/doc/GraphSON3Reader.html +3 -3
  16. package/doc/GraphSON3Writer.html +3 -3
  17. package/doc/GraphTraversal.html +1025 -190
  18. package/doc/GraphTraversalSource.html +520 -19
  19. package/doc/HaltedTraverserStrategy.html +3 -3
  20. package/doc/MatchAlgorithmStrategy.html +3 -3
  21. package/doc/P.html +13 -13
  22. package/doc/PartitionStrategy.html +3 -3
  23. package/doc/Path.html +2 -2
  24. package/doc/PlainTextSaslAuthenticator.html +2 -2
  25. package/doc/ProductiveByStrategy.html +288 -0
  26. package/doc/RemoteConnection.html +10 -10
  27. package/doc/RemoteStrategy.html +4 -4
  28. package/doc/RemoteTraversal.html +3 -3
  29. package/doc/ReservedKeysVerificationStrategy.html +3 -3
  30. package/doc/ResponseError.html +2 -2
  31. package/doc/ResultSet.html +7 -7
  32. package/doc/SaslAuthenticator.html +2 -2
  33. package/doc/SaslMechanismBase.html +2 -2
  34. package/doc/SaslMechanismPlain.html +6 -6
  35. package/doc/SeedStrategy.html +288 -0
  36. package/doc/SubgraphStrategy.html +3 -3
  37. package/doc/TextP.html +300 -10
  38. package/doc/Transaction.html +6 -6
  39. package/doc/Translator.html +198 -4
  40. package/doc/TraversalStrategies.html +5 -5
  41. package/doc/TraversalStrategy.html +3 -3
  42. package/doc/TypeSerializer.html +2 -2
  43. package/doc/driver_auth_authenticator.js.html +4 -4
  44. package/doc/driver_auth_mechanisms_sasl-mechanism-base.js.html +3 -3
  45. package/doc/driver_auth_mechanisms_sasl-mechanism-plain.js.html +26 -17
  46. package/doc/driver_auth_plain-text-sasl-authenticator.js.html +7 -7
  47. package/doc/driver_auth_sasl-authenticator.js.html +3 -3
  48. package/doc/driver_client.js.html +73 -23
  49. package/doc/driver_connection.js.html +108 -89
  50. package/doc/driver_driver-remote-connection.js.html +12 -11
  51. package/doc/driver_remote-connection.js.html +4 -5
  52. package/doc/driver_response-error.js.html +5 -4
  53. package/doc/driver_result-set.js.html +4 -4
  54. package/doc/global.html +200 -3
  55. package/doc/index.html +4 -4
  56. package/doc/process_anonymous-traversal.js.html +4 -4
  57. package/doc/process_bytecode.js.html +11 -9
  58. package/doc/process_graph-traversal.js.html +277 -143
  59. package/doc/process_transaction.js.html +16 -9
  60. package/doc/process_translator.js.html +53 -37
  61. package/doc/process_traversal-strategy.js.html +83 -53
  62. package/doc/process_traversal.js.html +111 -107
  63. package/doc/structure_graph.js.html +7 -7
  64. package/doc/structure_io_graph-serializer.js.html +65 -18
  65. package/doc/structure_io_type-serializers.js.html +86 -89
  66. package/index.js +5 -5
  67. package/lib/driver/auth/authenticator.js +2 -2
  68. package/lib/driver/auth/mechanisms/sasl-mechanism-base.js +1 -1
  69. package/lib/driver/auth/mechanisms/sasl-mechanism-plain.js +24 -15
  70. package/lib/driver/auth/plain-text-sasl-authenticator.js +5 -5
  71. package/lib/driver/auth/sasl-authenticator.js +1 -1
  72. package/lib/driver/client.js +71 -21
  73. package/lib/driver/connection.js +106 -87
  74. package/lib/driver/driver-remote-connection.js +10 -9
  75. package/lib/driver/remote-connection.js +2 -3
  76. package/lib/driver/response-error.js +2 -2
  77. package/lib/driver/result-set.js +1 -2
  78. package/lib/process/anonymous-traversal.js +1 -2
  79. package/lib/process/bytecode.js +9 -7
  80. package/lib/process/graph-traversal.js +274 -141
  81. package/lib/process/transaction.js +13 -7
  82. package/lib/process/translator.js +50 -35
  83. package/lib/process/traversal-strategy.js +80 -51
  84. package/lib/process/traversal.js +109 -105
  85. package/lib/structure/graph.js +5 -5
  86. package/lib/structure/io/graph-serializer.js +62 -16
  87. package/lib/structure/io/type-serializers.js +84 -87
  88. package/lib/utils.js +15 -10
  89. package/package.json +11 -4
@@ -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 === "js:RemoteStrategy");
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(this.graph, traversalStrategy, new Bytecode(this.bytecode),
94
- this.graphTraversalSourceClass, this.graphTraversalClass);
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("This TraversalSource is already bound to a transaction - child transactions are not supported")
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(new VertexProgramStrategy({graphComputer: graphComputer,
122
- workers: workers, result: result, persist: persist, vertices: vertices, edges: edges,
123
- configuration: configuration}));
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
- i => i[0] === "withStrategies" && i[1] instanceof OptionsStrategy);
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(this.graph, new TraversalStrategies(this.traversalStrategies), b, this.graphTraversalSourceClass, this.graphTraversalClass);
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(this.graph, new TraversalStrategies(this.traversalStrategies), b, this.graphTraversalSourceClass, this.graphTraversalClass);
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(this.graph, new TraversalStrategies(this.traversalStrategies), b, this.graphTraversalSourceClass, this.graphTraversalClass);
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(this.graph, new TraversalStrategies(this.traversalStrategies), b, this.graphTraversalSourceClass, this.graphTraversalClass);
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(this.graph, new TraversalStrategies(this.traversalStrategies), b, this.graphTraversalSourceClass, this.graphTraversalClass);
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(this.graph, new TraversalStrategies(this.traversalStrategies), b, this.graphTraversalSourceClass, this.graphTraversalClass);
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,17 @@ 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
+
297
+ /**
298
+ * mergeV GraphTraversalSource step method.
299
+ * @param {...Object} args
300
+ * @returns {GraphTraversal}
301
+ */
302
+ mergeE(...args) {
303
+ const b = new Bytecode(this.bytecode).addStep('mergeE', args);
304
+ return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
305
+ }
306
+
244
307
  /**
245
308
  * addV GraphTraversalSource step method.
246
309
  * @param {...Object} args
@@ -250,7 +313,17 @@ class GraphTraversalSource {
250
313
  const b = new Bytecode(this.bytecode).addStep('addV', args);
251
314
  return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
252
315
  }
253
-
316
+
317
+ /**
318
+ * mergeV GraphTraversalSource step method.
319
+ * @param {...Object} args
320
+ * @returns {GraphTraversal}
321
+ */
322
+ mergeV(...args) {
323
+ const b = new Bytecode(this.bytecode).addStep('mergeV', args);
324
+ return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
325
+ }
326
+
254
327
  /**
255
328
  * inject GraphTraversalSource step method.
256
329
  * @param {...Object} args
@@ -260,7 +333,7 @@ class GraphTraversalSource {
260
333
  const b = new Bytecode(this.bytecode).addStep('inject', args);
261
334
  return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
262
335
  }
263
-
336
+
264
337
  /**
265
338
  * io GraphTraversalSource step method.
266
339
  * @param {...Object} args
@@ -270,7 +343,16 @@ class GraphTraversalSource {
270
343
  const b = new Bytecode(this.bytecode).addStep('io', args);
271
344
  return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
272
345
  }
273
-
346
+
347
+ /**
348
+ * call GraphTraversalSource step method.
349
+ * @param {...Object} args
350
+ * @returns {GraphTraversal}
351
+ */
352
+ call(...args) {
353
+ const b = new Bytecode(this.bytecode).addStep('call', args);
354
+ return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
355
+ }
274
356
  }
275
357
 
276
358
  /**
@@ -288,7 +370,6 @@ class GraphTraversal extends Traversal {
288
370
  return new GraphTraversal(this.graph, this.traversalStrategies, this.getBytecode());
289
371
  }
290
372
 
291
-
292
373
  /**
293
374
  * Graph traversal V method.
294
375
  * @param {...Object} args
@@ -298,7 +379,7 @@ class GraphTraversal extends Traversal {
298
379
  this.bytecode.addStep('V', args);
299
380
  return this;
300
381
  }
301
-
382
+
302
383
  /**
303
384
  * Graph traversal addE method.
304
385
  * @param {...Object} args
@@ -308,7 +389,7 @@ class GraphTraversal extends Traversal {
308
389
  this.bytecode.addStep('addE', args);
309
390
  return this;
310
391
  }
311
-
392
+
312
393
  /**
313
394
  * Graph traversal addV method.
314
395
  * @param {...Object} args
@@ -318,7 +399,7 @@ class GraphTraversal extends Traversal {
318
399
  this.bytecode.addStep('addV', args);
319
400
  return this;
320
401
  }
321
-
402
+
322
403
  /**
323
404
  * Graph traversal aggregate method.
324
405
  * @param {...Object} args
@@ -328,7 +409,7 @@ class GraphTraversal extends Traversal {
328
409
  this.bytecode.addStep('aggregate', args);
329
410
  return this;
330
411
  }
331
-
412
+
332
413
  /**
333
414
  * Graph traversal and method.
334
415
  * @param {...Object} args
@@ -338,7 +419,7 @@ class GraphTraversal extends Traversal {
338
419
  this.bytecode.addStep('and', args);
339
420
  return this;
340
421
  }
341
-
422
+
342
423
  /**
343
424
  * Graph traversal as method.
344
425
  * @param {...Object} args
@@ -348,7 +429,7 @@ class GraphTraversal extends Traversal {
348
429
  this.bytecode.addStep('as', args);
349
430
  return this;
350
431
  }
351
-
432
+
352
433
  /**
353
434
  * Graph traversal barrier method.
354
435
  * @param {...Object} args
@@ -358,7 +439,7 @@ class GraphTraversal extends Traversal {
358
439
  this.bytecode.addStep('barrier', args);
359
440
  return this;
360
441
  }
361
-
442
+
362
443
  /**
363
444
  * Graph traversal both method.
364
445
  * @param {...Object} args
@@ -368,7 +449,7 @@ class GraphTraversal extends Traversal {
368
449
  this.bytecode.addStep('both', args);
369
450
  return this;
370
451
  }
371
-
452
+
372
453
  /**
373
454
  * Graph traversal bothE method.
374
455
  * @param {...Object} args
@@ -378,7 +459,7 @@ class GraphTraversal extends Traversal {
378
459
  this.bytecode.addStep('bothE', args);
379
460
  return this;
380
461
  }
381
-
462
+
382
463
  /**
383
464
  * Graph traversal bothV method.
384
465
  * @param {...Object} args
@@ -388,7 +469,7 @@ class GraphTraversal extends Traversal {
388
469
  this.bytecode.addStep('bothV', args);
389
470
  return this;
390
471
  }
391
-
472
+
392
473
  /**
393
474
  * Graph traversal branch method.
394
475
  * @param {...Object} args
@@ -398,7 +479,7 @@ class GraphTraversal extends Traversal {
398
479
  this.bytecode.addStep('branch', args);
399
480
  return this;
400
481
  }
401
-
482
+
402
483
  /**
403
484
  * Graph traversal by method.
404
485
  * @param {...Object} args
@@ -408,7 +489,16 @@ class GraphTraversal extends Traversal {
408
489
  this.bytecode.addStep('by', args);
409
490
  return this;
410
491
  }
411
-
492
+
493
+ /**
494
+ * Graph traversal call method.
495
+ * @param {...Object} args
496
+ * @returns {GraphTraversal}
497
+ */
498
+ call(...args) {
499
+ this.bytecode.addStep('call', args);
500
+ return this;
501
+ }
412
502
  /**
413
503
  * Graph traversal cap method.
414
504
  * @param {...Object} args
@@ -418,7 +508,7 @@ class GraphTraversal extends Traversal {
418
508
  this.bytecode.addStep('cap', args);
419
509
  return this;
420
510
  }
421
-
511
+
422
512
  /**
423
513
  * Graph traversal choose method.
424
514
  * @param {...Object} args
@@ -428,7 +518,7 @@ class GraphTraversal extends Traversal {
428
518
  this.bytecode.addStep('choose', args);
429
519
  return this;
430
520
  }
431
-
521
+
432
522
  /**
433
523
  * Graph traversal coalesce method.
434
524
  * @param {...Object} args
@@ -438,7 +528,7 @@ class GraphTraversal extends Traversal {
438
528
  this.bytecode.addStep('coalesce', args);
439
529
  return this;
440
530
  }
441
-
531
+
442
532
  /**
443
533
  * Graph traversal coin method.
444
534
  * @param {...Object} args
@@ -448,7 +538,7 @@ class GraphTraversal extends Traversal {
448
538
  this.bytecode.addStep('coin', args);
449
539
  return this;
450
540
  }
451
-
541
+
452
542
  /**
453
543
  * Graph traversal connectedComponent method.
454
544
  * @param {...Object} args
@@ -458,7 +548,7 @@ class GraphTraversal extends Traversal {
458
548
  this.bytecode.addStep('connectedComponent', args);
459
549
  return this;
460
550
  }
461
-
551
+
462
552
  /**
463
553
  * Graph traversal constant method.
464
554
  * @param {...Object} args
@@ -468,7 +558,7 @@ class GraphTraversal extends Traversal {
468
558
  this.bytecode.addStep('constant', args);
469
559
  return this;
470
560
  }
471
-
561
+
472
562
  /**
473
563
  * Graph traversal count method.
474
564
  * @param {...Object} args
@@ -478,7 +568,7 @@ class GraphTraversal extends Traversal {
478
568
  this.bytecode.addStep('count', args);
479
569
  return this;
480
570
  }
481
-
571
+
482
572
  /**
483
573
  * Graph traversal cyclicPath method.
484
574
  * @param {...Object} args
@@ -488,7 +578,7 @@ class GraphTraversal extends Traversal {
488
578
  this.bytecode.addStep('cyclicPath', args);
489
579
  return this;
490
580
  }
491
-
581
+
492
582
  /**
493
583
  * Graph traversal dedup method.
494
584
  * @param {...Object} args
@@ -498,7 +588,7 @@ class GraphTraversal extends Traversal {
498
588
  this.bytecode.addStep('dedup', args);
499
589
  return this;
500
590
  }
501
-
591
+
502
592
  /**
503
593
  * Graph traversal drop method.
504
594
  * @param {...Object} args
@@ -508,7 +598,16 @@ class GraphTraversal extends Traversal {
508
598
  this.bytecode.addStep('drop', args);
509
599
  return this;
510
600
  }
511
-
601
+
602
+ /**
603
+ * Graph traversal element method.
604
+ * @param {...Object} args
605
+ * @returns {GraphTraversal}
606
+ */
607
+ element(...args) {
608
+ this.bytecode.addStep('element', args);
609
+ return this;
610
+ }
512
611
  /**
513
612
  * Graph traversal elementMap method.
514
613
  * @param {...Object} args
@@ -518,7 +617,7 @@ class GraphTraversal extends Traversal {
518
617
  this.bytecode.addStep('elementMap', args);
519
618
  return this;
520
619
  }
521
-
620
+
522
621
  /**
523
622
  * Graph traversal emit method.
524
623
  * @param {...Object} args
@@ -528,7 +627,17 @@ class GraphTraversal extends Traversal {
528
627
  this.bytecode.addStep('emit', args);
529
628
  return this;
530
629
  }
531
-
630
+
631
+ /**
632
+ * Graph traversal fa method.
633
+ * @param {...Object} args
634
+ * @returns {GraphTraversal}
635
+ */
636
+ fail(...args) {
637
+ this.bytecode.addStep('fail', args);
638
+ return this;
639
+ }
640
+
532
641
  /**
533
642
  * Graph traversal filter method.
534
643
  * @param {...Object} args
@@ -538,7 +647,7 @@ class GraphTraversal extends Traversal {
538
647
  this.bytecode.addStep('filter', args);
539
648
  return this;
540
649
  }
541
-
650
+
542
651
  /**
543
652
  * Graph traversal flatMap method.
544
653
  * @param {...Object} args
@@ -548,7 +657,7 @@ class GraphTraversal extends Traversal {
548
657
  this.bytecode.addStep('flatMap', args);
549
658
  return this;
550
659
  }
551
-
660
+
552
661
  /**
553
662
  * Graph traversal fold method.
554
663
  * @param {...Object} args
@@ -558,7 +667,7 @@ class GraphTraversal extends Traversal {
558
667
  this.bytecode.addStep('fold', args);
559
668
  return this;
560
669
  }
561
-
670
+
562
671
  /**
563
672
  * Graph traversal from method.
564
673
  * @param {...Object} args
@@ -568,7 +677,7 @@ class GraphTraversal extends Traversal {
568
677
  this.bytecode.addStep('from', args);
569
678
  return this;
570
679
  }
571
-
680
+
572
681
  /**
573
682
  * Graph traversal group method.
574
683
  * @param {...Object} args
@@ -578,7 +687,7 @@ class GraphTraversal extends Traversal {
578
687
  this.bytecode.addStep('group', args);
579
688
  return this;
580
689
  }
581
-
690
+
582
691
  /**
583
692
  * Graph traversal groupCount method.
584
693
  * @param {...Object} args
@@ -588,7 +697,7 @@ class GraphTraversal extends Traversal {
588
697
  this.bytecode.addStep('groupCount', args);
589
698
  return this;
590
699
  }
591
-
700
+
592
701
  /**
593
702
  * Graph traversal has method.
594
703
  * @param {...Object} args
@@ -598,7 +707,7 @@ class GraphTraversal extends Traversal {
598
707
  this.bytecode.addStep('has', args);
599
708
  return this;
600
709
  }
601
-
710
+
602
711
  /**
603
712
  * Graph traversal hasId method.
604
713
  * @param {...Object} args
@@ -608,7 +717,7 @@ class GraphTraversal extends Traversal {
608
717
  this.bytecode.addStep('hasId', args);
609
718
  return this;
610
719
  }
611
-
720
+
612
721
  /**
613
722
  * Graph traversal hasKey method.
614
723
  * @param {...Object} args
@@ -618,7 +727,7 @@ class GraphTraversal extends Traversal {
618
727
  this.bytecode.addStep('hasKey', args);
619
728
  return this;
620
729
  }
621
-
730
+
622
731
  /**
623
732
  * Graph traversal hasLabel method.
624
733
  * @param {...Object} args
@@ -628,7 +737,7 @@ class GraphTraversal extends Traversal {
628
737
  this.bytecode.addStep('hasLabel', args);
629
738
  return this;
630
739
  }
631
-
740
+
632
741
  /**
633
742
  * Graph traversal hasNot method.
634
743
  * @param {...Object} args
@@ -638,7 +747,7 @@ class GraphTraversal extends Traversal {
638
747
  this.bytecode.addStep('hasNot', args);
639
748
  return this;
640
749
  }
641
-
750
+
642
751
  /**
643
752
  * Graph traversal hasValue method.
644
753
  * @param {...Object} args
@@ -648,7 +757,7 @@ class GraphTraversal extends Traversal {
648
757
  this.bytecode.addStep('hasValue', args);
649
758
  return this;
650
759
  }
651
-
760
+
652
761
  /**
653
762
  * Graph traversal id method.
654
763
  * @param {...Object} args
@@ -658,7 +767,7 @@ class GraphTraversal extends Traversal {
658
767
  this.bytecode.addStep('id', args);
659
768
  return this;
660
769
  }
661
-
770
+
662
771
  /**
663
772
  * Graph traversal identity method.
664
773
  * @param {...Object} args
@@ -668,7 +777,7 @@ class GraphTraversal extends Traversal {
668
777
  this.bytecode.addStep('identity', args);
669
778
  return this;
670
779
  }
671
-
780
+
672
781
  /**
673
782
  * Graph traversal in method.
674
783
  * @param {...Object} args
@@ -678,7 +787,7 @@ class GraphTraversal extends Traversal {
678
787
  this.bytecode.addStep('in', args);
679
788
  return this;
680
789
  }
681
-
790
+
682
791
  /**
683
792
  * Graph traversal inE method.
684
793
  * @param {...Object} args
@@ -688,7 +797,7 @@ class GraphTraversal extends Traversal {
688
797
  this.bytecode.addStep('inE', args);
689
798
  return this;
690
799
  }
691
-
800
+
692
801
  /**
693
802
  * Graph traversal inV method.
694
803
  * @param {...Object} args
@@ -698,7 +807,7 @@ class GraphTraversal extends Traversal {
698
807
  this.bytecode.addStep('inV', args);
699
808
  return this;
700
809
  }
701
-
810
+
702
811
  /**
703
812
  * Graph traversal index method.
704
813
  * @param {...Object} args
@@ -708,7 +817,7 @@ class GraphTraversal extends Traversal {
708
817
  this.bytecode.addStep('index', args);
709
818
  return this;
710
819
  }
711
-
820
+
712
821
  /**
713
822
  * Graph traversal inject method.
714
823
  * @param {...Object} args
@@ -718,7 +827,7 @@ class GraphTraversal extends Traversal {
718
827
  this.bytecode.addStep('inject', args);
719
828
  return this;
720
829
  }
721
-
830
+
722
831
  /**
723
832
  * Graph traversal is method.
724
833
  * @param {...Object} args
@@ -728,7 +837,7 @@ class GraphTraversal extends Traversal {
728
837
  this.bytecode.addStep('is', args);
729
838
  return this;
730
839
  }
731
-
840
+
732
841
  /**
733
842
  * Graph traversal key method.
734
843
  * @param {...Object} args
@@ -738,7 +847,7 @@ class GraphTraversal extends Traversal {
738
847
  this.bytecode.addStep('key', args);
739
848
  return this;
740
849
  }
741
-
850
+
742
851
  /**
743
852
  * Graph traversal label method.
744
853
  * @param {...Object} args
@@ -748,7 +857,7 @@ class GraphTraversal extends Traversal {
748
857
  this.bytecode.addStep('label', args);
749
858
  return this;
750
859
  }
751
-
860
+
752
861
  /**
753
862
  * Graph traversal limit method.
754
863
  * @param {...Object} args
@@ -758,7 +867,7 @@ class GraphTraversal extends Traversal {
758
867
  this.bytecode.addStep('limit', args);
759
868
  return this;
760
869
  }
761
-
870
+
762
871
  /**
763
872
  * Graph traversal local method.
764
873
  * @param {...Object} args
@@ -768,7 +877,7 @@ class GraphTraversal extends Traversal {
768
877
  this.bytecode.addStep('local', args);
769
878
  return this;
770
879
  }
771
-
880
+
772
881
  /**
773
882
  * Graph traversal loops method.
774
883
  * @param {...Object} args
@@ -778,7 +887,7 @@ class GraphTraversal extends Traversal {
778
887
  this.bytecode.addStep('loops', args);
779
888
  return this;
780
889
  }
781
-
890
+
782
891
  /**
783
892
  * Graph traversal map method.
784
893
  * @param {...Object} args
@@ -788,7 +897,7 @@ class GraphTraversal extends Traversal {
788
897
  this.bytecode.addStep('map', args);
789
898
  return this;
790
899
  }
791
-
900
+
792
901
  /**
793
902
  * Graph traversal match method.
794
903
  * @param {...Object} args
@@ -798,7 +907,7 @@ class GraphTraversal extends Traversal {
798
907
  this.bytecode.addStep('match', args);
799
908
  return this;
800
909
  }
801
-
910
+
802
911
  /**
803
912
  * Graph traversal math method.
804
913
  * @param {...Object} args
@@ -808,7 +917,7 @@ class GraphTraversal extends Traversal {
808
917
  this.bytecode.addStep('math', args);
809
918
  return this;
810
919
  }
811
-
920
+
812
921
  /**
813
922
  * Graph traversal max method.
814
923
  * @param {...Object} args
@@ -818,7 +927,7 @@ class GraphTraversal extends Traversal {
818
927
  this.bytecode.addStep('max', args);
819
928
  return this;
820
929
  }
821
-
930
+
822
931
  /**
823
932
  * Graph traversal mean method.
824
933
  * @param {...Object} args
@@ -828,7 +937,27 @@ class GraphTraversal extends Traversal {
828
937
  this.bytecode.addStep('mean', args);
829
938
  return this;
830
939
  }
831
-
940
+
941
+ /**
942
+ * Graph traversal mergeE method.
943
+ * @param {...Object} args
944
+ * @returns {GraphTraversal}
945
+ */
946
+ mergeE(...args) {
947
+ this.bytecode.addStep('mergeE', args);
948
+ return this;
949
+ }
950
+
951
+ /**
952
+ * Graph traversal mergeV method.
953
+ * @param {...Object} args
954
+ * @returns {GraphTraversal}
955
+ */
956
+ mergeV(...args) {
957
+ this.bytecode.addStep('mergeV', args);
958
+ return this;
959
+ }
960
+
832
961
  /**
833
962
  * Graph traversal min method.
834
963
  * @param {...Object} args
@@ -838,7 +967,7 @@ class GraphTraversal extends Traversal {
838
967
  this.bytecode.addStep('min', args);
839
968
  return this;
840
969
  }
841
-
970
+
842
971
  /**
843
972
  * Graph traversal none method.
844
973
  * @param {...Object} args
@@ -848,7 +977,7 @@ class GraphTraversal extends Traversal {
848
977
  this.bytecode.addStep('none', args);
849
978
  return this;
850
979
  }
851
-
980
+
852
981
  /**
853
982
  * Graph traversal not method.
854
983
  * @param {...Object} args
@@ -858,7 +987,7 @@ class GraphTraversal extends Traversal {
858
987
  this.bytecode.addStep('not', args);
859
988
  return this;
860
989
  }
861
-
990
+
862
991
  /**
863
992
  * Graph traversal option method.
864
993
  * @param {...Object} args
@@ -868,7 +997,7 @@ class GraphTraversal extends Traversal {
868
997
  this.bytecode.addStep('option', args);
869
998
  return this;
870
999
  }
871
-
1000
+
872
1001
  /**
873
1002
  * Graph traversal optional method.
874
1003
  * @param {...Object} args
@@ -878,7 +1007,7 @@ class GraphTraversal extends Traversal {
878
1007
  this.bytecode.addStep('optional', args);
879
1008
  return this;
880
1009
  }
881
-
1010
+
882
1011
  /**
883
1012
  * Graph traversal or method.
884
1013
  * @param {...Object} args
@@ -888,7 +1017,7 @@ class GraphTraversal extends Traversal {
888
1017
  this.bytecode.addStep('or', args);
889
1018
  return this;
890
1019
  }
891
-
1020
+
892
1021
  /**
893
1022
  * Graph traversal order method.
894
1023
  * @param {...Object} args
@@ -898,7 +1027,7 @@ class GraphTraversal extends Traversal {
898
1027
  this.bytecode.addStep('order', args);
899
1028
  return this;
900
1029
  }
901
-
1030
+
902
1031
  /**
903
1032
  * Graph traversal otherV method.
904
1033
  * @param {...Object} args
@@ -908,7 +1037,7 @@ class GraphTraversal extends Traversal {
908
1037
  this.bytecode.addStep('otherV', args);
909
1038
  return this;
910
1039
  }
911
-
1040
+
912
1041
  /**
913
1042
  * Graph traversal out method.
914
1043
  * @param {...Object} args
@@ -918,7 +1047,7 @@ class GraphTraversal extends Traversal {
918
1047
  this.bytecode.addStep('out', args);
919
1048
  return this;
920
1049
  }
921
-
1050
+
922
1051
  /**
923
1052
  * Graph traversal outE method.
924
1053
  * @param {...Object} args
@@ -928,7 +1057,7 @@ class GraphTraversal extends Traversal {
928
1057
  this.bytecode.addStep('outE', args);
929
1058
  return this;
930
1059
  }
931
-
1060
+
932
1061
  /**
933
1062
  * Graph traversal outV method.
934
1063
  * @param {...Object} args
@@ -938,7 +1067,7 @@ class GraphTraversal extends Traversal {
938
1067
  this.bytecode.addStep('outV', args);
939
1068
  return this;
940
1069
  }
941
-
1070
+
942
1071
  /**
943
1072
  * Graph traversal pageRank method.
944
1073
  * @param {...Object} args
@@ -948,7 +1077,7 @@ class GraphTraversal extends Traversal {
948
1077
  this.bytecode.addStep('pageRank', args);
949
1078
  return this;
950
1079
  }
951
-
1080
+
952
1081
  /**
953
1082
  * Graph traversal path method.
954
1083
  * @param {...Object} args
@@ -958,7 +1087,7 @@ class GraphTraversal extends Traversal {
958
1087
  this.bytecode.addStep('path', args);
959
1088
  return this;
960
1089
  }
961
-
1090
+
962
1091
  /**
963
1092
  * Graph traversal peerPressure method.
964
1093
  * @param {...Object} args
@@ -968,7 +1097,7 @@ class GraphTraversal extends Traversal {
968
1097
  this.bytecode.addStep('peerPressure', args);
969
1098
  return this;
970
1099
  }
971
-
1100
+
972
1101
  /**
973
1102
  * Graph traversal profile method.
974
1103
  * @param {...Object} args
@@ -978,7 +1107,7 @@ class GraphTraversal extends Traversal {
978
1107
  this.bytecode.addStep('profile', args);
979
1108
  return this;
980
1109
  }
981
-
1110
+
982
1111
  /**
983
1112
  * Graph traversal program method.
984
1113
  * @param {...Object} args
@@ -988,7 +1117,7 @@ class GraphTraversal extends Traversal {
988
1117
  this.bytecode.addStep('program', args);
989
1118
  return this;
990
1119
  }
991
-
1120
+
992
1121
  /**
993
1122
  * Graph traversal project method.
994
1123
  * @param {...Object} args
@@ -998,7 +1127,7 @@ class GraphTraversal extends Traversal {
998
1127
  this.bytecode.addStep('project', args);
999
1128
  return this;
1000
1129
  }
1001
-
1130
+
1002
1131
  /**
1003
1132
  * Graph traversal properties method.
1004
1133
  * @param {...Object} args
@@ -1008,7 +1137,7 @@ class GraphTraversal extends Traversal {
1008
1137
  this.bytecode.addStep('properties', args);
1009
1138
  return this;
1010
1139
  }
1011
-
1140
+
1012
1141
  /**
1013
1142
  * Graph traversal property method.
1014
1143
  * @param {...Object} args
@@ -1018,7 +1147,7 @@ class GraphTraversal extends Traversal {
1018
1147
  this.bytecode.addStep('property', args);
1019
1148
  return this;
1020
1149
  }
1021
-
1150
+
1022
1151
  /**
1023
1152
  * Graph traversal propertyMap method.
1024
1153
  * @param {...Object} args
@@ -1028,7 +1157,7 @@ class GraphTraversal extends Traversal {
1028
1157
  this.bytecode.addStep('propertyMap', args);
1029
1158
  return this;
1030
1159
  }
1031
-
1160
+
1032
1161
  /**
1033
1162
  * Graph traversal range method.
1034
1163
  * @param {...Object} args
@@ -1038,7 +1167,7 @@ class GraphTraversal extends Traversal {
1038
1167
  this.bytecode.addStep('range', args);
1039
1168
  return this;
1040
1169
  }
1041
-
1170
+
1042
1171
  /**
1043
1172
  * Graph traversal read method.
1044
1173
  * @param {...Object} args
@@ -1048,7 +1177,7 @@ class GraphTraversal extends Traversal {
1048
1177
  this.bytecode.addStep('read', args);
1049
1178
  return this;
1050
1179
  }
1051
-
1180
+
1052
1181
  /**
1053
1182
  * Graph traversal repeat method.
1054
1183
  * @param {...Object} args
@@ -1058,7 +1187,7 @@ class GraphTraversal extends Traversal {
1058
1187
  this.bytecode.addStep('repeat', args);
1059
1188
  return this;
1060
1189
  }
1061
-
1190
+
1062
1191
  /**
1063
1192
  * Graph traversal sack method.
1064
1193
  * @param {...Object} args
@@ -1068,7 +1197,7 @@ class GraphTraversal extends Traversal {
1068
1197
  this.bytecode.addStep('sack', args);
1069
1198
  return this;
1070
1199
  }
1071
-
1200
+
1072
1201
  /**
1073
1202
  * Graph traversal sample method.
1074
1203
  * @param {...Object} args
@@ -1078,7 +1207,7 @@ class GraphTraversal extends Traversal {
1078
1207
  this.bytecode.addStep('sample', args);
1079
1208
  return this;
1080
1209
  }
1081
-
1210
+
1082
1211
  /**
1083
1212
  * Graph traversal select method.
1084
1213
  * @param {...Object} args
@@ -1088,7 +1217,7 @@ class GraphTraversal extends Traversal {
1088
1217
  this.bytecode.addStep('select', args);
1089
1218
  return this;
1090
1219
  }
1091
-
1220
+
1092
1221
  /**
1093
1222
  * Graph traversal shortestPath method.
1094
1223
  * @param {...Object} args
@@ -1098,7 +1227,7 @@ class GraphTraversal extends Traversal {
1098
1227
  this.bytecode.addStep('shortestPath', args);
1099
1228
  return this;
1100
1229
  }
1101
-
1230
+
1102
1231
  /**
1103
1232
  * Graph traversal sideEffect method.
1104
1233
  * @param {...Object} args
@@ -1108,7 +1237,7 @@ class GraphTraversal extends Traversal {
1108
1237
  this.bytecode.addStep('sideEffect', args);
1109
1238
  return this;
1110
1239
  }
1111
-
1240
+
1112
1241
  /**
1113
1242
  * Graph traversal simplePath method.
1114
1243
  * @param {...Object} args
@@ -1118,7 +1247,7 @@ class GraphTraversal extends Traversal {
1118
1247
  this.bytecode.addStep('simplePath', args);
1119
1248
  return this;
1120
1249
  }
1121
-
1250
+
1122
1251
  /**
1123
1252
  * Graph traversal skip method.
1124
1253
  * @param {...Object} args
@@ -1128,7 +1257,7 @@ class GraphTraversal extends Traversal {
1128
1257
  this.bytecode.addStep('skip', args);
1129
1258
  return this;
1130
1259
  }
1131
-
1260
+
1132
1261
  /**
1133
1262
  * Graph traversal store method.
1134
1263
  * @param {...Object} args
@@ -1138,7 +1267,7 @@ class GraphTraversal extends Traversal {
1138
1267
  this.bytecode.addStep('store', args);
1139
1268
  return this;
1140
1269
  }
1141
-
1270
+
1142
1271
  /**
1143
1272
  * Graph traversal subgraph method.
1144
1273
  * @param {...Object} args
@@ -1148,7 +1277,7 @@ class GraphTraversal extends Traversal {
1148
1277
  this.bytecode.addStep('subgraph', args);
1149
1278
  return this;
1150
1279
  }
1151
-
1280
+
1152
1281
  /**
1153
1282
  * Graph traversal sum method.
1154
1283
  * @param {...Object} args
@@ -1158,7 +1287,7 @@ class GraphTraversal extends Traversal {
1158
1287
  this.bytecode.addStep('sum', args);
1159
1288
  return this;
1160
1289
  }
1161
-
1290
+
1162
1291
  /**
1163
1292
  * Graph traversal tail method.
1164
1293
  * @param {...Object} args
@@ -1168,7 +1297,7 @@ class GraphTraversal extends Traversal {
1168
1297
  this.bytecode.addStep('tail', args);
1169
1298
  return this;
1170
1299
  }
1171
-
1300
+
1172
1301
  /**
1173
1302
  * Graph traversal timeLimit method.
1174
1303
  * @param {...Object} args
@@ -1178,7 +1307,7 @@ class GraphTraversal extends Traversal {
1178
1307
  this.bytecode.addStep('timeLimit', args);
1179
1308
  return this;
1180
1309
  }
1181
-
1310
+
1182
1311
  /**
1183
1312
  * Graph traversal times method.
1184
1313
  * @param {...Object} args
@@ -1188,7 +1317,7 @@ class GraphTraversal extends Traversal {
1188
1317
  this.bytecode.addStep('times', args);
1189
1318
  return this;
1190
1319
  }
1191
-
1320
+
1192
1321
  /**
1193
1322
  * Graph traversal to method.
1194
1323
  * @param {...Object} args
@@ -1198,7 +1327,7 @@ class GraphTraversal extends Traversal {
1198
1327
  this.bytecode.addStep('to', args);
1199
1328
  return this;
1200
1329
  }
1201
-
1330
+
1202
1331
  /**
1203
1332
  * Graph traversal toE method.
1204
1333
  * @param {...Object} args
@@ -1208,7 +1337,7 @@ class GraphTraversal extends Traversal {
1208
1337
  this.bytecode.addStep('toE', args);
1209
1338
  return this;
1210
1339
  }
1211
-
1340
+
1212
1341
  /**
1213
1342
  * Graph traversal toV method.
1214
1343
  * @param {...Object} args
@@ -1218,7 +1347,7 @@ class GraphTraversal extends Traversal {
1218
1347
  this.bytecode.addStep('toV', args);
1219
1348
  return this;
1220
1349
  }
1221
-
1350
+
1222
1351
  /**
1223
1352
  * Graph traversal tree method.
1224
1353
  * @param {...Object} args
@@ -1228,7 +1357,7 @@ class GraphTraversal extends Traversal {
1228
1357
  this.bytecode.addStep('tree', args);
1229
1358
  return this;
1230
1359
  }
1231
-
1360
+
1232
1361
  /**
1233
1362
  * Graph traversal unfold method.
1234
1363
  * @param {...Object} args
@@ -1238,7 +1367,7 @@ class GraphTraversal extends Traversal {
1238
1367
  this.bytecode.addStep('unfold', args);
1239
1368
  return this;
1240
1369
  }
1241
-
1370
+
1242
1371
  /**
1243
1372
  * Graph traversal union method.
1244
1373
  * @param {...Object} args
@@ -1248,7 +1377,7 @@ class GraphTraversal extends Traversal {
1248
1377
  this.bytecode.addStep('union', args);
1249
1378
  return this;
1250
1379
  }
1251
-
1380
+
1252
1381
  /**
1253
1382
  * Graph traversal until method.
1254
1383
  * @param {...Object} args
@@ -1258,7 +1387,7 @@ class GraphTraversal extends Traversal {
1258
1387
  this.bytecode.addStep('until', args);
1259
1388
  return this;
1260
1389
  }
1261
-
1390
+
1262
1391
  /**
1263
1392
  * Graph traversal value method.
1264
1393
  * @param {...Object} args
@@ -1268,7 +1397,7 @@ class GraphTraversal extends Traversal {
1268
1397
  this.bytecode.addStep('value', args);
1269
1398
  return this;
1270
1399
  }
1271
-
1400
+
1272
1401
  /**
1273
1402
  * Graph traversal valueMap method.
1274
1403
  * @param {...Object} args
@@ -1278,7 +1407,7 @@ class GraphTraversal extends Traversal {
1278
1407
  this.bytecode.addStep('valueMap', args);
1279
1408
  return this;
1280
1409
  }
1281
-
1410
+
1282
1411
  /**
1283
1412
  * Graph traversal values method.
1284
1413
  * @param {...Object} args
@@ -1288,7 +1417,7 @@ class GraphTraversal extends Traversal {
1288
1417
  this.bytecode.addStep('values', args);
1289
1418
  return this;
1290
1419
  }
1291
-
1420
+
1292
1421
  /**
1293
1422
  * Graph traversal where method.
1294
1423
  * @param {...Object} args
@@ -1298,7 +1427,7 @@ class GraphTraversal extends Traversal {
1298
1427
  this.bytecode.addStep('where', args);
1299
1428
  return this;
1300
1429
  }
1301
-
1430
+
1302
1431
  /**
1303
1432
  * Graph traversal with method.
1304
1433
  * @param {...Object} args
@@ -1308,7 +1437,7 @@ class GraphTraversal extends Traversal {
1308
1437
  this.bytecode.addStep('with', args);
1309
1438
  return this;
1310
1439
  }
1311
-
1440
+
1312
1441
  /**
1313
1442
  * Graph traversal write method.
1314
1443
  * @param {...Object} args
@@ -1318,7 +1447,6 @@ class GraphTraversal extends Traversal {
1318
1447
  this.bytecode.addStep('write', args);
1319
1448
  return this;
1320
1449
  }
1321
-
1322
1450
  }
1323
1451
 
1324
1452
  function callOnEmptyTraversal(fnName, args) {
@@ -1342,6 +1470,7 @@ const statics = {
1342
1470
  bothE: (...args) => callOnEmptyTraversal('bothE', args),
1343
1471
  bothV: (...args) => callOnEmptyTraversal('bothV', args),
1344
1472
  branch: (...args) => callOnEmptyTraversal('branch', args),
1473
+ call: (...args) => callOnEmptyTraversal('call', args),
1345
1474
  cap: (...args) => callOnEmptyTraversal('cap', args),
1346
1475
  choose: (...args) => callOnEmptyTraversal('choose', args),
1347
1476
  coalesce: (...args) => callOnEmptyTraversal('coalesce', args),
@@ -1351,8 +1480,10 @@ const statics = {
1351
1480
  cyclicPath: (...args) => callOnEmptyTraversal('cyclicPath', args),
1352
1481
  dedup: (...args) => callOnEmptyTraversal('dedup', args),
1353
1482
  drop: (...args) => callOnEmptyTraversal('drop', args),
1483
+ element: (...args) => callOnEmptyTraversal('element', args),
1354
1484
  elementMap: (...args) => callOnEmptyTraversal('elementMap', args),
1355
1485
  emit: (...args) => callOnEmptyTraversal('emit', args),
1486
+ fail: (...args) => callOnEmptyTraversal('fail', args),
1356
1487
  filter: (...args) => callOnEmptyTraversal('filter', args),
1357
1488
  flatMap: (...args) => callOnEmptyTraversal('flatMap', args),
1358
1489
  fold: (...args) => callOnEmptyTraversal('fold', args),
@@ -1382,6 +1513,8 @@ const statics = {
1382
1513
  math: (...args) => callOnEmptyTraversal('math', args),
1383
1514
  max: (...args) => callOnEmptyTraversal('max', args),
1384
1515
  mean: (...args) => callOnEmptyTraversal('mean', args),
1516
+ mergeE: (...args) => callOnEmptyTraversal('mergeE', args),
1517
+ mergeV: (...args) => callOnEmptyTraversal('mergeV', args),
1385
1518
  min: (...args) => callOnEmptyTraversal('min', args),
1386
1519
  not: (...args) => callOnEmptyTraversal('not', args),
1387
1520
  optional: (...args) => callOnEmptyTraversal('optional', args),
@@ -1420,14 +1553,15 @@ const statics = {
1420
1553
  value: (...args) => callOnEmptyTraversal('value', args),
1421
1554
  valueMap: (...args) => callOnEmptyTraversal('valueMap', args),
1422
1555
  values: (...args) => callOnEmptyTraversal('values', args),
1423
- where: (...args) => callOnEmptyTraversal('where', args)
1556
+ where: (...args) => callOnEmptyTraversal('where', args),
1424
1557
  };
1425
1558
 
1426
1559
  module.exports = {
1427
1560
  GraphTraversal,
1428
1561
  GraphTraversalSource,
1429
- statics
1430
- };</code></pre>
1562
+ statics,
1563
+ };
1564
+ </code></pre>
1431
1565
  </article>
1432
1566
  </section>
1433
1567
 
@@ -1437,13 +1571,13 @@ module.exports = {
1437
1571
  </div>
1438
1572
 
1439
1573
  <nav>
1440
- <h2><a href="index.html">Home</a></h2><h3>Classes</h3><ul><li><a href="AnonymousTraversalSource.html">AnonymousTraversalSource</a></li><li><a href="Authenticator.html">Authenticator</a></li><li><a href="Bytecode.html">Bytecode</a></li><li><a href="Client.html">Client</a></li><li><a href="Connection.html">Connection</a></li><li><a href="DriverRemoteConnection.html">DriverRemoteConnection</a></li><li><a href="EdgeLabelVerificationStrategy.html">EdgeLabelVerificationStrategy</a></li><li><a href="Graph.html">Graph</a></li><li><a href="GraphSON2Reader.html">GraphSON2Reader</a></li><li><a href="GraphSON2Writer.html">GraphSON2Writer</a></li><li><a href="GraphSON3Reader.html">GraphSON3Reader</a></li><li><a href="GraphSON3Writer.html">GraphSON3Writer</a></li><li><a href="GraphTraversal.html">GraphTraversal</a></li><li><a href="GraphTraversalSource.html">GraphTraversalSource</a></li><li><a href="HaltedTraverserStrategy.html">HaltedTraverserStrategy</a></li><li><a href="MatchAlgorithmStrategy.html">MatchAlgorithmStrategy</a></li><li><a href="P.html">P</a></li><li><a href="PartitionStrategy.html">PartitionStrategy</a></li><li><a href="Path.html">Path</a></li><li><a href="PlainTextSaslAuthenticator.html">PlainTextSaslAuthenticator</a></li><li><a href="RemoteConnection.html">RemoteConnection</a></li><li><a href="RemoteStrategy.html">RemoteStrategy</a></li><li><a href="RemoteTraversal.html">RemoteTraversal</a></li><li><a href="ReservedKeysVerificationStrategy.html">ReservedKeysVerificationStrategy</a></li><li><a href="ResponseError.html">ResponseError</a></li><li><a href="ResultSet.html">ResultSet</a></li><li><a href="SaslAuthenticator.html">SaslAuthenticator</a></li><li><a href="SaslMechanismBase.html">SaslMechanismBase</a></li><li><a href="SaslMechanismPlain.html">SaslMechanismPlain</a></li><li><a href="SubgraphStrategy.html">SubgraphStrategy</a></li><li><a href="TextP.html">TextP</a></li><li><a href="Transaction.html">Transaction</a></li><li><a href="Translator.html">Translator</a></li><li><a href="TraversalStrategies.html">TraversalStrategies</a></li><li><a href="TraversalStrategy.html">TraversalStrategy</a></li><li><a href="TypeSerializer.html">TypeSerializer</a></li></ul><h3>Global</h3><ul><li><a href="global.html#statics">statics</a></li></ul>
1574
+ <h2><a href="index.html">Home</a></h2><h3>Classes</h3><ul><li><a href="AnonymousTraversalSource.html">AnonymousTraversalSource</a></li><li><a href="Authenticator.html">Authenticator</a></li><li><a href="Bytecode.html">Bytecode</a></li><li><a href="Client.html">Client</a></li><li><a href="Connection.html">Connection</a></li><li><a href="DriverRemoteConnection.html">DriverRemoteConnection</a></li><li><a href="EdgeLabelVerificationStrategy.html">EdgeLabelVerificationStrategy</a></li><li><a href="Graph.html">Graph</a></li><li><a href="GraphSON2Reader.html">GraphSON2Reader</a></li><li><a href="GraphSON2Writer.html">GraphSON2Writer</a></li><li><a href="GraphSON3Reader.html">GraphSON3Reader</a></li><li><a href="GraphSON3Writer.html">GraphSON3Writer</a></li><li><a href="GraphTraversal.html">GraphTraversal</a></li><li><a href="GraphTraversalSource.html">GraphTraversalSource</a></li><li><a href="HaltedTraverserStrategy.html">HaltedTraverserStrategy</a></li><li><a href="MatchAlgorithmStrategy.html">MatchAlgorithmStrategy</a></li><li><a href="P.html">P</a></li><li><a href="PartitionStrategy.html">PartitionStrategy</a></li><li><a href="Path.html">Path</a></li><li><a href="PlainTextSaslAuthenticator.html">PlainTextSaslAuthenticator</a></li><li><a href="ProductiveByStrategy.html">ProductiveByStrategy</a></li><li><a href="RemoteConnection.html">RemoteConnection</a></li><li><a href="RemoteStrategy.html">RemoteStrategy</a></li><li><a href="RemoteTraversal.html">RemoteTraversal</a></li><li><a href="ReservedKeysVerificationStrategy.html">ReservedKeysVerificationStrategy</a></li><li><a href="ResponseError.html">ResponseError</a></li><li><a href="ResultSet.html">ResultSet</a></li><li><a href="SaslAuthenticator.html">SaslAuthenticator</a></li><li><a href="SaslMechanismBase.html">SaslMechanismBase</a></li><li><a href="SaslMechanismPlain.html">SaslMechanismPlain</a></li><li><a href="SeedStrategy.html">SeedStrategy</a></li><li><a href="SubgraphStrategy.html">SubgraphStrategy</a></li><li><a href="TextP.html">TextP</a></li><li><a href="Transaction.html">Transaction</a></li><li><a href="Translator.html">Translator</a></li><li><a href="TraversalStrategies.html">TraversalStrategies</a></li><li><a href="TraversalStrategy.html">TraversalStrategy</a></li><li><a href="TypeSerializer.html">TypeSerializer</a></li></ul><h3>Global</h3><ul><li><a href="global.html#statics">statics</a></li></ul>
1441
1575
  </nav>
1442
1576
 
1443
1577
  <br class="clear">
1444
1578
 
1445
1579
  <footer>
1446
- Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.7</a> on Mon Jul 26 2021 10:29:09 GMT+0200 (Central European Summer Time)
1580
+ Documentation generated by <a href="https://github.com/jsdoc/jsdoc">JSDoc 3.6.10</a> on Mon Apr 11 2022 07:53:52 GMT-0400 (Eastern Daylight Time)
1447
1581
  </footer>
1448
1582
 
1449
1583
  <script> prettyPrint(); </script>