Protect std::{,unordered_}map tests under noexceptions

[rogfer01]

Summary

Skip tests that use exceptions

[mclow.lists]

LGTM.

libcxx/trunk/test/std/containers/associative/map/map.access/at.pass.cpp

 //===----------------------------------------------------------------------===//
 //
 //                     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.
 //
 //===----------------------------------------------------------------------===//
 
-// XFAIL: libcpp-no-exceptions
 // <map>
 
 // class map
 
 //       mapped_type& at(const key_type& k);
 // const mapped_type& at(const key_type& k) const;
 
 #include <map>
 #include <cassert>
 
 #include "min_allocator.h"
+#include "test_macros.h"
 
 int main()
 {
     {
         typedef std::pair<const int, double> V;
         V ar[] =
         {
             V(1, 1.5),
             V(2, 2.5),
             V(3, 3.5),
             V(4, 4.5),
             V(5, 5.5),
             V(7, 7.5),
             V(8, 8.5),
         };
         std::map<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
         assert(m.size() == 7);
         assert(m.at(1) == 1.5);
         m.at(1) = -1.5;
         assert(m.at(1) == -1.5);
         assert(m.at(2) == 2.5);
         assert(m.at(3) == 3.5);
         assert(m.at(4) == 4.5);
         assert(m.at(5) == 5.5);
+#ifndef TEST_HAS_NO_EXCEPTIONS
         try
         {
             m.at(6);
             assert(false);
         }
         catch (std::out_of_range&)
         {
         }
+#endif
         assert(m.at(7) == 7.5);
         assert(m.at(8) == 8.5);
         assert(m.size() == 7);
     }
     {
         typedef std::pair<const int, double> V;
         V ar[] =
         {
             V(1, 1.5),
             V(2, 2.5),
             V(3, 3.5),
             V(4, 4.5),
             V(5, 5.5),
             V(7, 7.5),
             V(8, 8.5),
         };
         const std::map<int, double> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
         assert(m.size() == 7);
         assert(m.at(1) == 1.5);
         assert(m.at(2) == 2.5);
         assert(m.at(3) == 3.5);
         assert(m.at(4) == 4.5);
         assert(m.at(5) == 5.5);
+#ifndef TEST_HAS_NO_EXCEPTIONS
         try
         {
             m.at(6);
             assert(false);
         }
         catch (std::out_of_range&)
         {
         }
+#endif
         assert(m.at(7) == 7.5);
         assert(m.at(8) == 8.5);
         assert(m.size() == 7);
     }
 #if TEST_STD_VER >= 11
     {
         typedef std::pair<const int, double> V;
         V ar[] =
#if TEST_STD_VER >= 11
         assert(m.size() == 7);
         assert(m.at(1) == 1.5);
         m.at(1) = -1.5;
         assert(m.at(1) == -1.5);
         assert(m.at(2) == 2.5);
         assert(m.at(3) == 3.5);
         assert(m.at(4) == 4.5);
         assert(m.at(5) == 5.5);
+#ifndef TEST_HAS_NO_EXCEPTIONS
         try
         {
             m.at(6);
             assert(false);
         }
         catch (std::out_of_range&)
         {
         }
+#endif
         assert(m.at(7) == 7.5);
         assert(m.at(8) == 8.5);
         assert(m.size() == 7);
     }
     {
         typedef std::pair<const int, double> V;
         V ar[] =
         {
             V(1, 1.5),
             V(2, 2.5),
             V(3, 3.5),
             V(4, 4.5),
             V(5, 5.5),
             V(7, 7.5),
             V(8, 8.5),
         };
         const std::map<int, double, std::less<int>, min_allocator<V>> m(ar, ar+sizeof(ar)/sizeof(ar[0]));
         assert(m.size() == 7);
         assert(m.at(1) == 1.5);
         assert(m.at(2) == 2.5);
         assert(m.at(3) == 3.5);
         assert(m.at(4) == 4.5);
         assert(m.at(5) == 5.5);
+#ifndef TEST_HAS_NO_EXCEPTIONS
         try
         {
             m.at(6);
             assert(false);
         }
         catch (std::out_of_range&)
         {
         }
+#endif
         assert(m.at(7) == 7.5);
         assert(m.at(8) == 8.5);
         assert(m.size() == 7);
     }
 #endif
 }

libcxx/trunk/test/std/containers/unord/unord.map/unord.map.elem/at.pass.cpp

 //===----------------------------------------------------------------------===//
 //
 //                     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.
 //
 //===----------------------------------------------------------------------===//
 
-// XFAIL: libcpp-no-exceptions
 // <unordered_map>
 
 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
 //           class Alloc = allocator<pair<const Key, T>>>
 // class unordered_map
 
 // mapped_type&       at(const key_type& k);
 // const mapped_type& at(const key_type& k) const;
 
 #include <unordered_map>
 #include <string>
 #include <cassert>
 
 #include "MoveOnly.h"
 #include "min_allocator.h"
+#include "test_macros.h"
 
 int main()
 {
     {
         typedef std::unordered_map<int, std::string> C;
         typedef std::pair<int, std::string> P;
         P a[] =
         {
             P(1, "one"),
             P(2, "two"),
             P(3, "three"),
             P(4, "four"),
             P(1, "four"),
             P(2, "four"),
         };
         C c(a, a + sizeof(a)/sizeof(a[0]));
         assert(c.size() == 4);
         c.at(1) = "ONE";
         assert(c.at(1) == "ONE");
+#ifndef TEST_HAS_NO_EXCEPTIONS
         try
         {
             c.at(11) = "eleven";
             assert(false);
         }
         catch (std::out_of_range&)
         {
         }
         assert(c.size() == 4);
+#endif
     }
     {
         typedef std::unordered_map<int, std::string> C;
         typedef std::pair<int, std::string> P;
         P a[] =
         {
             P(1, "one"),
             P(2, "two"),
             P(3, "three"),
             P(4, "four"),
             P(1, "four"),
             P(2, "four"),
         };
         const C c(a, a + sizeof(a)/sizeof(a[0]));
         assert(c.size() == 4);
         assert(c.at(1) == "one");
+#ifndef TEST_HAS_NO_EXCEPTIONS
         try
         {
             c.at(11);
             assert(false);
         }
         catch (std::out_of_range&)
         {
         }
         assert(c.size() == 4);
+#endif
     }
 #if TEST_STD_VER >= 11
     {
         typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
                             min_allocator<std::pair<const int, std::string>>> C;
         typedef std::pair<int, std::string> P;
         P a[] =
         {
             P(1, "one"),
             P(2, "two"),
             P(3, "three"),
             P(4, "four"),
             P(1, "four"),
             P(2, "four"),
         };
         C c(a, a + sizeof(a)/sizeof(a[0]));
         assert(c.size() == 4);
         c.at(1) = "ONE";
         assert(c.at(1) == "ONE");
+#ifndef TEST_HAS_NO_EXCEPTIONS
         try
         {
             c.at(11) = "eleven";
             assert(false);
         }
         catch (std::out_of_range&)
         {
         }
         assert(c.size() == 4);
+#endif
     }
     {
         typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
                             min_allocator<std::pair<const int, std::string>>> C;
         typedef std::pair<int, std::string> P;
         P a[] =
         {
             P(1, "one"),
             P(2, "two"),
             P(3, "three"),
             P(4, "four"),
             P(1, "four"),
             P(2, "four"),
         };
         const C c(a, a + sizeof(a)/sizeof(a[0]));
         assert(c.size() == 4);
         assert(c.at(1) == "one");
+#ifndef TEST_HAS_NO_EXCEPTIONS
         try
         {
             c.at(11);
             assert(false);
         }
         catch (std::out_of_range&)
         {
         }
         assert(c.size() == 4);
+#endif
     }
 #endif
 }