1 files changed, 0 insertions, 77 deletions
diff --git a/libcxx/test/containers/associative/map/map.modifiers/insert_iter_iter.pass.cpp b/libcxx/test/containers/associative/map/map.modifiers/insert_iter_iter.pass.cpp
deleted file mode 100644
index 964738b4a68..00000000000
--- a/libcxx/test/containers/associative/map/map.modifiers/insert_iter_iter.pass.cpp
+++ /dev/null
@@ -1,77 +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.
-//
-//===----------------------------------------------------------------------===//
-
-// <map>
-
-// class map
-
-// template <class InputIterator>
-//   void insert(InputIterator first, InputIterator last);
-
-#include <map>
-#include <cassert>
-
-#include "test_iterators.h"
-#include "min_allocator.h"
-
-int main()
-{
-    {
-        typedef std::map<int, double> M;
-        typedef std::pair<int, double> P;
-        P ar[] =
-        {
-            P(1, 1),
-            P(1, 1.5),
-            P(1, 2),
-            P(2, 1),
-            P(2, 1.5),
-            P(2, 2),
-            P(3, 1),
-            P(3, 1.5),
-            P(3, 2),
-        };
-        M m;
-        m.insert(input_iterator<P*>(ar), input_iterator<P*>(ar + sizeof(ar)/sizeof(ar[0])));
-        assert(m.size() == 3);
-        assert(m.begin()->first == 1);
-        assert(m.begin()->second == 1);
-        assert(next(m.begin())->first == 2);
-        assert(next(m.begin())->second == 1);
-        assert(next(m.begin(), 2)->first == 3);
-        assert(next(m.begin(), 2)->second == 1);
-    }
-#if __cplusplus >= 201103L
-    {
-        typedef std::map<int, double, std::less<int>, min_allocator<std::pair<const int, double>>> M;
-        typedef std::pair<int, double> P;
-        P ar[] =
-        {
-            P(1, 1),
-            P(1, 1.5),
-            P(1, 2),
-            P(2, 1),
-            P(2, 1.5),
-            P(2, 2),
-            P(3, 1),
-            P(3, 1.5),
-            P(3, 2),
-        };
-        M m;
-        m.insert(input_iterator<P*>(ar), input_iterator<P*>(ar + sizeof(ar)/sizeof(ar[0])));
-        assert(m.size() == 3);
-        assert(m.begin()->first == 1);
-        assert(m.begin()->second == 1);
-        assert(next(m.begin())->first == 2);
-        assert(next(m.begin())->second == 1);
-        assert(next(m.begin(), 2)->first == 3);
-        assert(next(m.begin(), 2)->second == 1);
-    }
-#endif
-}