node js javascript queue implementation example data structure

queue.js

console.time('queue');

const assert = require('assert'); // for tests

class Queue {
  constructor() {
    this.list = []
  }
  isEmpty() {
    return !this.list.length;
  }
  size() {
    return this.list.length;
  }
  front() {
    return this.list[0];
  }
  dequeue() {
    return this.list.pop();
  }
  enqueue(element) {
    return this.list.push(element);
  }
  toString() {
    return this.list.toString();
  }
  toArray() {
      return [...this.list];
  }
}

const queue = new Queue();
console.log('%O', queue);

assert.equal(queue.enqueue(1), 1);
assert.equal(queue.enqueue(2), 2);

assert.deepEqual(queue.toArray(), [1,2]);
assert.deepEqual(queue.toString(), '1,2');
assert.equal(queue.size(), 2);

assert.equal(queue.front(), 1);
assert.equal(queue.dequeue(), 2);

assert.equal(queue.front(), 1);
assert.equal(queue.dequeue(), 1);

assert.equal(queue.isEmpty(), true);
assert.equal(queue.size(), 0);

console.timeEnd('queue');

// node queue.js