dist-javascript-algorithms-and-data-structures/dist/data-structures/priority-queue/__test__/PriorityQueue.test.js

Algorithms and data-structures implemented on JavaScript

"use strict";

var _PriorityQueue = _interopRequireDefault(require("../PriorityQueue"));

function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }

describe('PriorityQueue', () => {
  it('should create default priority queue', () => {
    const priorityQueue = new _PriorityQueue.default();
    expect(priorityQueue).toBeDefined();
  });
  it('should insert items to the queue and respect priorities', () => {
    const priorityQueue = new _PriorityQueue.default();
    priorityQueue.add(10, 1);
    expect(priorityQueue.peek()).toBe(10);
    priorityQueue.add(5, 2);
    expect(priorityQueue.peek()).toBe(10);
    priorityQueue.add(100, 0);
    expect(priorityQueue.peek()).toBe(100);
  });
  it('should poll from queue with respect to priorities', () => {
    const priorityQueue = new _PriorityQueue.default();
    priorityQueue.add(10, 1);
    priorityQueue.add(5, 2);
    priorityQueue.add(100, 0);
    priorityQueue.add(200, 0);
    expect(priorityQueue.poll()).toBe(100);
    expect(priorityQueue.poll()).toBe(200);
    expect(priorityQueue.poll()).toBe(10);
    expect(priorityQueue.poll()).toBe(5);
  });
  it('should be possible to change priority of internal nodes', () => {
    const priorityQueue = new _PriorityQueue.default();
    priorityQueue.add(10, 1);
    priorityQueue.add(5, 2);
    priorityQueue.add(100, 0);
    priorityQueue.add(200, 0);
    priorityQueue.changePriority(100, 10);
    priorityQueue.changePriority(10, 20);
    expect(priorityQueue.poll()).toBe(200);
    expect(priorityQueue.poll()).toBe(5);
    expect(priorityQueue.poll()).toBe(100);
    expect(priorityQueue.poll()).toBe(10);
  });
  it('should be possible to change priority of head node', () => {
    const priorityQueue = new _PriorityQueue.default();
    priorityQueue.add(10, 1);
    priorityQueue.add(5, 2);
    priorityQueue.add(100, 0);
    priorityQueue.add(200, 0);
    priorityQueue.changePriority(200, 10);
    priorityQueue.changePriority(10, 20);
    expect(priorityQueue.poll()).toBe(100);
    expect(priorityQueue.poll()).toBe(5);
    expect(priorityQueue.poll()).toBe(200);
    expect(priorityQueue.poll()).toBe(10);
  });
  it('should be possible to change priority along with node addition', () => {
    const priorityQueue = new _PriorityQueue.default();
    priorityQueue.add(10, 1);
    priorityQueue.add(5, 2);
    priorityQueue.add(100, 0);
    priorityQueue.add(200, 0);
    priorityQueue.changePriority(200, 10);
    priorityQueue.changePriority(10, 20);
    priorityQueue.add(15, 15);
    expect(priorityQueue.poll()).toBe(100);
    expect(priorityQueue.poll()).toBe(5);
    expect(priorityQueue.poll()).toBe(200);
    expect(priorityQueue.poll()).toBe(15);
    expect(priorityQueue.poll()).toBe(10);
  });
  it('should be possible to search in priority queue by value', () => {
    const priorityQueue = new _PriorityQueue.default();
    priorityQueue.add(10, 1);
    priorityQueue.add(5, 2);
    priorityQueue.add(100, 0);
    priorityQueue.add(200, 0);
    priorityQueue.add(15, 15);
    expect(priorityQueue.hasValue(70)).toBe(false);
    expect(priorityQueue.hasValue(15)).toBe(true);
  });
});