pub fn inverse(&self) -> Cycles {
        Cycles {
            // reverse the order of cycles and the elements of each cycle
            cycles: self
                .cycles
                .iter()
                .rev()
                .map(|x| x.iter().copied().rev().collect())
                .collect(),
        }
    }
/// Returns the decomposition of the inverse permutation.
///
/// Equivalent to `Permutation::from(self).inverse().cyclic_decomposition()`, but more
/// efficient since computing the inverse decomposition is trivial.
Returns the decomposition of the inverse permutation.
Equivalent to `Permutation::from(self).inverse().cyclic_decomposition()`, but more
efficient since computing the inverse decomposition is trivial.
Returns the decomposition of the inverse permutation . Equivalent to ` Permutation :: from ( self ) . inverse () . cyclic_decomposition () ` but more efficient since computing the inverse decomposition is trivial .
pub fn inverse(&self) -> Cycles {
        Cycles {
            // reverse the order of cycles and the elements of each cycle
            cycles: self
                .cycles
                .iter()
                .rev()
                .map(|x| x.iter().copied().rev().collect())
                .collect(),
        }
    }
pub fn inverse ( & self ) -> Cycles { Cycles { // reverse the order of cycles and the elements of each cycle cycles : self . cycles . iter ( ) . rev ( ) . map ( | x | x . iter ( ) . copied ( ) . rev ( ) . collect ( ) ) . collect ( ) , } }
Returns the decomposition of the inverse permutation.
Returns the decomposition of the inverse permutation .
&self
&self