data-structure-typed 1.41.6 → 1.41.7

package/test/unit/data-structures/matrix/vector2d.test.ts

@@ -0,0 +1,171 @@
+import {Vector2D} from '../../../../src';
+
+describe('Vector2D', () => {
+  it('should create a vector with default values', () => {
+    const vector = new Vector2D();
+    expect(vector.x).toBe(0);
+    expect(vector.y).toBe(0);
+    expect(vector.w).toBe(1);
+  });
+
+  it('should correctly check if a vector is zero', () => {
+    const nonZeroVector = new Vector2D(3, 4);
+    const zeroVector = new Vector2D(0, 0);
+    expect(nonZeroVector.isZero).toBe(false);
+    expect(zeroVector.isZero).toBe(true);
+  });
+
+  it('should correctly calculate vector length', () => {
+    const vector = new Vector2D(3, 4);
+    expect(vector.length).toBe(5);
+  });
+
+  it('should correctly calculate squared vector length', () => {
+    const vector = new Vector2D(3, 4);
+    expect(vector.lengthSq).toBe(25);
+  });
+
+  it('should correctly round vector components', () => {
+    const vector = new Vector2D(3.6, 4.3);
+    const roundedVector = vector.rounded;
+    expect(roundedVector.x).toBe(4);
+    expect(roundedVector.y).toBe(4);
+  });
+
+  it('should correctly add two vectors', () => {
+    const vector1 = new Vector2D(2, 3);
+    const vector2 = new Vector2D(1, 2);
+    const result = Vector2D.add(vector1, vector2);
+    expect(result.x).toBe(3);
+    expect(result.y).toBe(5);
+  });
+
+  it('should correctly subtract two vectors', () => {
+    const vector1 = new Vector2D(4, 5);
+    const vector2 = new Vector2D(1, 2);
+    const result = Vector2D.subtract(vector1, vector2);
+    expect(result.x).toBe(3);
+    expect(result.y).toBe(3);
+  });
+
+  it('should correctly subtract value from a vector', () => {
+    const vector = new Vector2D(5, 7);
+    const result = Vector2D.subtractValue(vector, 3);
+    expect(result.x).toBe(2);
+    expect(result.y).toBe(4);
+  });
+
+  it('should correctly multiply a vector by a value', () => {
+    const vector = new Vector2D(2, 3);
+    const result = Vector2D.multiply(vector, 4);
+    expect(result.x).toBe(8);
+    expect(result.y).toBe(12);
+  });
+
+  it('should correctly divide a vector by a value', () => {
+    const vector = new Vector2D(6, 8);
+    const result = Vector2D.divide(vector, 2);
+    expect(result.x).toBe(3);
+    expect(result.y).toBe(4);
+  });
+
+  it('should correctly check if two vectors are equal', () => {
+    const vector1 = new Vector2D(3, 4);
+    const vector2 = new Vector2D(3, 4);
+    const vector3 = new Vector2D(4, 5);
+    expect(Vector2D.equals(vector1, vector2)).toBe(true);
+    expect(Vector2D.equals(vector1, vector3)).toBe(false);
+  });
+
+  it('should correctly check if two vectors are equal within a rounding factor', () => {
+    const vector1 = new Vector2D(3, 4);
+    const vector2 = new Vector2D(2.9, 3.9);
+    const vector3 = new Vector2D(4, 5);
+    expect(Vector2D.equalsRounded(vector1, vector2, 0.2)).toBe(true);
+    expect(Vector2D.equalsRounded(vector1, vector3, 0.2)).toBe(false);
+  });
+
+  it('should correctly normalize a vector', () => {
+    const vector = new Vector2D(3, 4);
+    const normalized = Vector2D.normalize(vector);
+    expect(normalized.x).toBeCloseTo(0.6);
+    expect(normalized.y).toBeCloseTo(0.8);
+  });
+
+  it('should correctly truncate a vector', () => {
+    const vector = new Vector2D(3, 4);
+    const truncated = Vector2D.truncate(vector, 4);
+    expect(truncated.length).toBeLessThanOrEqual(4);
+  });
+
+  it('should correctly get the perpendicular vector', () => {
+    const vector = new Vector2D(3, 4);
+    const perpendicular = Vector2D.perp(vector);
+    expect(Vector2D.dot(vector, perpendicular)).toBe(0);
+  });
+
+  it('should correctly reverse the vector', () => {
+    const vector = new Vector2D(3, 4);
+    const reversed = Vector2D.reverse(vector);
+    expect(reversed.x).toBe(-3);
+    expect(reversed.y).toBe(-4);
+  });
+
+  it('should correctly get the absolute vector', () => {
+    const vector = new Vector2D(-3, 4);
+    const absVector = Vector2D.abs(vector);
+    expect(absVector.x).toBe(3);
+    expect(absVector.y).toBe(4);
+  });
+
+  it('should correctly calculate the dot product of two vectors', () => {
+    const vector1 = new Vector2D(2, 3);
+    const vector2 = new Vector2D(4, 5);
+    const dotProduct = Vector2D.dot(vector1, vector2);
+    expect(dotProduct).toBe(23);
+  });
+
+  it('should correctly calculate the distance between two vectors', () => {
+    const vector1 = new Vector2D(1, 1);
+    const vector2 = new Vector2D(4, 5);
+    const distance = Vector2D.distance(vector1, vector2);
+    expect(distance).toBeCloseTo(5);
+  });
+
+  it('should correctly calculate the squared distance between two vectors', () => {
+    const vector1 = new Vector2D(1, 1);
+    const vector2 = new Vector2D(4, 5);
+    const distanceSq = Vector2D.distanceSq(vector1, vector2);
+    expect(distanceSq).toBe(25);
+  });
+
+  it('should correctly determine the sign of the cross product of two vectors', () => {
+    const vector1 = new Vector2D(2, 3);
+    const vector2 = new Vector2D(4, 5);
+    const sign = Vector2D.sign(vector1, vector2);
+    expect(sign).toBe(-1); // Assuming specific vector values, the result may vary
+  });
+
+  it('should correctly calculate the angle between a vector and the negative y-axis', () => {
+    const vector = new Vector2D(3, 4);
+    const angle = Vector2D.angle(vector);
+    expect(angle).toBeCloseTo(2.498091544796509, 3);
+  });
+
+  it('should create a random vector within the specified range', () => {
+    const maxX = 10;
+    const maxY = 10;
+    const randomVector = Vector2D.random(maxX, maxY);
+    expect(randomVector.x).toBeGreaterThanOrEqual(-maxX / 2);
+    expect(randomVector.x).toBeLessThanOrEqual(maxX / 2);
+    expect(randomVector.y).toBeGreaterThanOrEqual(-maxY / 2);
+    expect(randomVector.y).toBeLessThanOrEqual(maxY / 2);
+  });
+
+  it('should zero the vector components', () => {
+    const vector = new Vector2D(3, 4);
+    vector.zero();
+    expect(vector.x).toBe(0);
+    expect(vector.y).toBe(0);
+  });
+});

package/test/unit/data-structures/priority-queue/max-priority-queue.test.ts

@@ -0,0 +1,73 @@
+import {MaxPriorityQueue} from '../../../../src';
+
+describe('MaxPriorityQueue Operation Test', () => {
+  it('should add elements and maintain heap property', () => {
+    const priorityQueue = new MaxPriorityQueue<number>();
+
+    priorityQueue.add(5);
+    priorityQueue.add(3);
+    priorityQueue.add(7);
+    priorityQueue.add(1);
+
+    expect(priorityQueue.poll()).toBe(7);
+    expect(priorityQueue.poll()).toBe(5);
+    expect(priorityQueue.poll()).toBe(3);
+    expect(priorityQueue.poll()).toBe(1);
+  });
+
+  it('should add elements and maintain heap property in a object MaxPriorityQueue', () => {
+    const priorityQueue = new MaxPriorityQueue<{keyA: number}>({comparator: (a, b) => b.keyA - a.keyA});
+    priorityQueue.refill([{keyA: 5}, {keyA: 3}, {keyA: 1}]);
+    priorityQueue.add({keyA: 7});
+
+    expect(priorityQueue.poll()?.keyA).toBe(7);
+    expect(priorityQueue.poll()?.keyA).toBe(5);
+    expect(priorityQueue.poll()?.keyA).toBe(3);
+    expect(priorityQueue.poll()?.keyA).toBe(1);
+  });
+
+  it('should return and delete the smallest element', () => {
+    const priorityQueue = new MaxPriorityQueue<number>();
+    priorityQueue.add(5);
+    priorityQueue.add(3);
+    priorityQueue.add(7);
+
+    expect(priorityQueue.poll()).toBe(7);
+    expect(priorityQueue.poll()).toBe(5);
+    expect(priorityQueue.size).toBe(1);
+  });
+
+  it('should create a clone of the priority queue', () => {
+    const priorityQueue = new MaxPriorityQueue<number>();
+    priorityQueue.add(5);
+    priorityQueue.add(3);
+    priorityQueue.add(7);
+
+    const clone = priorityQueue.clone();
+    expect(clone.poll()).toBe(7);
+    expect(clone.poll()).toBe(5);
+    expect(clone.poll()).toBe(3);
+    expect(clone.isEmpty()).toBe(true);
+  });
+
+  it('should correctly heapify an array', () => {
+    const array = [5, 3, 7, 1];
+    const heap = MaxPriorityQueue.heapify<number>({nodes: array, comparator: (a, b) => b - a});
+    heap.refill(array);
+
+    expect(heap.poll()).toBe(7);
+    expect(heap.poll()).toBe(5);
+    expect(heap.poll()).toBe(3);
+    expect(heap.poll()).toBe(1);
+  });
+
+  it('should correctly heapify an object array', () => {
+    const nodes = [{keyA: 5}, {keyA: 3}, {keyA: 7}, {keyA: 1}];
+    const maxPQ = MaxPriorityQueue.heapify<{keyA: number}>({nodes: nodes, comparator: (a, b) => b.keyA - a.keyA});
+
+    expect(maxPQ.poll()?.keyA).toBe(7);
+    expect(maxPQ.poll()?.keyA).toBe(5);
+    expect(maxPQ.poll()?.keyA).toBe(3);
+    expect(maxPQ.poll()?.keyA).toBe(1);
+  });
+});

package/test/unit/data-structures/priority-queue/min-priority-queue.test.ts

@@ -0,0 +1,63 @@
+import {MinPriorityQueue} from '../../../../src';
+
+describe('MinPriorityQueue Operation Test', () => {
+  it('should check if a node exists in the queue', () => {
+    const priorityQueue = new MinPriorityQueue<number>();
+    priorityQueue.add(5);
+
+    expect(priorityQueue.has(5)).toBe(true);
+    expect(priorityQueue.has(3)).toBe(false);
+  });
+
+  it('should return the smallest element without removing it', () => {
+    const priorityQueue = new MinPriorityQueue<number>();
+    priorityQueue.add(5);
+    priorityQueue.add(3);
+    priorityQueue.add(7);
+
+    expect(priorityQueue.peek()).toBe(3);
+    expect(priorityQueue.size).toBe(3);
+  });
+
+  it('should return the last element', () => {
+    const priorityQueue = new MinPriorityQueue<number>();
+    priorityQueue.add(5);
+    priorityQueue.add(3);
+    priorityQueue.add(7);
+
+    expect(priorityQueue.leaf).toBe(7);
+  });
+
+  it('should check if the queue is empty', () => {
+    const priorityQueue = new MinPriorityQueue<number>();
+
+    expect(priorityQueue.isEmpty()).toBe(true);
+
+    priorityQueue.add(5);
+
+    expect(priorityQueue.isEmpty()).toBe(false);
+  });
+
+  it('should clear the queue', () => {
+    const priorityQueue = new MinPriorityQueue<number>();
+    priorityQueue.add(5);
+    priorityQueue.add(3);
+    priorityQueue.add(7);
+
+    priorityQueue.clear();
+
+    expect(priorityQueue.size).toBe(0);
+    expect(priorityQueue.isEmpty()).toBe(true);
+  });
+
+  it('should sort the elements', () => {
+    const priorityQueue = new MinPriorityQueue<number>();
+    priorityQueue.add(5);
+    priorityQueue.add(3);
+    priorityQueue.add(7);
+    priorityQueue.add(1);
+
+    const sortedArray = priorityQueue.sort();
+    expect(sortedArray).toEqual([1, 3, 5, 7]);
+  });
+});

package/test/unit/data-structures/priority-queue/priority-queue.test.ts

@@ -0,0 +1,53 @@
+import {PriorityQueue} from '../../../../src';
+import {getRandomInt} from '../../../utils';
+
+describe('PriorityQueue Operation Test', () => {
+  it('should PriorityQueue poll, pee, heapify, toArray work well', function () {
+    const minPQ = new PriorityQueue<number>({comparator: (a, b) => a - b});
+    minPQ.refill([5, 2, 3, 4, 6, 1]);
+    expect(minPQ.toArray()).toEqual([1, 2, 3, 4, 6, 5]);
+    minPQ.poll();
+    minPQ.poll();
+    minPQ.poll();
+    expect(minPQ.toArray()).toEqual([4, 5, 6]);
+    expect(minPQ.peek()).toBe(4);
+    expect(PriorityQueue.heapify({nodes: [3, 2, 1, 5, 6, 7, 8, 9, 10], comparator: (a, b) => a - b}).toArray()).toEqual(
+      [1, 2, 3, 5, 6, 7, 8, 9, 10]
+    );
+  });
+
+  it('should Max PriorityQueue poll, peek, heapify, toArray work well', function () {
+    const maxPriorityQueue = new PriorityQueue<number>({comparator: (a, b) => b - a});
+    maxPriorityQueue.refill([5, 2, 3, 4, 6, 1]);
+    expect(maxPriorityQueue.toArray()).toEqual([6, 5, 3, 4, 2, 1]);
+    maxPriorityQueue.poll();
+    maxPriorityQueue.poll();
+    maxPriorityQueue.poll();
+    expect(maxPriorityQueue.toArray()).toEqual([3, 2, 1]);
+    expect(maxPriorityQueue.peek()).toBe(3);
+    expect(PriorityQueue.heapify({nodes: [3, 2, 1, 5, 6, 7, 8, 9, 10], comparator: (a, b) => a - b}).toArray()).toEqual(
+      [1, 2, 3, 5, 6, 7, 8, 9, 10]
+    );
+  });
+
+  it('should PriorityQueue clone, sort, getNodes, dfs work well', function () {
+    const minPQ1 = new PriorityQueue<number>({comparator: (a, b) => a - b});
+    minPQ1.refill([2, 5, 8, 3, 1, 6, 7, 4]);
+    const clonedPriorityQueue = minPQ1.clone();
+    expect(clonedPriorityQueue.getNodes()).toEqual(minPQ1.getNodes());
+    expect(clonedPriorityQueue.sort()).toEqual([1, 2, 3, 4, 5, 6, 7, 8]);
+    expect(minPQ1.dfs('in')).toEqual([4, 3, 2, 5, 1, 8, 6, 7]);
+    expect(minPQ1.dfs('post')).toEqual([4, 3, 5, 2, 8, 7, 6, 1]);
+    expect(minPQ1.dfs('pre')).toEqual([1, 2, 3, 4, 5, 6, 8, 7]);
+  });
+});
+
+describe('Priority Queue Performance Test', () => {
+  it('should numeric heap work well', function () {
+    const values = Array.from(new Array(10000), () => getRandomInt(1, 10000000));
+    const minPriorityQueue = new PriorityQueue<number>({comparator: (a, b) => a - b});
+    minPriorityQueue.refill(values);
+    const sorted = minPriorityQueue.sort();
+    expect(sorted).toEqual(values.sort((a, b) => a - b));
+  });
+});