linkrs-storage 0.1.0

Storage engine with CSR and memory-mapped containers
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

use linkrs_core::StorageError;

/// Vertex cursor backed by a pre-materialized `Vec<Vertex>`.
///
/// This is the default implementation used when the storage backend does
/// not yet provide a native lazy cursor.  It is semantically identical
/// to calling [`StorageReader::scan_vertices`] upfront.
#[derive(Debug)]
pub struct VecVertexCursor {
    iter: std::vec::IntoIter<linkrs_core::Vertex>,
}

impl VecVertexCursor {
    pub fn new(vertices: Vec<linkrs_core::Vertex>) -> Self {
        Self {
            iter: vertices.into_iter(),
        }
    }
}

impl crate::cursor::VertexCursor for VecVertexCursor {
    fn next_batch(&mut self, batch_size: usize) -> Result<Vec<linkrs_core::Vertex>, StorageError> {
        Ok(self.iter.by_ref().take(batch_size).collect())
    }
}

/// Edge cursor backed by a pre-materialized `Vec<Edge>`.
#[derive(Debug)]
pub struct VecEdgeCursor {
    iter: std::vec::IntoIter<linkrs_core::Edge>,
}

impl VecEdgeCursor {
    pub fn new(edges: Vec<linkrs_core::Edge>) -> Self {
        Self {
            iter: edges.into_iter(),
        }
    }
}

impl crate::cursor::EdgeCursor for VecEdgeCursor {
    fn next_batch(&mut self, batch_size: usize) -> Result<Vec<linkrs_core::Edge>, StorageError> {
        Ok(self.iter.by_ref().take(batch_size).collect())
    }
}