src index.ts

Press n or j to go to the next uncovered block, b, p or k for the previous block.


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19  
 
 
1x
2x
 
 
3x
 
 
 
1x
 
 
 
5x
 
 
  // FIFO implementation
// @src https://basarat.gitbook.io/algorithms/datastructures/queue
 
export class Queue<T> {
    private store: T[] = [];
 
    public push(item: T): void {
        this.store.push(item);
    }
 
    public pop(): T | undefined {
        return this.store.shift();
    }
 
    public getData(): T[] {
        return this.store;
    }
}