@@ -186,7 +186,7 @@ where
186
186
assert ! ( std:: mem:: align_of:: <Entry <K , V >>( ) == 1 ) ;
187
187
188
188
debug_assert ! ( data. len( ) . is_power_of_two( ) ) ;
189
- debug_assert ! ( metadata. len( ) == data. len( ) + GROUP_SIZE ) ;
189
+ debug_assert ! ( metadata. len( ) == data. len( ) + REFERENCE_GROUP_SIZE ) ;
190
190
191
191
Self {
192
192
metadata,
@@ -198,7 +198,7 @@ where
198
198
#[ inline]
199
199
pub ( crate ) fn find ( & self , key : & K ) -> Option < & V > {
200
200
debug_assert ! ( self . data. len( ) . is_power_of_two( ) ) ;
201
- debug_assert ! ( self . metadata. len( ) == self . data. len( ) + GROUP_SIZE ) ;
201
+ debug_assert ! ( self . metadata. len( ) == self . data. len( ) + REFERENCE_GROUP_SIZE ) ;
202
202
203
203
let mask = self . data . len ( ) - 1 ;
204
204
let hash = H :: hash ( key. as_slice ( ) ) ;
@@ -308,7 +308,7 @@ where
308
308
assert ! ( std:: mem:: align_of:: <Entry <K , V >>( ) == 1 ) ;
309
309
310
310
debug_assert ! ( data. len( ) . is_power_of_two( ) ) ;
311
- debug_assert_eq ! ( metadata. len( ) , data. len( ) + GROUP_SIZE ) ;
311
+ debug_assert_eq ! ( metadata. len( ) , data. len( ) + REFERENCE_GROUP_SIZE ) ;
312
312
313
313
Self {
314
314
metadata,
@@ -324,7 +324,7 @@ where
324
324
#[ inline]
325
325
pub ( crate ) fn insert ( & mut self , key : K , value : V ) -> Option < V > {
326
326
debug_assert ! ( self . data. len( ) . is_power_of_two( ) ) ;
327
- debug_assert ! ( self . metadata. len( ) == self . data. len( ) + GROUP_SIZE ) ;
327
+ debug_assert ! ( self . metadata. len( ) == self . data. len( ) + REFERENCE_GROUP_SIZE ) ;
328
328
329
329
let mask = self . data . len ( ) - 1 ;
330
330
let hash = H :: hash ( key. as_slice ( ) ) ;
@@ -352,11 +352,11 @@ where
352
352
* entry_at_mut ( self . data , index) = Entry :: new ( key, value) ;
353
353
* metadata_at_mut ( self . metadata , index) = h2;
354
354
355
- if index < GROUP_SIZE {
355
+ if index < REFERENCE_GROUP_SIZE {
356
356
let first_mirror = self . data . len ( ) ;
357
357
* metadata_at_mut ( self . metadata , first_mirror + index) = h2;
358
358
debug_assert_eq ! (
359
- self . metadata[ ..GROUP_SIZE ] ,
359
+ self . metadata[ ..REFERENCE_GROUP_SIZE ] ,
360
360
self . metadata[ self . data. len( ) ..]
361
361
) ;
362
362
}
@@ -408,7 +408,7 @@ where
408
408
{
409
409
pub ( crate ) fn new ( metadata : & ' a [ EntryMetadata ] , data : & ' a [ Entry < K , V > ] ) -> RawIter < ' a , K , V > {
410
410
debug_assert ! ( data. len( ) . is_power_of_two( ) ) ;
411
- debug_assert ! ( metadata. len( ) == data. len( ) + GROUP_SIZE ) ;
411
+ debug_assert ! ( metadata. len( ) == data. len( ) + REFERENCE_GROUP_SIZE ) ;
412
412
413
413
RawIter {
414
414
metadata,
@@ -529,7 +529,7 @@ mod tests {
529
529
) -> ( Vec < EntryMetadata > , Vec < Entry < K , V > > ) {
530
530
let size = xs. size_hint ( ) . 0 . next_power_of_two ( ) ;
531
531
let mut data = vec ! [ Entry :: default ( ) ; size] ;
532
- let mut metadata = vec ! [ 255 ; size + GROUP_SIZE ] ;
532
+ let mut metadata = vec ! [ 255 ; size + REFERENCE_GROUP_SIZE ] ;
533
533
534
534
assert ! ( metadata. iter( ) . all( |b| is_empty_or_deleted( * b) ) ) ;
535
535
0 commit comments