Run `cargo fmt`.

src/base/blas.rs

@@ -1328,7 +1328,8 @@ where
         ShapeConstraint: DimEq<D1, D1> + DimEq<D1, R3> + DimEq<C3, D4>,
         DefaultAllocator: Allocator<N, D1>,
     {
-        let mut work = unsafe { crate::unimplemented_or_uninitialized_generic!(self.data.shape().0, U1) };
+        let mut work =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(self.data.shape().0, U1) };
         self.quadform_tr_with_workspace(&mut work, alpha, lhs, mid, beta)
     }
 
@@ -1421,7 +1422,8 @@ where
         ShapeConstraint: DimEq<D2, R3> + DimEq<D1, C3> + AreMultipliable<C3, R3, D2, U1>,
         DefaultAllocator: Allocator<N, D2>,
     {
-        let mut work = unsafe { crate::unimplemented_or_uninitialized_generic!(mid.data.shape().0, U1) };
+        let mut work =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(mid.data.shape().0, U1) };
         self.quadform_with_workspace(&mut work, alpha, mid, rhs, beta)
     }
 }

src/base/conversion.rs

@@ -50,7 +50,8 @@ where
         let nrows2 = R2::from_usize(nrows);
         let ncols2 = C2::from_usize(ncols);
 
-        let mut res: MatrixMN<N2, R2, C2> = unsafe { crate::unimplemented_or_uninitialized_generic!(nrows2, ncols2) };
+        let mut res: MatrixMN<N2, R2, C2> =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(nrows2, ncols2) };
         for i in 0..nrows {
             for j in 0..ncols {
                 unsafe {

src/base/default_allocator.rs

@@ -55,9 +55,9 @@ where
         ncols: C,
         iter: I,
     ) -> Self::Buffer {
-        #[cfg(feature="no_unsound_assume_init")]
+        #[cfg(feature = "no_unsound_assume_init")]
         let mut res: Self::Buffer = unimplemented!();
-        #[cfg(not(feature="no_unsound_assume_init"))]
+        #[cfg(not(feature = "no_unsound_assume_init"))]
         let mut res = unsafe { Self::allocate_uninitialized(nrows, ncols).assume_init() };
         let mut count = 0;
 
@@ -158,10 +158,11 @@ where
         cto: CTo,
         buf: <Self as Allocator<N, RFrom, CFrom>>::Buffer,
     ) -> ArrayStorage<N, RTo, CTo> {
-        #[cfg(feature="no_unsound_assume_init")]
+        #[cfg(feature = "no_unsound_assume_init")]
         let mut res: ArrayStorage<N, RTo, CTo> = unimplemented!();
-        #[cfg(not(feature="no_unsound_assume_init"))]
+        #[cfg(not(feature = "no_unsound_assume_init"))]
-        let mut res = <Self as Allocator<N, RTo, CTo>>::allocate_uninitialized(rto, cto).assume_init();
+        let mut res =
+            <Self as Allocator<N, RTo, CTo>>::allocate_uninitialized(rto, cto).assume_init();
 
         let (rfrom, cfrom) = buf.shape();
 
@@ -189,10 +190,11 @@ where
         cto: CTo,
         buf: ArrayStorage<N, RFrom, CFrom>,
     ) -> VecStorage<N, Dynamic, CTo> {
-        #[cfg(feature="no_unsound_assume_init")]
+        #[cfg(feature = "no_unsound_assume_init")]
         let mut res: VecStorage<N, Dynamic, CTo> = unimplemented!();
-        #[cfg(not(feature="no_unsound_assume_init"))]
+        #[cfg(not(feature = "no_unsound_assume_init"))]
-        let mut res = <Self as Allocator<N, Dynamic, CTo>>::allocate_uninitialized(rto, cto).assume_init();
+        let mut res =
+            <Self as Allocator<N, Dynamic, CTo>>::allocate_uninitialized(rto, cto).assume_init();
 
         let (rfrom, cfrom) = buf.shape();
 
@@ -220,10 +222,11 @@ where
         cto: Dynamic,
         buf: ArrayStorage<N, RFrom, CFrom>,
     ) -> VecStorage<N, RTo, Dynamic> {
-        #[cfg(feature="no_unsound_assume_init")]
+        #[cfg(feature = "no_unsound_assume_init")]
         let mut res: VecStorage<N, RTo, Dynamic> = unimplemented!();
-        #[cfg(not(feature="no_unsound_assume_init"))]
+        #[cfg(not(feature = "no_unsound_assume_init"))]
-        let mut res = <Self as Allocator<N, RTo, Dynamic>>::allocate_uninitialized(rto, cto).assume_init();
+        let mut res =
+            <Self as Allocator<N, RTo, Dynamic>>::allocate_uninitialized(rto, cto).assume_init();
 
         let (rfrom, cfrom) = buf.shape();
 

src/base/edition.rs

@@ -54,7 +54,9 @@ impl<N: Scalar + Zero, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
     {
         let irows = irows.into_iter();
         let ncols = self.data.shape().1;
-        let mut res = unsafe { crate::unimplemented_or_uninitialized_generic!(Dynamic::new(irows.len()), ncols) };
+        let mut res = unsafe {
+            crate::unimplemented_or_uninitialized_generic!(Dynamic::new(irows.len()), ncols)
+        };
 
         // First, check that all the indices from irows are valid.
         // This will allow us to use unchecked access in the inner loop.
@@ -88,8 +90,9 @@ impl<N: Scalar + Zero, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
     {
         let icols = icols.into_iter();
         let nrows = self.data.shape().0;
-        let mut res =
+        let mut res = unsafe {
-            unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, Dynamic::new(icols.len())) };
+            crate::unimplemented_or_uninitialized_generic!(nrows, Dynamic::new(icols.len()))
+        };
 
         for (destination, source) in icols.enumerate() {
             res.column_mut(destination).copy_from(&self.column(*source))
@@ -895,7 +898,9 @@ impl<N: Scalar> DMatrix<N> {
     where
         DefaultAllocator: Reallocator<N, Dynamic, Dynamic, Dynamic, Dynamic>,
     {
-        let placeholder = unsafe { crate::unimplemented_or_uninitialized_generic!(Dynamic::new(0), Dynamic::new(0)) };
+        let placeholder = unsafe {
+            crate::unimplemented_or_uninitialized_generic!(Dynamic::new(0), Dynamic::new(0))
+        };
         let old = mem::replace(self, placeholder);
         let new = old.resize(new_nrows, new_ncols, val);
         let _ = mem::replace(self, new);
@@ -918,7 +923,9 @@ where
     where
         DefaultAllocator: Reallocator<N, Dynamic, C, Dynamic, C>,
     {
-        let placeholder = unsafe { crate::unimplemented_or_uninitialized_generic!(Dynamic::new(0), self.data.shape().1) };
+        let placeholder = unsafe {
+            crate::unimplemented_or_uninitialized_generic!(Dynamic::new(0), self.data.shape().1)
+        };
         let old = mem::replace(self, placeholder);
         let new = old.resize_vertically(new_nrows, val);
         let _ = mem::replace(self, new);
@@ -941,7 +948,9 @@ where
     where
         DefaultAllocator: Reallocator<N, R, Dynamic, R, Dynamic>,
     {
-        let placeholder = unsafe { crate::unimplemented_or_uninitialized_generic!(self.data.shape().0, Dynamic::new(0)) };
+        let placeholder = unsafe {
+            crate::unimplemented_or_uninitialized_generic!(self.data.shape().0, Dynamic::new(0))
+        };
         let old = mem::replace(self, placeholder);
         let new = old.resize_horizontally(new_ncols, val);
         let _ = mem::replace(self, new);

src/base/matrix.rs

@@ -300,8 +300,12 @@ impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
 
     /// Creates a new uninitialized matrix with the given uninitialized data
     pub unsafe fn from_uninitialized_data(data: mem::MaybeUninit<S>) -> mem::MaybeUninit<Self> {
-        let res: Matrix<N, R, C, mem::MaybeUninit<S>> = Matrix { data, _phantoms: PhantomData };
+        let res: Matrix<N, R, C, mem::MaybeUninit<S>> = Matrix {
-        let res: mem::MaybeUninit<Matrix<N, R, C, mem::MaybeUninit<S>>> = mem::MaybeUninit::new(res);
+            data,
+            _phantoms: PhantomData,
+        };
+        let res: mem::MaybeUninit<Matrix<N, R, C, mem::MaybeUninit<S>>> =
+            mem::MaybeUninit::new(res);
         // safety: since we wrap the inner MaybeUninit in an outer MaybeUninit above, the fact that the `data` field is partially-uninitialized is still opaque.
         // with s/transmute_copy/transmute/, rustc claims that `MaybeUninit<Matrix<N, R, C, MaybeUninit<S>>>` may be of a different size from `MaybeUninit<Matrix<N, R, C, S>>`
         // but MaybeUninit's documentation says "MaybeUninit<T> is guaranteed to have the same size, alignment, and ABI as T", which implies those types should be the same size
@@ -507,7 +511,8 @@ impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
         let nrows: SameShapeR<R, R2> = Dim::from_usize(nrows);
         let ncols: SameShapeC<C, C2> = Dim::from_usize(ncols);
 
-        let mut res: MatrixSum<N, R, C, R2, C2> = unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, ncols) };
+        let mut res: MatrixSum<N, R, C, R2, C2> =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, ncols) };
 
         // TODO: use copy_from
         for j in 0..res.ncols() {
@@ -574,7 +579,8 @@ impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
     {
         let (nrows, ncols) = self.data.shape();
 
-        let mut res: MatrixMN<N2, R, C> = unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, ncols) };
+        let mut res: MatrixMN<N2, R, C> =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, ncols) };
 
         for j in 0..ncols.value() {
             for i in 0..nrows.value() {
@@ -618,7 +624,8 @@ impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
     {
         let (nrows, ncols) = self.data.shape();
 
-        let mut res: MatrixMN<N2, R, C> = unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, ncols) };
+        let mut res: MatrixMN<N2, R, C> =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, ncols) };
 
         for j in 0..ncols.value() {
             for i in 0..nrows.value() {
@@ -645,7 +652,8 @@ impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
     {
         let (nrows, ncols) = self.data.shape();
 
-        let mut res: MatrixMN<N3, R, C> = unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, ncols) };
+        let mut res: MatrixMN<N3, R, C> =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, ncols) };
 
         assert_eq!(
             (nrows.value(), ncols.value()),
@@ -686,7 +694,8 @@ impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
     {
         let (nrows, ncols) = self.data.shape();
 
-        let mut res: MatrixMN<N4, R, C> = unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, ncols) };
+        let mut res: MatrixMN<N4, R, C> =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(nrows, ncols) };
 
         assert_eq!(
             (nrows.value(), ncols.value()),
@@ -1180,7 +1189,8 @@ impl<N: SimdComplexField, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S
         let (nrows, ncols) = self.data.shape();
 
         unsafe {
-            let mut res: MatrixMN<_, C, R> = crate::unimplemented_or_uninitialized_generic!(ncols, nrows);
+            let mut res: MatrixMN<_, C, R> =
+                crate::unimplemented_or_uninitialized_generic!(ncols, nrows);
             self.adjoint_to(&mut res);
 
             res
@@ -1321,7 +1331,8 @@ impl<N: Scalar, D: Dim, S: Storage<N, D, D>> SquareMatrix<N, D, S> {
         );
 
         let dim = self.data.shape().0;
-        let mut res: VectorN<N2, D> = unsafe { crate::unimplemented_or_uninitialized_generic!(dim, U1) };
+        let mut res: VectorN<N2, D> =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(dim, U1) };
 
         for i in 0..dim.value() {
             unsafe {
@@ -1448,7 +1459,8 @@ impl<N: Scalar + Zero, D: DimAdd<U1>, S: Storage<N, D>> Vector<N, D, S> {
     {
         let len = self.len();
         let hnrows = DimSum::<D, U1>::from_usize(len + 1);
-        let mut res: VectorN::<N, _> = unsafe { crate::unimplemented_or_uninitialized_generic!(hnrows, U1) };
+        let mut res: VectorN<N, _> =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(hnrows, U1) };
         res.generic_slice_mut((0, 0), self.data.shape())
             .copy_from(self);
         res[(len, 0)] = element;
@@ -1793,7 +1805,8 @@ impl<N: Scalar + ClosedAdd + ClosedSub + ClosedMul, R: Dim, C: Dim, S: Storage<N
                 // TODO: soooo ugly!
                 let nrows = SameShapeR::<R, R2>::from_usize(3);
                 let ncols = SameShapeC::<C, C2>::from_usize(1);
-                let mut res: MatrixCross<N, R, C, R2, C2> = crate::unimplemented_or_uninitialized_generic!(nrows, ncols);
+                let mut res: MatrixCross<N, R, C, R2, C2> =
+                    crate::unimplemented_or_uninitialized_generic!(nrows, ncols);
 
                 let ax = self.get_unchecked((0, 0));
                 let ay = self.get_unchecked((1, 0));
@@ -1817,7 +1830,8 @@ impl<N: Scalar + ClosedAdd + ClosedSub + ClosedMul, R: Dim, C: Dim, S: Storage<N
                 // TODO: ugly!
                 let nrows = SameShapeR::<R, R2>::from_usize(1);
                 let ncols = SameShapeC::<C, C2>::from_usize(3);
-                let mut res: MatrixCross<N, R, C, R2, C2> = crate::unimplemented_or_uninitialized_generic!(nrows, ncols);
+                let mut res: MatrixCross<N, R, C, R2, C2> =
+                    crate::unimplemented_or_uninitialized_generic!(nrows, ncols);
 
                 let ax = self.get_unchecked((0, 0));
                 let ay = self.get_unchecked((0, 1));

src/base/mod.rs

@@ -15,7 +15,8 @@ mod alias_slice;
 mod array_storage;
 mod cg;
 mod componentwise;
-#[macro_use] mod construction;
+#[macro_use]
+mod construction;
 mod construction_slice;
 mod conversion;
 mod edition;

src/base/ops.rs

@@ -573,7 +573,9 @@ where
 
     #[inline]
     fn mul(self, rhs: &'b Matrix<N, R2, C2, SB>) -> Self::Output {
-        let mut res = unsafe { crate::unimplemented_or_uninitialized_generic!(self.data.shape().0, rhs.data.shape().1) };
+        let mut res = unsafe {
+            crate::unimplemented_or_uninitialized_generic!(self.data.shape().0, rhs.data.shape().1)
+        };
         self.mul_to(rhs, &mut res);
         res
     }
@@ -682,7 +684,9 @@ where
         DefaultAllocator: Allocator<N, C1, C2>,
         ShapeConstraint: SameNumberOfRows<R1, R2>,
     {
-        let mut res = unsafe { crate::unimplemented_or_uninitialized_generic!(self.data.shape().1, rhs.data.shape().1) };
+        let mut res = unsafe {
+            crate::unimplemented_or_uninitialized_generic!(self.data.shape().1, rhs.data.shape().1)
+        };
 
         self.tr_mul_to(rhs, &mut res);
         res
@@ -697,7 +701,9 @@ where
         DefaultAllocator: Allocator<N, C1, C2>,
         ShapeConstraint: SameNumberOfRows<R1, R2>,
     {
-        let mut res = unsafe { crate::unimplemented_or_uninitialized_generic!(self.data.shape().1, rhs.data.shape().1) };
+        let mut res = unsafe {
+            crate::unimplemented_or_uninitialized_generic!(self.data.shape().1, rhs.data.shape().1)
+        };
 
         self.ad_mul_to(rhs, &mut res);
         res
@@ -811,7 +817,9 @@ where
         let (nrows1, ncols1) = self.data.shape();
         let (nrows2, ncols2) = rhs.data.shape();
 
-        let mut res = unsafe { crate::unimplemented_or_uninitialized_generic!(nrows1.mul(nrows2), ncols1.mul(ncols2)) };
+        let mut res = unsafe {
+            crate::unimplemented_or_uninitialized_generic!(nrows1.mul(nrows2), ncols1.mul(ncols2))
+        };
 
         {
             let mut data_res = res.data.ptr_mut();

src/base/statistics.rs

@@ -17,7 +17,8 @@ impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
         DefaultAllocator: Allocator<N, U1, C>,
     {
         let ncols = self.data.shape().1;
-        let mut res: RowVectorN<N, C> = unsafe { crate::unimplemented_or_uninitialized_generic!(U1, ncols) };
+        let mut res: RowVectorN<N, C> =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(U1, ncols) };
 
         for i in 0..ncols.value() {
             // TODO: avoid bound checking of column.
@@ -42,7 +43,8 @@ impl<N: Scalar, R: Dim, C: Dim, S: Storage<N, R, C>> Matrix<N, R, C, S> {
         DefaultAllocator: Allocator<N, C>,
     {
         let ncols = self.data.shape().1;
-        let mut res: VectorN<N, C> = unsafe { crate::unimplemented_or_uninitialized_generic!(ncols, U1) };
+        let mut res: VectorN<N, C> =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(ncols, U1) };
 
         for i in 0..ncols.value() {
             // TODO: avoid bound checking of column.

src/geometry/point.rs

@@ -181,7 +181,12 @@ where
         D: DimNameAdd<U1>,
         DefaultAllocator: Allocator<N, DimNameSum<D, U1>>,
     {
-        let mut res = unsafe { crate::unimplemented_or_uninitialized_generic!(<DimNameSum<D, U1> as DimName>::name(), U1) };
+        let mut res = unsafe {
+            crate::unimplemented_or_uninitialized_generic!(
+                <DimNameSum<D, U1> as DimName>::name(),
+                U1
+            )
+        };
         res.fixed_slice_mut::<D, U1>(0, 0).copy_from(&self.coords);
         res[(D::dim(), 0)] = N::one();
 

src/geometry/point_construction.rs

@@ -24,7 +24,10 @@ where
     /// Creates a new point with uninitialized coordinates.
     #[inline]
     pub unsafe fn new_uninitialized() -> Self {
-        Self::from(crate::unimplemented_or_uninitialized_generic!(D::name(), U1))
+        Self::from(crate::unimplemented_or_uninitialized_generic!(
+            D::name(),
+            U1
+        ))
     }
 
     /// Creates a new point with all coordinates equal to zero.

src/linalg/bidiagonal.rs

@@ -81,7 +81,8 @@ where
             "Cannot compute the bidiagonalization of an empty matrix."
         );
 
-        let mut diagonal = unsafe { crate::unimplemented_or_uninitialized_generic!(min_nrows_ncols, U1) };
+        let mut diagonal =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(min_nrows_ncols, U1) };
         let mut off_diagonal =
             unsafe { crate::unimplemented_or_uninitialized_generic!(min_nrows_ncols.sub(U1), U1) };
         let mut axis_packed = unsafe { crate::unimplemented_or_uninitialized_generic!(ncols, U1) };
@@ -239,7 +240,8 @@ where
         let min_nrows_ncols = nrows.min(ncols);
 
         let mut res = Matrix::identity_generic(min_nrows_ncols, ncols);
-        let mut work = unsafe { crate::unimplemented_or_uninitialized_generic!(min_nrows_ncols, U1) };
+        let mut work =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(min_nrows_ncols, U1) };
         let mut axis_packed = unsafe { crate::unimplemented_or_uninitialized_generic!(ncols, U1) };
 
         let shift = self.axis_shift().1;

src/linalg/hessenberg.rs

@@ -48,7 +48,8 @@ where
 {
     /// Computes the Hessenberg decomposition using householder reflections.
     pub fn new(hess: MatrixN<N, D>) -> Self {
-        let mut work = unsafe { crate::unimplemented_or_uninitialized_generic!(hess.data.shape().0, U1) };
+        let mut work =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(hess.data.shape().0, U1) };
         Self::new_with_workspace(hess, &mut work)
     }
 
@@ -74,7 +75,8 @@ where
             "Hessenberg: invalid workspace size."
         );
 
-        let mut subdiag = unsafe { crate::unimplemented_or_uninitialized_generic!(dim.sub(U1), U1) };
+        let mut subdiag =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(dim.sub(U1), U1) };
 
         if dim.value() == 0 {
             return Hessenberg { hess, subdiag };

src/linalg/qr.rs

@@ -54,7 +54,8 @@ where
         let (nrows, ncols) = matrix.data.shape();
         let min_nrows_ncols = nrows.min(ncols);
 
-        let mut diag = unsafe { crate::unimplemented_or_uninitialized_generic!(min_nrows_ncols, U1) };
+        let mut diag =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(min_nrows_ncols, U1) };
 
         if min_nrows_ncols.value() == 0 {
             return QR { qr: matrix, diag };

src/linalg/schur.rs

@@ -71,7 +71,8 @@ where
     /// number of iteration is exceeded, `None` is returned. If `niter == 0`, then the algorithm
     /// continues indefinitely until convergence.
     pub fn try_new(m: MatrixN<N, D>, eps: N::RealField, max_niter: usize) -> Option<Self> {
-        let mut work = unsafe { crate::unimplemented_or_uninitialized_generic!(m.data.shape().0, U1) };
+        let mut work =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(m.data.shape().0, U1) };
 
         Self::do_decompose(m, &mut work, eps, max_niter, true)
             .map(|(q, t)| Schur { q: q.unwrap(), t })
@@ -378,7 +379,8 @@ where
     ///
     /// Return `None` if some eigenvalues are complex.
     pub fn eigenvalues(&self) -> Option<VectorN<N, D>> {
-        let mut out = unsafe { crate::unimplemented_or_uninitialized_generic!(self.t.data.shape().0, U1) };
+        let mut out =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(self.t.data.shape().0, U1) };
         if Self::do_eigenvalues(&self.t, &mut out) {
             Some(out)
         } else {
@@ -392,7 +394,8 @@ where
         N: RealField,
         DefaultAllocator: Allocator<NumComplex<N>, D>,
     {
-        let mut out = unsafe { crate::unimplemented_or_uninitialized_generic!(self.t.data.shape().0, U1) };
+        let mut out =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(self.t.data.shape().0, U1) };
         Self::do_complex_eigenvalues(&self.t, &mut out);
         out
     }
@@ -503,7 +506,8 @@ where
             "Unable to compute eigenvalues of a non-square matrix."
         );
 
-        let mut work = unsafe { crate::unimplemented_or_uninitialized_generic!(self.data.shape().0, U1) };
+        let mut work =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(self.data.shape().0, U1) };
 
         // Special case for 2x2 matrices.
         if self.nrows() == 2 {

src/linalg/symmetric_tridiagonal.rs

@@ -61,7 +61,8 @@ where
             "Unable to compute the symmetric tridiagonal decomposition of an empty matrix."
         );
 
-        let mut off_diagonal = unsafe { crate::unimplemented_or_uninitialized_generic!(dim.sub(U1), U1) };
+        let mut off_diagonal =
+            unsafe { crate::unimplemented_or_uninitialized_generic!(dim.sub(U1), U1) };
         let mut p = unsafe { crate::unimplemented_or_uninitialized_generic!(dim.sub(U1), U1) };
 
         for i in 0..dim.value() - 1 {