relay-knowledge 1.1.16

Graph-database-based knowledge graph project.
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

//! Direct tests for watcher content-hash caching.

use super::*;

#[test]
fn detects_new_file_as_changed() {
    let mut cache = ContentHashCache::new(100);
    assert!(
        cache
            .check_and_update(PathBuf::from("a.rs"), b"hello")
            .changed
    );
}

#[test]
fn detects_unchanged_file_as_not_changed() {
    let mut cache = ContentHashCache::new(100);
    cache.check_and_update(PathBuf::from("a.rs"), b"hello");
    assert!(
        !cache
            .check_and_update(PathBuf::from("a.rs"), b"hello")
            .changed
    );
}

#[test]
fn detects_modified_file_as_changed() {
    let mut cache = ContentHashCache::new(100);
    cache.check_and_update(PathBuf::from("a.rs"), b"hello");
    assert!(
        cache
            .check_and_update(PathBuf::from("a.rs"), b"world")
            .changed
    );
}

#[test]
fn returns_stable_content_hash_for_same_bytes() {
    let mut cache = ContentHashCache::new(100);
    let first = cache.check_and_update(PathBuf::from("a.rs"), b"hello");
    let second = cache.check_and_update(PathBuf::from("a.rs"), b"hello");
    assert_eq!(first.hash, second.hash);
    assert!(!second.changed);
}

#[test]
fn evicts_when_at_capacity() {
    let mut cache = ContentHashCache::new(2);
    cache.check_and_update(PathBuf::from("a.rs"), b"a");
    cache.check_and_update(PathBuf::from("b.rs"), b"b");
    cache.check_and_update(PathBuf::from("c.rs"), b"c");
    assert_eq!(cache.len(), 2);
}

#[test]
fn remove_clears_entry() {
    let mut cache = ContentHashCache::new(100);
    cache.check_and_update(PathBuf::from("a.rs"), b"a");
    let key = PathBuf::from("a.rs");
    cache.remove(&key);
    assert!(cache.is_empty());
}

#[test]
fn clear_empties_all_entries() {
    let mut cache = ContentHashCache::new(100);
    cache.check_and_update(PathBuf::from("a.rs"), b"a");
    cache.check_and_update(PathBuf::from("b.rs"), b"b");
    cache.clear();
    assert!(cache.is_empty());
}

#[test]
fn update_at_capacity_replaces_existing_without_eviction() {
    let mut cache = ContentHashCache::new(2);
    cache.check_and_update(PathBuf::from("a.rs"), b"a");
    cache.check_and_update(PathBuf::from("b.rs"), b"b");
    assert!(!cache.check_and_update(PathBuf::from("a.rs"), b"a").changed);
    assert_eq!(cache.len(), 2);
}

#[test]
fn evicts_in_insertion_order() {
    let mut cache = ContentHashCache::new(2);
    cache.check_and_update(PathBuf::from("a.rs"), b"a");
    cache.check_and_update(PathBuf::from("b.rs"), b"b");
    cache.check_and_update(PathBuf::from("c.rs"), b"c");
    assert_eq!(cache.len(), 2);
    assert!(cache.check_and_update(PathBuf::from("a.rs"), b"a").changed);
    assert_eq!(cache.len(), 2);
}

#[test]
fn zero_capacity_tracks_no_entries() {
    let mut cache = ContentHashCache::new(0);
    let observation = cache.check_and_update(PathBuf::from("a.rs"), b"a");
    assert!(observation.changed);
    assert_ne!(observation.hash, 0);
    assert!(cache.is_empty());
}