libcxx/test/std/containers/unord/unord.set/insert_const_lvalue.pass.cpp

   1 //===----------------------------------------------------------------------===//
   2 //
   3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
   4 // See https://llvm.org/LICENSE.txt for license information.
   5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
   6 //
   7 //===----------------------------------------------------------------------===//
   8
   9 // <unordered_set>
  10
  11 // template <class Value, class Hash = hash<Value>, class Pred = equal_to<Value>,
  12 //           class Alloc = allocator<Value>>
  13 // class unordered_set
  14
  15 // pair<iterator, bool> insert(const value_type& x);
  16
  17 #include <unordered_set>
  18 #include <cassert>
  19
  20 #include "test_macros.h"
  21 #include "min_allocator.h"
  22
  23 template<class Container>
  24 void do_insert_const_lvalue_test()
  25 {
  26     typedef Container C;
  27     typedef std::pair<typename C::iterator, bool> R;
  28     typedef typename C::value_type VT;
  29     C c;
  30     const VT v1(3.5);
  31     R r = c.insert(v1);
  32     assert(c.size() == 1);
  33     assert(*r.first == 3.5);
  34     assert(r.second);
  35
  36     r = c.insert(v1);
  37     assert(c.size() == 1);
  38     assert(*r.first == 3.5);
  39     assert(!r.second);
  40
  41     const VT v2(4.5);
  42     r = c.insert(v2);
  43     assert(c.size() == 2);
  44     assert(*r.first == 4.5);
  45     assert(r.second);
  46
  47     const VT v3(5.5);
  48     r = c.insert(v3);
  49     assert(c.size() == 3);
  50     assert(*r.first == 5.5);
  51     assert(r.second);
  52 }
  53
  54 int main(int, char**)
  55 {
  56     do_insert_const_lvalue_test<std::unordered_set<double> >();
  57 #if TEST_STD_VER >= 11
  58     {
  59         typedef std::unordered_set<double, std::hash<double>,
  60                                 std::equal_to<double>, min_allocator<double>> C;
  61         do_insert_const_lvalue_test<C>();
  62     }
  63 #endif
  64
  65   return 0;
  66 }