c++ - 如何找到对集合中一对之间的元素？

Question

set<pair<int,int> >s;
pair<int,int>a0 = make_pair(1,10); // pair is kind of range of integer
air<int,int>a1 = make_pair(11,50);
s.insert(a0);
s.insert(a1);

现在我需要一个函数，当我搜索位于集合中任何对范围之间的任何整数时返回 true。

Answer 1

Now I need a function which returns true when I search any integer which lies between range of any pair in the set.

它似乎适用于 std::any_of()

#include <set>
#include <utility>
#include <iostream>
#include <algorithm>

bool anyRange (std::set<std::pair<int, int>> const & s, int v)
 { return std::any_of(s.cbegin(), s.cend(),
                      [&](std::pair<int, int> const & p)
                       { return (p.first <= v) && (v <= p.second); }); }

int main()
 {
   std::set<std::pair<int, int>> s { {1, 10}, {11, 50} };

   std::cout << anyRange(s, -5) << std::endl; // print 0
   std::cout << anyRange(s, 5)  << std::endl; // print 1
   std::cout << anyRange(s, 25) << std::endl; // print 1
   std::cout << anyRange(s, 75) << std::endl; // print 0
 }