importunate 0.1.3

Methods for returning random elements from an iterator.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

use core::marker::PhantomData;

use crate::{inner::Inner, Permutation};

/// Decomposes permutations into disjoint cycles.
#[derive(Clone, Debug, PartialEq, Eq, Hash, Ord, PartialOrd)]
#[must_use]
pub struct Decomposer<I: Inner, const ELEMENTS: usize> {
    array: [u8; ELEMENTS],
    index: u8,
    phantom: PhantomData<I>,
}

impl<I: Inner, const ELEMENTS: usize> Iterator for Decomposer<I, ELEMENTS> {
    type Item = Permutation<I, ELEMENTS>;

    fn next(&mut self) -> Option<Self::Item> {
        while let Some(x) = self.array.get(self.index as usize) {
            let mut x1 = *x;
            let mut i = self.index;
            self.index += 1;
            if x1 != i {
                let mut arr = Permutation::<I, ELEMENTS>::DEFAULT_ARRAY;

                while i != x1 {
                    arr[i as usize] = x1;
                    self.array[i as usize] = i;
                    i = x1;
                    x1 = self.array[i as usize];
                }
                let perm = Permutation::<I, ELEMENTS>::calculate_unchecked(arr, |x| *x);
                return Some(perm);
            }
        }
        None
    }
}

impl<I: Inner, const ELEMENTS: usize> From<Permutation<I, ELEMENTS>> for Decomposer<I, ELEMENTS> {
    fn from(perm: Permutation<I, ELEMENTS>) -> Self {
        Self {
            array: perm.get_array(),
            index: 0,
            phantom: core::marker::PhantomData,
        }
    }
}