@@ -68,23 +68,23 @@ pub trait Set<T>: Mutable {
68
68
69
69
/// Return true if the set has no elements in common with `other`.
70
70
/// This is equivalent to checking for an empty intersection.
71
- pure fn is_disjoint ( & self , other: & self ) -> bool ;
71
+ pure fn is_disjoint ( & self , other : & Self ) -> bool ;
72
72
73
73
/// Return true if the set is a subset of another
74
- pure fn is_subset ( & self , other: & self ) -> bool ;
74
+ pure fn is_subset ( & self , other : & Self ) -> bool ;
75
75
76
76
/// Return true if the set is a superset of another
77
- pure fn is_superset ( & self , other: & self ) -> bool ;
77
+ pure fn is_superset ( & self , other : & Self ) -> bool ;
78
78
79
79
/// Visit the values representing the difference
80
- pure fn difference ( & self , other : & self , f: fn ( & T ) -> bool ) ;
80
+ pure fn difference ( & self , other : & Self , f : fn ( & T ) -> bool ) ;
81
81
82
82
/// Visit the values representing the symmetric difference
83
- pure fn symmetric_difference ( & self , other : & self , f: fn ( & T ) -> bool ) ;
83
+ pure fn symmetric_difference ( & self , other : & Self , f : fn ( & T ) -> bool ) ;
84
84
85
85
/// Visit the values representing the intersection
86
- pure fn intersection ( & self , other : & self , f: fn ( & T ) -> bool ) ;
86
+ pure fn intersection ( & self , other : & Self , f : fn ( & T ) -> bool ) ;
87
87
88
88
/// Visit the values representing the union
89
- pure fn union ( & self , other : & self , f: fn ( & T ) -> bool ) ;
89
+ pure fn union ( & self , other : & Self , f : fn ( & T ) -> bool ) ;
90
90
}
0 commit comments