rnacos 0.8.3

Nacos server re-implemented in 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
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
108
109
110
111
112
113
114
115
116
117
118
119
120

#[derive(Debug)]
pub struct CycleQueue<T> {
    capacity: usize,
    array: Vec<Option<T>>,
    head: usize,
    tail: usize,
}

impl<T: ToOwned<Owned = T>> CycleQueue<T> {
    pub fn new(count: usize) -> Self {
        let capacity = count + 1;
        let mut array = Vec::with_capacity(capacity.to_owned());
        for _ in 0..capacity {
            array.push(None);
        }
        Self {
            capacity,
            array,
            head: 0,
            tail: 0,
        }
    }

    fn uidx(&self, i: usize) -> usize {
        if i < self.capacity {
            i
        } else {
            i - self.capacity
        }
    }

    pub fn is_empty(&self) -> bool {
        self.head == self.tail
    }

    pub fn is_full(&self) -> bool {
        self.uidx(self.tail + 1) == self.head
    }

    pub fn pushback(&mut self, item: T) -> Option<T> {
        let cell = self.array.get_mut(self.tail).unwrap();
        *cell = Some(item);
        let is_full = self.is_full();
        self.tail = self.uidx(self.tail + 1);
        if is_full {
            let cell = self.array.get_mut(self.head).unwrap();
            let v = cell.as_ref().map(|e| e.to_owned());
            *cell = None;
            self.head = self.uidx(self.head + 1);
            v
        } else {
            None
        }
    }

    pub fn push(&mut self, item: T) {
        let cell = self.array.get_mut(self.tail).unwrap();
        *cell = Some(item);
        let is_full = self.is_full();
        self.tail = self.uidx(self.tail + 1);
        if is_full {
            let cell = self.array.get_mut(self.head).unwrap();
            *cell = None;
            self.head = self.uidx(self.head + 1);
        }
    }

    pub fn remove_front(&mut self) -> Option<T> {
        if self.is_empty() {
            None
        } else {
            let cell = self.array.get_mut(self.head).unwrap();
            let v = cell.as_ref().map(|e| e.to_owned());
            *cell = None;
            self.head = self.uidx(self.head + 1);
            v
        }
    }

    pub fn len(&self) -> usize {
        if self.tail < self.head {
            self.capacity + self.tail - self.head
        } else {
            self.tail - self.head
        }
    }

    pub fn seek(&self) -> Option<&T> {
        if self.is_empty() {
            return None;
        }
        self.array.get(self.head).unwrap().as_ref()
    }

    pub fn get(&self, index: usize) -> Option<&T> {
        if self.is_empty() {
            return None;
        }
        let idx = self.uidx(self.head + index);
        self.array.get(idx).unwrap().as_ref()
    }
}

#[cfg(test)]
mod tests {
    use super::CycleQueue;

    #[test]
    fn iter() {
        let mut queue: CycleQueue<u32> = CycleQueue::new(50);
        for i in 0..151 {
            queue.push(i);
        }
        assert_eq!(queue.remove_front(), Some(101));
        for i in 0..queue.len() {
            let v = queue.get(i);
            println!("item: {:?}", &v);
        }
    }
}