rcgal 0.2.2

Rust Computational Geometry Algorithms Library.
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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107

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

type OptionNodeRc<T> = Option<Rc<RefCell<ListNode<T>>>>;

#[derive(Debug, Clone)]
pub struct ListNode<T: Clone + Copy> {
    pub data: T,
    pub next: OptionNodeRc<T>,
    pub prev: OptionNodeRc<T>,
}

pub struct CircularDoubleLinkedList<T: Clone + Copy> {
    head: OptionNodeRc<T>,
    tail: OptionNodeRc<T>,
    length: usize,
}

impl<T: Clone + Copy> CircularDoubleLinkedList<T> {
    pub fn new() -> Self {
        Self {
            head: None,
            tail: None,
            length: 0,
        }
    }

    pub fn head(&self) -> OptionNodeRc<T> {
        self.head.clone()
    }

    pub fn tail(&self) -> OptionNodeRc<T> {
        self.tail.clone()
    }

    pub fn insert(&mut self, node: OptionNodeRc<T>, data: T) -> Rc<RefCell<ListNode<T>>> {
        match node {
            Some(node) => {
                let new_node = Rc::new(RefCell::new(ListNode {
                    data,
                    next: None,
                    prev: None,
                }));
                let next = node.borrow().next.clone();
                node.borrow_mut().next = Some(new_node.clone());
                new_node.borrow_mut().prev = Some(node.clone());
                new_node.borrow_mut().next = next.clone();
                next.unwrap().borrow_mut().prev = Some(new_node.clone());
                self.length += 1;
                if Rc::ptr_eq(&node, &self.tail().unwrap()) {
                    self.tail = Some(new_node.clone());
                }
                new_node
            }
            None => {
                let new_node = Rc::new(RefCell::new(ListNode {
                    data,
                    next: None,
                    prev: None,
                }));
                new_node.borrow_mut().next = Some(new_node.clone());
                new_node.borrow_mut().prev = Some(new_node.clone());
                self.head = Some(new_node.clone());
                self.tail = Some(new_node.clone());
                self.length += 1;
                new_node
            }
        }
    }

    pub fn delete(&mut self, node: OptionNodeRc<T>) {
        match node {
            Some(node) => {
                let prev = node.borrow().prev.clone();
                let next = node.borrow().next.clone();
                match (prev, next) {
                    (Some(prev), Some(next)) => {
                        prev.borrow_mut().next = Some(next.clone());
                        next.borrow_mut().prev = Some(prev.clone());
                    }
                    (Some(prev), None) => {
                        prev.borrow_mut().next = None;
                        self.tail = Some(prev.clone());
                    }
                    (None, Some(next)) => {
                        next.borrow_mut().prev = None;
                        self.head = Some(next.clone());
                    }
                    (None, None) => {
                        self.head = None;
                        self.tail = None;
                    }
                }
                if Rc::ptr_eq(&node, &self.head().unwrap()) {
                    self.head = node.borrow().next.clone();
                } else if Rc::ptr_eq(&node, &self.tail().unwrap()) {
                    self.tail = node.borrow().prev.clone();
                }
                self.length -= 1;
            }
            None => {}
        }
    }

    pub fn len(&self) -> usize {
        self.length
    }
}