harsh 0.2.2

Hashids implementation for Rust
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

use harsh::Harsh;

const NUMBERS: [u64; 3] = [1, 2, 3];

#[test]
fn bad_alphabet() {
    test_alphabet("cCsSfFhHuUiItT01", "should work with the worst alphabet");
}

#[test]
fn separators_alphabet() {
    test_alphabet(
        "abdegjklCFHISTUc",
        "should work with half the alphabet being separators",
    );
}

#[test]
fn two_separators() {
    test_alphabet(
        "abdegjklmnopqrSF",
        "should work with exactly two separators",
    );
}

#[test]
fn no_separators() {
    test_alphabet(
        "abdegjklmnopqrvwxyzABDEGJKLMNOPQRVWXYZ1234567890",
        "should work with no separators",
    );
}

#[test]
fn long_alphabet() {
    test_alphabet(
        "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ1234567890`~!@#$%^&*()-_=+\\|'\";:/?.>,<{[}]",
        "should work with super-long alphabet",
    );
}

#[test]
fn weird_alphabet() {
    test_alphabet(
        "`~!@#$%^&*()-_=+\\|'\";:/?.>,<{[}]",
        "should work with a weird alphabet",
    );
}

fn test_alphabet(alphabet: &str, message: &str) {
    let harsh = Harsh::builder().alphabet(alphabet).build().unwrap();
    let encoded = harsh.encode(&NUMBERS);
    let decoded = harsh.decode(encoded).unwrap();

    assert_eq!(NUMBERS, &decoded[..], "{}", message);
}