You cannot select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
libcxx/test/std/containers/associative/set/count_transparent.pass.cpp

52 lines
1.2 KiB
C++

//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
// UNSUPPORTED: c++98, c++03, c++11
// <set>
// class set
// template<typename K>
// iterator lower_bound(const K& x); // C++14
// template<typename K>
// const_iterator lower_bound(const K& x) const; // C++14
#include <cassert>
#include <set>
#include <utility>
#include "min_allocator.h"
#include "private_constructor.hpp"
#include "test_macros.h"
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() {
std::set<std::pair<int, int>, Comp> s{{2, 1}, {1, 2}, {1, 3}, {1, 4}, {2, 2}};
auto cnt = s.count(1);
assert(cnt == 3);
}