pub fn reciprocal(&self) -> Self {
        // FIXME: *strictly speaking* this violates the invariant that 'inverse'
        //        is uniquely determined by 'matrix', which our PartialEq
        //        relies on.
        Self {
            matrix: Arc::new(self.inverse.t()),
            inverse: Arc::new(self.matrix.t()),
        }
    }
// for dead-code elimination of matrices we don't use
for dead-code elimination of matrices we don't use
for dead - code elimination of matrices we don ' t use
pub fn reciprocal(&self) -> Self {
        // FIXME: *strictly speaking* this violates the invariant that 'inverse'
        //        is uniquely determined by 'matrix', which our PartialEq
        //        relies on.
        Self {
            matrix: Arc::new(self.inverse.t()),
            inverse: Arc::new(self.matrix.t()),
        }
    }
pub fn reciprocal ( & self ) -> Self { // FIXME: *strictly speaking* this violates the invariant that 'inverse' //        is uniquely determined by 'matrix', which our PartialEq //        relies on. Self { matrix : Arc :: new ( self . inverse . t ( ) ) , inverse : Arc :: new ( self . matrix . t ( ) ) , } }
for dead-code elimination of matrices we don't use
for dead - code elimination of matrices we don ' t use
&self
&self