1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
//
// XFAIL: c++98, c++03, c++11
// <map>
// class multimap
// iterator find(const key_type& k);
// const_iterator find(const key_type& k) const;
//
// The member function templates find, count, lower_bound, upper_bound, and
// equal_range shall not participate in overload resolution unless the
// qualified-id Compare::is_transparent is valid and denotes a type
#include <map>
#include <cassert>
#include "is_transparent.h"
int main()
{
{
typedef std::multimap<int, double, transparent_less> M;
typedef std::pair<typename M::iterator, typename M::iterator> P;
M example;
P result = example.equal_range(C2Int{5});
assert(result.first == result.second);
}
{
typedef std::multimap<int, double, transparent_less_not_referenceable> M;
typedef std::pair<typename M::iterator, typename M::iterator> P;
M example;
P result = example.equal_range(C2Int{5});
assert(result.first == result.second);
}
}
|
