cassandra-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From dbros...@apache.org
Subject cassandra git commit: remove dead field
Date Thu, 30 Apr 2015 02:39:55 GMT
Repository: cassandra
Updated Branches:
  refs/heads/trunk 3c09adec7 -> 16a7fcfb7


remove dead field


Project: http://git-wip-us.apache.org/repos/asf/cassandra/repo
Commit: http://git-wip-us.apache.org/repos/asf/cassandra/commit/16a7fcfb
Tree: http://git-wip-us.apache.org/repos/asf/cassandra/tree/16a7fcfb
Diff: http://git-wip-us.apache.org/repos/asf/cassandra/diff/16a7fcfb

Branch: refs/heads/trunk
Commit: 16a7fcfb78556b23bf8b9b6dae5bb9a6756b83c9
Parents: 3c09ade
Author: Dave Brosius <dbrosius@mebigfatguy.com>
Authored: Wed Apr 29 22:39:39 2015 -0400
Committer: Dave Brosius <dbrosius@mebigfatguy.com>
Committed: Wed Apr 29 22:39:39 2015 -0400

----------------------------------------------------------------------
 src/java/org/apache/cassandra/utils/OverlapIterator.java | 6 +-----
 1 file changed, 1 insertion(+), 5 deletions(-)
----------------------------------------------------------------------


http://git-wip-us.apache.org/repos/asf/cassandra/blob/16a7fcfb/src/java/org/apache/cassandra/utils/OverlapIterator.java
----------------------------------------------------------------------
diff --git a/src/java/org/apache/cassandra/utils/OverlapIterator.java b/src/java/org/apache/cassandra/utils/OverlapIterator.java
index bc43742..131a749 100644
--- a/src/java/org/apache/cassandra/utils/OverlapIterator.java
+++ b/src/java/org/apache/cassandra/utils/OverlapIterator.java
@@ -2,8 +2,6 @@ package org.apache.cassandra.utils;
 
 import java.util.*;
 
-import org.apache.cassandra.utils.AsymmetricOrdering.Op;
-
 /**
  * A class for iterating sequentially through an ordered collection and efficiently
  * finding the overlapping set of matching intervals.
@@ -24,8 +22,6 @@ public class OverlapIterator<I extends Comparable<? super I>, V>
     final Set<V> overlaps = new HashSet<>();
     final Set<V> accessible = Collections.unmodifiableSet(overlaps);
 
-    I mostRecent;
-
     public OverlapIterator(Collection<Interval<I, V>> intervals)
     {
         sortedByMax = new ArrayList<>(intervals);
@@ -42,7 +38,7 @@ public class OverlapIterator<I extends Comparable<? super I>, V>
     public void update(I point)
     {
         // we don't use binary search here since we expect points to be a superset of the
min/max values
-        mostRecent = point;
+
         // add those we are now after the start of
         while (nextToInclude < sortedByMin.size() && sortedByMin.get(nextToInclude).min.compareTo(point)
<= 0)
             overlaps.add(sortedByMin.get(nextToInclude++).data);


Mime
View raw message