Revert "Use a smart allocator for allocating memory for large 'long' lived"

1 files changed, 0 insertions, 14 deletions

diff --git a/vespalib/src/tests/stllike/hash_test.cpp b/vespalib/src/tests/stllike/hash_test.cpp
index e86a9ad020a..d23c2c6b68c 100644
--- a/vespalib/src/tests/stllike/hash_test.cpp
+++ b/vespalib/src/tests/stllike/hash_test.cpp
@@ -4,7 +4,6 @@
 #include <vespa/vespalib/stllike/hash_set.hpp>
 #include <vespa/vespalib/stllike/hash_map.hpp>
 #include <vespa/vespalib/stllike/hash_map_equal.hpp>
-#include <vespa/vespalib/stllike/allocator.h>
 #include <cstddef>
 #include <algorithm>
 
@@ -554,17 +553,4 @@ TEST("test that begin and end are identical with empty hashtables") {
     EXPECT_TRUE(empty_but_reserved.begin() == empty_but_reserved.end());
 }
 
-TEST ("test that large_allocator works fine with std::vector") {
-    using V = std::vector<uint64_t, allocator_large<uint64_t>>;
-    V a;
-    a.push_back(1);
-    a.reserve(14);
-    for (size_t i(0); i < 400000; i++) {
-        a.push_back(i);
-    }
-    V b = std::move(a);
-    V c = b;
-    ASSERT_EQUAL(b.size(), c.size());
-}
-
 TEST_MAIN() { TEST_RUN_ALL(); }