fn forward_unsorted<T>(&self, items: &mut [(usize, T)]) {
        debug_assert!(items.iter().all(|&(i, _)| i < self.len()));

        for (i, _) in items {
            Permutation::forward(self, i)
        }
    }
/// Apply the forward permutation to each of the elements.
///
/// Used when permutations get applied repeatedly, then sorting can be done manually after only
/// once.
///
/// # Arguments
///
/// * `items`: Slice of `(index, value)` tuples that will be mutated in place. Does not need to
/// be sorted.
Apply the forward permutation to each of the elements.
Used when permutations get applied repeatedly, then sorting can be done manually after only
once.
Apply the forward permutation to each of the elements . Used when permutations get applied repeatedly then sorting can be done manually after only once .
fn forward_unsorted<T>(&self, items: &mut [(usize, T)]) {
        debug_assert!(items.iter().all(|&(i, _)| i < self.len()));
        for (i, _) in items {
            Permutation::forward(self, i)
        }
    }
fn forward_unsorted < T > ( & self , items : & mut [ ( usize , T ) ] ) { debug_assert ! ( items iter ( ) all ( ( i ) i self len ( ) ) ) ; for ( i , _ ) in items { Permutation :: forward ( self , i ) } }
Apply the forward permutation to each of the elements.
Apply the forward permutation to each of the elements .
&self
items
&mut [(usize, T)]
&self
items
&mut [(usize, T)]