queue 0.3.1

Simple wrapper around Vec to provide a FIFO queue.
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
121
122
123
124
125
126
127
128
129
130

use super::*;

#[test]
fn from_vec() {
	let q = Queue::from(vec![1, 2, 3]);
	assert_eq!(&vec![1, 2, 3], q.vec());
}

#[test]
fn from_empty_vec() {
	let v: Vec<i64> = Vec::new();
	let q = Queue::from(v.clone());
	assert_eq!(&v, q.vec());
}

#[test]
fn queue() {
	let mut q = Queue::new();
	assert_eq!(q.queue("hello"), Ok(1));
}

#[test]
fn dequeue() {
	let mut q = Queue::new();
	q.queue("hello").unwrap();
	assert_eq!(q.dequeue(), Some("hello"));
}

#[test]
fn dequeue_empty() {
	let mut q: Queue<i64> = Queue::new();
	assert_eq!(q.dequeue(), None);
}

#[test]
fn no_capacity() {
	let q: Queue<u8> = Queue::new();
	assert_eq!(q.capacity(), None);
}

#[test]
fn some_capacity() {
	let q: Queue<u8> = Queue::with_capacity(12);
	assert_eq!(q.capacity(), Some(12));
}

#[test]
fn queue_full_capacity() {
	let mut q: Queue<u8> = Queue::with_capacity(0);
	assert_eq!(q.queue(3), Err(()));
}

#[test]
fn vec_empty() {
	let q: Queue<i64> = Queue::new();
	let v: Vec<i64> = Vec::new();
	assert_eq!(&v, q.vec());
}

#[test]
fn vec_some() {
	let mut q = Queue::new();
	q.queue(1).unwrap();
	q.queue(2).unwrap();
	q.queue(3).unwrap();
	let v = vec![1, 2, 3];
	assert_eq!(&v, q.vec());
}

#[test]
fn peek_at_empty() {
	let q: Queue<u8> = Queue::with_capacity(1);
	assert_eq!(q.peek(), None);
}

#[test]
fn peek_at_something() {
	let mut q = Queue::new();
	q.queue(1).unwrap();
	assert_eq!(q.peek(), Some(1));
}

#[test]
fn force_queue_with_capacity() {
	let mut q: Queue<u8> = Queue::with_capacity(1);
	q.queue(1).unwrap();
	let _ = q.force_queue(2);
	assert_eq!(q.peek(), Some(2));
}

#[test]
fn force_queue_with_capacity_check_size() {
	let mut q = Queue::with_capacity(1);
	q.queue(1).unwrap();
	assert_eq!(1, q.force_queue(2));
}

#[test]
fn force_queue_no_capacity() {
	let mut q = Queue::new();
	q.queue(1).unwrap();
	assert_eq!(2, q.force_queue(2));
}

#[test]
fn no_len() {
	let q: Queue<u8> = Queue::new();
	assert_eq!(q.len(), 0);
}

#[test]
fn some_len() {
	let mut q = Queue::new();
	q.queue(1).unwrap();
	q.queue(2).unwrap();
	assert_eq!(q.len(), 2);
}

#[test]
fn is_empty_empty() {
	let q: Queue<i64> = Queue::new();
	assert_eq!(q.is_empty(), true);
}

#[test]
fn is_empty_some() {
	let mut q = Queue::new();
	q.queue(1).unwrap();
	assert_eq!(q.is_empty(), false);
}