Move test into test/std subdirectory.

llvm-svn: 224658

1 files changed, 0 insertions, 181 deletions

diff --git a/libcxx/test/containers/associative/set/erase_iter.pass.cpp b/libcxx/test/containers/associative/set/erase_iter.pass.cpp
deleted file mode 100644
index 21666c36401..00000000000
--- a/libcxx/test/containers/associative/set/erase_iter.pass.cpp
+++ /dev/null
@@ -1,181 +0,0 @@
-//===----------------------------------------------------------------------===//
-//
-//                     The LLVM Compiler Infrastructure
-//
-// This file is dual licensed under the MIT and the University of Illinois Open
-// Source Licenses. See LICENSE.TXT for details.
-//
-//===----------------------------------------------------------------------===//
-
-// <set>
-
-// class set
-
-// iterator erase(const_iterator position);
-
-#include <set>
-#include <cassert>
-
-#include "min_allocator.h"
-
-int main()
-{
-    {
-        typedef std::set<int> M;
-        typedef int V;
-        typedef M::iterator I;
-        V ar[] =
-        {
-            1,
-            2,
-            3,
-            4,
-            5,
-            6,
-            7,
-            8
-        };
-        M m(ar, ar + sizeof(ar)/sizeof(ar[0]));
-        assert(m.size() == 8);
-        I i = m.erase(next(m.cbegin(), 3));
-        assert(m.size() == 7);
-        assert(i == next(m.begin(), 3));
-        assert(*next(m.begin(), 0) == 1);
-        assert(*next(m.begin(), 1) == 2);
-        assert(*next(m.begin(), 2) == 3);
-        assert(*next(m.begin(), 3) == 5);
-        assert(*next(m.begin(), 4) == 6);
-        assert(*next(m.begin(), 5) == 7);
-        assert(*next(m.begin(), 6) == 8);
-
-        i = m.erase(next(m.cbegin(), 0));
-        assert(m.size() == 6);
-        assert(i == m.begin());
-        assert(*next(m.begin(), 0) == 2);
-        assert(*next(m.begin(), 1) == 3);
-        assert(*next(m.begin(), 2) == 5);
-        assert(*next(m.begin(), 3) == 6);
-        assert(*next(m.begin(), 4) == 7);
-        assert(*next(m.begin(), 5) == 8);
-
-        i = m.erase(next(m.cbegin(), 5));
-        assert(m.size() == 5);
-        assert(i == m.end());
-        assert(*next(m.begin(), 0) == 2);
-        assert(*next(m.begin(), 1) == 3);
-        assert(*next(m.begin(), 2) == 5);
-        assert(*next(m.begin(), 3) == 6);
-        assert(*next(m.begin(), 4) == 7);
-
-        i = m.erase(next(m.cbegin(), 1));
-        assert(m.size() == 4);
-        assert(i == next(m.begin()));
-        assert(*next(m.begin(), 0) == 2);
-        assert(*next(m.begin(), 1) == 5);
-        assert(*next(m.begin(), 2) == 6);
-        assert(*next(m.begin(), 3) == 7);
-
-        i = m.erase(next(m.cbegin(), 2));
-        assert(m.size() == 3);
-        assert(i == next(m.begin(), 2));
-        assert(*next(m.begin(), 0) == 2);
-        assert(*next(m.begin(), 1) == 5);
-        assert(*next(m.begin(), 2) == 7);
-
-        i = m.erase(next(m.cbegin(), 2));
-        assert(m.size() == 2);
-        assert(i == next(m.begin(), 2));
-        assert(*next(m.begin(), 0) == 2);
-        assert(*next(m.begin(), 1) == 5);
-
-        i = m.erase(next(m.cbegin(), 0));
-        assert(m.size() == 1);
-        assert(i == next(m.begin(), 0));
-        assert(*next(m.begin(), 0) == 5);
-
-        i = m.erase(m.cbegin());
-        assert(m.size() == 0);
-        assert(i == m.begin());
-        assert(i == m.end());
-    }
-#if __cplusplus >= 201103L
-    {
-        typedef std::set<int, std::less<int>, min_allocator<int>> M;
-        typedef int V;
-        typedef M::iterator I;
-        V ar[] =
-        {
-            1,
-            2,
-            3,
-            4,
-            5,
-            6,
-            7,
-            8
-        };
-        M m(ar, ar + sizeof(ar)/sizeof(ar[0]));
-        assert(m.size() == 8);
-        I i = m.erase(next(m.cbegin(), 3));
-        assert(m.size() == 7);
-        assert(i == next(m.begin(), 3));
-        assert(*next(m.begin(), 0) == 1);
-        assert(*next(m.begin(), 1) == 2);
-        assert(*next(m.begin(), 2) == 3);
-        assert(*next(m.begin(), 3) == 5);
-        assert(*next(m.begin(), 4) == 6);
-        assert(*next(m.begin(), 5) == 7);
-        assert(*next(m.begin(), 6) == 8);
-
-        i = m.erase(next(m.cbegin(), 0));
-        assert(m.size() == 6);
-        assert(i == m.begin());
-        assert(*next(m.begin(), 0) == 2);
-        assert(*next(m.begin(), 1) == 3);
-        assert(*next(m.begin(), 2) == 5);
-        assert(*next(m.begin(), 3) == 6);
-        assert(*next(m.begin(), 4) == 7);
-        assert(*next(m.begin(), 5) == 8);
-
-        i = m.erase(next(m.cbegin(), 5));
-        assert(m.size() == 5);
-        assert(i == m.end());
-        assert(*next(m.begin(), 0) == 2);
-        assert(*next(m.begin(), 1) == 3);
-        assert(*next(m.begin(), 2) == 5);
-        assert(*next(m.begin(), 3) == 6);
-        assert(*next(m.begin(), 4) == 7);
-
-        i = m.erase(next(m.cbegin(), 1));
-        assert(m.size() == 4);
-        assert(i == next(m.begin()));
-        assert(*next(m.begin(), 0) == 2);
-        assert(*next(m.begin(), 1) == 5);
-        assert(*next(m.begin(), 2) == 6);
-        assert(*next(m.begin(), 3) == 7);
-
-        i = m.erase(next(m.cbegin(), 2));
-        assert(m.size() == 3);
-        assert(i == next(m.begin(), 2));
-        assert(*next(m.begin(), 0) == 2);
-        assert(*next(m.begin(), 1) == 5);
-        assert(*next(m.begin(), 2) == 7);
-
-        i = m.erase(next(m.cbegin(), 2));
-        assert(m.size() == 2);
-        assert(i == next(m.begin(), 2));
-        assert(*next(m.begin(), 0) == 2);
-        assert(*next(m.begin(), 1) == 5);
-
-        i = m.erase(next(m.cbegin(), 0));
-        assert(m.size() == 1);
-        assert(i == next(m.begin(), 0));
-        assert(*next(m.begin(), 0) == 5);
-
-        i = m.erase(m.cbegin());
-        assert(m.size() == 0);
-        assert(i == m.begin());
-        assert(i == m.end());
-    }
-#endif
-}