bee-common 0.5.0

Common utilities used across the bee framework
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

// Copyright 2020-2021 IOTA Stiftung
// SPDX-License-Identifier: Apache-2.0

use bee_common::ord;

#[test]
fn is_unique_sorted_empty() {
    assert!(ord::is_unique_sorted(Vec::<()>::new().iter()));
}

#[test]
fn is_unique_sorted() {
    assert!(ord::is_unique_sorted(vec![0, 1, 2, 3, 4, 5, 6, 7, 8, 9].iter()));
}

#[test]
fn is_unique_not_sorted() {
    assert!(!ord::is_unique_sorted(vec![0, 1, 3, 2, 4, 5, 6, 7, 8, 9].iter()));
}

#[test]
fn is_not_unique_sorted() {
    assert!(!ord::is_unique_sorted(vec![0, 1, 1, 2, 3, 4, 5, 6, 7, 8].iter()));
}

#[test]
fn is_sorted_empty() {
    assert!(ord::is_sorted(Vec::<()>::new().iter()));
}

#[test]
fn is_sorted() {
    assert!(ord::is_sorted(vec![0, 1, 2, 3, 4, 5, 6, 7, 8, 9].iter()));
}

#[test]
fn is_not_sorted() {
    assert!(!ord::is_sorted(vec![0, 1, 3, 2, 4, 5, 6, 7, 8, 9].iter()));
}

#[test]
fn is_sorted_not_unique() {
    assert!(ord::is_sorted(vec![0, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9].iter()));
}

#[test]
fn vec_is_sorted() {
    assert!(ord::is_sorted(
        vec![
            vec![0, 1, b'a', 2, 3, 4, 5, 6, 7, 8, 9],
            vec![0, 1, b'b', 2, 3, 4, 5, 6, 7, 8, 9],
        ]
        .iter()
    ));
}

#[test]
fn vec_is_not_sorted() {
    assert!(!ord::is_sorted(
        vec![
            vec![0, 1, b'b', 2, 3, 4, 5, 6, 7, 8, 9],
            vec![0, 1, b'a', 2, 3, 4, 5, 6, 7, 8, 9],
        ]
        .iter()
    ));
}