user8469759 - 2 months ago 20

C++ Question

Say I have the following code

`#include <iostream>`

#include <set>

int main ()

{

std::set<int> myset;

int inf, sup;

inf = 25; sup = 60;

for (int i=1; i<10; i++) myset.insert(i*10); // 10 20 30 40 50 60 70 80 90

return 0;

}

I was trying to figure out if the standard library provides any methods, or combination of methods that would allow me to get two iterators

`it_l, it_u`

Update : Some examples of expected output would be (in my example)

`inf =25; sup = 60`

`{30,40,50,60}`

if instead

`inf=30; sup = 60`

`{30,40,50,60}`

if

`inf=25; sup = 65`

`{30,40,50,60}`

Apparently there's a misunderstanding, or maybe it's me I'm not correctly expressing what I want to do.

When I say inf and sup please intend them as extreme values of a real interval. Once you made such assumption what I want is to retrieve is the intersection between the interval [inf,sup] and the discrete set specified by an set objects. Is there some contradiction between what I just said and my examples?

Let

`A={10 20 30 40 50 60 70 80 90}`

`B1=[25,60]`

`B2=[30,60]`

`B3=[25,65]`

For each

`i=1,2,3`

`A`

`Bi`

Answer

This works fine for me:

```
#include <iostream>
#include <set>
template <typename T>
std::pair<typename std::set<T>::const_iterator, typename std::set<T>::const_iterator>
infsup(const std::set<T>& set, const T& inf, const T& sup)
{
return std::make_pair(set.lower_bound(inf), set.upper_bound(sup));
}
int main ()
{
std::set<int> myset;
int inf, sup;
for (int i=1; i<10; i++) myset.insert(i*10); // 10 20 30 40 50 60 70 80 90
for (auto its = infsup(myset, 30, 60); its.first != its.second; ++its.first)
{
std::cout << " " << *its.first; // 30 40 50 60
}
std::cout << std::endl;
for (auto its = infsup(myset, 25, 65); its.first != its.second; ++its.first)
{
std::cout << " " << *its.first; // 30 40 50 60
}
std::cout << std::endl;
return 0;
}
```

Using `lower_bound`

for `inf`

means that the start iterator will point to *the first element that is not less than inf*, and so fulfills the condition you want for the lower end of the range.

Using `upper_bound`

for `sup`

means that the end iterator will point to _ first element that is greater than `sup`

_. Note that the end iterator, in C++, always points *just past the end* of your range, so therefore `sup`

will be included.