@@ -304,9 +304,9 @@ impl<K, V> Node<K, V> {
304304 let ( vals_offset, _) = calculate_offsets_generic :: < K , V > ( capacity, true ) ;
305305
306306 Node {
307- keys : Unique ( buffer as * mut K ) .
307+ keys : Unique ( buffer as * mut K ) ,
308308 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 ( ) ) ,
310310 _len : 0 ,
311311 _capacity : capacity,
312312 }
@@ -574,7 +574,7 @@ impl <K, V> Node<K, V> {
574574
575575 /// If the node has any children
576576 pub fn is_leaf ( & self ) -> bool {
577- self . edges . is_null ( )
577+ self . edges . 0 . is_null ( )
578578 }
579579
580580 /// if the node has too few elements
@@ -1058,7 +1058,7 @@ impl<K, V> Node<K, V> {
10581058 vals : RawItems :: from_slice ( self . vals ( ) ) ,
10591059 edges : RawItems :: from_slice ( self . edges ( ) ) ,
10601060
1061- ptr : self . keys as * mut u8 ,
1061+ ptr : self . keys . 0 as * mut u8 ,
10621062 capacity : self . capacity ( ) ,
10631063 is_leaf : self . is_leaf ( )
10641064 } ,
0 commit comments