@@ -130,7 +130,7 @@ impl Eq for HashKeyValue {}
130
130
/// This must implement [Hash], [PartialEq], and [Eq] so it may be used as
131
131
/// HashMap keys and other de-duplication methods.
132
132
#[ derive( Clone , Default , Debug , PartialEq , Eq ) ]
133
- pub ( crate ) struct AttributeSet ( Vec < HashKeyValue > , u64 ) ;
133
+ pub struct AttributeSet ( Vec < HashKeyValue > , u64 ) ;
134
134
135
135
impl From < & [ KeyValue ] > for AttributeSet {
136
136
fn from ( values : & [ KeyValue ] ) -> Self {
@@ -168,12 +168,12 @@ impl AttributeSet {
168
168
}
169
169
170
170
/// Returns `true` if the set contains no elements.
171
- pub ( crate ) fn is_empty ( & self ) -> bool {
171
+ pub fn is_empty ( & self ) -> bool {
172
172
self . 0 . is_empty ( )
173
173
}
174
174
175
175
/// Retains only the attributes specified by the predicate.
176
- pub ( crate ) fn retain < F > ( & mut self , f : F )
176
+ pub fn retain < F > ( & mut self , f : F )
177
177
where
178
178
F : Fn ( & KeyValue ) -> bool ,
179
179
{
@@ -184,7 +184,7 @@ impl AttributeSet {
184
184
}
185
185
186
186
/// Iterate over key value pairs in the set
187
- pub ( crate ) fn iter ( & self ) -> impl Iterator < Item = ( & Key , & Value ) > {
187
+ pub fn iter ( & self ) -> impl Iterator < Item = ( & Key , & Value ) > {
188
188
self . 0 . iter ( ) . map ( |kv| ( & kv. 0 . key , & kv. 0 . value ) )
189
189
}
190
190
}
0 commit comments