Repository: cassandra Updated Branches: refs/heads/trunk c0fc8d823 -> 7ea642c89
remove dead code Project: http://git-wip-us.apache.org/repos/asf/cassandra/repo Commit: http://git-wip-us.apache.org/repos/asf/cassandra/commit/7ea642c8 Tree: http://git-wip-us.apache.org/repos/asf/cassandra/tree/7ea642c8 Diff: http://git-wip-us.apache.org/repos/asf/cassandra/diff/7ea642c8 Branch: refs/heads/trunk Commit: 7ea642c89c124f0515754ceb8a163370e8d74578 Parents: c0fc8d8 Author: Dave Brosius <dbros...@mebigfatguy.com> Authored: Sun Mar 29 20:35:24 2015 -0400 Committer: Dave Brosius <dbros...@mebigfatguy.com> Committed: Sun Mar 29 20:35:24 2015 -0400 ---------------------------------------------------------------------- src/java/org/apache/cassandra/utils/IntervalTree.java | 9 --------- 1 file changed, 9 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/cassandra/blob/7ea642c8/src/java/org/apache/cassandra/utils/IntervalTree.java ---------------------------------------------------------------------- diff --git a/src/java/org/apache/cassandra/utils/IntervalTree.java b/src/java/org/apache/cassandra/utils/IntervalTree.java index 0c3c611..4522e27 100644 --- a/src/java/org/apache/cassandra/utils/IntervalTree.java +++ b/src/java/org/apache/cassandra/utils/IntervalTree.java @@ -47,19 +47,10 @@ public class IntervalTree<C extends Comparable<? super C>, D, I extends Interval protected IntervalTree(Collection<I> intervals) { - final IntervalTree it = this; this.head = intervals == null || intervals.isEmpty() ? null : new IntervalNode(intervals); this.count = intervals == null ? 0 : intervals.size(); } - public static <C extends Comparable<? super C>, D, I extends Interval<C, D>> IntervalTree<C, D, I> build(Collection<I> intervals, Comparator<C> comparator) - { - if (intervals == null || intervals.isEmpty()) - return emptyTree(); - - return new IntervalTree<C, D, I>(intervals); - } - public static <C extends Comparable<? super C>, D, I extends Interval<C, D>> IntervalTree<C, D, I> build(Collection<I> intervals) { if (intervals == null || intervals.isEmpty())
