[geode] 01/03: Clean up unused code

[ri...@apache.org]

This is an automated email from the ASF dual-hosted git repository.

ringles pushed a commit to branch GEODE-9375-Implement-ZRANGE-Radish-command
in repository https://gitbox.apache.org/repos/asf/geode.git

commit 8a0f35fc9e9fee8994c3131ccde6e52923a44a18
Author: Ray Ingles <ri...@vmware.com>
AuthorDate: Thu Jul 1 10:44:43 2021 -0400

    Clean up unused code
---
 .../internal/collections/OrderStatisticsTree.java  | 33 ----------------------
 1 file changed, 33 deletions(-)

diff --git a/geode-apis-compatible-with-redis/src/main/java/org/apache/geode/redis/internal/collections/OrderStatisticsTree.java b/geode-apis-compatible-with-redis/src/main/java/org/apache/geode/redis/internal/collections/OrderStatisticsTree.java
index b619136..3be9e7d 100644
--- a/geode-apis-compatible-with-redis/src/main/java/org/apache/geode/redis/internal/collections/OrderStatisticsTree.java
+++ b/geode-apis-compatible-with-redis/src/main/java/org/apache/geode/redis/internal/collections/OrderStatisticsTree.java
@@ -215,11 +215,6 @@ public class OrderStatisticsTree<E extends Comparable<? super E>>
     return entryList;
   }
 
-  public Iterator<E> iterator(int index) {
-    Node<E> node = getNode(index);
-    return new TreeIterator(node);
-  }
-
   private Node<E> getNode(int index) {
     checkIndex(index);
     Node<E> node = root;
@@ -236,26 +231,6 @@ public class OrderStatisticsTree<E extends Comparable<? super E>>
     }
   }
 
-  private Node<E> findMinNode(E o) {
-    Node<E> x = root;
-    int cmp;
-
-    while ((cmp = o.compareTo(x.key)) != 0) {
-      if (cmp < 0) {
-        if (x.left == null) {
-          break;
-        }
-        x = x.left;
-      } else {
-        if (x.right == null) {
-          break;
-        }
-        x = x.right;
-      }
-    }
-    return x;
-  }
-
   @Override
   @SuppressWarnings("unchecked")
   public boolean contains(Object o) {
@@ -776,14 +751,6 @@ public class OrderStatisticsTree<E extends Comparable<? super E>>
       }
     }
 
-    public TreeIterator(Node<E> node) {
-      if (root == null) {
-        nextNode = null;
-      } else {
-        nextNode = node;
-      }
-    }
-
     @Override
     public boolean hasNext() {
       return nextNode != null;