//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // template , class Pred = equal_to, // class Alloc = allocator>> // class unordered_map // pair insert(const value_type& x); #include #include #include "min_allocator.h" int main() { { typedef std::unordered_map C; typedef std::pair R; typedef C::value_type P; C c; R r = c.insert(P(3.5, 3)); assert(r.second); assert(c.size() == 1); assert(r.first->first == 3.5); assert(r.first->second == 3); r = c.insert(P(3.5, 4)); assert(!r.second); assert(c.size() == 1); assert(r.first->first == 3.5); assert(r.first->second == 3); r = c.insert(P(4.5, 4)); assert(r.second); assert(c.size() == 2); assert(r.first->first == 4.5); assert(r.first->second == 4); r = c.insert(P(5.5, 4)); assert(r.second); assert(c.size() == 3); assert(r.first->first == 5.5); assert(r.first->second == 4); } #if __cplusplus >= 201103L { typedef std::unordered_map, std::equal_to, min_allocator>> C; typedef std::pair R; typedef C::value_type P; C c; R r = c.insert(P(3.5, 3)); assert(r.second); assert(c.size() == 1); assert(r.first->first == 3.5); assert(r.first->second == 3); r = c.insert(P(3.5, 4)); assert(!r.second); assert(c.size() == 1); assert(r.first->first == 3.5); assert(r.first->second == 3); r = c.insert(P(4.5, 4)); assert(r.second); assert(c.size() == 2); assert(r.first->first == 4.5); assert(r.first->second == 4); r = c.insert(P(5.5, 4)); assert(r.second); assert(c.size() == 3); assert(r.first->first == 5.5); assert(r.first->second == 4); } #endif }