pub fn is_disjoint(&self, other: &BTreeSet<T>) -> bool
    where
        T: Ord,
    {
        self.intersection(other).next().is_none()
    }
Returns `true` if the set is a superset of another,
i.e., `self` contains at least all the values in `other`.

# Examples
benchmarks/haystacks/code/rust-library.rs