From d51f317538c8c9b2a0bb19416affb8962651cff0 Mon Sep 17 00:00:00 2001
From: Kefu Chai <kchai@redhat.com>
Date: Fri, 19 Jul 2019 14:00:54 +0800
Subject: [PATCH] test/old/testtree.cc: remove test for BinaryTree

BinaryTree.h was removed in c1865445c5b88cae2df499e4d2047af156225177

Signed-off-by: Kefu Chai <kchai@redhat.com>
---
 src/test/old/testtree.cc | 46 ----------------------------------------
 1 file changed, 46 deletions(-)
 delete mode 100644 src/test/old/testtree.cc

diff --git a/src/test/old/testtree.cc b/src/test/old/testtree.cc
deleted file mode 100644
index 2c21bcbe52e..00000000000
--- a/src/test/old/testtree.cc
+++ /dev/null
@@ -1,46 +0,0 @@
-
-
-#include "../crush/BinaryTree.h"
-using namespace crush;
-
-#include <iostream>
-#include <vector>
-using namespace std;
-
-int main() 
-{
-  BinaryTree t;
-
-  vector<int> nodes;
-
-  for (int i=0; i<30; i++) {
-    cout << "adding " << i << endl;
-    int n = t.add_node(1);
-    nodes.push_back(n);
-    //cout << t << endl;
-  }
-  cout << t << endl;
-
-  for (int k=0; k<10000; k++) {
-    if (rand() % 2) {
-      cout << "adding" << endl;
-      nodes.push_back( t.add_node(1) );
-    } else {
-      if (!nodes.empty()) {
-        //for (int i=0; i<nodes.size(); i++) {
-        int p = rand() % nodes.size();
-        int n = nodes[p];
-        assert (t.exists(n));
-        cout << "removing " << n << endl;
-        t.remove_node(n);
-        
-        for (int j=p; j<nodes.size(); j++)
-          nodes[j] = nodes[j+1];
-        nodes.pop_back();
-      }
-    }
-    cout << t << endl;
-  }
-
-
-}
-- 
2.39.5