mirror of
https://github.com/llvm-mirror/libcxx.git
synced 2025-10-24 12:02:36 +08:00
9e6ac074ee
Patch from ngolovliov@gmail.com Reviewed as: https://reviews.llvm.org/D42344 As described in llvm.org/PR30959, the current implementation of std::{map, key}::{count, equal_range} in libcxx is non-conforming. Quoting the C++14 standard [associative.reqmts]p3 > The phrase “equivalence of keys” means the equivalence relation imposed by > the comparison and not the operator== on keys. That is, two keys k1 and k2 are > considered to be equivalent if for the comparison object comp, > comp(k1, k2) == false && comp(k2, k1) == false. In the same section, the requirements table states the following: > a.equal_range(k) equivalent to make_pair(a.lower_bound(k), a.upper_bound(k)) > a.count(k) returns the number of elements with key equivalent to k The behaviour of libstdc++ seems to conform to the standard here. git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@324799 91177308-0d34-0410-b5e6-96231b3b80d8
61 lines
1.4 KiB
C++
61 lines
1.4 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>
|
|
// pair<iterator,iterator> equal_range(const K& x); //
|
|
// C++14
|
|
// template<typename K>
|
|
// pair<const_iterator,const_iterator> equal_range(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 er = s.equal_range(1);
|
|
long nels = 0;
|
|
|
|
for (auto it = er.first; it != er.second; it++) {
|
|
assert(it->first == 1);
|
|
nels++;
|
|
}
|
|
|
|
assert(nels == 3);
|
|
}
|