14 Sep
2012
14 Sep
'12
9:36 a.m.
Hi everyone, I'm trying to test whether two std::vector's intersect. A straightforward way is to sort them, apply std::set_intersection and test whether the result set is non-empty. However, I don't need the result. Is there some algorithm in boost that just _tests_ for intersection, i.e., stops when it has found one common element? Best regards, Jens