syncweb-core 0.1.1-alpha.7

delay-tolerant web surfing
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
119
120
121
122
123
124
125
126
127
128
129
130

use std::time::{Duration, SystemTime};

use syncweb_core::sort::{SortConfig, SortCriterion, SortEntry, Sorter};

fn entry_with(path: &str, niche: f64, frequency: u64, peers: usize, folder: &str) -> SortEntry {
    SortEntry::new(path)
        .with_folder(folder)
        .with_niche(niche)
        .with_frequency(frequency)
        .with_peers(peers)
}

fn sort_with(criterion: SortCriterion, entries: &mut [SortEntry]) {
    let mut config = SortConfig::default();
    config.criteria = vec![(criterion, true)];
    Sorter::new(config).sort(entries);
}

#[test]
fn test_niche_sort() {
    let mut entries = vec![
        entry_with("common.txt", 0.1, 10, 5, "f"),
        entry_with("rare.txt", 0.9, 1, 1, "f"),
        entry_with("medium.txt", 0.5, 5, 3, "f"),
    ];
    sort_with(SortCriterion::Niche, &mut entries);

    let paths: Vec<_> = entries.into_iter().map(|e| e.path).collect();
    assert_eq!(
        paths,
        vec![
            std::path::PathBuf::from("rare.txt"),
            std::path::PathBuf::from("medium.txt"),
            std::path::PathBuf::from("common.txt"),
        ]
    );
}

#[test]
fn test_frecency_sort() {
    let mut entries = vec![
        SortEntry::new("stale.txt")
            .with_folder("f")
            .with_frequency(1)
            .with_modified(SystemTime::now() - Duration::new(2_592_000, 0)),
        SortEntry::new("fresh.txt")
            .with_folder("f")
            .with_frequency(1)
            .with_modified(SystemTime::now()),
        SortEntry::new("frequent.txt")
            .with_folder("f")
            .with_frequency(100)
            .with_modified(SystemTime::now() - Duration::new(86_400, 0)),
    ];
    sort_with(SortCriterion::Frecency, &mut entries);

    let paths: Vec<_> = entries.into_iter().map(|e| e.path).collect();
    assert_eq!(
        paths,
        vec![
            std::path::PathBuf::from("frequent.txt"),
            std::path::PathBuf::from("fresh.txt"),
            std::path::PathBuf::from("stale.txt"),
        ]
    );
}

#[test]
fn test_peers_sort() {
    let mut entries = vec![
        entry_with("lonely.txt", 0.0, 0, 0, "f"),
        entry_with("popular.txt", 0.0, 0, 10, "f"),
        entry_with("mid.txt", 0.0, 0, 5, "f"),
    ];
    sort_with(SortCriterion::Peers, &mut entries);

    let paths: Vec<_> = entries.into_iter().map(|e| e.path).collect();
    assert_eq!(
        paths,
        vec![
            std::path::PathBuf::from("popular.txt"),
            std::path::PathBuf::from("mid.txt"),
            std::path::PathBuf::from("lonely.txt"),
        ]
    );
}

#[test]
fn test_random_sort() {
    let mut entries = vec![
        entry_with("a.txt", 0.0, 0, 0, "f"),
        entry_with("b.txt", 0.0, 0, 0, "f"),
        entry_with("c.txt", 0.0, 0, 0, "f"),
        entry_with("d.txt", 0.0, 0, 0, "f"),
        entry_with("e.txt", 0.0, 0, 0, "f"),
    ];

    let original_order: Vec<_> = entries.iter().map(|e| e.path.clone()).collect();
    sort_with(SortCriterion::Random, &mut entries);
    let shuffled_order: Vec<_> = entries.iter().map(|e| e.path.clone()).collect();

    // Verify all entries are still present (just reordered)
    assert_eq!(shuffled_order.len(), original_order.len());
    let mut sorted_original = original_order;
    sorted_original.sort();
    let mut sorted_shuffled = shuffled_order;
    sorted_shuffled.sort();
    assert_eq!(sorted_original, sorted_shuffled);
}

#[test]
fn test_folder_aggregate() {
    let mut entries = vec![
        entry_with("a/1.txt", 0.0, 0, 0, "alpha"),
        entry_with("a/2.txt", 0.0, 0, 0, "alpha"),
        entry_with("a/3.txt", 0.0, 0, 0, "alpha"),
        entry_with("b/1.txt", 0.0, 0, 0, "beta"),
        entry_with("c/1.txt", 0.0, 0, 0, "gamma"),
        entry_with("c/2.txt", 0.0, 0, 0, "gamma"),
    ];
    sort_with(SortCriterion::FolderAggregate, &mut entries);

    let folders: Vec<_> = entries.iter().map(|e| e.folder.as_str()).collect();
    let alpha_count = folders.iter().filter(|&&f| f == "alpha").count();
    let gamma_count = folders.iter().filter(|&&f| f == "gamma").count();
    let beta_count = folders.iter().filter(|&&f| f == "beta").count();

    assert!(alpha_count >= gamma_count, "alpha (3) should come before gamma (2)");
    assert!(gamma_count >= beta_count, "gamma (2) should come before beta (1)");
}