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
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++03, c++11
// <set>
// class multiset
// template<typename K>
// size_type count(const K& x) const; // C++14
#include <cassert>
#include <set>
#include <utility>
struct Comp {
using is_transparent = void;
bool operator()(const std::pair<int, int>& lhs, const std::pair<int, int>& rhs) const { return lhs < rhs; }
bool operator()(const std::pair<int, int>& lhs, int rhs) const { return lhs.first < rhs; }
bool operator()(int lhs, const std::pair<int, int>& rhs) const { return lhs < rhs.first; }
};
int main(int, char**) {
std::multiset<std::pair<int, int>, Comp> s{{2, 1}, {1, 1}, {1, 1}, {1, 1}, {2, 2}};
auto cnt = s.count(1);
assert(cnt == 3);
return 0;
}
|
