dsalgo 0.3.10

A package for Datastructures and 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
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

use std::{
    cell::RefCell,
    rc::{
        Rc,
        Weak,
    },
};

use crate::new_rc_refcell::new_rc_refcell;

pub struct Node<T> {
    pub value: T,
    pub from: Vec<Weak<RefCell<Node<T>>>>,
    pub to: Vec<Rc<RefCell<Node<T>>>>,
}

impl<T> Node<T> {
    pub(crate) fn new(value: T) -> Self {
        Self { value, from: Vec::new(), to: Vec::new() }
    }

    pub fn new_rc_refcell(value: T) -> Rc<RefCell<Self>> {
        new_rc_refcell(Self::new(value))
    }

    pub fn connect(
        lhs: &Rc<RefCell<Self>>,
        rhs: &Rc<RefCell<Self>>,
    ) {
        lhs.borrow_mut().to.push(rhs.clone());

        rhs.borrow_mut().from.push(Rc::downgrade(lhs));
    }
}

impl<T: std::fmt::Debug> std::fmt::Debug for Node<T> {
    fn fmt(
        &self,
        f: &mut std::fmt::Formatter,
    ) -> std::fmt::Result {
        write!(
            f,
            r#"Node {{
    value: {:?},
    from: [...] {} nodes,
    to: [...] {} nodes,
}}"#,
            self.value,
            self.from.len(),
            self.to.len(),
        )
    }
}

#[cfg(test)]

mod tests {

    use super::*;

    #[test]

    fn test() {
        #[derive(Debug)]

        pub struct Data {
            pub id: usize,
        }

        type V = Node<Data>;

        let a = V::new_rc_refcell(Data { id: 1 });

        let b = V::new_rc_refcell(Data { id: 2 });

        V::connect(&a, &b);

        dbg!(&a.borrow());

        dbg!(&b.borrow());

        V::connect(&b, &a);

        dbg!(&a.borrow());

        dbg!(&b.borrow());
    }
}