115 pub struct HashSet<T, S = DefaultHashBuilder, A: Allocator + Clone = Global> {  struct
119 impl<T: Clone, S: Clone, A: Allocator + Clone> Clone for HashSet<T, S, A> {  argument
121         HashSet {  in clone()
132 impl<T> HashSet<T, DefaultHashBuilder> {  impl
172 impl<T: Hash + Eq, A: Allocator + Clone> HashSet<T, DefaultHashBuilder, A> {  impl
211 impl<T, S, A: Allocator + Clone> HashSet<T, S, A> {  implementation
385 impl<T, S> HashSet<T, S, Global> {  implementation
453 impl<T, S, A> HashSet<T, S, A>  implementation
532 impl<T, S, A> HashSet<T, S, A>  implementation
1076 impl<T, S, A> PartialEq for HashSet<T, S, A>  implementation
1091 impl<T, S, A> Eq for HashSet<T, S, A>  implementation
1099 impl<T, S, A> fmt::Debug for HashSet<T, S, A>  implementation
1110 impl<T, S, A> From<HashMap<T, (), S, A>> for HashSet<T, S, A>  implementation
1119 impl<T, S, A> FromIterator<T> for HashSet<T, S, A>  implementation
1133 impl<T, S, A> Extend<T> for HashSet<T, S, A>  implementation
1157 impl<'a, T, S, A> Extend<&'a T> for HashSet<T, S, A>  implementation
1181 impl<T, S, A> Default for HashSet<T, S, A>  implementation
1195 impl<T, S, A> BitOr<&HashSet<T, S, A>> for &HashSet<T, S, A>  implementation
1201     type Output = HashSet<T, S>;
1223     fn bitor(self, rhs: &HashSet<T, S, A>) -> HashSet<T, S> {  in bitor()
1228 impl<T, S, A> BitAnd<&HashSet<T, S, A>> for &HashSet<T, S, A>  implementation
1234     type Output = HashSet<T, S>;
1256     fn bitand(self, rhs: &HashSet<T, S, A>) -> HashSet<T, S> {  in bitand()
1261 impl<T, S> BitXor<&HashSet<T, S>> for &HashSet<T, S>  implementation
1266     type Output = HashSet<T, S>;
1288     fn bitxor(self, rhs: &HashSet<T, S>) -> HashSet<T, S> {  in bitxor()
1293 impl<T, S> Sub<&HashSet<T, S>> for &HashSet<T, S>  implementation
1298     type Output = HashSet<T, S>;
1320     fn sub(self, rhs: &HashSet<T, S>) -> HashSet<T, S> {  in sub()
1384     other: &'a HashSet<T, S, A>,
1398     other: &'a HashSet<T, S, A>,
1423 impl<'a, T, S, A: Allocator + Clone> IntoIterator for &'a HashSet<T, S, A> {  implementation
1433 impl<T, S, A: Allocator + Clone> IntoIterator for HashSet<T, S, A> {  implementation
1801     fn set<'new>(v: HashSet<&'static str>) -> HashSet<&'new str> {  in assert_covariance()
1842     use super::HashSet;
1847         type HS = HashSet<i32>;  in test_zero_capacities()
1879         let mut xs = HashSet::new();  in test_disjoint()
1880         let mut ys = HashSet::new();  in test_disjoint()
1901         let mut a = HashSet::new();  in test_subset_and_superset()
1907         let mut b = HashSet::new();  in test_subset_and_superset()
1930         let mut a = HashSet::new();  in test_iterate()
1943         let mut a = HashSet::new();  in test_intersection()
1944         let mut b = HashSet::new();  in test_intersection()
1973         let mut a = HashSet::new();  in test_difference()
1974         let mut b = HashSet::new();  in test_difference()
1996         let mut a = HashSet::new();  in test_symmetric_difference()
1997         let mut b = HashSet::new();  in test_symmetric_difference()
2022         let mut a = HashSet::new();  in test_union()
2023         let mut b = HashSet::new();  in test_union()
2058         let a: HashSet<_> = a.into();  in test_from_map()
2071         let set: HashSet<_> = xs.iter().cloned().collect();  in test_from_iter()
2083             let mut hs = HashSet::new();  in test_move_iter()
2099         let mut s1 = HashSet::new();  in test_eq()
2105         let mut s2 = HashSet::new();  in test_eq()
2119         let mut set = HashSet::new();  in test_show()
2120         let empty = HashSet::<i32>::new();  in test_show()
2133         let mut s = HashSet::<i32>::new();  in test_trivial_drain()
2138         let mut s = HashSet::<i32>::new();  in test_trivial_drain()
2145         let mut s: HashSet<_> = (1..100).collect();  in test_drain()
2191         let mut s = HashSet::new();  in test_replace()
2204         let mut a = HashSet::new();  in test_extend_ref()
2215         let mut b = HashSet::new();  in test_extend_ref()
2233         let mut set: HashSet<i32> = xs.iter().cloned().collect();  in test_retain()
2244             let mut set: HashSet<i32> = (0..8).collect();  in test_drain_filter()
2252             let mut set: HashSet<i32> = (0..8).collect();  in test_drain_filter()
2273         const EMPTY_SET: HashSet<u32, MyHasher> = HashSet::with_hasher(MyHasher);  in test_const_with_hasher()
2282         let mut set = HashSet::new();  in rehash_in_place()