1 files changed, 0 insertions, 139 deletions
diff --git a/libcxx/test/containers/sequences/deque/deque.modifiers/insert_value.pass.cpp b/libcxx/test/containers/sequences/deque/deque.modifiers/insert_value.pass.cpp
deleted file mode 100644
index 97827c1183a..00000000000
--- a/libcxx/test/containers/sequences/deque/deque.modifiers/insert_value.pass.cpp
+++ /dev/null
@@ -1,139 +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.
-//
-//===----------------------------------------------------------------------===//
-
-// <deque>
-
-// iterator insert (const_iterator p, const value_type& v);
-
-#include <deque>
-#include <cassert>
-
-#include "min_allocator.h"
-
-template <class C>
-C
-make(int size, int start = 0 )
-{
-    const int b = 4096 / sizeof(int);
-    int init = 0;
-    if (start > 0)
-    {
-        init = (start+1) / b + ((start+1) % b != 0);
-        init *= b;
-        --init;
-    }
-    C c(init, 0);
-    for (int i = 0; i < init-start; ++i)
-        c.pop_back();
-    for (int i = 0; i < size; ++i)
-        c.push_back(i);
-    for (int i = 0; i < start; ++i)
-        c.pop_front();
-    return c;
-};
-
-template <class C>
-void
-test(int P, C& c1, int x)
-{
-    typedef typename C::iterator I;
-    typedef typename C::const_iterator CI;
-    std::size_t c1_osize = c1.size();
-    CI i = c1.insert(c1.begin() + P, x);
-    assert(i == c1.begin() + P);
-    assert(c1.size() == c1_osize + 1);
-    assert(distance(c1.begin(), c1.end()) == c1.size());
-    i = c1.begin();
-    for (int j = 0; j < P; ++j, ++i)
-        assert(*i == j);
-    assert(*i == x);
-    ++i;
-    for (int j = P; j < c1_osize; ++j, ++i)
-        assert(*i == j);
-}
-
-template <class C>
-void
-testN(int start, int N)
-{
-    typedef typename C::iterator I;
-    typedef typename C::const_iterator CI;
-    for (int i = 0; i <= 3; ++i)
-    {
-        if (0 <= i && i <= N)
-        {
-            C c1 = make<C>(N, start);
-            test(i, c1, -10);
-        }
-    }
-    for (int i = N/2-1; i <= N/2+1; ++i)
-    {
-        if (0 <= i && i <= N)
-        {
-            C c1 = make<C>(N, start);
-            test(i, c1, -10);
-        }
-    }
-    for (int i = N - 3; i <= N; ++i)
-    {
-        if (0 <= i && i <= N)
-        {
-            C c1 = make<C>(N, start);
-            test(i, c1, -10);
-        }
-    }
-}
-
-template <class C>
-void
-self_reference_test()
-{
-    typedef typename C::const_iterator CI;
-    for (int i = 0; i < 20; ++i)
-    {
-        for (int j = 0; j < 20; ++j)
-        {
-            C c = make<C>(20);
-            CI it = c.cbegin() + i;
-            CI jt = c.cbegin() + j;
-            c.insert(it, *jt);
-            assert(c.size() == 21);
-            assert(distance(c.begin(), c.end()) == c.size());
-            it = c.cbegin();
-            for (int k = 0; k < i; ++k, ++it)
-                assert(*it == k);
-            assert(*it == j);
-            ++it;
-            for (int k = i; k < 20; ++k, ++it)
-                assert(*it == k);
-        }
-    }
-}
-
-int main()
-{
-    {
-    int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
-    const int N = sizeof(rng)/sizeof(rng[0]);
-    for (int i = 0; i < N; ++i)
-        for (int j = 0; j < N; ++j)
-            testN<std::deque<int> >(rng[i], rng[j]);
-    self_reference_test<std::deque<int> >();
-    }
-#if __cplusplus >= 201103L
-    {
-    int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
-    const int N = sizeof(rng)/sizeof(rng[0]);
-    for (int i = 0; i < N; ++i)
-        for (int j = 0; j < N; ++j)
-            testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j]);
-    self_reference_test<std::deque<int, min_allocator<int>> >();
-    }
-#endif
-}