tailcall 1.0.1

Safe, zero-cost tail recursion
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

use tailcall::*;

/// Factorial artificial wrapped in a Option
fn factorial(input: u64) -> Option<u64> {
    #[tailcall]
    fn factorial_inner(accumulator: Option<u64>, input: Option<u64>) -> Option<u64> {
        let inp = input?;
        let acc = accumulator?;
        if inp > 0 {
            factorial_inner(Some(acc * inp), Some(inp - 1))
        } else {
            Some(acc)
        }
    }

    factorial_inner(Some(1), Some(input))
}

#[tailcall]
#[allow(dead_code)]
fn add_iter<'a, I>(mut int_iter: I, accum: i32) -> Option<i32>
where
    I: Iterator<Item = &'a i32>,
{
    match int_iter.next() {
        Some(i) => add_iter(int_iter, accum + i),
        None => Some(accum),
    }
}

#[test]
fn factorial_option_runs() {
    assert_eq!(factorial(0).unwrap(), 1);
    assert_eq!(factorial(1).unwrap(), 1);
    assert_eq!(factorial(2).unwrap(), 2);
    assert_eq!(factorial(3).unwrap(), 6);
    assert_eq!(factorial(4).unwrap(), 24);
}