erase_key.pass.cpp revision b64f8b07c104c6cc986570ac8ee0ed16a9f23976
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// size_type erase(const key_type& k); 17 18#include <unordered_map> 19#include <string> 20#include <cassert> 21 22int main() 23{ 24 { 25 typedef std::unordered_map<int, std::string> C; 26 typedef std::pair<int, std::string> P; 27 P a[] = 28 { 29 P(1, "one"), 30 P(2, "two"), 31 P(3, "three"), 32 P(4, "four"), 33 P(1, "four"), 34 P(2, "four"), 35 }; 36 C c(a, a + sizeof(a)/sizeof(a[0])); 37 assert(c.erase(5) == 0); 38 assert(c.size() == 4); 39 assert(c.at(1) == "one"); 40 assert(c.at(2) == "two"); 41 assert(c.at(3) == "three"); 42 assert(c.at(4) == "four"); 43 44 assert(c.erase(2) == 1); 45 assert(c.size() == 3); 46 assert(c.at(1) == "one"); 47 assert(c.at(3) == "three"); 48 assert(c.at(4) == "four"); 49 50 assert(c.erase(2) == 0); 51 assert(c.size() == 3); 52 assert(c.at(1) == "one"); 53 assert(c.at(3) == "three"); 54 assert(c.at(4) == "four"); 55 56 assert(c.erase(4) == 1); 57 assert(c.size() == 2); 58 assert(c.at(1) == "one"); 59 assert(c.at(3) == "three"); 60 61 assert(c.erase(4) == 0); 62 assert(c.size() == 2); 63 assert(c.at(1) == "one"); 64 assert(c.at(3) == "three"); 65 66 assert(c.erase(1) == 1); 67 assert(c.size() == 1); 68 assert(c.at(3) == "three"); 69 70 assert(c.erase(1) == 0); 71 assert(c.size() == 1); 72 assert(c.at(3) == "three"); 73 74 assert(c.erase(3) == 1); 75 assert(c.size() == 0); 76 77 assert(c.erase(3) == 0); 78 assert(c.size() == 0); 79 } 80} 81