-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathqueue.rs
More file actions
71 lines (56 loc) · 1.3 KB
/
Copy pathqueue.rs
File metadata and controls
71 lines (56 loc) · 1.3 KB
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
/*!
* queue.rs
*
* Description: Queue implemenation in Rust
*
* Author: Int Main
* Created: <Date created>
*
* Modified By: <Name of person modifying the file>
* Last Modified: <Date of last modification>
*/
// Rest of the code goes here...
struct Queue {
queue: Vec<i32>,
}
impl Queue {
fn new() -> Queue {
Queue { queue: Vec::new() }
}
fn is_empty(&self) -> bool {
self.queue.is_empty()
}
fn enqueue(&mut self, item: i32) {
self.queue.push(item);
}
fn dequeue(&mut self) -> Option<i32> {
if self.is_empty() {
return None;
}
Some(self.queue.remove(0))
}
fn peek(&self) -> Option<i32> {
self.queue.first().cloned()
}
fn size(&self) -> usize {
self.queue.len()
}
}
fn main()
{
let mut queue = Queue::new();
queue.enqueue(10);
queue.enqueue(20);
queue.enqueue(30);
println!("Size of queue: {}", queue.size());
println!("Front of the queue is: {}", queue.peek().unwrap());
queue.enqueue(40);
queue.enqueue(50);
queue.enqueue(60);
println!("Size of queue: {}", queue.size());
while let Some(item) = queue.dequeue()
{
println!("Dequeued item: {}", item);
}
println!("Is queue empty: {}", queue.is_empty());
}