disk-based-bfs 0.1.0

Fast generic implementation of breadth-first search using disk storage, suitable for extremely large implicit graphs.
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

pub(crate) struct AvailableUpdateBlock {
    updates: Vec<u32>,
}

impl AvailableUpdateBlock {
    pub(crate) fn new(capacity: usize) -> Self {
        Self {
            updates: Vec::with_capacity(capacity),
        }
    }

    pub(crate) fn into_fillable(
        self,
        source_depth: usize,
        source_chunk_idx: usize,
    ) -> FillableUpdateBlock {
        FillableUpdateBlock {
            updates: self.updates,
            source_depth,
            source_chunk_idx,
        }
    }
}

pub(crate) struct FillableUpdateBlock {
    updates: Vec<u32>,

    // Depth and index of the chunk that these updates were generated from
    source_depth: usize,
    source_chunk_idx: usize,
}

impl FillableUpdateBlock {
    pub(crate) fn into_filled(self, depth: usize, chunk_idx: usize) -> FilledUpdateBlock {
        FilledUpdateBlock {
            updates: self.updates,
            depth,
            chunk_idx,
            source_depth: self.source_depth,
            source_chunk_idx: self.source_chunk_idx,
        }
    }

    pub(crate) fn source_depth(&self) -> usize {
        self.source_depth
    }

    pub(crate) fn source_chunk_idx(&self) -> usize {
        self.source_chunk_idx
    }

    pub(crate) fn push(&mut self, update: u32) {
        self.updates.push(update);
    }

    pub(crate) fn len(&self) -> usize {
        self.updates.len()
    }

    pub(crate) fn capacity(&self) -> usize {
        self.updates.capacity()
    }
}

pub(crate) struct FilledUpdateBlock {
    updates: Vec<u32>,
    depth: usize,
    chunk_idx: usize,
    source_depth: usize,
    source_chunk_idx: usize,
}

impl FilledUpdateBlock {
    pub(crate) fn clear(mut self) -> AvailableUpdateBlock {
        self.updates.clear();

        AvailableUpdateBlock {
            updates: self.updates,
        }
    }

    pub(crate) fn source_depth(&self) -> usize {
        self.source_depth
    }

    pub(crate) fn source_chunk_idx(&self) -> usize {
        self.source_chunk_idx
    }

    pub(crate) fn len(&self) -> usize {
        self.updates.len()
    }

    pub(crate) fn is_empty(&self) -> bool {
        self.updates.is_empty()
    }

    pub(crate) fn updates(&self) -> &[u32] {
        &self.updates
    }

    pub(crate) fn depth(&self) -> usize {
        self.depth
    }

    pub(crate) fn chunk_idx(&self) -> usize {
        self.chunk_idx
    }
}