sinistra 0.1.0-202603071957

A generic graph framework with pluggable storage and topology and streaming graph algorithms.
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

use crate::graph::Handle;

#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord, Hash, Debug)]
pub struct Checked<T: Handle>(T);

impl<T: Handle> Checked<T> {
    pub fn generation(handle: T) -> Option<Self> {
        if handle.generation() == 1 {
            return Some(Self(handle));
        }

        None
    }

    pub fn graph_and_generation(handle: T, graph: u32) -> Option<Self> {
        if handle.graph() == graph {
            return Self::generation(handle);
        }

        None
    }

    pub fn index(&self) -> usize {
        self.0.index()
    }

    pub fn into_inner(self) -> T {
        self.0
    }
}