Is there a zero-copy way to find the intersection of an arbitrary number of sets?

Question

Here is a simple example demonstrating what I\'m trying to do:

use std::collections::HashSet;

fn main() {
    let mut sets: Vec> =