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 // iterator insert(const_iterator p, const value_type& x); 17 18 #if _LIBCPP_DEBUG >= 1 19 #define _LIBCPP_ASSERT(x, m) ((x) ? (void)0 : std::exit(0)) 20 #endif 21 22 #include <unordered_map> 23 #include <cassert> 24 25 #include "min_allocator.h" 26 27 template<class Container> 28 void do_insert_hint_const_lvalue_test() 29 { 30 typedef Container C; 31 typedef typename C::iterator R; 32 typedef typename C::value_type VT; 33 C c; 34 typename C::const_iterator e = c.end(); 35 const VT v1(3.5, 3); 36 R r = c.insert(e, v1); 37 assert(c.size() == 1); 38 assert(r->first == 3.5); 39 assert(r->second == 3); 40 41 const VT v2(3.5, 4); 42 r = c.insert(c.end(), v2); 43 assert(c.size() == 1); 44 assert(r->first == 3.5); 45 assert(r->second == 3); 46 47 const VT v3(4.5, 4); 48 r = c.insert(c.end(), v3); 49 assert(c.size() == 2); 50 assert(r->first == 4.5); 51 assert(r->second == 4); 52 53 const VT v4(5.5, 4); 54 r = c.insert(c.end(), v4); 55 assert(c.size() == 3); 56 assert(r->first == 5.5); 57 assert(r->second == 4); 58 } 59 60 int main() 61 { 62 do_insert_hint_const_lvalue_test<std::unordered_map<double, int> >(); 63 #if TEST_STD_VER >= 11 64 { 65 typedef std::unordered_map<double, int, std::hash<double>, std::equal_to<double>, 66 min_allocator<std::pair<const double, int>>> C; 67 68 do_insert_hint_const_lvalue_test<C>(); 69 } 70 #endif 71 #if _LIBCPP_DEBUG >= 1 72 { 73 typedef std::unordered_map<double, int> C; 74 typedef C::iterator R; 75 typedef C::value_type P; 76 C c; 77 C c2; 78 C::const_iterator e = c2.end(); 79 P v(3.5, 3); 80 R r = c.insert(e, v); 81 assert(false); 82 } 83 #endif 84 } 85
