perigee 0.7.0

A headless realtime 3D engine built with a focus on the web.
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

use serde::{Deserialize, Serialize};

/// A basic queue structure.
#[derive(Default, Serialize, Deserialize)]
pub struct Queue<T> {
    vec: Vec<T>,
}

impl<T> Queue<T> {
    pub fn new() -> Self {
        Queue { vec: Vec::new() }
    }

    pub fn with_capacity(cap: usize) -> Self {
        Queue {
            vec: Vec::with_capacity(cap),
        }
    }

    pub fn capacity(&self) -> usize {
        self.vec.capacity()
    }

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

    pub fn enqueue(&mut self, item: T) {
        self.vec.push(item)
    }

    pub fn dequeue(&mut self) -> T {
        self.vec.remove(0)
    }

    pub fn is_empty(&self) -> bool {
        self.vec.is_empty()
    }

    pub fn peek(&self) -> Option<&T> {
        self.vec.first()
    }
}

impl<T: PartialEq> PartialEq for Queue<T> {
    fn eq(&self, other: &Self) -> bool {
        PartialEq::eq(&self.vec, &other.vec)
    }
}

impl<T: PartialEq> PartialEq<Vec<T>> for Queue<T> {
    fn eq(&self, other: &Vec<T>) -> bool {
        PartialEq::eq(&self.vec, other)
    }
}

impl<T: Eq> Eq for Queue<T> {}