gremlin 3.5.0 → 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/NOTICE +1 -1
- package/doc/AnonymousTraversalSource.html +7 -7
- package/doc/Authenticator.html +3 -3
- package/doc/Bytecode.html +249 -5
- package/doc/Client.html +139 -65
- package/doc/Connection.html +90 -6
- package/doc/DriverRemoteConnection.html +380 -8
- package/doc/EdgeLabelVerificationStrategy.html +3 -3
- package/doc/Graph.html +2 -2
- package/doc/GraphSON2Reader.html +4 -4
- package/doc/GraphSON2Writer.html +3 -3
- package/doc/GraphSON3Reader.html +3 -3
- package/doc/GraphSON3Writer.html +3 -3
- package/doc/GraphTraversal.html +107 -107
- package/doc/GraphTraversalSource.html +130 -19
- package/doc/HaltedTraverserStrategy.html +3 -3
- package/doc/MatchAlgorithmStrategy.html +3 -3
- package/doc/P.html +13 -13
- package/doc/PartitionStrategy.html +3 -3
- package/doc/Path.html +2 -2
- package/doc/PlainTextSaslAuthenticator.html +2 -2
- package/doc/ProductiveByStrategy.html +288 -0
- package/doc/RemoteConnection.html +484 -10
- package/doc/RemoteStrategy.html +4 -4
- package/doc/RemoteTraversal.html +3 -3
- package/doc/ReservedKeysVerificationStrategy.html +3 -3
- package/doc/ResponseError.html +3 -3
- package/doc/ResultSet.html +8 -8
- package/doc/SaslAuthenticator.html +2 -2
- package/doc/SaslMechanismBase.html +3 -3
- package/doc/SaslMechanismPlain.html +6 -6
- package/doc/{GraphSONReader.html → SeedStrategy.html} +12 -15
- package/doc/SubgraphStrategy.html +3 -3
- package/doc/TextP.html +10 -10
- package/doc/Transaction.html +655 -0
- package/doc/Translator.html +200 -6
- package/doc/TraversalStrategies.html +137 -4
- package/doc/TraversalStrategy.html +4 -4
- package/doc/TypeSerializer.html +2 -2
- package/doc/driver_auth_authenticator.js.html +4 -4
- package/doc/driver_auth_mechanisms_sasl-mechanism-base.js.html +3 -3
- package/doc/driver_auth_mechanisms_sasl-mechanism-plain.js.html +26 -17
- package/doc/driver_auth_plain-text-sasl-authenticator.js.html +7 -7
- package/doc/driver_auth_sasl-authenticator.js.html +3 -3
- package/doc/driver_client.js.html +75 -25
- package/doc/driver_connection.js.html +108 -89
- package/doc/driver_driver-remote-connection.js.html +40 -9
- package/doc/driver_remote-connection.js.html +47 -6
- package/doc/driver_response-error.js.html +5 -4
- package/doc/driver_result-set.js.html +4 -4
- package/doc/global.html +200 -3
- package/doc/index.html +2 -2
- package/doc/process_anonymous-traversal.js.html +5 -5
- package/doc/process_bytecode.js.html +32 -7
- package/doc/process_graph-traversal.js.html +213 -143
- package/doc/process_transaction.js.html +143 -0
- package/doc/process_translator.js.html +58 -39
- package/doc/process_traversal-strategy.js.html +79 -52
- package/doc/process_traversal.js.html +101 -108
- package/doc/structure_graph.js.html +7 -7
- package/doc/structure_io_graph-serializer.js.html +65 -18
- package/doc/structure_io_type-serializers.js.html +86 -89
- 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 +73 -23
- package/lib/driver/connection.js +106 -87
- package/lib/driver/driver-remote-connection.js +38 -7
- package/lib/driver/remote-connection.js +45 -4
- package/lib/driver/response-error.js +2 -2
- package/lib/driver/result-set.js +1 -2
- package/lib/process/anonymous-traversal.js +2 -3
- package/lib/process/bytecode.js +30 -5
- package/lib/process/graph-traversal.js +210 -141
- package/lib/process/transaction.js +92 -0
- package/lib/process/translator.js +55 -37
- package/lib/process/traversal-strategy.js +76 -50
- 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 +11 -5
- package/doc/GraphSONWriter.html +0 -436
- package/gremlin-javascript.iml +0 -9
|
@@ -23,17 +23,15 @@
|
|
|
23
23
|
'use strict';
|
|
24
24
|
|
|
25
25
|
const { Traversal } = require('./traversal');
|
|
26
|
+
const { Transaction } = require('./transaction');
|
|
26
27
|
const remote = require('../driver/remote-connection');
|
|
27
|
-
const utils = require('../utils');
|
|
28
28
|
const Bytecode = require('./bytecode');
|
|
29
29
|
const { TraversalStrategies, VertexProgramStrategy, OptionsStrategy } = require('./traversal-strategy');
|
|
30
30
|
|
|
31
|
-
|
|
32
31
|
/**
|
|
33
32
|
* Represents the primary DSL of the Gremlin traversal machine.
|
|
34
33
|
*/
|
|
35
34
|
class GraphTraversalSource {
|
|
36
|
-
|
|
37
35
|
/**
|
|
38
36
|
* Creates a new instance of {@link GraphTraversalSource}.
|
|
39
37
|
* @param {Graph} graph
|
|
@@ -48,16 +46,41 @@ class GraphTraversalSource {
|
|
|
48
46
|
this.bytecode = bytecode || new Bytecode();
|
|
49
47
|
this.graphTraversalSourceClass = graphTraversalSourceClass || GraphTraversalSource;
|
|
50
48
|
this.graphTraversalClass = graphTraversalClass || GraphTraversal;
|
|
49
|
+
|
|
50
|
+
// in order to keep the constructor unchanged within 3.5.x we can try to pop the RemoteConnection out of the
|
|
51
|
+
// TraversalStrategies. keeping this unchanged will allow user DSLs to not take a break.
|
|
52
|
+
// TODO: refactor this to be nicer in 3.6.0 when we can take a breaking change
|
|
53
|
+
const strat = traversalStrategies.strategies.find((ts) => ts.fqcn === 'js:RemoteStrategy');
|
|
54
|
+
this.remoteConnection = strat !== undefined ? strat.connection : undefined;
|
|
51
55
|
}
|
|
52
56
|
|
|
53
57
|
/**
|
|
54
|
-
* @param remoteConnection
|
|
58
|
+
* @param {RemoteConnection} remoteConnection
|
|
55
59
|
* @returns {GraphTraversalSource}
|
|
56
60
|
*/
|
|
57
61
|
withRemote(remoteConnection) {
|
|
58
62
|
const traversalStrategy = new TraversalStrategies(this.traversalStrategies);
|
|
59
63
|
traversalStrategy.addStrategy(new remote.RemoteStrategy(remoteConnection));
|
|
60
|
-
return new this.graphTraversalSourceClass(
|
|
64
|
+
return new this.graphTraversalSourceClass(
|
|
65
|
+
this.graph,
|
|
66
|
+
traversalStrategy,
|
|
67
|
+
new Bytecode(this.bytecode),
|
|
68
|
+
this.graphTraversalSourceClass,
|
|
69
|
+
this.graphTraversalClass,
|
|
70
|
+
);
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
/**
|
|
74
|
+
* Spawn a new <code>Transaction</code> object that can then start and stop a transaction.
|
|
75
|
+
* @returns {Transaction}
|
|
76
|
+
*/
|
|
77
|
+
tx() {
|
|
78
|
+
// you can't do g.tx().begin().tx() - no child transactions
|
|
79
|
+
if (this.remoteConnection && this.remoteConnection.isSessionBound) {
|
|
80
|
+
throw new Error('This TraversalSource is already bound to a transaction - child transactions are not supported');
|
|
81
|
+
}
|
|
82
|
+
|
|
83
|
+
return new Transaction(this);
|
|
61
84
|
}
|
|
62
85
|
|
|
63
86
|
/**
|
|
@@ -71,9 +94,17 @@ class GraphTraversalSource {
|
|
|
71
94
|
* @returns {GraphTraversalSource}
|
|
72
95
|
*/
|
|
73
96
|
withComputer(graphComputer, workers, result, persist, vertices, edges, configuration) {
|
|
74
|
-
return this.withStrategies(
|
|
75
|
-
|
|
76
|
-
|
|
97
|
+
return this.withStrategies(
|
|
98
|
+
new VertexProgramStrategy({
|
|
99
|
+
graphComputer: graphComputer,
|
|
100
|
+
workers: workers,
|
|
101
|
+
result: result,
|
|
102
|
+
persist: persist,
|
|
103
|
+
vertices: vertices,
|
|
104
|
+
edges: edges,
|
|
105
|
+
configuration: configuration,
|
|
106
|
+
}),
|
|
107
|
+
);
|
|
77
108
|
}
|
|
78
109
|
|
|
79
110
|
/**
|
|
@@ -82,18 +113,23 @@ class GraphTraversalSource {
|
|
|
82
113
|
* @param {Object} value if not specified, the value with default to {@code true}
|
|
83
114
|
* @returns {GraphTraversalSource}
|
|
84
115
|
*/
|
|
85
|
-
with_(key, value=undefined) {
|
|
116
|
+
with_(key, value = undefined) {
|
|
86
117
|
const val = value === undefined ? true : value;
|
|
87
118
|
let optionsStrategy = this.bytecode.sourceInstructions.find(
|
|
88
|
-
|
|
119
|
+
(i) => i[0] === 'withStrategies' && i[1] instanceof OptionsStrategy,
|
|
120
|
+
);
|
|
89
121
|
if (optionsStrategy === undefined) {
|
|
90
|
-
optionsStrategy = new OptionsStrategy({[key]: val});
|
|
122
|
+
optionsStrategy = new OptionsStrategy({ [key]: val });
|
|
91
123
|
return this.withStrategies(optionsStrategy);
|
|
92
|
-
} else {
|
|
93
|
-
optionsStrategy[1].configuration[key] = val;
|
|
94
|
-
return new this.graphTraversalSourceClass(this.graph, new TraversalStrategies(this.traversalStrategies),
|
|
95
|
-
this.bytecode, this.graphTraversalSourceClass, this.graphTraversalClass);
|
|
96
124
|
}
|
|
125
|
+
optionsStrategy[1].configuration[key] = val;
|
|
126
|
+
return new this.graphTraversalSourceClass(
|
|
127
|
+
this.graph,
|
|
128
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
129
|
+
this.bytecode,
|
|
130
|
+
this.graphTraversalSourceClass,
|
|
131
|
+
this.graphTraversalClass,
|
|
132
|
+
);
|
|
97
133
|
}
|
|
98
134
|
|
|
99
135
|
/**
|
|
@@ -103,7 +139,7 @@ class GraphTraversalSource {
|
|
|
103
139
|
toString() {
|
|
104
140
|
return 'graphtraversalsource[' + this.graph.toString() + ']';
|
|
105
141
|
}
|
|
106
|
-
|
|
142
|
+
|
|
107
143
|
/**
|
|
108
144
|
* Graph Traversal Source withBulk method.
|
|
109
145
|
* @param {...Object} args
|
|
@@ -111,9 +147,15 @@ class GraphTraversalSource {
|
|
|
111
147
|
*/
|
|
112
148
|
withBulk(...args) {
|
|
113
149
|
const b = new Bytecode(this.bytecode).addSource('withBulk', args);
|
|
114
|
-
return new this.graphTraversalSourceClass(
|
|
150
|
+
return new this.graphTraversalSourceClass(
|
|
151
|
+
this.graph,
|
|
152
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
153
|
+
b,
|
|
154
|
+
this.graphTraversalSourceClass,
|
|
155
|
+
this.graphTraversalClass,
|
|
156
|
+
);
|
|
115
157
|
}
|
|
116
|
-
|
|
158
|
+
|
|
117
159
|
/**
|
|
118
160
|
* Graph Traversal Source withPath method.
|
|
119
161
|
* @param {...Object} args
|
|
@@ -121,9 +163,15 @@ class GraphTraversalSource {
|
|
|
121
163
|
*/
|
|
122
164
|
withPath(...args) {
|
|
123
165
|
const b = new Bytecode(this.bytecode).addSource('withPath', args);
|
|
124
|
-
return new this.graphTraversalSourceClass(
|
|
166
|
+
return new this.graphTraversalSourceClass(
|
|
167
|
+
this.graph,
|
|
168
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
169
|
+
b,
|
|
170
|
+
this.graphTraversalSourceClass,
|
|
171
|
+
this.graphTraversalClass,
|
|
172
|
+
);
|
|
125
173
|
}
|
|
126
|
-
|
|
174
|
+
|
|
127
175
|
/**
|
|
128
176
|
* Graph Traversal Source withSack method.
|
|
129
177
|
* @param {...Object} args
|
|
@@ -131,9 +179,15 @@ class GraphTraversalSource {
|
|
|
131
179
|
*/
|
|
132
180
|
withSack(...args) {
|
|
133
181
|
const b = new Bytecode(this.bytecode).addSource('withSack', args);
|
|
134
|
-
return new this.graphTraversalSourceClass(
|
|
182
|
+
return new this.graphTraversalSourceClass(
|
|
183
|
+
this.graph,
|
|
184
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
185
|
+
b,
|
|
186
|
+
this.graphTraversalSourceClass,
|
|
187
|
+
this.graphTraversalClass,
|
|
188
|
+
);
|
|
135
189
|
}
|
|
136
|
-
|
|
190
|
+
|
|
137
191
|
/**
|
|
138
192
|
* Graph Traversal Source withSideEffect method.
|
|
139
193
|
* @param {...Object} args
|
|
@@ -141,9 +195,15 @@ class GraphTraversalSource {
|
|
|
141
195
|
*/
|
|
142
196
|
withSideEffect(...args) {
|
|
143
197
|
const b = new Bytecode(this.bytecode).addSource('withSideEffect', args);
|
|
144
|
-
return new this.graphTraversalSourceClass(
|
|
198
|
+
return new this.graphTraversalSourceClass(
|
|
199
|
+
this.graph,
|
|
200
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
201
|
+
b,
|
|
202
|
+
this.graphTraversalSourceClass,
|
|
203
|
+
this.graphTraversalClass,
|
|
204
|
+
);
|
|
145
205
|
}
|
|
146
|
-
|
|
206
|
+
|
|
147
207
|
/**
|
|
148
208
|
* Graph Traversal Source withStrategies method.
|
|
149
209
|
* @param {...Object} args
|
|
@@ -151,9 +211,15 @@ class GraphTraversalSource {
|
|
|
151
211
|
*/
|
|
152
212
|
withStrategies(...args) {
|
|
153
213
|
const b = new Bytecode(this.bytecode).addSource('withStrategies', args);
|
|
154
|
-
return new this.graphTraversalSourceClass(
|
|
214
|
+
return new this.graphTraversalSourceClass(
|
|
215
|
+
this.graph,
|
|
216
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
217
|
+
b,
|
|
218
|
+
this.graphTraversalSourceClass,
|
|
219
|
+
this.graphTraversalClass,
|
|
220
|
+
);
|
|
155
221
|
}
|
|
156
|
-
|
|
222
|
+
|
|
157
223
|
/**
|
|
158
224
|
* Graph Traversal Source withoutStrategies method.
|
|
159
225
|
* @param {...Object} args
|
|
@@ -161,9 +227,15 @@ class GraphTraversalSource {
|
|
|
161
227
|
*/
|
|
162
228
|
withoutStrategies(...args) {
|
|
163
229
|
const b = new Bytecode(this.bytecode).addSource('withoutStrategies', args);
|
|
164
|
-
return new this.graphTraversalSourceClass(
|
|
230
|
+
return new this.graphTraversalSourceClass(
|
|
231
|
+
this.graph,
|
|
232
|
+
new TraversalStrategies(this.traversalStrategies),
|
|
233
|
+
b,
|
|
234
|
+
this.graphTraversalSourceClass,
|
|
235
|
+
this.graphTraversalClass,
|
|
236
|
+
);
|
|
165
237
|
}
|
|
166
|
-
|
|
238
|
+
|
|
167
239
|
/**
|
|
168
240
|
* E GraphTraversalSource step method.
|
|
169
241
|
* @param {...Object} args
|
|
@@ -173,7 +245,7 @@ class GraphTraversalSource {
|
|
|
173
245
|
const b = new Bytecode(this.bytecode).addStep('E', args);
|
|
174
246
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
175
247
|
}
|
|
176
|
-
|
|
248
|
+
|
|
177
249
|
/**
|
|
178
250
|
* V GraphTraversalSource step method.
|
|
179
251
|
* @param {...Object} args
|
|
@@ -183,7 +255,7 @@ class GraphTraversalSource {
|
|
|
183
255
|
const b = new Bytecode(this.bytecode).addStep('V', args);
|
|
184
256
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
185
257
|
}
|
|
186
|
-
|
|
258
|
+
|
|
187
259
|
/**
|
|
188
260
|
* addE GraphTraversalSource step method.
|
|
189
261
|
* @param {...Object} args
|
|
@@ -193,7 +265,7 @@ class GraphTraversalSource {
|
|
|
193
265
|
const b = new Bytecode(this.bytecode).addStep('addE', args);
|
|
194
266
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
195
267
|
}
|
|
196
|
-
|
|
268
|
+
|
|
197
269
|
/**
|
|
198
270
|
* addV GraphTraversalSource step method.
|
|
199
271
|
* @param {...Object} args
|
|
@@ -203,7 +275,7 @@ class GraphTraversalSource {
|
|
|
203
275
|
const b = new Bytecode(this.bytecode).addStep('addV', args);
|
|
204
276
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
205
277
|
}
|
|
206
|
-
|
|
278
|
+
|
|
207
279
|
/**
|
|
208
280
|
* inject GraphTraversalSource step method.
|
|
209
281
|
* @param {...Object} args
|
|
@@ -213,7 +285,7 @@ class GraphTraversalSource {
|
|
|
213
285
|
const b = new Bytecode(this.bytecode).addStep('inject', args);
|
|
214
286
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
215
287
|
}
|
|
216
|
-
|
|
288
|
+
|
|
217
289
|
/**
|
|
218
290
|
* io GraphTraversalSource step method.
|
|
219
291
|
* @param {...Object} args
|
|
@@ -223,7 +295,6 @@ class GraphTraversalSource {
|
|
|
223
295
|
const b = new Bytecode(this.bytecode).addStep('io', args);
|
|
224
296
|
return new this.graphTraversalClass(this.graph, new TraversalStrategies(this.traversalStrategies), b);
|
|
225
297
|
}
|
|
226
|
-
|
|
227
298
|
}
|
|
228
299
|
|
|
229
300
|
/**
|
|
@@ -241,7 +312,6 @@ class GraphTraversal extends Traversal {
|
|
|
241
312
|
return new GraphTraversal(this.graph, this.traversalStrategies, this.getBytecode());
|
|
242
313
|
}
|
|
243
314
|
|
|
244
|
-
|
|
245
315
|
/**
|
|
246
316
|
* Graph traversal V method.
|
|
247
317
|
* @param {...Object} args
|
|
@@ -251,7 +321,7 @@ class GraphTraversal extends Traversal {
|
|
|
251
321
|
this.bytecode.addStep('V', args);
|
|
252
322
|
return this;
|
|
253
323
|
}
|
|
254
|
-
|
|
324
|
+
|
|
255
325
|
/**
|
|
256
326
|
* Graph traversal addE method.
|
|
257
327
|
* @param {...Object} args
|
|
@@ -261,7 +331,7 @@ class GraphTraversal extends Traversal {
|
|
|
261
331
|
this.bytecode.addStep('addE', args);
|
|
262
332
|
return this;
|
|
263
333
|
}
|
|
264
|
-
|
|
334
|
+
|
|
265
335
|
/**
|
|
266
336
|
* Graph traversal addV method.
|
|
267
337
|
* @param {...Object} args
|
|
@@ -271,7 +341,7 @@ class GraphTraversal extends Traversal {
|
|
|
271
341
|
this.bytecode.addStep('addV', args);
|
|
272
342
|
return this;
|
|
273
343
|
}
|
|
274
|
-
|
|
344
|
+
|
|
275
345
|
/**
|
|
276
346
|
* Graph traversal aggregate method.
|
|
277
347
|
* @param {...Object} args
|
|
@@ -281,7 +351,7 @@ class GraphTraversal extends Traversal {
|
|
|
281
351
|
this.bytecode.addStep('aggregate', args);
|
|
282
352
|
return this;
|
|
283
353
|
}
|
|
284
|
-
|
|
354
|
+
|
|
285
355
|
/**
|
|
286
356
|
* Graph traversal and method.
|
|
287
357
|
* @param {...Object} args
|
|
@@ -291,7 +361,7 @@ class GraphTraversal extends Traversal {
|
|
|
291
361
|
this.bytecode.addStep('and', args);
|
|
292
362
|
return this;
|
|
293
363
|
}
|
|
294
|
-
|
|
364
|
+
|
|
295
365
|
/**
|
|
296
366
|
* Graph traversal as method.
|
|
297
367
|
* @param {...Object} args
|
|
@@ -301,7 +371,7 @@ class GraphTraversal extends Traversal {
|
|
|
301
371
|
this.bytecode.addStep('as', args);
|
|
302
372
|
return this;
|
|
303
373
|
}
|
|
304
|
-
|
|
374
|
+
|
|
305
375
|
/**
|
|
306
376
|
* Graph traversal barrier method.
|
|
307
377
|
* @param {...Object} args
|
|
@@ -311,7 +381,7 @@ class GraphTraversal extends Traversal {
|
|
|
311
381
|
this.bytecode.addStep('barrier', args);
|
|
312
382
|
return this;
|
|
313
383
|
}
|
|
314
|
-
|
|
384
|
+
|
|
315
385
|
/**
|
|
316
386
|
* Graph traversal both method.
|
|
317
387
|
* @param {...Object} args
|
|
@@ -321,7 +391,7 @@ class GraphTraversal extends Traversal {
|
|
|
321
391
|
this.bytecode.addStep('both', args);
|
|
322
392
|
return this;
|
|
323
393
|
}
|
|
324
|
-
|
|
394
|
+
|
|
325
395
|
/**
|
|
326
396
|
* Graph traversal bothE method.
|
|
327
397
|
* @param {...Object} args
|
|
@@ -331,7 +401,7 @@ class GraphTraversal extends Traversal {
|
|
|
331
401
|
this.bytecode.addStep('bothE', args);
|
|
332
402
|
return this;
|
|
333
403
|
}
|
|
334
|
-
|
|
404
|
+
|
|
335
405
|
/**
|
|
336
406
|
* Graph traversal bothV method.
|
|
337
407
|
* @param {...Object} args
|
|
@@ -341,7 +411,7 @@ class GraphTraversal extends Traversal {
|
|
|
341
411
|
this.bytecode.addStep('bothV', args);
|
|
342
412
|
return this;
|
|
343
413
|
}
|
|
344
|
-
|
|
414
|
+
|
|
345
415
|
/**
|
|
346
416
|
* Graph traversal branch method.
|
|
347
417
|
* @param {...Object} args
|
|
@@ -351,7 +421,7 @@ class GraphTraversal extends Traversal {
|
|
|
351
421
|
this.bytecode.addStep('branch', args);
|
|
352
422
|
return this;
|
|
353
423
|
}
|
|
354
|
-
|
|
424
|
+
|
|
355
425
|
/**
|
|
356
426
|
* Graph traversal by method.
|
|
357
427
|
* @param {...Object} args
|
|
@@ -361,7 +431,7 @@ class GraphTraversal extends Traversal {
|
|
|
361
431
|
this.bytecode.addStep('by', args);
|
|
362
432
|
return this;
|
|
363
433
|
}
|
|
364
|
-
|
|
434
|
+
|
|
365
435
|
/**
|
|
366
436
|
* Graph traversal cap method.
|
|
367
437
|
* @param {...Object} args
|
|
@@ -371,7 +441,7 @@ class GraphTraversal extends Traversal {
|
|
|
371
441
|
this.bytecode.addStep('cap', args);
|
|
372
442
|
return this;
|
|
373
443
|
}
|
|
374
|
-
|
|
444
|
+
|
|
375
445
|
/**
|
|
376
446
|
* Graph traversal choose method.
|
|
377
447
|
* @param {...Object} args
|
|
@@ -381,7 +451,7 @@ class GraphTraversal extends Traversal {
|
|
|
381
451
|
this.bytecode.addStep('choose', args);
|
|
382
452
|
return this;
|
|
383
453
|
}
|
|
384
|
-
|
|
454
|
+
|
|
385
455
|
/**
|
|
386
456
|
* Graph traversal coalesce method.
|
|
387
457
|
* @param {...Object} args
|
|
@@ -391,7 +461,7 @@ class GraphTraversal extends Traversal {
|
|
|
391
461
|
this.bytecode.addStep('coalesce', args);
|
|
392
462
|
return this;
|
|
393
463
|
}
|
|
394
|
-
|
|
464
|
+
|
|
395
465
|
/**
|
|
396
466
|
* Graph traversal coin method.
|
|
397
467
|
* @param {...Object} args
|
|
@@ -401,7 +471,7 @@ class GraphTraversal extends Traversal {
|
|
|
401
471
|
this.bytecode.addStep('coin', args);
|
|
402
472
|
return this;
|
|
403
473
|
}
|
|
404
|
-
|
|
474
|
+
|
|
405
475
|
/**
|
|
406
476
|
* Graph traversal connectedComponent method.
|
|
407
477
|
* @param {...Object} args
|
|
@@ -411,7 +481,7 @@ class GraphTraversal extends Traversal {
|
|
|
411
481
|
this.bytecode.addStep('connectedComponent', args);
|
|
412
482
|
return this;
|
|
413
483
|
}
|
|
414
|
-
|
|
484
|
+
|
|
415
485
|
/**
|
|
416
486
|
* Graph traversal constant method.
|
|
417
487
|
* @param {...Object} args
|
|
@@ -421,7 +491,7 @@ class GraphTraversal extends Traversal {
|
|
|
421
491
|
this.bytecode.addStep('constant', args);
|
|
422
492
|
return this;
|
|
423
493
|
}
|
|
424
|
-
|
|
494
|
+
|
|
425
495
|
/**
|
|
426
496
|
* Graph traversal count method.
|
|
427
497
|
* @param {...Object} args
|
|
@@ -431,7 +501,7 @@ class GraphTraversal extends Traversal {
|
|
|
431
501
|
this.bytecode.addStep('count', args);
|
|
432
502
|
return this;
|
|
433
503
|
}
|
|
434
|
-
|
|
504
|
+
|
|
435
505
|
/**
|
|
436
506
|
* Graph traversal cyclicPath method.
|
|
437
507
|
* @param {...Object} args
|
|
@@ -441,7 +511,7 @@ class GraphTraversal extends Traversal {
|
|
|
441
511
|
this.bytecode.addStep('cyclicPath', args);
|
|
442
512
|
return this;
|
|
443
513
|
}
|
|
444
|
-
|
|
514
|
+
|
|
445
515
|
/**
|
|
446
516
|
* Graph traversal dedup method.
|
|
447
517
|
* @param {...Object} args
|
|
@@ -451,7 +521,7 @@ class GraphTraversal extends Traversal {
|
|
|
451
521
|
this.bytecode.addStep('dedup', args);
|
|
452
522
|
return this;
|
|
453
523
|
}
|
|
454
|
-
|
|
524
|
+
|
|
455
525
|
/**
|
|
456
526
|
* Graph traversal drop method.
|
|
457
527
|
* @param {...Object} args
|
|
@@ -461,7 +531,7 @@ class GraphTraversal extends Traversal {
|
|
|
461
531
|
this.bytecode.addStep('drop', args);
|
|
462
532
|
return this;
|
|
463
533
|
}
|
|
464
|
-
|
|
534
|
+
|
|
465
535
|
/**
|
|
466
536
|
* Graph traversal elementMap method.
|
|
467
537
|
* @param {...Object} args
|
|
@@ -471,7 +541,7 @@ class GraphTraversal extends Traversal {
|
|
|
471
541
|
this.bytecode.addStep('elementMap', args);
|
|
472
542
|
return this;
|
|
473
543
|
}
|
|
474
|
-
|
|
544
|
+
|
|
475
545
|
/**
|
|
476
546
|
* Graph traversal emit method.
|
|
477
547
|
* @param {...Object} args
|
|
@@ -481,7 +551,7 @@ class GraphTraversal extends Traversal {
|
|
|
481
551
|
this.bytecode.addStep('emit', args);
|
|
482
552
|
return this;
|
|
483
553
|
}
|
|
484
|
-
|
|
554
|
+
|
|
485
555
|
/**
|
|
486
556
|
* Graph traversal filter method.
|
|
487
557
|
* @param {...Object} args
|
|
@@ -491,7 +561,7 @@ class GraphTraversal extends Traversal {
|
|
|
491
561
|
this.bytecode.addStep('filter', args);
|
|
492
562
|
return this;
|
|
493
563
|
}
|
|
494
|
-
|
|
564
|
+
|
|
495
565
|
/**
|
|
496
566
|
* Graph traversal flatMap method.
|
|
497
567
|
* @param {...Object} args
|
|
@@ -501,7 +571,7 @@ class GraphTraversal extends Traversal {
|
|
|
501
571
|
this.bytecode.addStep('flatMap', args);
|
|
502
572
|
return this;
|
|
503
573
|
}
|
|
504
|
-
|
|
574
|
+
|
|
505
575
|
/**
|
|
506
576
|
* Graph traversal fold method.
|
|
507
577
|
* @param {...Object} args
|
|
@@ -511,7 +581,7 @@ class GraphTraversal extends Traversal {
|
|
|
511
581
|
this.bytecode.addStep('fold', args);
|
|
512
582
|
return this;
|
|
513
583
|
}
|
|
514
|
-
|
|
584
|
+
|
|
515
585
|
/**
|
|
516
586
|
* Graph traversal from method.
|
|
517
587
|
* @param {...Object} args
|
|
@@ -521,7 +591,7 @@ class GraphTraversal extends Traversal {
|
|
|
521
591
|
this.bytecode.addStep('from', args);
|
|
522
592
|
return this;
|
|
523
593
|
}
|
|
524
|
-
|
|
594
|
+
|
|
525
595
|
/**
|
|
526
596
|
* Graph traversal group method.
|
|
527
597
|
* @param {...Object} args
|
|
@@ -531,7 +601,7 @@ class GraphTraversal extends Traversal {
|
|
|
531
601
|
this.bytecode.addStep('group', args);
|
|
532
602
|
return this;
|
|
533
603
|
}
|
|
534
|
-
|
|
604
|
+
|
|
535
605
|
/**
|
|
536
606
|
* Graph traversal groupCount method.
|
|
537
607
|
* @param {...Object} args
|
|
@@ -541,7 +611,7 @@ class GraphTraversal extends Traversal {
|
|
|
541
611
|
this.bytecode.addStep('groupCount', args);
|
|
542
612
|
return this;
|
|
543
613
|
}
|
|
544
|
-
|
|
614
|
+
|
|
545
615
|
/**
|
|
546
616
|
* Graph traversal has method.
|
|
547
617
|
* @param {...Object} args
|
|
@@ -551,7 +621,7 @@ class GraphTraversal extends Traversal {
|
|
|
551
621
|
this.bytecode.addStep('has', args);
|
|
552
622
|
return this;
|
|
553
623
|
}
|
|
554
|
-
|
|
624
|
+
|
|
555
625
|
/**
|
|
556
626
|
* Graph traversal hasId method.
|
|
557
627
|
* @param {...Object} args
|
|
@@ -561,7 +631,7 @@ class GraphTraversal extends Traversal {
|
|
|
561
631
|
this.bytecode.addStep('hasId', args);
|
|
562
632
|
return this;
|
|
563
633
|
}
|
|
564
|
-
|
|
634
|
+
|
|
565
635
|
/**
|
|
566
636
|
* Graph traversal hasKey method.
|
|
567
637
|
* @param {...Object} args
|
|
@@ -571,7 +641,7 @@ class GraphTraversal extends Traversal {
|
|
|
571
641
|
this.bytecode.addStep('hasKey', args);
|
|
572
642
|
return this;
|
|
573
643
|
}
|
|
574
|
-
|
|
644
|
+
|
|
575
645
|
/**
|
|
576
646
|
* Graph traversal hasLabel method.
|
|
577
647
|
* @param {...Object} args
|
|
@@ -581,7 +651,7 @@ class GraphTraversal extends Traversal {
|
|
|
581
651
|
this.bytecode.addStep('hasLabel', args);
|
|
582
652
|
return this;
|
|
583
653
|
}
|
|
584
|
-
|
|
654
|
+
|
|
585
655
|
/**
|
|
586
656
|
* Graph traversal hasNot method.
|
|
587
657
|
* @param {...Object} args
|
|
@@ -591,7 +661,7 @@ class GraphTraversal extends Traversal {
|
|
|
591
661
|
this.bytecode.addStep('hasNot', args);
|
|
592
662
|
return this;
|
|
593
663
|
}
|
|
594
|
-
|
|
664
|
+
|
|
595
665
|
/**
|
|
596
666
|
* Graph traversal hasValue method.
|
|
597
667
|
* @param {...Object} args
|
|
@@ -601,7 +671,7 @@ class GraphTraversal extends Traversal {
|
|
|
601
671
|
this.bytecode.addStep('hasValue', args);
|
|
602
672
|
return this;
|
|
603
673
|
}
|
|
604
|
-
|
|
674
|
+
|
|
605
675
|
/**
|
|
606
676
|
* Graph traversal id method.
|
|
607
677
|
* @param {...Object} args
|
|
@@ -611,7 +681,7 @@ class GraphTraversal extends Traversal {
|
|
|
611
681
|
this.bytecode.addStep('id', args);
|
|
612
682
|
return this;
|
|
613
683
|
}
|
|
614
|
-
|
|
684
|
+
|
|
615
685
|
/**
|
|
616
686
|
* Graph traversal identity method.
|
|
617
687
|
* @param {...Object} args
|
|
@@ -621,7 +691,7 @@ class GraphTraversal extends Traversal {
|
|
|
621
691
|
this.bytecode.addStep('identity', args);
|
|
622
692
|
return this;
|
|
623
693
|
}
|
|
624
|
-
|
|
694
|
+
|
|
625
695
|
/**
|
|
626
696
|
* Graph traversal in method.
|
|
627
697
|
* @param {...Object} args
|
|
@@ -631,7 +701,7 @@ class GraphTraversal extends Traversal {
|
|
|
631
701
|
this.bytecode.addStep('in', args);
|
|
632
702
|
return this;
|
|
633
703
|
}
|
|
634
|
-
|
|
704
|
+
|
|
635
705
|
/**
|
|
636
706
|
* Graph traversal inE method.
|
|
637
707
|
* @param {...Object} args
|
|
@@ -641,7 +711,7 @@ class GraphTraversal extends Traversal {
|
|
|
641
711
|
this.bytecode.addStep('inE', args);
|
|
642
712
|
return this;
|
|
643
713
|
}
|
|
644
|
-
|
|
714
|
+
|
|
645
715
|
/**
|
|
646
716
|
* Graph traversal inV method.
|
|
647
717
|
* @param {...Object} args
|
|
@@ -651,7 +721,7 @@ class GraphTraversal extends Traversal {
|
|
|
651
721
|
this.bytecode.addStep('inV', args);
|
|
652
722
|
return this;
|
|
653
723
|
}
|
|
654
|
-
|
|
724
|
+
|
|
655
725
|
/**
|
|
656
726
|
* Graph traversal index method.
|
|
657
727
|
* @param {...Object} args
|
|
@@ -661,7 +731,7 @@ class GraphTraversal extends Traversal {
|
|
|
661
731
|
this.bytecode.addStep('index', args);
|
|
662
732
|
return this;
|
|
663
733
|
}
|
|
664
|
-
|
|
734
|
+
|
|
665
735
|
/**
|
|
666
736
|
* Graph traversal inject method.
|
|
667
737
|
* @param {...Object} args
|
|
@@ -671,7 +741,7 @@ class GraphTraversal extends Traversal {
|
|
|
671
741
|
this.bytecode.addStep('inject', args);
|
|
672
742
|
return this;
|
|
673
743
|
}
|
|
674
|
-
|
|
744
|
+
|
|
675
745
|
/**
|
|
676
746
|
* Graph traversal is method.
|
|
677
747
|
* @param {...Object} args
|
|
@@ -681,7 +751,7 @@ class GraphTraversal extends Traversal {
|
|
|
681
751
|
this.bytecode.addStep('is', args);
|
|
682
752
|
return this;
|
|
683
753
|
}
|
|
684
|
-
|
|
754
|
+
|
|
685
755
|
/**
|
|
686
756
|
* Graph traversal key method.
|
|
687
757
|
* @param {...Object} args
|
|
@@ -691,7 +761,7 @@ class GraphTraversal extends Traversal {
|
|
|
691
761
|
this.bytecode.addStep('key', args);
|
|
692
762
|
return this;
|
|
693
763
|
}
|
|
694
|
-
|
|
764
|
+
|
|
695
765
|
/**
|
|
696
766
|
* Graph traversal label method.
|
|
697
767
|
* @param {...Object} args
|
|
@@ -701,7 +771,7 @@ class GraphTraversal extends Traversal {
|
|
|
701
771
|
this.bytecode.addStep('label', args);
|
|
702
772
|
return this;
|
|
703
773
|
}
|
|
704
|
-
|
|
774
|
+
|
|
705
775
|
/**
|
|
706
776
|
* Graph traversal limit method.
|
|
707
777
|
* @param {...Object} args
|
|
@@ -711,7 +781,7 @@ class GraphTraversal extends Traversal {
|
|
|
711
781
|
this.bytecode.addStep('limit', args);
|
|
712
782
|
return this;
|
|
713
783
|
}
|
|
714
|
-
|
|
784
|
+
|
|
715
785
|
/**
|
|
716
786
|
* Graph traversal local method.
|
|
717
787
|
* @param {...Object} args
|
|
@@ -721,7 +791,7 @@ class GraphTraversal extends Traversal {
|
|
|
721
791
|
this.bytecode.addStep('local', args);
|
|
722
792
|
return this;
|
|
723
793
|
}
|
|
724
|
-
|
|
794
|
+
|
|
725
795
|
/**
|
|
726
796
|
* Graph traversal loops method.
|
|
727
797
|
* @param {...Object} args
|
|
@@ -731,7 +801,7 @@ class GraphTraversal extends Traversal {
|
|
|
731
801
|
this.bytecode.addStep('loops', args);
|
|
732
802
|
return this;
|
|
733
803
|
}
|
|
734
|
-
|
|
804
|
+
|
|
735
805
|
/**
|
|
736
806
|
* Graph traversal map method.
|
|
737
807
|
* @param {...Object} args
|
|
@@ -741,7 +811,7 @@ class GraphTraversal extends Traversal {
|
|
|
741
811
|
this.bytecode.addStep('map', args);
|
|
742
812
|
return this;
|
|
743
813
|
}
|
|
744
|
-
|
|
814
|
+
|
|
745
815
|
/**
|
|
746
816
|
* Graph traversal match method.
|
|
747
817
|
* @param {...Object} args
|
|
@@ -751,7 +821,7 @@ class GraphTraversal extends Traversal {
|
|
|
751
821
|
this.bytecode.addStep('match', args);
|
|
752
822
|
return this;
|
|
753
823
|
}
|
|
754
|
-
|
|
824
|
+
|
|
755
825
|
/**
|
|
756
826
|
* Graph traversal math method.
|
|
757
827
|
* @param {...Object} args
|
|
@@ -761,7 +831,7 @@ class GraphTraversal extends Traversal {
|
|
|
761
831
|
this.bytecode.addStep('math', args);
|
|
762
832
|
return this;
|
|
763
833
|
}
|
|
764
|
-
|
|
834
|
+
|
|
765
835
|
/**
|
|
766
836
|
* Graph traversal max method.
|
|
767
837
|
* @param {...Object} args
|
|
@@ -771,7 +841,7 @@ class GraphTraversal extends Traversal {
|
|
|
771
841
|
this.bytecode.addStep('max', args);
|
|
772
842
|
return this;
|
|
773
843
|
}
|
|
774
|
-
|
|
844
|
+
|
|
775
845
|
/**
|
|
776
846
|
* Graph traversal mean method.
|
|
777
847
|
* @param {...Object} args
|
|
@@ -781,7 +851,7 @@ class GraphTraversal extends Traversal {
|
|
|
781
851
|
this.bytecode.addStep('mean', args);
|
|
782
852
|
return this;
|
|
783
853
|
}
|
|
784
|
-
|
|
854
|
+
|
|
785
855
|
/**
|
|
786
856
|
* Graph traversal min method.
|
|
787
857
|
* @param {...Object} args
|
|
@@ -791,7 +861,7 @@ class GraphTraversal extends Traversal {
|
|
|
791
861
|
this.bytecode.addStep('min', args);
|
|
792
862
|
return this;
|
|
793
863
|
}
|
|
794
|
-
|
|
864
|
+
|
|
795
865
|
/**
|
|
796
866
|
* Graph traversal none method.
|
|
797
867
|
* @param {...Object} args
|
|
@@ -801,7 +871,7 @@ class GraphTraversal extends Traversal {
|
|
|
801
871
|
this.bytecode.addStep('none', args);
|
|
802
872
|
return this;
|
|
803
873
|
}
|
|
804
|
-
|
|
874
|
+
|
|
805
875
|
/**
|
|
806
876
|
* Graph traversal not method.
|
|
807
877
|
* @param {...Object} args
|
|
@@ -811,7 +881,7 @@ class GraphTraversal extends Traversal {
|
|
|
811
881
|
this.bytecode.addStep('not', args);
|
|
812
882
|
return this;
|
|
813
883
|
}
|
|
814
|
-
|
|
884
|
+
|
|
815
885
|
/**
|
|
816
886
|
* Graph traversal option method.
|
|
817
887
|
* @param {...Object} args
|
|
@@ -821,7 +891,7 @@ class GraphTraversal extends Traversal {
|
|
|
821
891
|
this.bytecode.addStep('option', args);
|
|
822
892
|
return this;
|
|
823
893
|
}
|
|
824
|
-
|
|
894
|
+
|
|
825
895
|
/**
|
|
826
896
|
* Graph traversal optional method.
|
|
827
897
|
* @param {...Object} args
|
|
@@ -831,7 +901,7 @@ class GraphTraversal extends Traversal {
|
|
|
831
901
|
this.bytecode.addStep('optional', args);
|
|
832
902
|
return this;
|
|
833
903
|
}
|
|
834
|
-
|
|
904
|
+
|
|
835
905
|
/**
|
|
836
906
|
* Graph traversal or method.
|
|
837
907
|
* @param {...Object} args
|
|
@@ -841,7 +911,7 @@ class GraphTraversal extends Traversal {
|
|
|
841
911
|
this.bytecode.addStep('or', args);
|
|
842
912
|
return this;
|
|
843
913
|
}
|
|
844
|
-
|
|
914
|
+
|
|
845
915
|
/**
|
|
846
916
|
* Graph traversal order method.
|
|
847
917
|
* @param {...Object} args
|
|
@@ -851,7 +921,7 @@ class GraphTraversal extends Traversal {
|
|
|
851
921
|
this.bytecode.addStep('order', args);
|
|
852
922
|
return this;
|
|
853
923
|
}
|
|
854
|
-
|
|
924
|
+
|
|
855
925
|
/**
|
|
856
926
|
* Graph traversal otherV method.
|
|
857
927
|
* @param {...Object} args
|
|
@@ -861,7 +931,7 @@ class GraphTraversal extends Traversal {
|
|
|
861
931
|
this.bytecode.addStep('otherV', args);
|
|
862
932
|
return this;
|
|
863
933
|
}
|
|
864
|
-
|
|
934
|
+
|
|
865
935
|
/**
|
|
866
936
|
* Graph traversal out method.
|
|
867
937
|
* @param {...Object} args
|
|
@@ -871,7 +941,7 @@ class GraphTraversal extends Traversal {
|
|
|
871
941
|
this.bytecode.addStep('out', args);
|
|
872
942
|
return this;
|
|
873
943
|
}
|
|
874
|
-
|
|
944
|
+
|
|
875
945
|
/**
|
|
876
946
|
* Graph traversal outE method.
|
|
877
947
|
* @param {...Object} args
|
|
@@ -881,7 +951,7 @@ class GraphTraversal extends Traversal {
|
|
|
881
951
|
this.bytecode.addStep('outE', args);
|
|
882
952
|
return this;
|
|
883
953
|
}
|
|
884
|
-
|
|
954
|
+
|
|
885
955
|
/**
|
|
886
956
|
* Graph traversal outV method.
|
|
887
957
|
* @param {...Object} args
|
|
@@ -891,7 +961,7 @@ class GraphTraversal extends Traversal {
|
|
|
891
961
|
this.bytecode.addStep('outV', args);
|
|
892
962
|
return this;
|
|
893
963
|
}
|
|
894
|
-
|
|
964
|
+
|
|
895
965
|
/**
|
|
896
966
|
* Graph traversal pageRank method.
|
|
897
967
|
* @param {...Object} args
|
|
@@ -901,7 +971,7 @@ class GraphTraversal extends Traversal {
|
|
|
901
971
|
this.bytecode.addStep('pageRank', args);
|
|
902
972
|
return this;
|
|
903
973
|
}
|
|
904
|
-
|
|
974
|
+
|
|
905
975
|
/**
|
|
906
976
|
* Graph traversal path method.
|
|
907
977
|
* @param {...Object} args
|
|
@@ -911,7 +981,7 @@ class GraphTraversal extends Traversal {
|
|
|
911
981
|
this.bytecode.addStep('path', args);
|
|
912
982
|
return this;
|
|
913
983
|
}
|
|
914
|
-
|
|
984
|
+
|
|
915
985
|
/**
|
|
916
986
|
* Graph traversal peerPressure method.
|
|
917
987
|
* @param {...Object} args
|
|
@@ -921,7 +991,7 @@ class GraphTraversal extends Traversal {
|
|
|
921
991
|
this.bytecode.addStep('peerPressure', args);
|
|
922
992
|
return this;
|
|
923
993
|
}
|
|
924
|
-
|
|
994
|
+
|
|
925
995
|
/**
|
|
926
996
|
* Graph traversal profile method.
|
|
927
997
|
* @param {...Object} args
|
|
@@ -931,7 +1001,7 @@ class GraphTraversal extends Traversal {
|
|
|
931
1001
|
this.bytecode.addStep('profile', args);
|
|
932
1002
|
return this;
|
|
933
1003
|
}
|
|
934
|
-
|
|
1004
|
+
|
|
935
1005
|
/**
|
|
936
1006
|
* Graph traversal program method.
|
|
937
1007
|
* @param {...Object} args
|
|
@@ -941,7 +1011,7 @@ class GraphTraversal extends Traversal {
|
|
|
941
1011
|
this.bytecode.addStep('program', args);
|
|
942
1012
|
return this;
|
|
943
1013
|
}
|
|
944
|
-
|
|
1014
|
+
|
|
945
1015
|
/**
|
|
946
1016
|
* Graph traversal project method.
|
|
947
1017
|
* @param {...Object} args
|
|
@@ -951,7 +1021,7 @@ class GraphTraversal extends Traversal {
|
|
|
951
1021
|
this.bytecode.addStep('project', args);
|
|
952
1022
|
return this;
|
|
953
1023
|
}
|
|
954
|
-
|
|
1024
|
+
|
|
955
1025
|
/**
|
|
956
1026
|
* Graph traversal properties method.
|
|
957
1027
|
* @param {...Object} args
|
|
@@ -961,7 +1031,7 @@ class GraphTraversal extends Traversal {
|
|
|
961
1031
|
this.bytecode.addStep('properties', args);
|
|
962
1032
|
return this;
|
|
963
1033
|
}
|
|
964
|
-
|
|
1034
|
+
|
|
965
1035
|
/**
|
|
966
1036
|
* Graph traversal property method.
|
|
967
1037
|
* @param {...Object} args
|
|
@@ -971,7 +1041,7 @@ class GraphTraversal extends Traversal {
|
|
|
971
1041
|
this.bytecode.addStep('property', args);
|
|
972
1042
|
return this;
|
|
973
1043
|
}
|
|
974
|
-
|
|
1044
|
+
|
|
975
1045
|
/**
|
|
976
1046
|
* Graph traversal propertyMap method.
|
|
977
1047
|
* @param {...Object} args
|
|
@@ -981,7 +1051,7 @@ class GraphTraversal extends Traversal {
|
|
|
981
1051
|
this.bytecode.addStep('propertyMap', args);
|
|
982
1052
|
return this;
|
|
983
1053
|
}
|
|
984
|
-
|
|
1054
|
+
|
|
985
1055
|
/**
|
|
986
1056
|
* Graph traversal range method.
|
|
987
1057
|
* @param {...Object} args
|
|
@@ -991,7 +1061,7 @@ class GraphTraversal extends Traversal {
|
|
|
991
1061
|
this.bytecode.addStep('range', args);
|
|
992
1062
|
return this;
|
|
993
1063
|
}
|
|
994
|
-
|
|
1064
|
+
|
|
995
1065
|
/**
|
|
996
1066
|
* Graph traversal read method.
|
|
997
1067
|
* @param {...Object} args
|
|
@@ -1001,7 +1071,7 @@ class GraphTraversal extends Traversal {
|
|
|
1001
1071
|
this.bytecode.addStep('read', args);
|
|
1002
1072
|
return this;
|
|
1003
1073
|
}
|
|
1004
|
-
|
|
1074
|
+
|
|
1005
1075
|
/**
|
|
1006
1076
|
* Graph traversal repeat method.
|
|
1007
1077
|
* @param {...Object} args
|
|
@@ -1011,7 +1081,7 @@ class GraphTraversal extends Traversal {
|
|
|
1011
1081
|
this.bytecode.addStep('repeat', args);
|
|
1012
1082
|
return this;
|
|
1013
1083
|
}
|
|
1014
|
-
|
|
1084
|
+
|
|
1015
1085
|
/**
|
|
1016
1086
|
* Graph traversal sack method.
|
|
1017
1087
|
* @param {...Object} args
|
|
@@ -1021,7 +1091,7 @@ class GraphTraversal extends Traversal {
|
|
|
1021
1091
|
this.bytecode.addStep('sack', args);
|
|
1022
1092
|
return this;
|
|
1023
1093
|
}
|
|
1024
|
-
|
|
1094
|
+
|
|
1025
1095
|
/**
|
|
1026
1096
|
* Graph traversal sample method.
|
|
1027
1097
|
* @param {...Object} args
|
|
@@ -1031,7 +1101,7 @@ class GraphTraversal extends Traversal {
|
|
|
1031
1101
|
this.bytecode.addStep('sample', args);
|
|
1032
1102
|
return this;
|
|
1033
1103
|
}
|
|
1034
|
-
|
|
1104
|
+
|
|
1035
1105
|
/**
|
|
1036
1106
|
* Graph traversal select method.
|
|
1037
1107
|
* @param {...Object} args
|
|
@@ -1041,7 +1111,7 @@ class GraphTraversal extends Traversal {
|
|
|
1041
1111
|
this.bytecode.addStep('select', args);
|
|
1042
1112
|
return this;
|
|
1043
1113
|
}
|
|
1044
|
-
|
|
1114
|
+
|
|
1045
1115
|
/**
|
|
1046
1116
|
* Graph traversal shortestPath method.
|
|
1047
1117
|
* @param {...Object} args
|
|
@@ -1051,7 +1121,7 @@ class GraphTraversal extends Traversal {
|
|
|
1051
1121
|
this.bytecode.addStep('shortestPath', args);
|
|
1052
1122
|
return this;
|
|
1053
1123
|
}
|
|
1054
|
-
|
|
1124
|
+
|
|
1055
1125
|
/**
|
|
1056
1126
|
* Graph traversal sideEffect method.
|
|
1057
1127
|
* @param {...Object} args
|
|
@@ -1061,7 +1131,7 @@ class GraphTraversal extends Traversal {
|
|
|
1061
1131
|
this.bytecode.addStep('sideEffect', args);
|
|
1062
1132
|
return this;
|
|
1063
1133
|
}
|
|
1064
|
-
|
|
1134
|
+
|
|
1065
1135
|
/**
|
|
1066
1136
|
* Graph traversal simplePath method.
|
|
1067
1137
|
* @param {...Object} args
|
|
@@ -1071,7 +1141,7 @@ class GraphTraversal extends Traversal {
|
|
|
1071
1141
|
this.bytecode.addStep('simplePath', args);
|
|
1072
1142
|
return this;
|
|
1073
1143
|
}
|
|
1074
|
-
|
|
1144
|
+
|
|
1075
1145
|
/**
|
|
1076
1146
|
* Graph traversal skip method.
|
|
1077
1147
|
* @param {...Object} args
|
|
@@ -1081,7 +1151,7 @@ class GraphTraversal extends Traversal {
|
|
|
1081
1151
|
this.bytecode.addStep('skip', args);
|
|
1082
1152
|
return this;
|
|
1083
1153
|
}
|
|
1084
|
-
|
|
1154
|
+
|
|
1085
1155
|
/**
|
|
1086
1156
|
* Graph traversal store method.
|
|
1087
1157
|
* @param {...Object} args
|
|
@@ -1091,7 +1161,7 @@ class GraphTraversal extends Traversal {
|
|
|
1091
1161
|
this.bytecode.addStep('store', args);
|
|
1092
1162
|
return this;
|
|
1093
1163
|
}
|
|
1094
|
-
|
|
1164
|
+
|
|
1095
1165
|
/**
|
|
1096
1166
|
* Graph traversal subgraph method.
|
|
1097
1167
|
* @param {...Object} args
|
|
@@ -1101,7 +1171,7 @@ class GraphTraversal extends Traversal {
|
|
|
1101
1171
|
this.bytecode.addStep('subgraph', args);
|
|
1102
1172
|
return this;
|
|
1103
1173
|
}
|
|
1104
|
-
|
|
1174
|
+
|
|
1105
1175
|
/**
|
|
1106
1176
|
* Graph traversal sum method.
|
|
1107
1177
|
* @param {...Object} args
|
|
@@ -1111,7 +1181,7 @@ class GraphTraversal extends Traversal {
|
|
|
1111
1181
|
this.bytecode.addStep('sum', args);
|
|
1112
1182
|
return this;
|
|
1113
1183
|
}
|
|
1114
|
-
|
|
1184
|
+
|
|
1115
1185
|
/**
|
|
1116
1186
|
* Graph traversal tail method.
|
|
1117
1187
|
* @param {...Object} args
|
|
@@ -1121,7 +1191,7 @@ class GraphTraversal extends Traversal {
|
|
|
1121
1191
|
this.bytecode.addStep('tail', args);
|
|
1122
1192
|
return this;
|
|
1123
1193
|
}
|
|
1124
|
-
|
|
1194
|
+
|
|
1125
1195
|
/**
|
|
1126
1196
|
* Graph traversal timeLimit method.
|
|
1127
1197
|
* @param {...Object} args
|
|
@@ -1131,7 +1201,7 @@ class GraphTraversal extends Traversal {
|
|
|
1131
1201
|
this.bytecode.addStep('timeLimit', args);
|
|
1132
1202
|
return this;
|
|
1133
1203
|
}
|
|
1134
|
-
|
|
1204
|
+
|
|
1135
1205
|
/**
|
|
1136
1206
|
* Graph traversal times method.
|
|
1137
1207
|
* @param {...Object} args
|
|
@@ -1141,7 +1211,7 @@ class GraphTraversal extends Traversal {
|
|
|
1141
1211
|
this.bytecode.addStep('times', args);
|
|
1142
1212
|
return this;
|
|
1143
1213
|
}
|
|
1144
|
-
|
|
1214
|
+
|
|
1145
1215
|
/**
|
|
1146
1216
|
* Graph traversal to method.
|
|
1147
1217
|
* @param {...Object} args
|
|
@@ -1151,7 +1221,7 @@ class GraphTraversal extends Traversal {
|
|
|
1151
1221
|
this.bytecode.addStep('to', args);
|
|
1152
1222
|
return this;
|
|
1153
1223
|
}
|
|
1154
|
-
|
|
1224
|
+
|
|
1155
1225
|
/**
|
|
1156
1226
|
* Graph traversal toE method.
|
|
1157
1227
|
* @param {...Object} args
|
|
@@ -1161,7 +1231,7 @@ class GraphTraversal extends Traversal {
|
|
|
1161
1231
|
this.bytecode.addStep('toE', args);
|
|
1162
1232
|
return this;
|
|
1163
1233
|
}
|
|
1164
|
-
|
|
1234
|
+
|
|
1165
1235
|
/**
|
|
1166
1236
|
* Graph traversal toV method.
|
|
1167
1237
|
* @param {...Object} args
|
|
@@ -1171,7 +1241,7 @@ class GraphTraversal extends Traversal {
|
|
|
1171
1241
|
this.bytecode.addStep('toV', args);
|
|
1172
1242
|
return this;
|
|
1173
1243
|
}
|
|
1174
|
-
|
|
1244
|
+
|
|
1175
1245
|
/**
|
|
1176
1246
|
* Graph traversal tree method.
|
|
1177
1247
|
* @param {...Object} args
|
|
@@ -1181,7 +1251,7 @@ class GraphTraversal extends Traversal {
|
|
|
1181
1251
|
this.bytecode.addStep('tree', args);
|
|
1182
1252
|
return this;
|
|
1183
1253
|
}
|
|
1184
|
-
|
|
1254
|
+
|
|
1185
1255
|
/**
|
|
1186
1256
|
* Graph traversal unfold method.
|
|
1187
1257
|
* @param {...Object} args
|
|
@@ -1191,7 +1261,7 @@ class GraphTraversal extends Traversal {
|
|
|
1191
1261
|
this.bytecode.addStep('unfold', args);
|
|
1192
1262
|
return this;
|
|
1193
1263
|
}
|
|
1194
|
-
|
|
1264
|
+
|
|
1195
1265
|
/**
|
|
1196
1266
|
* Graph traversal union method.
|
|
1197
1267
|
* @param {...Object} args
|
|
@@ -1201,7 +1271,7 @@ class GraphTraversal extends Traversal {
|
|
|
1201
1271
|
this.bytecode.addStep('union', args);
|
|
1202
1272
|
return this;
|
|
1203
1273
|
}
|
|
1204
|
-
|
|
1274
|
+
|
|
1205
1275
|
/**
|
|
1206
1276
|
* Graph traversal until method.
|
|
1207
1277
|
* @param {...Object} args
|
|
@@ -1211,7 +1281,7 @@ class GraphTraversal extends Traversal {
|
|
|
1211
1281
|
this.bytecode.addStep('until', args);
|
|
1212
1282
|
return this;
|
|
1213
1283
|
}
|
|
1214
|
-
|
|
1284
|
+
|
|
1215
1285
|
/**
|
|
1216
1286
|
* Graph traversal value method.
|
|
1217
1287
|
* @param {...Object} args
|
|
@@ -1221,7 +1291,7 @@ class GraphTraversal extends Traversal {
|
|
|
1221
1291
|
this.bytecode.addStep('value', args);
|
|
1222
1292
|
return this;
|
|
1223
1293
|
}
|
|
1224
|
-
|
|
1294
|
+
|
|
1225
1295
|
/**
|
|
1226
1296
|
* Graph traversal valueMap method.
|
|
1227
1297
|
* @param {...Object} args
|
|
@@ -1231,7 +1301,7 @@ class GraphTraversal extends Traversal {
|
|
|
1231
1301
|
this.bytecode.addStep('valueMap', args);
|
|
1232
1302
|
return this;
|
|
1233
1303
|
}
|
|
1234
|
-
|
|
1304
|
+
|
|
1235
1305
|
/**
|
|
1236
1306
|
* Graph traversal values method.
|
|
1237
1307
|
* @param {...Object} args
|
|
@@ -1241,7 +1311,7 @@ class GraphTraversal extends Traversal {
|
|
|
1241
1311
|
this.bytecode.addStep('values', args);
|
|
1242
1312
|
return this;
|
|
1243
1313
|
}
|
|
1244
|
-
|
|
1314
|
+
|
|
1245
1315
|
/**
|
|
1246
1316
|
* Graph traversal where method.
|
|
1247
1317
|
* @param {...Object} args
|
|
@@ -1251,7 +1321,7 @@ class GraphTraversal extends Traversal {
|
|
|
1251
1321
|
this.bytecode.addStep('where', args);
|
|
1252
1322
|
return this;
|
|
1253
1323
|
}
|
|
1254
|
-
|
|
1324
|
+
|
|
1255
1325
|
/**
|
|
1256
1326
|
* Graph traversal with method.
|
|
1257
1327
|
* @param {...Object} args
|
|
@@ -1261,7 +1331,7 @@ class GraphTraversal extends Traversal {
|
|
|
1261
1331
|
this.bytecode.addStep('with', args);
|
|
1262
1332
|
return this;
|
|
1263
1333
|
}
|
|
1264
|
-
|
|
1334
|
+
|
|
1265
1335
|
/**
|
|
1266
1336
|
* Graph traversal write method.
|
|
1267
1337
|
* @param {...Object} args
|
|
@@ -1271,7 +1341,6 @@ class GraphTraversal extends Traversal {
|
|
|
1271
1341
|
this.bytecode.addStep('write', args);
|
|
1272
1342
|
return this;
|
|
1273
1343
|
}
|
|
1274
|
-
|
|
1275
1344
|
}
|
|
1276
1345
|
|
|
1277
1346
|
function callOnEmptyTraversal(fnName, args) {
|
|
@@ -1373,11 +1442,11 @@ const statics = {
|
|
|
1373
1442
|
value: (...args) => callOnEmptyTraversal('value', args),
|
|
1374
1443
|
valueMap: (...args) => callOnEmptyTraversal('valueMap', args),
|
|
1375
1444
|
values: (...args) => callOnEmptyTraversal('values', args),
|
|
1376
|
-
where: (...args) => callOnEmptyTraversal('where', args)
|
|
1445
|
+
where: (...args) => callOnEmptyTraversal('where', args),
|
|
1377
1446
|
};
|
|
1378
1447
|
|
|
1379
1448
|
module.exports = {
|
|
1380
1449
|
GraphTraversal,
|
|
1381
1450
|
GraphTraversalSource,
|
|
1382
|
-
statics
|
|
1383
|
-
};
|
|
1451
|
+
statics,
|
|
1452
|
+
};
|