• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
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 // UNSUPPORTED: c++03, c++11
10 
11 // <set>
12 
13 // class multiset
14 
15 // template<typename K>
16 //     pair<iterator,iterator>             equal_range(const K& x);        //
17 //     C++14
18 // template<typename K>
19 //     pair<const_iterator,const_iterator> equal_range(const K& x) const;  //
20 //     C++14
21 
22 #include <cassert>
23 #include <set>
24 #include <utility>
25 
26 #include "min_allocator.h"
27 #include "private_constructor.h"
28 #include "test_macros.h"
29 
30 struct Comp {
31   using is_transparent = void;
32 
operator ()Comp33   bool operator()(const std::pair<int, int> &lhs,
34                   const std::pair<int, int> &rhs) const {
35     return lhs < rhs;
36   }
37 
operator ()Comp38   bool operator()(const std::pair<int, int> &lhs, int rhs) const {
39     return lhs.first < rhs;
40   }
41 
operator ()Comp42   bool operator()(int lhs, const std::pair<int, int> &rhs) const {
43     return lhs < rhs.first;
44   }
45 };
46 
main(int,char **)47 int main(int, char**) {
48   std::multiset<std::pair<int, int>, Comp> s{{2, 1}, {1, 1}, {1, 1}, {1, 1}, {2, 2}};
49 
50   auto er = s.equal_range(1);
51   long nels = 0;
52 
53   for (auto it = er.first; it != er.second; it++) {
54     assert(it->first == 1);
55     nels++;
56   }
57 
58   assert(nels == 3);
59 
60   return 0;
61 }
62