@@ -330,14 +330,14 @@ impl<'a> Graph<'a> {
330330 } ;
331331
332332 let mut prev = 0 ;
333- for x in & * xadj {
333+ for x in xadj {
334334 if prev > * x {
335335 return Err ( NewGraphError :: msg ( "index list is not sorted" ) ) ;
336336 }
337337 prev = * x;
338338 }
339339
340- for a in & * adjncy {
340+ for a in adjncy {
341341 if * a < 0 || * a >= nvtxs {
342342 return Err ( NewGraphError :: msg (
343343 "some values in the adjacency list are out of bounds" ,
@@ -859,7 +859,7 @@ impl<'a> Mesh<'a> {
859859 if nparts <= 0 {
860860 return Err ( NewMeshError :: NoParts ) ;
861861 }
862- let ( _ne, nn) = check_mesh_structure ( & * eptr, & * eind) ?;
862+ let ( _ne, nn) = check_mesh_structure ( eptr, eind) ?;
863863 Ok ( unsafe { Mesh :: new_unchecked ( nn, nparts, eptr, eind) } )
864864 }
865865
@@ -1164,7 +1164,7 @@ impl Drop for Dual {
11641164/// This function returns an error if `eptr` and `eind` don't follow the mesh
11651165/// format given in [`Mesh::new`].
11661166pub fn mesh_to_dual ( eptr : & [ Idx ] , eind : & [ Idx ] , ncommon : Idx ) -> Result < Dual > {
1167- let ( ne, nn) = check_mesh_structure ( & * eptr, & * eind) ?;
1167+ let ( ne, nn) = check_mesh_structure ( eptr, eind) ?;
11681168 let mut xadj = mem:: MaybeUninit :: uninit ( ) ;
11691169 let mut adjncy = mem:: MaybeUninit :: uninit ( ) ;
11701170 let numbering_flag = 0 ;
0 commit comments