predicates-tree 1.0.13

Render boolean-valued predicate functions results as a tree.
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

use predicates::prelude::*;
use predicates_tree::CaseTreeExt;

fn main() {
    let expected = 10;
    let actual = 15;
    let pred = predicates::ord::eq(expected);
    if let Some(case) = pred.find_case(false, &actual) {
        let tree = case.tree();
        println!("{tree}");
    }

    let expected = [1, 2, 3];
    let actual = 15;
    let pred = predicates::iter::in_iter(IntoIterator::into_iter(expected));
    if let Some(case) = pred.find_case(false, &actual) {
        let tree = case.tree();
        println!("{tree}");
    }

    let expected = "Hello
World!

Goodbye!";
    let actual = "Hello
Moon!

Goodbye!";
    let pred = predicates::ord::eq(expected);
    if let Some(case) = pred.find_case(false, &actual) {
        let tree = case.tree();
        println!("{tree}");
    }

    let expected = "Hello
World!

Goodbye!";
    let actual = "Hello
Moon!

Goodbye!";
    let pred = predicates::str::diff(expected);
    if let Some(case) = pred.find_case(false, actual) {
        let tree = case.tree();
        println!("{tree}");
    }
}