From 8033f6ca38e5a66995bf90beb1cbaff810298db4 Mon Sep 17 00:00:00 2001
From: Peizhao Ou <peizhaoo@uci.edu>
Date: Thu, 1 Feb 2018 11:30:48 -0800
Subject: [PATCH 1/1] Refactors test case driver

---
 ...{grampa_driver.cpp => junction_driver.cpp} |  0
 test/linear_driver.cpp                        | 65 -------------------
 2 files changed, 65 deletions(-)
 rename test/{grampa_driver.cpp => junction_driver.cpp} (100%)
 delete mode 100755 test/linear_driver.cpp

diff --git a/test/grampa_driver.cpp b/test/junction_driver.cpp
similarity index 100%
rename from test/grampa_driver.cpp
rename to test/junction_driver.cpp
diff --git a/test/linear_driver.cpp b/test/linear_driver.cpp
deleted file mode 100755
index 3f8dab7..0000000
--- a/test/linear_driver.cpp
+++ /dev/null
@@ -1,65 +0,0 @@
-#include <junction/ConcurrentMap_Linear.h>
-#include <iostream>
-#include <memory>
-#include <chrono>
-#include <cassert>
-
-namespace {
-
-const size_t kMapSize = 10000;
-const size_t kPassCount = 1;
-const unsigned s_nInsertPercentage = 10;
-const char* kTestName = "InsDelFind";
-const char* kBenchmarkName = "JunctionMapLinear";
-
-} // namespace
-
-typedef junction::ConcurrentMap_Linear<turf::u64, turf::u64> Map;
-
-int main() {
-    auto start_time = std::chrono::system_clock::now();
-
-    size_t nInsertedNum = 0;
-    size_t nFindSuccess = 0;
-    std::unique_ptr<Map> map(new Map(kMapSize / 8));
-    for (size_t count = 0; count < kPassCount; count++) {
-        for (size_t i = 1; i <= kMapSize; ++i) {
-            // The number to operate on the map.
-            size_t n = i;
-            // Insert
-            if (i % s_nInsertPercentage == 1) {
-                auto iter = map->insertOrFind(n);
-                if (!iter.getValue()) {
-                  iter.assignValue(n + 1);
-                  nInsertedNum++;
-                  std::cout << "Inserted\n";
-                }
-            }
-            // Find
-            {
-                auto iter = map->find(n);
-                if (!iter.getValue()) {
-                    ++nFindSuccess;
-                    std::cout << "Found\n";
-                }
-            }
-            // Delete
-            if (i % s_nInsertPercentage == 1) {
-                auto iter = map->find(n);
-                if (iter.getValue()) {
-                    iter.eraseValue();
-                    std::cout << "Erased\n";
-                }
-            }
-        }
-    }
-    assert(nFindSuccess == nFindSuccess && "junction::ConcurrentMap_Linear ERROR");
-
-    auto finish_time = std::chrono::system_clock::now();
-    auto dur = finish_time - start_time;
-    auto milisecs = std::chrono::duration_cast<std::chrono::milliseconds>(dur);
-    std::cout << "[       OK ] " << kTestName << "." << kBenchmarkName << "("
-              << milisecs.count() << " ms)\n";
-
-    return 0;
-}
-- 
2.34.1