libcxx/test/std/containers/unord/unord.map/equal_range_const.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_map>
  10
  11 // template <class Key, class T, class Hash = hash<Key>, class Pred = equal_to<Key>,
  12 //           class Alloc = allocator<pair<const Key, T>>>
  13 // class unordered_map
  14
  15 // pair<const_iterator, const_iterator> equal_range(const key_type& k) const;
  16
  17 #include <unordered_map>
  18 #include <string>
  19 #include <cassert>
  20 #include <iterator>
  21
  22 #include "test_macros.h"
  23 #include "min_allocator.h"
  24
  25 int main(int, char**)
  26 {
  27     {
  28         typedef std::unordered_map<int, std::string> C;
  29         typedef C::const_iterator I;
  30         typedef std::pair<int, std::string> P;
  31         P a[] =
  32         {
  33             P(10, "ten"),
  34             P(20, "twenty"),
  35             P(30, "thirty"),
  36             P(40, "forty"),
  37             P(50, "fifty"),
  38             P(60, "sixty"),
  39             P(70, "seventy"),
  40             P(80, "eighty"),
  41         };
  42         const C c(std::begin(a), std::end(a));
  43         std::pair<I, I> r = c.equal_range(30);
  44         assert(std::distance(r.first, r.second) == 1);
  45         assert(r.first->first == 30);
  46         assert(r.first->second == "thirty");
  47         r = c.equal_range(5);
  48         assert(std::distance(r.first, r.second) == 0);
  49     }
  50 #if TEST_STD_VER >= 11
  51     {
  52         typedef std::unordered_map<int, std::string, std::hash<int>, std::equal_to<int>,
  53                             min_allocator<std::pair<const int, std::string>>> C;
  54         typedef C::const_iterator I;
  55         typedef std::pair<int, std::string> P;
  56         P a[] =
  57         {
  58             P(10, "ten"),
  59             P(20, "twenty"),
  60             P(30, "thirty"),
  61             P(40, "forty"),
  62             P(50, "fifty"),
  63             P(60, "sixty"),
  64             P(70, "seventy"),
  65             P(80, "eighty"),
  66         };
  67         const C c(std::begin(a), std::end(a));
  68         std::pair<I, I> r = c.equal_range(30);
  69         assert(std::distance(r.first, r.second) == 1);
  70         assert(r.first->first == 30);
  71         assert(r.first->second == "thirty");
  72         r = c.equal_range(5);
  73         assert(std::distance(r.first, r.second) == 0);
  74     }
  75 #endif
  76
  77   return 0;
  78 }