Index: test/containers/associative/multiset/iterator.pass.cpp
===================================================================
--- test/containers/associative/multiset/iterator.pass.cpp	(revision 187794)
+++ test/containers/associative/multiset/iterator.pass.cpp	(working copy)
@@ -195,4 +195,23 @@
                 assert(*i == j);
     }
 #endif
+#if _LIBCPP_STD_VER > 11
+    { // N3664 testing
+    	typedef std::multiset<int> C;
+        C::iterator ii1{}, ii2{};
+        C::iterator ii4 = ii1;
+        C::const_iterator cii{};
+        assert ( ii1 == ii2 );
+        assert ( ii1 == ii4 );
+        assert ( ii1 == cii );
+
+        assert ( !(ii1 != ii2 ));
+        assert ( !(ii1 != cii ));
+//         C c;
+//         assert ( ii1 != c.cbegin());
+//         assert ( cii != c.begin());
+//         assert ( cii != c.cend());
+//         assert ( ii1 != c.end());
+    }
+#endif
 }
Index: test/containers/associative/multimap/iterator.pass.cpp
===================================================================
--- test/containers/associative/multimap/iterator.pass.cpp	(revision 187794)
+++ test/containers/associative/multimap/iterator.pass.cpp	(working copy)
@@ -211,4 +211,24 @@
             }
     }
 #endif
+#if _LIBCPP_STD_VER > 11
+    { // N3664 testing
+    	typedef std::multimap<int, double> C;
+        C::iterator ii1{}, ii2{};
+        C::iterator ii4 = ii1;
+        C::const_iterator cii{};
+        assert ( ii1 == ii2 );
+        assert ( ii1 == ii4 );
+        assert ( ii1 == cii );
+
+        assert ( !(ii1 != ii2 ));
+        assert ( !(ii1 != cii ));
+
+//         C c;
+//         assert ( ii1 != c.cbegin());
+//         assert ( cii != c.begin());
+//         assert ( cii != c.cend());
+//         assert ( ii1 != c.end());
+    }
+#endif
 }
Index: test/containers/associative/set/iterator.pass.cpp
===================================================================
--- test/containers/associative/set/iterator.pass.cpp	(revision 187794)
+++ test/containers/associative/set/iterator.pass.cpp	(working copy)
@@ -191,4 +191,23 @@
             assert(*i == j);
     }
 #endif
+#if _LIBCPP_STD_VER > 11
+    { // N3664 testing
+    	typedef std::set<int> C;
+        C::iterator ii1{}, ii2{};
+        C::iterator ii4 = ii1;
+        C::const_iterator cii{};
+        assert ( ii1 == ii2 );
+        assert ( ii1 == ii4 );
+        assert ( ii1 == cii );
+
+        assert ( !(ii1 != ii2 ));
+        assert ( !(ii1 != cii ));
+//         C c;
+//         assert ( ii1 != c.cbegin());
+//         assert ( cii != c.begin());
+//         assert ( cii != c.cend());
+//         assert ( ii1 != c.end());
+    }
+#endif
 }
Index: test/containers/associative/map/iterator.pass.cpp
===================================================================
--- test/containers/associative/map/iterator.pass.cpp	(revision 0)
+++ test/containers/associative/map/iterator.pass.cpp	(revision 0)
@@ -0,0 +1,174 @@
+//===----------------------------------------------------------------------===//
+//
+//                     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
+
+//       iterator begin();
+// const_iterator begin() const;
+//       iterator end();
+// const_iterator end()   const;
+//
+//       reverse_iterator rbegin();
+// const_reverse_iterator rbegin() const;
+//       reverse_iterator rend();
+// const_reverse_iterator rend()   const;
+//
+// const_iterator         cbegin()  const;
+// const_iterator         cend()    const;
+// const_reverse_iterator crbegin() const;
+// const_reverse_iterator crend()   const;
+
+#include <map>
+#include <cassert>
+
+#include "../../min_allocator.h"
+
+int main()
+{
+    {
+        typedef std::pair<const int, double> V;
+        V ar[] =
+        {
+            V(1, 1),
+            V(2, 1),
+            V(3, 1),
+            V(4, 1),
+            V(5, 1),
+            V(6, 1),
+            V(7, 1),
+            V(8, 1)
+        };
+        const size_t v_size = sizeof(ar)/sizeof(ar[0]);
+        std::map<int, double> m(ar, ar+v_size);
+        assert(m.size() == v_size);
+        assert(std::distance(m.begin(), m.end()) == m.size());
+        assert(std::distance(m.rbegin(), m.rend()) == m.size());
+        std::map<int, double>::iterator i;
+        i = m.begin();
+        std::map<int, double>::const_iterator k = i;
+        assert(i == k);
+        for (int j = 1; j <= 8; ++j, ++i)
+        {
+            assert(i->first == j);
+            assert(i->second == 1);
+            i->second = 2.5;
+            assert(i->second == 2.5);
+        }
+    }
+    {
+        typedef std::pair<const int, double> V;
+        V ar[] =
+        {
+            V(1, 1),
+            V(2, 2),
+            V(3, 3),
+            V(4, 4),
+            V(5, 5),
+            V(6, 6),
+            V(7, 7),
+            V(8, 8)
+        };
+        const size_t v_size = sizeof(ar)/sizeof(ar[0]);
+        const std::map<int, double> m(ar, ar+v_size);
+        assert(m.size() == v_size);
+        assert(std::distance(m.begin(), m.end()) == m.size());
+        assert(std::distance(m.cbegin(), m.cend()) == m.size());
+        assert(std::distance(m.rbegin(), m.rend()) == m.size());
+        assert(std::distance(m.crbegin(), m.crend()) == m.size());
+        std::map<int, double>::const_iterator i;
+        i = m.begin();
+        for (int j = 1; j <= 8; ++j, ++i)
+        {
+            assert(i->first == j);
+            assert(i->second == j);
+        }
+    }
+#if __cplusplus >= 201103L
+    {
+        typedef std::pair<const int, double> V;
+        V ar[] =
+        {
+            V(1, 1),
+            V(2, 1),
+            V(3, 1),
+            V(4, 1),
+            V(5, 1),
+            V(6, 1),
+            V(7, 1),
+            V(8, 1)
+        };
+        const size_t v_size = sizeof(ar)/sizeof(ar[0]);
+        std::map<int, double, std::less<int>, min_allocator<V>> m(ar, ar+v_size);
+        assert(m.size() == v_size);
+        assert(std::distance(m.begin(), m.end()) == m.size());
+        assert(std::distance(m.rbegin(), m.rend()) == m.size());
+        std::map<int, double, std::less<int>, min_allocator<V>>::iterator i;
+        i = m.begin();
+        std::map<int, double, std::less<int>, min_allocator<V>>::const_iterator k = i;
+        assert(i == k);
+        for (int j = 1; j <= 8; ++j, ++i)
+        {
+            assert(i->first == j);
+            assert(i->second == 1);
+            i->second = 2.5;
+            assert(i->second == 2.5);
+        }
+    }
+    {
+        typedef std::pair<const int, double> V;
+        V ar[] =
+        {
+            V(1, 1),
+            V(2, 2),
+            V(3, 3),
+            V(4, 4),
+            V(5, 5),
+            V(6, 6),
+            V(7, 7),
+            V(8, 8)
+        };
+        const size_t v_size = sizeof(ar)/sizeof(ar[0]);
+        const std::map<int, double, std::less<int>, min_allocator<V>> m(ar, ar+v_size);
+        assert(m.size() == v_size);
+        assert(std::distance(m.begin(), m.end()) == m.size());
+        assert(std::distance(m.cbegin(), m.cend()) == m.size());
+        assert(std::distance(m.rbegin(), m.rend()) == m.size());
+        assert(std::distance(m.crbegin(), m.crend()) == m.size());
+        std::map<int, double, std::less<int>, min_allocator<V>>::const_iterator i;
+        i = m.begin();
+        for (int j = 1; j <= 8; ++j, ++i)
+        {
+            assert(i->first == j);
+            assert(i->second == j);
+        }
+    }
+#endif
+#if _LIBCPP_STD_VER > 11
+    { // N3664 testing
+    	typedef std::map<int, double> C;
+        C::iterator ii1{}, ii2{};
+        C::iterator ii4 = ii1;
+        C::const_iterator cii{};
+        assert ( ii1 == ii2 );
+        assert ( ii1 == ii4 );
+        assert ( ii1 == cii );
+
+        assert ( !(ii1 != ii2 ));
+        assert ( !(ii1 != cii ));
+
+//         C c;
+//         assert ( ii1 != c.cbegin());
+//         assert ( cii != c.begin());
+//         assert ( cii != c.cend());
+//         assert ( ii1 != c.end());
+    }
+#endif
+}