Compute the intersection of S1 and S2, updating S1 in place.
Declared in <llvm/ADT/SetOperations.h>
template<
class S1Ty,
class S2Ty>
void
set_intersect(
S1Ty& S1,
S2Ty const& S2);Identical to set_intersection, except that it works on set<>'s and is nicer to use. Functionally, this iterates through S1, removing elements that are not contained in S2.
| Name | Description |
|---|---|
| S1 | Set updated to contain only elements also in S2. |
| S2 | Set used for membership tests. |