trellis-core 0.1.2

Deterministic reactive resource graph core types.
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

use crate::{GraphError, GraphResult, NodeId};
use std::collections::BTreeSet;

/// Deterministic list of explicit node dependencies.
#[derive(Clone, Debug, Default, Eq, PartialEq)]
pub struct DependencyList {
    nodes: Vec<NodeId>,
}

impl DependencyList {
    /// Creates a dependency list, rejecting duplicate node ids.
    pub fn new(nodes: impl IntoIterator<Item = NodeId>) -> GraphResult<Self> {
        let mut seen = BTreeSet::new();
        let mut ordered = Vec::new();

        for node in nodes {
            if !seen.insert(node) {
                return Err(GraphError::DuplicateDependency(node));
            }
            ordered.push(node);
        }

        Ok(Self { nodes: ordered })
    }

    /// Creates an empty dependency list.
    pub fn empty() -> Self {
        Self { nodes: Vec::new() }
    }

    /// Returns dependencies in declared order.
    pub fn as_slice(&self) -> &[NodeId] {
        &self.nodes
    }

    /// Returns true when the list contains no dependencies.
    pub fn is_empty(&self) -> bool {
        self.nodes.is_empty()
    }
}

impl IntoIterator for DependencyList {
    type Item = NodeId;
    type IntoIter = std::vec::IntoIter<NodeId>;

    fn into_iter(self) -> Self::IntoIter {
        self.nodes.into_iter()
    }
}