libcxx/test/std/containers/associative/multimap/multimap.ops/lower_bound0.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 // XFAIL: c++03, c++11
  10
  11 // <map>
  12
  13 // class multimap
  14
  15 //       iterator lower_bound(const key_type& k);
  16 // const_iterator lower_bound(const key_type& k) const;
  17 //
  18 //   The member function templates find, count, lower_bound, upper_bound, and
  19 // equal_range shall not participate in overload resolution unless the
  20 // qualified-id Compare::is_transparent is valid and denotes a type
  21
  22
  23 #include <map>
  24 #include <cassert>
  25
  26 #include "test_macros.h"
  27 #include "is_transparent.h"
  28
  29 int main(int, char**)
  30 {
  31     {
  32     typedef std::multimap<int, double, transparent_less> M;
  33     M example;
  34     assert(example.lower_bound(C2Int{5}) == example.end());
  35     }
  36     {
  37     typedef std::multimap<int, double, transparent_less_not_referenceable> M;
  38     M example;
  39     assert(example.lower_bound(C2Int{5}) == example.end());
  40     }
  41
  42   return 0;
  43 }