quarkrs 0.1.1

A collection of small life improvements for rust.
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

use super::thead_data::ThreadData;

struct GraphNode<T> {
    value: T,
    arcs: Vec<ThreadData<GraphNode<T>>>
}

impl<T> GraphNode<T> {
    pub fn new(val: T) -> GraphNode<T> {
        GraphNode { 
            value: val, 
            arcs: vec![]
        }
    }

    fn new_struct(val: T) -> ThreadData<GraphNode<T>> {
        ThreadData::new(GraphNode::new(val))
    }

    pub fn add_arc(&mut self, val: T) {
        self.arcs.push(GraphNode::new_struct(val))
    } 

    pub fn get_node(&self, val: T){todo!()}

}


pub struct UnweightedGraph<T> {
    entry: ThreadData<GraphNode<T>>,
}

impl<T> UnweightedGraph<T>  {
    // fn get_node(&self, val: T) -> Option<GraphNode<T>> {
    //     let mut select = self.entry.clone();

    //     // loop {
    //     //     match select.try_read_access() {
    //     //         Some(read) => {
    //     //             todo!()
    //     //         },
    //     //         None => todo!(),
    //     //     }
    //     // }
    // }

    pub fn insert(&mut self, value: T, parent: T) {todo!()}

    pub fn add_undirected_arc(&self, link_a: T, link_b: T) {todo!()}

    pub fn add_directed_arc(&self, from: T, to: T) {todo!()}

    pub fn contains(&self, value: T) -> bool {todo!()}

    pub fn remove(&self, value: T) -> bool {todo!()}

    pub fn update(&self, old: T, new: T) -> bool {todo!()}

}