¶template <class S1Ty, class S2Ty>
void set_intersect(S1Ty& S1, const S2Ty& S2)

Description

set_intersect(A, B) - Compute A := A ^ B 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.

Declared at: llvm/include/llvm/ADT/SetOperations.h:39

Templates

S1Ty

S2Ty

Parameters

S1Ty& S1

const S2Ty& S2