algorithmify 0.1.1

Create specifications for algorithms defined using Rust code
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

use algorithmify::{Expression, Interpreter};
use algorithmify_macros::define_function_builder;

#[test]
fn addition_test() {
    #[define_function_builder]
    fn addition() -> i32 {
        let mut a = 1;
        a = a + 2;
        a
    }

    let expression = Interpreter::execute_function(addition__function_builder()).unwrap();

    assert_eq!(addition(), 3);
    assert_eq!(expression, 3.into());
}

#[test]
fn substraction_test() {
    #[define_function_builder]
    fn substraction() -> i32 {
        let mut a = 6;
        a = a - 2;
        a
    }

    let expression = Interpreter::execute_function(substraction__function_builder()).unwrap();

    assert_eq!(substraction(), 4);
    assert_eq!(expression, 4.into());
}

#[test]
fn multiplication_test() {
    #[define_function_builder]
    fn multiplication() -> i32 {
        let mut a = 3;
        a = a * 2;
        a
    }

    let expression = Interpreter::execute_function(multiplication__function_builder()).unwrap();

    assert_eq!(multiplication(), 6);
    assert_eq!(expression, 6.into());
}

#[test]
fn division_test() {
    #[define_function_builder]
    fn division() -> i32 {
        let mut a = 6;
        a = a / 2;
        a
    }

    let expression = Interpreter::execute_function(division__function_builder()).unwrap();

    assert_eq!(division(), 3);
    assert_eq!(expression, 3.into());
}

#[test]
fn parametherized_expression_test() {
    #[define_function_builder]
    fn parametherized_expression() -> i32 {
        let mut a = 6;
        a = 3 + ((a / 2) * 2) + 3;
        a
    }

    let expression =
        Interpreter::execute_function(parametherized_expression__function_builder()).unwrap();

    assert_eq!(parametherized_expression(), 12);
    assert_eq!(expression, 12.into());
}

#[test]
fn operator_precedence_test() {
    #[define_function_builder]
    fn operator_precedence() -> i32 {
        let mut a = 6;
        a = 3 + a / 2 * 2 + 3;
        a
    }

    let expression =
        Interpreter::execute_function(operator_precedence__function_builder()).unwrap();

    assert_eq!(operator_precedence(), 12);
    assert_eq!(expression, 12.into());
}

#[test]
fn boolean_logic_test() {
    #[define_function_builder]
    fn boolean_logic_true() -> bool {
        let a = 6;
        let eq = a == 6;
        let ne = a != 5;
        let cmp = 23 > 6 && 11 < 23 && 5 <= 6 && 5 >= 3;

        (eq && ne && cmp) || false
    }

    let expression = Interpreter::execute_function(boolean_logic_true__function_builder()).unwrap();

    assert_eq!(boolean_logic_true(), true);
    assert_eq!(expression, Expression::Bool(true));

    #[define_function_builder]
    fn boolean_logic_false() -> bool {
        let a = 6;
        let eq = a == 6;
        let ne = a != 6;
        let cmp = 23 > 6 && 11 < 23 && 5 <= 6 && 5 >= 3;

        (eq && ne && cmp) || false
    }

    let expression =
        Interpreter::execute_function(boolean_logic_false__function_builder()).unwrap();

    assert_eq!(boolean_logic_false(), false);
    assert_eq!(expression, Expression::Bool(false));
}