@@ -19,8 +19,8 @@ impl LabelSet {
1919 }
2020
2121 /// Insert a new label pair or update the value of an existing label.
22- pub fn upsert ( & mut self , key : LabelName , value : LabelValue ) {
23- self . items . insert ( key , value) ;
22+ pub fn upsert ( & mut self , name : LabelName , value : LabelValue ) {
23+ self . items . insert ( name , value) ;
2424 }
2525
2626 pub fn is_empty ( & self ) -> bool {
@@ -35,7 +35,7 @@ impl LabelSet {
3535 }
3636
3737 pub fn matches ( & self , criteria : & LabelSet ) -> bool {
38- criteria. iter ( ) . all ( |( key , value) | self . contains_pair ( key , value) )
38+ criteria. iter ( ) . all ( |( name , value) | self . contains_pair ( name , value) )
3939 }
4040
4141 pub fn iter ( & self ) -> Iter < ' _ , LabelName , LabelValue > {
@@ -48,7 +48,7 @@ impl Display for LabelSet {
4848 let items = self
4949 . items
5050 . iter ( )
51- . map ( |( key , value) | format ! ( "{key }=\" {value}\" " ) )
51+ . map ( |( name , value) | format ! ( "{name }=\" {value}\" " ) )
5252 . collect :: < Vec < _ > > ( )
5353 . join ( "," ) ;
5454
@@ -90,8 +90,8 @@ impl From<Vec<LabelPair>> for LabelSet {
9090 fn from ( vec : Vec < LabelPair > ) -> Self {
9191 let mut items = BTreeMap :: new ( ) ;
9292
93- for ( key , value) in vec {
94- items. insert ( key , value) ;
93+ for ( name , value) in vec {
94+ items. insert ( name , value) ;
9595 }
9696
9797 Self { items }
@@ -160,8 +160,8 @@ impl Serialize for LabelSet {
160160 {
161161 self . items
162162 . iter ( )
163- . map ( |( key , value) | SerializedLabel {
164- name : key . clone ( ) ,
163+ . map ( |( name , value) | SerializedLabel {
164+ name : name . clone ( ) ,
165165 value : value. clone ( ) ,
166166 } )
167167 . collect :: < Vec < _ > > ( )
0 commit comments