@@ -9,20 +9,20 @@ impl<K: PartialEq, V> VecMap<K, V> {
9
9
#[ inline]
10
10
pub fn with_capacity ( cap : usize ) -> VecMap < K , V > {
11
11
VecMap {
12
- vec : Vec :: with_capacity ( cap)
12
+ vec : Vec :: with_capacity ( cap) ,
13
13
}
14
14
}
15
15
16
16
#[ inline]
17
17
pub fn insert ( & mut self , key : K , value : V ) {
18
18
match self . find ( & key) {
19
19
Some ( pos) => self . vec [ pos] = ( key, value) ,
20
- None => self . vec . push ( ( key, value) )
20
+ None => self . vec . push ( ( key, value) ) ,
21
21
}
22
22
}
23
23
24
24
#[ inline]
25
- pub fn entry ( & mut self , key : K ) -> Entry < K , V > {
25
+ pub fn entry ( & mut self , key : K ) -> Entry < ' _ , K , V > {
26
26
match self . find ( & key) {
27
27
Some ( pos) => Entry :: Occupied ( OccupiedEntry {
28
28
vec : self ,
@@ -31,7 +31,7 @@ impl<K: PartialEq, V> VecMap<K, V> {
31
31
None => Entry :: Vacant ( VacantEntry {
32
32
vec : self ,
33
33
key : key,
34
- } )
34
+ } ) ,
35
35
}
36
36
}
37
37
@@ -51,15 +51,19 @@ impl<K: PartialEq, V> VecMap<K, V> {
51
51
}
52
52
53
53
#[ inline]
54
- pub fn len ( & self ) -> usize { self . vec . len ( ) }
54
+ pub fn len ( & self ) -> usize {
55
+ self . vec . len ( )
56
+ }
55
57
56
58
#[ inline]
57
- pub fn iter ( & self ) -> :: std:: slice:: Iter < ( K , V ) > {
59
+ pub fn iter ( & self ) -> :: std:: slice:: Iter < ' _ , ( K , V ) > {
58
60
self . vec . iter ( )
59
61
}
60
62
#[ inline]
61
63
pub fn remove < K2 : PartialEq < K > + ?Sized > ( & mut self , key : & K2 ) -> Option < V > {
62
- self . find ( key) . map ( |pos| self . vec . remove ( pos) ) . map ( |( _, v) | v)
64
+ self . find ( key)
65
+ . map ( |pos| self . vec . remove ( pos) )
66
+ . map ( |( _, v) | v)
63
67
}
64
68
#[ inline]
65
69
pub fn clear ( & mut self ) {
@@ -74,10 +78,10 @@ impl<K: PartialEq, V> VecMap<K, V> {
74
78
75
79
pub enum Entry < ' a , K : ' a , V : ' a > {
76
80
Vacant ( VacantEntry < ' a , K , V > ) ,
77
- Occupied ( OccupiedEntry < ' a , K , V > )
81
+ Occupied ( OccupiedEntry < ' a , K , V > ) ,
78
82
}
79
83
80
- pub struct VacantEntry < ' a , K : ' a , V : ' a > {
84
+ pub struct VacantEntry < ' a , K , V > {
81
85
vec : & ' a mut VecMap < K , V > ,
82
86
key : K ,
83
87
}
@@ -91,7 +95,7 @@ impl<'a, K, V> VacantEntry<'a, K, V> {
91
95
}
92
96
}
93
97
94
- pub struct OccupiedEntry < ' a , K : ' a , V : ' a > {
98
+ pub struct OccupiedEntry < ' a , K , V > {
95
99
vec : & ' a mut VecMap < K , V > ,
96
100
pos : usize ,
97
101
}
0 commit comments