diskann-disk 0.50.1

DiskANN is a fast approximate nearest neighbor search library for high dimensional data
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

/*
 * Copyright (c) Microsoft Corporation.
 * Licensed under the MIT license.
 */

#[derive(Debug, Clone)]
pub enum Progress {
    Completed,
    Processed(usize /* items processed */),
}

impl Progress {
    pub fn map(self, f: impl Fn(usize) -> usize) -> Progress {
        match self {
            Progress::Completed => Progress::Completed,
            Progress::Processed(progress) => Progress::Processed(f(progress)),
        }
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_progress_map_processed() {
        let progress = Progress::Processed(10);
        let mapped = progress.map(|n| n * 2);
        match mapped {
            Progress::Processed(n) => assert_eq!(n, 20),
            _ => panic!("Expected Processed variant"),
        }
    }

    #[test]
    fn test_progress_map_completed() {
        let progress = Progress::Completed;
        let mapped = progress.map(|n| n * 2);
        match mapped {
            Progress::Completed => {}
            _ => panic!("Expected Completed variant"),
        }
    }
}