plant 0.1.0

Tree data structures.
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

// Copyright (C) 2018-2019 Boyu Yang
//
// Licensed under the Apache License, Version 2.0 <LICENSE-APACHE or
// http://www.apache.org/licenses/LICENSE-2.0> or the MIT license
// <LICENSE-MIT or http://opensource.org/licenses/MIT>, at your
// option. This file may not be copied, modified, or distributed
// except according to those terms.

use super::full;

#[test]
fn is_left_or_right() {
    let test_data = vec![(true, vec![1, 3, 5, 7, 9]), (false, vec![2, 4, 6, 8, 10])];
    for (is_left, inputs) in test_data {
        for input in inputs {
            if is_left {
                assert!(full::is_left(input));
                assert!(!full::is_right(input));
            } else {
                assert!(!full::is_left(input));
                assert!(full::is_right(input));
            }
        }
    }
}

#[test]
#[should_panic]
fn is_left_panic() {
    let _ = full::is_left(0);
}

#[test]
#[should_panic]
fn is_right_panic() {
    let _ = full::is_right(0);
}