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 2015/06/16 00:08:07 UTC
[06/31] incubator-tinkerpop git commit: ArrayList already hashCode()s
based on elements internal.
ArrayList already hashCode()s based on elements internal.
Project: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/repo
Commit: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/commit/5d351f91
Tree: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/tree/5d351f91
Diff: http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/diff/5d351f91
Branch: refs/heads/master
Commit: 5d351f9186831131774d6ddd7cdc4d0eb1e8e958
Parents: 15e3f77
Author: Marko A. Rodriguez <ok...@gmail.com>
Authored: Thu Jun 11 14:24:14 2015 -0600
Committer: Marko A. Rodriguez <ok...@gmail.com>
Committed: Thu Jun 11 14:24:14 2015 -0600
----------------------------------------------------------------------
.../process/traversal/step/filter/exp/XMatchStep.java | 8 ++------
1 file changed, 2 insertions(+), 6 deletions(-)
----------------------------------------------------------------------
http://git-wip-us.apache.org/repos/asf/incubator-tinkerpop/blob/5d351f91/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/filter/exp/XMatchStep.java
----------------------------------------------------------------------
diff --git a/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/filter/exp/XMatchStep.java b/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/filter/exp/XMatchStep.java
index a67928b..5524ee0 100644
--- a/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/filter/exp/XMatchStep.java
+++ b/gremlin-core/src/main/java/org/apache/tinkerpop/gremlin/process/traversal/step/filter/exp/XMatchStep.java
@@ -107,7 +107,7 @@ public final class XMatchStep<S> extends ComputerAwareStep<S, S> implements Trav
public XMatchStep<S> clone() {
final XMatchStep<S> clone = (XMatchStep<S>) super.clone();
clone.andTraversals = new ArrayList<>();
- for (final Traversal.Admin<Object,Object> traversal : this.andTraversals) {
+ for (final Traversal.Admin<Object, Object> traversal : this.andTraversals) {
clone.andTraversals.add(clone.integrateChild(traversal.clone()));
}
return clone;
@@ -157,11 +157,7 @@ public final class XMatchStep<S> extends ComputerAwareStep<S, S> implements Trav
@Override
public int hashCode() {
- int result = super.hashCode();
- for(final Traversal.Admin<Object,Object> andTraversal : this.andTraversals) {
- result ^= andTraversal.hashCode();
- }
- return result;
+ return super.hashCode() ^ this.andTraversals.hashCode();
}
@Override