Lines Matching defs:sets
1834 let mut sets = [BTreeSet::new(), BTreeSet::new()];
1837 sets[b as usize].insert(i as u32);
1839 assert_eq!(sets[0].len(), n1);
1840 assert_eq!(sets[1].len(), n2);
1841 sets
1845 ($name: ident, $set_func: ident, $result_func: ident, $sets: expr) => {
1849 let sets = $sets;
1852 b.iter(|| sets[0].$set_func(&sets[1]).$result_func())
21446 // `Weak::new` sets this to `usize::MAX` so that it doesn’t need
23545 // `Weak::new` sets this to `usize::MAX` so that it doesn’t need
32349 // iterate similarly sized sets jointly, spotting matches along the way
32384 // This constant is used by functions that compare two sets.
33645 // and T is an empty type, the storage overhead of sets limits