@@ -304,9 +304,9 @@ impl<K, V> Node<K, V> {
304
304
let ( vals_offset, _) = calculate_offsets_generic :: < K , V > ( capacity, true ) ;
305
305
306
306
Node {
307
- keys : Unique ( buffer as * mut K ) .
307
+ keys : Unique ( buffer as * mut K ) ,
308
308
vals : Unique ( unsafe { buffer. offset ( vals_offset as int ) as * mut V } ) ,
309
- edges : Unique ( ptr:: null_mut :: < u8 > ( ) ) ,
309
+ edges : Unique ( ptr:: null_mut ( ) ) ,
310
310
_len : 0 ,
311
311
_capacity : capacity,
312
312
}
@@ -574,7 +574,7 @@ impl <K, V> Node<K, V> {
574
574
575
575
/// If the node has any children
576
576
pub fn is_leaf ( & self ) -> bool {
577
- self . edges . is_null ( )
577
+ self . edges . 0 . is_null ( )
578
578
}
579
579
580
580
/// if the node has too few elements
@@ -1058,7 +1058,7 @@ impl<K, V> Node<K, V> {
1058
1058
vals : RawItems :: from_slice ( self . vals ( ) ) ,
1059
1059
edges : RawItems :: from_slice ( self . edges ( ) ) ,
1060
1060
1061
- ptr : self . keys as * mut u8 ,
1061
+ ptr : self . keys . 0 as * mut u8 ,
1062
1062
capacity : self . capacity ( ) ,
1063
1063
is_leaf : self . is_leaf ( )
1064
1064
} ,
0 commit comments