Method insert_intersection

datafusion/optimizer/src/join_key_set.rs:110–118

Inserts any join keys that are common to both `s1` and `s2` into self

(&mut self, s1: &JoinKeySet, s2: &JoinKeySet)

    /// Inserts any join keys that are common to both `s1` and `s2` into self
    pub fn insert_intersection(&mut self, s1: &JoinKeySet, s2: &JoinKeySet) {
        // note can't use inner.intersection as we need to consider both (l, r)
        // and (r, l) in equality
        for (left, right) in s1.inner.iter() {
            if s2.contains(left, right) {
                self.insert(left, right);
            }
        }
    }

    /// returns true if this set is empty
    pub fn is_empty(&self) -> bool {