ciclo 0.1.0

Exhaustive cycle enumeration.
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164

use std::fmt::Debug;

#[derive(Debug, PartialEq, Hash, Eq)]
pub struct Cycle<T>(Vec<T>);

impl<T: PartialOrd + Debug> Cycle<T> {
    pub fn new(nodes: Vec<T>) -> Self {
        let rotation = rotation(&nodes);
        let rotated = rotate(nodes, rotation);
        let flipped = if &rotated[1] > rotated.last().expect("last") {
            flip(rotated)
        } else {
            rotated
        };

        Self(flipped)
    }
}

fn rotation<T: PartialOrd + Debug>(nodes: &Vec<T>) -> usize {
    let mut iter = nodes.iter().rev().enumerate();
    let (mut index, mut value) = iter.next().expect("");

    while let Some((i, v)) = iter.next() {
        if v < &value {
            value = v;
            index = i
        }
    }

    if index == nodes.len() - 1 {
        0
    } else {
        index + 1
    }
}

fn rotate<T: Debug>(mut nodes: Vec<T>, count: usize) -> Vec<T> {
    let mut result = Vec::new();

    for _ in 0..count {
        result.push(nodes.pop().expect(""));
    }

    result.reverse();
    result.append(&mut nodes);

    result
}

fn flip<T: Debug>(mut nodes: Vec<T>) -> Vec<T> {
    let mut stack = Vec::new();

    for _ in 0..(nodes.len() - 1) {
        stack.push(nodes.pop().expect(""))
    }

    println!("stack {:?}", stack);

    nodes.append(&mut stack);

    nodes
}

#[cfg(test)]
mod rotate {
    use super::*;
    use pretty_assertions::assert_eq;

    #[test]
    fn zero() {
        let nodes = vec![0, 1, 2];

        assert_eq!(rotate(nodes, 0), vec![0, 1, 2])
    }

    #[test]
    fn one() {
        let nodes = vec![0, 1, 2];

        assert_eq!(rotate(nodes, 1), vec![2, 0, 1])
    }

    #[test]
    fn two() {
        let nodes = vec![1, 0, 2];

        assert_eq!(rotate(nodes, 2), vec![0, 2, 1])
    }

    #[test]
    fn foo() {
        let nodes = vec![1, 0, 2];

        assert_eq!(rotate(nodes, 2), vec![0, 2, 1])
    }
}

#[cfg(test)]
mod rotation {
    use super::*;
    use pretty_assertions::assert_eq;

    #[test]
    fn min_left() {
        let nodes = vec![0, 1, 2];

        assert_eq!(rotation(&nodes), 0)
    }

    #[test]
    fn min_middle() {
        let nodes = vec![1, 0, 2];

        assert_eq!(rotation(&nodes), 2)
    }

    #[test]
    fn min_right() {
        let nodes = vec![1, 2, 0];

        assert_eq!(rotation(&nodes), 1)
    }
}

#[cfg(test)]
mod flip {
    use super::*;
    use pretty_assertions::assert_eq;

    #[test]
    fn foo() {
        let nodes = vec![0, 2, 1];

        assert_eq!(flip(nodes), vec![0, 1, 2])
    }
}

#[cfg(test)]
mod new {
    use super::*;
    use pretty_assertions::assert_eq;

    #[test]
    fn no_rotate_no_flip() {
        let nodes = vec![0, 1, 2];

        assert_eq!(Cycle::new(nodes), Cycle(vec![0, 1, 2]))
    }

    #[test]
    fn rotate_no_flip() {
        let nodes = vec![2, 0, 1];

        assert_eq!(Cycle::new(nodes), Cycle(vec![0, 1, 2]))
    }

    #[test]
    fn no_rotate_flip() {
        let nodes = vec![0, 2, 1];

        assert_eq!(Cycle::new(nodes), Cycle(vec![0, 1, 2]))
    }
}