UNPKG

dist-javascript-algorithms-and-data-structures

Version:

Algorithms and data-structures implemented on JavaScript

84 lines (81 loc) 4.09 kB
"use strict"; var _SegmentTree = _interopRequireDefault(require("../SegmentTree")); function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; } describe('SegmentTree', () => { it('should build tree for input array #0 with length of power of two', () => { const array = [-1, 2]; const segmentTree = new _SegmentTree.default(array, Math.min, Infinity); expect(segmentTree.segmentTree).toEqual([-1, -1, 2]); expect(segmentTree.segmentTree.length).toBe(2 * array.length - 1); }); it('should build tree for input array #1 with length of power of two', () => { const array = [-1, 2, 4, 0]; const segmentTree = new _SegmentTree.default(array, Math.min, Infinity); expect(segmentTree.segmentTree).toEqual([-1, -1, 0, -1, 2, 4, 0]); expect(segmentTree.segmentTree.length).toBe(2 * array.length - 1); }); it('should build tree for input array #0 with length not of power of two', () => { const array = [0, 1, 2]; const segmentTree = new _SegmentTree.default(array, Math.min, Infinity); expect(segmentTree.segmentTree).toEqual([0, 0, 2, 0, 1, null, null]); expect(segmentTree.segmentTree.length).toBe(2 * 4 - 1); }); it('should build tree for input array #1 with length not of power of two', () => { const array = [-1, 3, 4, 0, 2, 1]; const segmentTree = new _SegmentTree.default(array, Math.min, Infinity); expect(segmentTree.segmentTree).toEqual([-1, -1, 0, -1, 4, 0, 1, -1, 3, null, null, 0, 2, null, null]); expect(segmentTree.segmentTree.length).toBe(2 * 8 - 1); }); it('should build max array', () => { const array = [-1, 2, 4, 0]; const segmentTree = new _SegmentTree.default(array, Math.max, -Infinity); expect(segmentTree.segmentTree).toEqual([4, 2, 4, -1, 2, 4, 0]); expect(segmentTree.segmentTree.length).toBe(2 * array.length - 1); }); it('should build sum array', () => { const array = [-1, 2, 4, 0]; const segmentTree = new _SegmentTree.default(array, (a, b) => a + b, 0); expect(segmentTree.segmentTree).toEqual([5, 1, 4, -1, 2, 4, 0]); expect(segmentTree.segmentTree.length).toBe(2 * array.length - 1); }); it('should do min range query on power of two length array', () => { const array = [-1, 3, 4, 0, 2, 1]; const segmentTree = new _SegmentTree.default(array, Math.min, Infinity); expect(segmentTree.rangeQuery(0, 5)).toBe(-1); expect(segmentTree.rangeQuery(0, 2)).toBe(-1); expect(segmentTree.rangeQuery(1, 3)).toBe(0); expect(segmentTree.rangeQuery(2, 4)).toBe(0); expect(segmentTree.rangeQuery(4, 5)).toBe(1); expect(segmentTree.rangeQuery(2, 2)).toBe(4); }); it('should do min range query on not power of two length array', () => { const array = [-1, 2, 4, 0]; const segmentTree = new _SegmentTree.default(array, Math.min, Infinity); expect(segmentTree.rangeQuery(0, 4)).toBe(-1); expect(segmentTree.rangeQuery(0, 1)).toBe(-1); expect(segmentTree.rangeQuery(1, 3)).toBe(0); expect(segmentTree.rangeQuery(1, 2)).toBe(2); expect(segmentTree.rangeQuery(2, 3)).toBe(0); expect(segmentTree.rangeQuery(2, 2)).toBe(4); }); it('should do max range query', () => { const array = [-1, 3, 4, 0, 2, 1]; const segmentTree = new _SegmentTree.default(array, Math.max, -Infinity); expect(segmentTree.rangeQuery(0, 5)).toBe(4); expect(segmentTree.rangeQuery(0, 1)).toBe(3); expect(segmentTree.rangeQuery(1, 3)).toBe(4); expect(segmentTree.rangeQuery(2, 4)).toBe(4); expect(segmentTree.rangeQuery(4, 5)).toBe(2); expect(segmentTree.rangeQuery(3, 3)).toBe(0); }); it('should do sum range query', () => { const array = [-1, 3, 4, 0, 2, 1]; const segmentTree = new _SegmentTree.default(array, (a, b) => a + b, 0); expect(segmentTree.rangeQuery(0, 5)).toBe(9); expect(segmentTree.rangeQuery(0, 1)).toBe(2); expect(segmentTree.rangeQuery(1, 3)).toBe(7); expect(segmentTree.rangeQuery(2, 4)).toBe(6); expect(segmentTree.rangeQuery(4, 5)).toBe(3); expect(segmentTree.rangeQuery(3, 3)).toBe(0); }); });