lightyear 0.3.0

Server-client networking library for the Bevy game engine
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

#[derive(Debug, Clone, Copy)]
pub struct FreeList<T: Sized, const N: usize> {
    len: usize,
    inner: [Option<T>; N],
}

pub struct FreeListIter<'a, T: Sized + Copy, const N: usize> {
    pub free_list: &'a FreeList<T, N>,
    pub index: usize,
}

impl<T: Sized + Copy, const N: usize> FreeList<T, N> {
    pub fn new() -> Self {
        Self {
            len: 0,
            inner: [None; N],
        }
    }
}

impl<T: Sized, const N: usize> FreeList<T, N> {
    pub fn len(&self) -> usize {
        self.len
    }
    pub fn insert(&mut self, value: T) -> usize {
        if self.len >= N {
            panic!("free list is full");
        }
        // Find the first empty slot, insert the value there, and return the index
        let index = self
            .inner
            .iter()
            .position(|x| x.is_none())
            .expect("len should be less than N");
        self.len += 1;
        self.inner[index] = Some(value);
        index
    }

    pub fn remove(&mut self, index: usize) {
        if self.inner[index].is_some() {
            self.len -= 1;
            self.inner[index] = None;
        }
    }

    pub fn get(&self, index: usize) -> Option<&T> {
        self.inner.get(index).and_then(Option::as_ref)
    }

    pub fn get_mut(&mut self, index: usize) -> Option<&mut T> {
        self.inner.get_mut(index).and_then(Option::as_mut)
    }

    pub fn iter(&self) -> FreeListIter<'_, T, N>
    where
        T: Copy,
    {
        FreeListIter {
            free_list: self,
            index: 0,
        }
    }
}

impl<T: Sized, const N: usize> std::ops::Index<usize> for FreeList<T, N> {
    type Output = T;

    fn index(&self, index: usize) -> &Self::Output {
        self.get(index).expect("index out of bounds")
    }
}

impl<T: Sized, const N: usize> std::ops::IndexMut<usize> for FreeList<T, N> {
    fn index_mut(&mut self, index: usize) -> &mut Self::Output {
        self.get_mut(index).expect("index out of bounds")
    }
}

impl<'a, T: Sized + Copy, const N: usize> Iterator for FreeListIter<'a, T, N> {
    type Item = (usize, T);

    fn next(&mut self) -> Option<Self::Item> {
        while self.index < N {
            let index = self.index;
            self.index += 1;
            if let Some(value) = self.free_list.get(index) {
                return Some((index, *value));
            }
        }
        None
    }
}