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