-
Notifications
You must be signed in to change notification settings - Fork 0
/
queue.ts
42 lines (35 loc) · 1007 Bytes
/
queue.ts
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
/** A queue data structure, with first-in-first-out functionality. */
export default class Queue {
collection: any[] = [];
/** Adds an element to the end of the queue. */
enqueue(element: any): void {
this.collection.push(element);
}
/** Returns the element at the front of the queue, leaving it in place. */
front(): any {
return this.collection[0];
}
/** Removes and returns the element at the front of the queue. */
dequeue(): any {
return this.collection.shift();
}
/** Returns the number of elements in the queue. */
size(): number {
return this.collection.length;
}
/** Returns whether or not the queue is currently empty. */
isEmpty(): boolean {
return this.collection.length === 0;
}
/** Clears the contents of the queue. */
clear(): void {
this.collection = [];
}
/**
* Prints the queue to the console as an array with elements ordered from
* front to end.
*/
print(): void {
console.log(this.collection);
}
}