Skip to content
This repository was archived by the owner on Mar 4, 2025. It is now read-only.

Commit ede5d61

Browse files
committed
benchmarks update
1 parent 0c92868 commit ede5d61

2 files changed

Lines changed: 0 additions & 39 deletions

File tree

src/benchmark/Neo4jBenchmark.java

Lines changed: 0 additions & 23 deletions
Original file line numberDiff line numberDiff line change
@@ -292,13 +292,8 @@ public static void benchmarkReachabilities(String relType, int nodeNumber, int w
292292
}
293293

294294
List<Tuple<Integer, Integer>> chunkSize = Arrays.asList(
295-
<<<<<<< HEAD
296-
new Tuple<>(nodeNumber, 100)
297-
//new Tuple<>(1, 100)
298-
=======
299295
// new Tuple<>(nodeNumber, 100)
300296
new Tuple<>(1, 100)
301-
>>>>>>> 877f37c6d008c2ac2a75f8b509d9cfd86626bf93
302297
//, new Tuple<>(10, 20)
303298
//, new Tuple<>(50, 30)
304299
//, new Tuple<>(100, 50)
@@ -321,7 +316,6 @@ public static void benchmarkReachabilities(String relType, int nodeNumber, int w
321316
int finalIter = iter;
322317
verticesPartitioned.forEach(chunk -> {
323318
GraphInput input = new Neo4jBenchmarkInput(graphDb, f, chunk.stream(), nodeNumber);
324-
<<<<<<< HEAD
325319
//System.out.println("iteration: " + finalIter + " first vertex: " + chunk);
326320
long result = 0;
327321
long t1_local = System.nanoTime();
@@ -341,23 +335,6 @@ public static void benchmarkReachabilities(String relType, int nodeNumber, int w
341335
// resulTimePerChunk.println(chunk.get(0) + "," + stepTime);
342336
//}
343337
((Neo4jBenchmarkInput) input).close();
344-
=======
345-
long result = 0;
346-
// if (chunk.get(0) == 14013) {
347-
System.out.println("iteration: " + finalIter + " first vertex: " + chunk.get(0));
348-
long t1_local = System.nanoTime();
349-
Stream<Pair> parseResults = parser.getReachabilities(input,
350-
new ParseOptions.Builder().setAmbiguous(false).build());
351-
if (parseResults != null) {
352-
result = parseResults.count();
353-
}
354-
long t2_local = System.nanoTime();
355-
long stepTime = t2_local - t1_local;
356-
if (finalIter >= warmUp) {
357-
resulTimePerChunk.print("," + stepTime);
358-
}
359-
// if (stepTime > 1000000000) {
360-
>>>>>>> 877f37c6d008c2ac2a75f8b509d9cfd86626bf93
361338

362339
System.out.println(" time: " + stepTime + "\n" + "ans:" + result);
363340
// }

src/org/iguana/gss/DefaultGSSNode.java

Lines changed: 0 additions & 16 deletions
Original file line numberDiff line numberDiff line change
@@ -193,24 +193,14 @@ private T addPoppedElements(EndGrammarSlot slot, T child, Object value, ResultOp
193193

194194
private void processPoppedElement(T poppedElement, GSSEdge<T> edge, BodyGrammarSlot returnSlot,
195195
GSSNode<T> destination, Input input, Environment env, IguanaRuntime<T> runtime) {
196-
<<<<<<< HEAD
197196
//boolean anyMatchTestFollow = input.nextSymbols(poppedElement.getIndex())
198197
// .anyMatch(returnSlot::testFollow);
199198
//if (anyMatchTestFollow) {
200-
=======
201-
// boolean anyMatchTestFollow = input.nextSymbols(poppedElement.getIndex())
202-
// .anyMatch(returnSlot::testFollow);
203-
// if (anyMatchTestFollow) {
204-
>>>>>>> 877f37c6d008c2ac2a75f8b509d9cfd86626bf93
205199
T result = addDescriptor(input, this, poppedElement, edge, returnSlot, runtime);
206200
if (result != null) {
207201
runtime.scheduleDescriptor(returnSlot, destination, result, env);
208202
}
209-
<<<<<<< HEAD
210203
//}
211-
=======
212-
// }
213-
>>>>>>> 877f37c6d008c2ac2a75f8b509d9cfd86626bf93
214204
}
215205

216206
private void iterateOverEdges(Input input, T result, IguanaRuntime<T> runtime) {
@@ -231,15 +221,9 @@ private void iterateOverEdges(Input input, T result, IguanaRuntime<T> runtime) {
231221
}
232222

233223
private void processEdge(Input input, T node, GSSEdge<T> edge, BodyGrammarSlot returnSlot, IguanaRuntime<T> runtime) {
234-
<<<<<<< HEAD
235224
//boolean anyMatchTestFollow = input.nextSymbols(node.getIndex())
236225
// .anyMatch(returnSlot::testFollow);
237226
//if (!anyMatchTestFollow) return;
238-
=======
239-
// boolean anyMatchTestFollow = input.nextSymbols(node.getIndex())
240-
// .anyMatch(returnSlot::testFollow);
241-
// if (!anyMatchTestFollow) return;
242-
>>>>>>> 877f37c6d008c2ac2a75f8b509d9cfd86626bf93
243227

244228
T result = addDescriptor(input, this, node, edge, returnSlot, runtime);
245229
if (result != null) {

0 commit comments

Comments
 (0)