dprint-core 0.41.0

Core rust library for dprint.
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

#[cfg(feature = "tracing")]
thread_local! {
    static GRAPH_NODE_COUNTER: super::super::utils::CounterCell = super::super::utils::CounterCell::new();
}

#[derive(Clone)]
pub struct GraphNode<'a, T> {
    item: T,
    previous: Option<&'a GraphNode<'a, T>>,
    #[cfg(feature = "tracing")]
    pub graph_node_id: usize,
}

impl<'a, T> GraphNode<'a, T> {
    pub fn new(item: T, previous: Option<&'a GraphNode<'a, T>>) -> GraphNode<'a, T> {
        GraphNode {
            item,
            previous,
            #[cfg(feature = "tracing")]
            graph_node_id: GRAPH_NODE_COUNTER.with(|counter| counter.increment()),
        }
    }

    #[cfg(any(feature = "tracing", debug_assertions))]
    pub fn borrow_item(&self) -> &T {
        &self.item
    }

    pub fn borrow_previous(&self) -> &Option<&'a GraphNode<'a, T>> {
        &self.previous
    }
}

impl<'a, T> IntoIterator for &'a GraphNode<'a, T> {
    type Item = &'a T;
    type IntoIter = GraphNodeIterator<'a, T>;

    fn into_iter(self) -> Self::IntoIter {
        GraphNodeIterator {
            node: Some(self),
        }
    }
}

pub struct GraphNodeIterator<'a, T> {
    node: Option<&'a GraphNode<'a, T>>,
}

impl<'a, T> GraphNodeIterator<'a, T> {
    pub fn empty() -> GraphNodeIterator<'a, T> {
        GraphNodeIterator {
            node: None,
        }
    }
}

impl<'a, T> Iterator for GraphNodeIterator<'a, T> {
    type Item = &'a T;

    fn next(&mut self) -> Option<&'a T> {
        match self.node.take() {
            Some(node) => {
                self.node = node.previous;
                Some(&node.item)
            },
            None => None
        }
    }
}