You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@tinkerpop.apache.org by ok...@apache.org on 2016/03/31 22:53:17 UTC
[09/11] incubator-tinkerpop git commit: reduce the key counter for
OLTP to 1000. still faster than groupV3d0.
reduce the key counter for OLTP to 1000. still faster than groupV3d0.
Project: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/repo
Commit: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/commit/4b0784c5
Tree: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/tree/4b0784c5
Diff: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/diff/4b0784c5
Branch: refs/heads/master
Commit: 4b0784c5111c03a205b7fe622b279917bf24812f
Parents: 4655180
Author: Marko A. Rodriguez <ok...@gmail.com>
Authored: Wed Mar 30 14:39:54 2016 -0600
Committer: Marko A. Rodriguez <ok...@gmail.com>
Committed: Thu Mar 31 12:52:07 2016 -0600
----------------------------------------------------------------------
.../tinkerpop/gremlin/process/traversal/step/map/GroupStep.java | 3 +--
1 file changed, 1 insertion(+), 2 deletions(-)
----------------------------------------------------------------------
http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/blob/4b0784c5/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/map/GroupStep.java
----------------------------------------------------------------------
diff --git a/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/map/GroupStep.java b/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/map/GroupStep.java
index e1cfe4f..a8cf550 100644
--- a/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/map/GroupStep.java
+++ b/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/map/GroupStep.java
@@ -227,8 +227,7 @@ public final class GroupStep<S, K, V> extends ReducingBarrierStep<S, Map<K, V>>
mapA.put(key, (V) valueTraversalClone);
}
valueTraversalClone.addStart(traverser);
- final int count = this.counters.compute(key, (k, i) -> ++i);
- if (count > 10000) {
+ if (this.counters.compute(key, (k, i) -> ++i) > 1000) {
this.counters.put(key, 0);
TraversalHelper.getFirstStepOfAssignableClass(Barrier.class, valueTraversalClone).ifPresent(Barrier::processAllStarts);
}