insert_hint_const_lvalue.pass.cpp revision f890d9bfaadc13df40bb74e95cebd53ec826f932
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#include <unordered_map> 19#include <cassert> 20 21#include "../../../min_allocator.h" 22 23int main() 24{ 25 { 26 typedef std::unordered_map<double, int> C; 27 typedef C::iterator R; 28 typedef C::value_type P; 29 C c; 30 C::const_iterator e = c.end(); 31 R r = c.insert(e, P(3.5, 3)); 32 assert(c.size() == 1); 33 assert(r->first == 3.5); 34 assert(r->second == 3); 35 36 r = c.insert(c.end(), P(3.5, 4)); 37 assert(c.size() == 1); 38 assert(r->first == 3.5); 39 assert(r->second == 3); 40 41 r = c.insert(c.end(), P(4.5, 4)); 42 assert(c.size() == 2); 43 assert(r->first == 4.5); 44 assert(r->second == 4); 45 46 r = c.insert(c.end(), P(5.5, 4)); 47 assert(c.size() == 3); 48 assert(r->first == 5.5); 49 assert(r->second == 4); 50 } 51#if __cplusplus >= 201103L 52 { 53 typedef std::unordered_map<double, int, std::hash<double>, std::equal_to<double>, 54 min_allocator<std::pair<const double, int>>> C; 55 typedef C::iterator R; 56 typedef C::value_type P; 57 C c; 58 C::const_iterator e = c.end(); 59 R r = c.insert(e, P(3.5, 3)); 60 assert(c.size() == 1); 61 assert(r->first == 3.5); 62 assert(r->second == 3); 63 64 r = c.insert(c.end(), P(3.5, 4)); 65 assert(c.size() == 1); 66 assert(r->first == 3.5); 67 assert(r->second == 3); 68 69 r = c.insert(c.end(), P(4.5, 4)); 70 assert(c.size() == 2); 71 assert(r->first == 4.5); 72 assert(r->second == 4); 73 74 r = c.insert(c.end(), P(5.5, 4)); 75 assert(c.size() == 3); 76 assert(r->first == 5.5); 77 assert(r->second == 4); 78 } 79#endif 80} 81