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 20 21 22 23 24 25 | 1x 1x 1x 1x 1x 1x 5x 5x 5x 6x 6x 5x 5x 1x 1x 5x 5x 8x 8x 5x 5x 2x 2x 5x | import { isEmpty } from "@jga/arrays";
// FIFO implementation
// @src https://basarat.gitbook.io/algorithms/datastructures/queue
export class Queue<Element> {
private readonly store: Element[] = [];
public push(item: Element): number {
return this.store.push(item);
}
public pop(): Element | undefined {
return this.store.shift();
}
public size(): number {
return this.store.length;
}
public peek(): Element | undefined {
return isEmpty(this.store) ? undefined : this.store[0];
}
}
|