data-structure-typed 1.35.0 → 1.36.0

package/src/data-structures/priority-queue/priority-queue.ts

@@ -1,359 +1,16 @@
 /**
  * data-structure-typed
  *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @author Kirk Qi
+ * @copyright Copyright (c) 2022 Kirk Qi <qilinaus@gmail.com>
  * @license MIT License
  */
-import type {PriorityQueueComparator, PriorityQueueDFSOrderPattern, PriorityQueueOptions} from '../../types';
 
-export class PriorityQueue<E = any> {
-  /**
-   * The constructor initializes a priority queue with the given options, including an array of nodes and a comparator
-   * function.
-   * @param options - The `options` parameter is an object that contains the following properties:
-   */
-  constructor(options: PriorityQueueOptions<E>) {
-    const {nodes, comparator, isFix = true} = options;
-    this._comparator = comparator;
+import {Heap} from '../heap';
+import {CompareFunction} from '../../types';
 
-    if (nodes && Array.isArray(nodes) && nodes.length > 0) {
-      // TODO support distinct
-      this._nodes = [...nodes];
-      isFix && this._fix();
-    }
+export class PriorityQueue<T> extends Heap<T> {
+  constructor(comparator: CompareFunction<T>) {
+    super(comparator);
   }
-
-  protected _nodes: E[] = [];
-
-  get nodes(): E[] {
-    return this._nodes;
-  }
-
-  get size(): number {
-    return this.nodes.length;
-  }
-
-  /**
-   * The `heapify` function creates a new PriorityQueue instance and fixes the heap property.
-   * @param options - The "options" parameter is an object that contains the configuration options for the PriorityQueue.
-   * It can include properties such as "comparator" which specifies the comparison function used to order the elements in
-   * the priority queue, and "initialValues" which is an array of initial values to be added to the priority
-   * @returns a new instance of the PriorityQueue class after performing the heapify operation on it.
-   */
-  static heapify<E>(options: PriorityQueueOptions<E>) {
-    const heap = new PriorityQueue(options);
-    heap._fix();
-    return heap;
-  }
-
-  /**
-   * The function checks if a priority queue is valid by creating a new priority queue with a fix option and then calling
-   * the isValid method.
-   * @param options - An object containing options for creating a priority queue. The options object should have the
-   * following properties:
-   * @returns the result of calling the `isValid()` method on a new instance of the `PriorityQueue` class.
-   */
-  static isPriorityQueueified<E>(options: Omit<PriorityQueueOptions<E>, 'isFix'>) {
-    return new PriorityQueue({...options, isFix: false}).isValid();
-  }
-
-  /**
-   * Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.
-   */
-  getNodes(): E[] {
-    return this._nodes;
-  }
-
-  /**
-   * The "add" function adds a node to the heap and ensures that the heap property is maintained.
-   * @param {E} node - The parameter "node" is of type E, which means it can be any data type. It represents the node
-   * that needs to be added to the heap.
-   */
-  add(node: E) {
-    this.nodes.push(node);
-    this._heapifyUp(this.size - 1);
-  }
-
-  /**
-   * The "has" function checks if a given node is present in the list of nodes.
-   * @param {E} node - The parameter `node` is of type `E`, which means it can be any type. It represents the node that
-   * we want to check if it exists in the `nodes` array.
-   * @returns a boolean value indicating whether the given node is included in the array of nodes.
-   */
-  has(node: E): boolean {
-    return this.nodes.includes(node);
-  }
-
-  /**
-   * The `peek` function returns the first element of the `nodes` array if it exists, otherwise it returns `null`.
-   * @returns The `peek()` function is returning the first element (`E`) of the `nodes` array if the `size` is not zero.
-   * Otherwise, it returns `null`.
-   */
-  peek(): E | null {
-    return this.size ? this.nodes[0] : null;
-  }
-
-  /**
-   * The `poll` function removes and returns the top element from a heap data structure.
-   * @returns The `poll()` method returns a value of type `E` or `null`.
-   */
-  poll(): E | null {
-    let res: E | null = null;
-    if (this.size > 1) {
-      this._swap(0, this.nodes.length - 1);
-      res = this.nodes.pop() ?? null;
-      this._heapifyDown(0);
-    } else if (this.size === 1) {
-      res = this.nodes.pop() ?? null;
-    }
-    return res;
-  }
-
-  /**
-   * The `leaf` function returns the last element in the `nodes` array or `null` if the array is empty.
-   * @returns The method `leaf()` is returning the last element (`E`) in the `nodes` array if it exists. If the array is
-   * empty or the last element is `null`, then it returns `null`.
-   */
-  leaf(): E | null {
-    return this.nodes[this.size - 1] ?? null;
-  }
-
-  /**
-   * The function checks if the size of an object is equal to zero and returns a boolean value indicating whether the
-   * object is empty or not.
-   * @returns The method `isEmpty()` is returning a boolean value indicating whether the size of the object is equal to
-   * 0.
-   */
-  isEmpty() {
-    return this.size === 0;
-  }
-
-  /**
-   * The clear function clears the nodes array.
-   */
-  clear() {
-    this._setNodes([]);
-  }
-
-  /**
-   * The toArray function returns an array containing all the elements in the nodes property.
-   * @returns An array of type E, which is the elements of the nodes property.
-   */
-  toArray(): E[] {
-    return [...this.nodes];
-  }
-
-  /**
-   * The `clone` function returns a new instance of the `PriorityQueue` class with the same nodes and comparator as the
-   * original instance.
-   * @returns The `clone()` method is returning a new instance of the `PriorityQueue` class with the same `nodes` and
-   * `comparator` properties as the original instance.
-   */
-  clone(): PriorityQueue<E> {
-    return new PriorityQueue<E>({
-      nodes: this.nodes,
-      comparator: this._comparator
-    });
-  }
-
-  // --- start additional methods ---
-  /**
-   * The `isValid` function recursively checks if a binary tree satisfies a certain condition.
-   * @returns The function `isValid()` returns a boolean value.
-   */
-  isValid(): boolean {
-    for (let i = 0; i < this.nodes.length; i++) {
-      const leftChildIndex = this._getLeft(i);
-      const rightChildIndex = this._getRight(i);
-      if (this._isValidIndex(leftChildIndex) && !this._compare(leftChildIndex, i)) {
-        return false;
-      }
-      if (this._isValidIndex(rightChildIndex) && !this._compare(rightChildIndex, i)) {
-        return false;
-      }
-    }
-    return true;
-  }
-
-  /**
-   * O(n log n), In scenarios with smaller data sizes, heap sort is generally expected to be slower than QuickSort or MergeSort.
-   */
-
-  /**
-   * The function sorts the elements in a data structure and returns them in an array.
-   * Plan to support sorting of duplicate elements.
-   * @returns The `sort()` method is returning an array of type `E[]`.
-   */
-  sort(): E[] {
-    const visitedNode: E[] = [];
-    while (this.size !== 0) {
-      const top = this.poll();
-      if (top) visitedNode.push(top);
-    }
-    return visitedNode;
-  }
-
-  /**
-   * The dfs function performs a depth-first search traversal on a binary tree and returns an array of visited nodes
-   * based on the specified traversal order.
-   * @param {PriorityQueueDFSOrderPattern} dfsMode - The dfsMode parameter is a string that specifies the order in which
-   * the nodes should be visited during the Depth-First Search (dfs) traversal. It can have one of the following values:
-   * @returns an array of type `(E | null)[]`.
-   */
-  dfs(dfsMode: PriorityQueueDFSOrderPattern): (E | null)[] {
-    const visitedNode: (E | null)[] = [];
-
-    const traverse = (cur: number) => {
-      const leftChildIndex = this._getLeft(cur);
-      const rightChildIndex = this._getRight(cur);
-      switch (dfsMode) {
-        case 'in':
-          this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
-          visitedNode.push(this.nodes[cur] ?? null);
-          this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
-          break;
-        case 'pre':
-          visitedNode.push(this.nodes[cur] ?? null);
-          this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
-          this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
-          break;
-        case 'post':
-          this._isValidIndex(leftChildIndex) && traverse(leftChildIndex);
-          this._isValidIndex(rightChildIndex) && traverse(rightChildIndex);
-          visitedNode.push(this.nodes[cur] ?? null);
-          break;
-      }
-    };
-
-    this._isValidIndex(0) && traverse(0);
-    return visitedNode;
-  }
-
-  protected _setNodes(value: E[]) {
-    this._nodes = value;
-  }
-
-  protected readonly _comparator: PriorityQueueComparator<E> = (a: E, b: E) => {
-    const aKey = a as unknown as number,
-      bKey = b as unknown as number;
-    return aKey - bKey;
-  };
-
-  /**
-   * The function compares two numbers using a custom comparator function.
-   * @param {number} a - The parameter "a" is a number that represents the index of a node in an array.
-   * @param {number} b - The parameter "b" is a number.
-   * @returns the result of the comparison between the elements at indices `a` and `b` in the `nodes` array. The
-   * comparison is done using the `_comparator` function, and if the result is greater than 0, `true` is returned,
-   * indicating that the element at index `a` is greater than the element at index `b`.
-   */
-  protected _compare(a: number, b: number) {
-    return this._comparator(this.nodes[a], this.nodes[b]) > 0;
-  }
-
-  /**
-   * The function swaps two elements in an array.
-   * @param {number} a - The parameter "a" is a number that represents the index of an element in an array.
-   * @param {number} b - The parameter "b" is a number.
-   */
-  protected _swap(a: number, b: number) {
-    const temp = this.nodes[a];
-    this.nodes[a] = this.nodes[b];
-    this.nodes[b] = temp;
-  }
-
-  /**
-   * The function checks if a given index is valid within an array.
-   * @param {number} index - The parameter "index" is of type number and represents the index value that needs to be
-   * checked for validity.
-   * @returns A boolean value indicating whether the given index is valid or not.
-   */
-  protected _isValidIndex(index: number): boolean {
-    return index > -1 && index < this.nodes.length;
-  }
-
-  /**
-   * The function returns the index of the parent node given the index of a child node in a binary tree.
-   * @param {number} child - The "child" parameter is a number representing the index of a child node in a binary tree.
-   * @returns the parent of the given child node.
-   */
-  protected _getParent(child: number): number {
-    return Math.floor((child - 1) / 2);
-  }
-
-  /**
-   * The function returns the index of the left child node in a binary tree given the index of its parent node.
-   * @param {number} parent - The parameter "parent" is a number that represents the index of a node in a binary tree.
-   * @returns the left child of a given parent node in a binary tree.
-   */
-  protected _getLeft(parent: number): number {
-    return 2 * parent + 1;
-  }
-
-  /**
-   * The function returns the index of the right child node in a binary tree given the index of its parent node.
-   * @param {number} parent - The parameter "parent" is a number that represents the index of a node in a binary tree.
-   * @returns the right child of a given parent node in a binary tree.
-   */
-  protected _getRight(parent: number): number {
-    return 2 * parent + 2;
-  }
-
-  /**
-   * The function returns the index of the smallest child node of a given parent node.
-   * @param {number} parent - The parent parameter is a number that represents the index of the parent node in a binary
-   * tree.
-   * @returns the minimum value between the parent node and its left and right child nodes.
-   */
-  protected _getComparedChild(parent: number) {
-    let min = parent;
-    const left = this._getLeft(parent),
-      right = this._getRight(parent);
-
-    if (left < this.size && this._compare(min, left)) {
-      min = left;
-    }
-    if (right < this.size && this._compare(min, right)) {
-      min = right;
-    }
-    return min;
-  }
-
-  /**
-   * The function `_heapifyUp` is used to maintain the heap property by moving an element up the heap until it is in the
-   * correct position.
-   * @param {number} start - The start parameter is the index of the element that needs to be moved up in the heap.
-   */
-  protected _heapifyUp(start: number) {
-    while (start > 0 && this._compare(this._getParent(start), start)) {
-      const parent = this._getParent(start);
-      this._swap(start, parent);
-      start = parent;
-    }
-  }
-
-  /**
-   * The function performs a heapify operation by comparing and swapping elements in a binary heap.
-   * @param {number} start - The start parameter is the index of the element in the heap from where the heapifyDown
-   * operation should start.
-   */
-  protected _heapifyDown(start: number) {
-    let min = this._getComparedChild(start);
-    while (this._compare(start, min)) {
-      this._swap(min, start);
-      start = min;
-      min = this._getComparedChild(start);
-    }
-  }
-
-  /**
-   * The _fix function performs a heapify operation on the elements of the heap starting from the middle and moving
-   * towards the root.
-   */
-  protected _fix() {
-    for (let i = Math.floor(this.size / 2); i > -1; i--) this._heapifyDown(i);
-  }
-
-  // --- end additional methods ---
 }

package/src/types/data-structures/heap.ts

@@ -1,5 +1 @@
-export type HeapOptions<T> = {
-  priorityExtractor?: (element: T) => number;
-  // TODO there is an idea that support chaining which is for conveniently using the data structure
-  // isChaining? : boolean
-};
+export type CompareFunction<T> = (a: T, b: T) => number;

package/test/integration/avl-tree.test.ts

@@ -31,12 +31,12 @@ describe('AVL Tree Test', () => {
     // node15 has type problem. After the uniform design, the generics of containers (DirectedGraph, BST) are based on the type of value. However, this design has a drawback: when I attempt to inherit from the Vertex or BSTNode classes, the types of the results obtained by all methods are those of the parent class.
     expect(node15?.val).toBe(15);
 
-    const dfs = tree.DFS('in', 'node');
+    const dfs = tree.dfs('in', 'node');
     expect(dfs[0].key).toBe(1);
     expect(dfs[dfs.length - 1].key).toBe(16);
 
     tree.perfectlyBalance();
-    const bfs = tree.BFS('node');
+    const bfs = tree.bfs('node');
     expect(tree.isPerfectlyBalanced()).toBe(true);
     expect(bfs[0].key).toBe(8);
     expect(bfs[bfs.length - 1].key).toBe(16);
@@ -95,12 +95,12 @@ describe('AVL Tree Test', () => {
     expect(tree.getHeight()).toBe(1);
 
     expect(tree.isAVLBalanced()).toBe(true);
-    const lastBFSIds = tree.BFS();
+    const lastBFSIds = tree.bfs();
     expect(lastBFSIds[0]).toBe(12);
     expect(lastBFSIds[1]).toBe(2);
     expect(lastBFSIds[2]).toBe(16);
 
-    const lastBFSNodes = tree.BFS('node');
+    const lastBFSNodes = tree.bfs('node');
     expect(lastBFSNodes[0].key).toBe(12);
     expect(lastBFSNodes[1].key).toBe(2);
     expect(lastBFSNodes[2].key).toBe(16);

package/test/integration/bst.test.ts

@@ -44,14 +44,14 @@ describe('Individual package BST operations test', () => {
     const node11 = bst.get(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
-    const dfsInorderNodes = bst.DFS('in', 'node');
+    const dfsInorderNodes = bst.dfs('in', 'node');
     expect(dfsInorderNodes[0].key).toBe(1);
     expect(dfsInorderNodes[dfsInorderNodes.length - 1].key).toBe(16);
 
     bst.perfectlyBalance();
     expect(bst.isPerfectlyBalanced()).toBe(true);
 
-    const bfsNodesAfterBalanced = bst.BFS('node');
+    const bfsNodesAfterBalanced = bst.bfs('node');
     expect(bfsNodesAfterBalanced[0].key).toBe(8);
     expect(bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].key).toBe(16);
 
@@ -169,12 +169,12 @@ describe('Individual package BST operations test', () => {
 
     expect(bst.isAVLBalanced()).toBe(false);
 
-    const bfsIDs = bst.BFS();
+    const bfsIDs = bst.bfs();
     expect(bfsIDs[0]).toBe(2);
     expect(bfsIDs[1]).toBe(12);
     expect(bfsIDs[2]).toBe(16);
 
-    const bfsNodes = bst.BFS('node');
+    const bfsNodes = bst.bfs('node');
     expect(bfsNodes[0].key).toBe(2);
     expect(bfsNodes[1].key).toBe(12);
     expect(bfsNodes[2].key).toBe(16);
@@ -242,14 +242,14 @@ describe('Individual package BST operations test', () => {
     const node11 = objBST.get(11);
     expect(node11).toBeInstanceOf(BSTNode);
 
-    const dfsInorderNodes = objBST.DFS('in', 'node');
+    const dfsInorderNodes = objBST.dfs('in', 'node');
     expect(dfsInorderNodes[0].key).toBe(1);
     expect(dfsInorderNodes[dfsInorderNodes.length - 1].key).toBe(16);
 
     objBST.perfectlyBalance();
     expect(objBST.isPerfectlyBalanced()).toBe(true);
 
-    const bfsNodesAfterBalanced = objBST.BFS('node');
+    const bfsNodesAfterBalanced = objBST.bfs('node');
     expect(bfsNodesAfterBalanced[0].key).toBe(8);
     expect(bfsNodesAfterBalanced[bfsNodesAfterBalanced.length - 1].key).toBe(16);
 
@@ -367,12 +367,12 @@ describe('Individual package BST operations test', () => {
 
     expect(objBST.isAVLBalanced()).toBe(false);
 
-    const bfsIDs = objBST.BFS();
+    const bfsIDs = objBST.bfs();
     expect(bfsIDs[0]).toBe(2);
     expect(bfsIDs[1]).toBe(12);
     expect(bfsIDs[2]).toBe(16);
 
-    const bfsNodes = objBST.BFS('node');
+    const bfsNodes = objBST.bfs('node');
     expect(bfsNodes[0].key).toBe(2);
     expect(bfsNodes[1].key).toBe(12);
     expect(bfsNodes[2].key).toBe(16);

package/test/unit/data-structures/graph/directed-graph.test.ts

@@ -1,4 +1,4 @@
-import {DirectedEdge, DirectedGraph, DirectedVertex, VertexId} from '../../../../src';
+import {DirectedEdge, DirectedGraph, DirectedVertex, VertexKey} from '../../../../src';
 
 describe('DirectedGraph Operation Test', () => {
   let graph: DirectedGraph;
@@ -63,7 +63,7 @@ describe('DirectedGraph Operation Test', () => {
 });
 
 class MyVertex<V extends string> extends DirectedVertex<V> {
-  constructor(key: VertexId, val?: V) {
+  constructor(key: VertexKey, val?: V) {
     super(key, val);
     this._data = val;
   }
@@ -80,7 +80,7 @@ class MyVertex<V extends string> extends DirectedVertex<V> {
 }
 
 class MyEdge<E extends string> extends DirectedEdge<E> {
-  constructor(v1: VertexId, v2: VertexId, weight?: number, val?: E) {
+  constructor(v1: VertexKey, v2: VertexKey, weight?: number, val?: E) {
     super(v1, v2, weight, val);
     this._data = val;
   }
@@ -97,11 +97,11 @@ class MyEdge<E extends string> extends DirectedEdge<E> {
 }
 
 class MyDirectedGraph<V extends MyVertex<string>, E extends MyEdge<string>> extends DirectedGraph<V, E> {
-  createVertex(key: VertexId, val: V['val']): V {
+  createVertex(key: VertexKey, val: V['val']): V {
     return new MyVertex(key, val) as V;
   }
 
-  createEdge(src: VertexId, dest: VertexId, weight?: number, val?: E['val']): E {
+  createEdge(src: VertexKey, dest: VertexKey, weight?: number, val?: E['val']): E {
     return new MyEdge(src, dest, weight ?? 1, val) as E;
   }
 }

package/test/unit/data-structures/graph/overall.test.ts

@@ -29,8 +29,8 @@ describe('Overall Graph Operation Test', () => {
     graph.addEdge('A', 'B');
     graph.addEdge('B', 'C');
 
-    const topologicalOrderIds = graph.topologicalSort();
-    expect(topologicalOrderIds).toEqual(['A', 'B', 'C']);
+    const topologicalOrderKeys = graph.topologicalSort();
+    expect(topologicalOrderKeys).toEqual(['A', 'B', 'C']);
   });
   it('Overall UndirectedGraph Operation Test', () => {
     const graph = new UndirectedGraph();

package/test/unit/data-structures/heap/heap.test.ts

@@ -21,34 +21,42 @@ describe('Heap Operation Test', () => {
   });
 
   it('should object heap work well', function () {
-    const minHeap = new MinHeap<{a: string}>();
-    minHeap.add(1, {a: 'a1'});
-    minHeap.add(6, {a: 'a6'});
-    minHeap.add(2, {a: 'a2'});
-    minHeap.add(0, {a: 'a0'});
+    const minHeap = new MinHeap<{a: string; key: number}>((a, b) => a.key - b.key);
+    minHeap.add({key: 1, a: 'a1'});
+    minHeap.add({key: 6, a: 'a6'});
+    minHeap.add({key: 2, a: 'a2'});
+    minHeap.add({key: 0, a: 'a0'});
 
-    expect(minHeap.peek()).toEqual({a: 'a0'});
-    expect(minHeap.toArray()).toEqual([{a: 'a0'}, {a: 'a1'}, {a: 'a2'}, {a: 'a6'}]);
+    expect(minHeap.peek()).toEqual({a: 'a0', key: 0});
+    console.log('---', minHeap.toArray());
+    expect(minHeap.toArray().map(item => ({a: item.a}))).toEqual([{a: 'a0'}, {a: 'a1'}, {a: 'a2'}, {a: 'a6'}]);
     let i = 0;
     const expectPolled = [{a: 'a0'}, {a: 'a1'}, {a: 'a2'}, {a: 'a6'}];
     while (minHeap.size > 0) {
-      expect(minHeap.poll()).toEqual(expectPolled[i]);
+      expect({a: minHeap.poll()?.a}).toEqual(expectPolled[i]);
       i++;
     }
 
-    const maxHeap = new MaxHeap<{a: string}>();
-    maxHeap.add(1, {a: 'a1'});
-    maxHeap.add(6, {a: 'a6'});
-    maxHeap.add(5, {a: 'a5'});
-    maxHeap.add(2, {a: 'a2'});
-    maxHeap.add(0, {a: 'a0'});
-    maxHeap.add(9, {a: 'a9'});
-    expect(maxHeap.peek()).toEqual({a: 'a9'});
-    expect(maxHeap.toArray()).toEqual([{a: 'a9'}, {a: 'a2'}, {a: 'a6'}, {a: 'a1'}, {a: 'a0'}, {a: 'a5'}]);
+    const maxHeap = new MaxHeap<{key: number; a: string}>((a, b) => b.key - a.key);
+    maxHeap.add({key: 1, a: 'a1'});
+    maxHeap.add({key: 6, a: 'a6'});
+    maxHeap.add({key: 5, a: 'a5'});
+    maxHeap.add({key: 2, a: 'a2'});
+    maxHeap.add({key: 0, a: 'a0'});
+    maxHeap.add({key: 9, a: 'a9'});
+    expect(maxHeap.peek()).toEqual({a: 'a9', key: 9});
+    expect(maxHeap.toArray().map(item => ({a: item.a}))).toEqual([
+      {a: 'a9'},
+      {a: 'a2'},
+      {a: 'a6'},
+      {a: 'a1'},
+      {a: 'a0'},
+      {a: 'a5'}
+    ]);
     const maxExpectPolled = [{a: 'a9'}, {a: 'a6'}, {a: 'a5'}, {a: 'a2'}, {a: 'a1'}, {a: 'a0'}];
     let maxI = 0;
     while (maxHeap.size > 0) {
-      expect(maxHeap.poll()).toEqual(maxExpectPolled[maxI]);
+      expect({a: maxHeap.poll()?.a}).toEqual(maxExpectPolled[maxI]);
       maxI++;
     }
   });

package/test/unit/data-structures/heap/max-heap.test.ts

@@ -1,44 +1,52 @@
-import {HeapItem, MaxHeap} from '../../../../src';
-
-describe('MaxHeap Operation Test', () => {
-  it('should object Max Heap operations be proper', function () {
-    const maxHeap = new MaxHeap<{keyA: string}>();
-    const myObj1 = {keyA: 'a1'},
-      myObj6 = {keyA: 'a6'},
-      myObj5 = {keyA: 'a5'},
-      myObj2 = {keyA: 'a2'},
-      myObj0 = {keyA: 'a0'},
-      myObj9 = {keyA: 'a9'};
-    maxHeap.add(1, myObj1);
-    expect(maxHeap.has(myObj1)).toBe(true);
-    expect(maxHeap.has(myObj9)).toBe(false);
-    maxHeap.add(6, myObj6);
-    expect(maxHeap.has(myObj6)).toBe(true);
-    maxHeap.add(5, myObj5);
-    expect(maxHeap.has(myObj5)).toBe(true);
-    maxHeap.add(2, myObj2);
-    expect(maxHeap.has(myObj2)).toBe(true);
-    expect(maxHeap.has(myObj6)).toBe(true);
-    maxHeap.add(0, myObj0);
-    expect(maxHeap.has(myObj0)).toBe(true);
-    expect(maxHeap.has(myObj9)).toBe(false);
-    maxHeap.add(9, myObj9);
-    expect(maxHeap.has(myObj9)).toBe(true);
-
-    const peek9 = maxHeap.peek(true);
-    peek9 && peek9.val && expect(peek9.val.keyA).toBe('a9');
-
-    const heapToArr = maxHeap.toArray(true);
-    expect(heapToArr.map(item => item?.val?.keyA)).toEqual(['a9', 'a2', 'a6', 'a1', 'a0', 'a5']);
-
-    const values = ['a9', 'a6', 'a5', 'a2', 'a1', 'a0'];
-    let i = 0;
-    while (maxHeap.size > 0) {
-      const polled = maxHeap.poll(true);
-      expect(polled).toBeInstanceOf(HeapItem);
-      polled && expect(polled.val).toHaveProperty('keyA');
-      polled && polled.val && expect(polled.val.keyA).toBe(values[i]);
-      i++;
-    }
+import {CompareFunction, MaxHeap} from '../../../../src';
+
+describe('MaxHeap', () => {
+  const numberComparator: CompareFunction<number> = (a, b) => b - a;
+  let maxHeap: MaxHeap<number>;
+
+  beforeEach(() => {
+    maxHeap = new MaxHeap(numberComparator);
+  });
+
+  test('add and poll elements in descending order', () => {
+    maxHeap.add(3);
+    maxHeap.add(1);
+    maxHeap.add(4);
+    maxHeap.add(2);
+
+    expect(maxHeap.poll()).toBe(4);
+    expect(maxHeap.poll()).toBe(3);
+    expect(maxHeap.poll()).toBe(2);
+    expect(maxHeap.poll()).toBe(1);
+  });
+
+  test('peek at the top element without removing it', () => {
+    maxHeap.add(3);
+    maxHeap.add(1);
+    maxHeap.add(4);
+    maxHeap.add(2);
+
+    expect(maxHeap.peek()).toBe(4);
+    expect(maxHeap.size).toBe(4);
+  });
+
+  test('sort elements in descending order', () => {
+    maxHeap.add(3);
+    maxHeap.add(1);
+    maxHeap.add(4);
+    maxHeap.add(2);
+
+    const sortedArray = maxHeap.sort();
+    expect(sortedArray).toEqual([4, 3, 2, 1]);
+  });
+
+  test('check if the heap is empty', () => {
+    expect(maxHeap.isEmpty()).toBe(true);
+
+    maxHeap.add(5);
+    expect(maxHeap.isEmpty()).toBe(false);
+
+    maxHeap.poll();
+    expect(maxHeap.isEmpty()).toBe(true);
   });
 });