fast-tlsh 0.1.1

Library to generate / parse / compare TLSH locality sensitive hashes
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

// SPDX-License-Identifier: Apache-2.0 OR MIT
// SPDX-FileCopyrightText: Copyright (C) 2024 Tsukasa OI <floss_ssdeep@irq.a4lg.com>.

//! Tests: `crate::compare::utils`.

#![cfg(test)]

use std::collections::hash_map::Entry;
use std::collections::HashMap;

use crate::compare::utils::generic;

#[test]
fn mod_diff_16() {
    for y in 0..16u8 {
        for x in 0..16u8 {
            // Constant implementation matches with the generic implementation.
            assert_eq!(
                super::distance_on_ring_mod(x, y, 16),
                generic::distance_on_ring_mod(x, y, 16)
            );
            // The function is symmetric.
            assert_eq!(
                super::distance_on_ring_mod(x, y, 16),
                super::distance_on_ring_mod(y, x, 16)
            );
            // mod_diff(x, y, 16) in u8 works as expected.
            assert_eq!(
                generic::distance_on_ring_mod(x, y, 16) as u16,
                generic::distance_on_ring_mod(x as u16, y as u16, 16)
            );
        }
    }
}

#[test]
fn mod_diff_16_dependency() {
    let mut values = HashMap::<u8, u8>::new();
    for y in 0..16u8 {
        for x in 0..16u8 {
            // mod_diff(x, y, 16) only depends on the wrapped difference % 16.
            let diff = x.wrapping_sub(y) % 16;
            let dist = super::distance_on_ring_mod(x, y, 16);
            match values.entry(diff) {
                Entry::Occupied(e) => {
                    assert_eq!(*(e.get()), dist);
                }
                Entry::Vacant(e) => {
                    e.insert(dist);
                }
            }
        }
    }
}

#[test]
fn mod_diff_16_max() {
    assert_eq!(
        (0..16u8)
            .map(|x| super::distance_on_ring_mod(x, 0, 16))
            .max(),
        Some(0x08),
    );
}

#[test]
fn mod_diff_256() {
    for y in u8::MIN..=u8::MAX {
        for x in u8::MIN..=u8::MAX {
            // Constant implementation matches with the generic implementation.
            assert_eq!(
                super::distance_on_ring_mod(x, y, 0),
                generic::distance_on_ring_mod(x, y, 0)
            );
            // The function is symmetric.
            assert_eq!(
                super::distance_on_ring_mod(x, y, 0),
                super::distance_on_ring_mod(y, x, 0)
            );
            // mod_diff(x as u16, y as u16, 256) (where x and y u8)
            // equals distance_on_ring_mod::<u8>(x, y, 0).
            assert_eq!(
                generic::distance_on_ring_mod(x, y, 0) as u16,
                generic::distance_on_ring_mod(x as u16, y as u16, 256)
            );
        }
    }
}

#[test]
fn mod_diff_256_dependency() {
    let mut values = HashMap::<u8, u8>::new();
    for y in u8::MIN..=u8::MAX {
        for x in u8::MIN..=u8::MAX {
            // mod_diff(x, y, 256) only depends on the wrapped difference.
            let diff = x.wrapping_sub(y);
            let dist = super::distance_on_ring_mod(x, y, 0);
            match values.entry(diff) {
                Entry::Occupied(e) => {
                    assert_eq!(*(e.get()), dist);
                }
                Entry::Vacant(e) => {
                    e.insert(dist);
                }
            }
        }
    }
}

#[test]
fn mod_diff_256_max() {
    assert_eq!(
        (u8::MIN..=u8::MAX)
            .map(|x| super::distance_on_ring_mod(x, 0, 0))
            .max(),
        Some(0x80),
    );
}