pub fn intset_intersection(lhs: &mut Vec<i32>, rhs: &[i32])Expand description
Replace lhs with the sorted intersection of lhs and rhs.
Both inputs must already be sorted ascending. As a special case,
lhs == [-1] is treated as the universal set, so the result
becomes rhs. Runs in O(n + m).