clear.pass.cpp (1720B)
1 //===----------------------------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is dual licensed under the MIT and the University of Illinois Open 6 // Source Licenses. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 // <unordered_map> 11 12 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>, 13 // class Alloc = allocator<pair<const Key, T>>> 14 // class unordered_map 15 16 // void clear() noexcept; 17 18 #include <unordered_map> 19 #include <string> 20 #include <cassert> 21 22 #include "test_macros.h" 23 #include "min_allocator.h" 24 25 int main() 26 { 27 { 28 typedef std::unordered_map<int, std::string> C; 29 typedef std::pair<int, std::string> P; 30 P a[] = 31 { 32 P(1, "one"), 33 P(2, "two"), 34 P(3, "three"), 35 P(4, "four"), 36 P(1, "four"), 37 P(2, "four"), 38 }; 39 C c(a, a + sizeof(a)/sizeof(a[0])); 40 ASSERT_NOEXCEPT(c.clear()); 41 c.clear(); 42 assert(c.size() == 0); 43 } 44 #if TEST_STD_VER >= 11 45 { 46 typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>, 47 min_allocator<std::pair<const int, std::string>>> C; 48 typedef std::pair<int, std::string> P; 49 P a[] = 50 { 51 P(1, "one"), 52 P(2, "two"), 53 P(3, "three"), 54 P(4, "four"), 55 P(1, "four"), 56 P(2, "four"), 57 }; 58 C c(a, a + sizeof(a)/sizeof(a[0])); 59 ASSERT_NOEXCEPT(c.clear()); 60 c.clear(); 61 assert(c.size() == 0); 62 } 63 #endif 64 }