@@ -1333,7 +1333,7 @@ impl<T> HeaderMap<T> {
1333
1333
1334
1334
if danger || num_displaced >= DISPLACEMENT_THRESHOLD {
1335
1335
// Increase danger level
1336
- self . danger . to_yellow ( ) ;
1336
+ self . danger . set_yellow ( ) ;
1337
1337
}
1338
1338
1339
1339
index
@@ -1524,15 +1524,15 @@ impl<T> HeaderMap<T> {
1524
1524
1525
1525
if load_factor >= LOAD_FACTOR_THRESHOLD {
1526
1526
// Transition back to green danger level
1527
- self . danger . to_green ( ) ;
1527
+ self . danger . set_green ( ) ;
1528
1528
1529
1529
// Double the capacity
1530
1530
let new_cap = self . indices . len ( ) * 2 ;
1531
1531
1532
1532
// Grow the capacity
1533
1533
self . grow ( new_cap) ;
1534
1534
} else {
1535
- self . danger . to_red ( ) ;
1535
+ self . danger . set_red ( ) ;
1536
1536
1537
1537
// Rebuild hash table
1538
1538
for index in self . indices . iter_mut ( ) {
@@ -3223,7 +3223,7 @@ impl Danger {
3223
3223
matches ! ( * self , Danger :: Red ( _) )
3224
3224
}
3225
3225
3226
- fn to_red ( & mut self ) {
3226
+ fn set_red ( & mut self ) {
3227
3227
debug_assert ! ( self . is_yellow( ) ) ;
3228
3228
* self = Danger :: Red ( RandomState :: new ( ) ) ;
3229
3229
}
@@ -3232,13 +3232,13 @@ impl Danger {
3232
3232
matches ! ( * self , Danger :: Yellow )
3233
3233
}
3234
3234
3235
- fn to_yellow ( & mut self ) {
3235
+ fn set_yellow ( & mut self ) {
3236
3236
if let Danger :: Green = * self {
3237
3237
* self = Danger :: Yellow ;
3238
3238
}
3239
3239
}
3240
3240
3241
- fn to_green ( & mut self ) {
3241
+ fn set_green ( & mut self ) {
3242
3242
debug_assert ! ( self . is_yellow( ) ) ;
3243
3243
* self = Danger :: Green ;
3244
3244
}
0 commit comments