algorist 0.10.2

Algorithms and data structures for competitive programming
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

pub trait TupleTransform<F, R>
where
    Self: Sized,
    F: FnOnce(Self) -> R,
{
    fn transform(self, f: F) -> R;
}

impl<F, R, T, U> TupleTransform<F, R> for (T, U)
where
    F: FnOnce(Self) -> R,
{
    fn transform(self, f: F) -> R {
        f(self)
    }
}

impl<F, R, T, U, V> TupleTransform<F, R> for (T, U, V)
where
    F: FnOnce(Self) -> R,
{
    fn transform(self, f: F) -> R {
        f(self)
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_tuple_transform() {
        let (a, b) = (1, 2).transform(|(x, y)| (y, x));
        assert_eq!((a, b), (2, 1));

        let (a, b, c) = (1i64, 2, 3).transform(|(x, y, z)| (z, y, x));
        assert_eq!((a, b, c), (3, 2, 1));

        let (a, b, c) = (1i64, 2i32, "sdf").transform(|(x, y, z)| (z, x, y));
        assert_eq!((a, b, c), ("sdf", 1, 2));
    }
}