Boost C++ Libraries: Ticket #11180: has_set_intersection

Marshall Clow — Fri, 10 Apr 2015 14:44:45 GMT

Yes, maybe an idea ;-)

Although I might be tempted to call it ranges_intersect or something.

Marshall Clow — Sat, 11 Apr 2015 06:43:37 GMT

I thought that I knew what you were asking, but then I realized I did not.

What do you mean by "overlap"? An example would be helpful, I think.

gast128@… — Mon, 13 Apr 2015 07:34:00 GMT

Example:

int a1[] = {1, 2, 3};
int a2[] = {2, 3, 4};
int a3[] = {4, 5, 6};

a1 and a2 have overlap; a1 and a3 not. Basically it is just the set_intersection algorithm but without storing the results and break out early if possible.

I get btw a lot of 'trac' errors: 'Submission rejected as potential spam (StopForumSpam says this is spam (ip))'

gast128@… — Fri, 12 May 2017 08:05:01 GMT

It seems that std::includes is more or less the Boolean version of std::set_difference though it uses reversed arguments.