data-structure-typed 1.49.4 → 1.49.6

package/src/types/common.ts

@@ -1,6 +1,6 @@
 export enum BSTVariant {
-  MIN = 'MIN',
-  MAX = 'MAX',
+  STANDARD = 'STANDARD',
+  INVERSE = 'INVERSE'
 }
 
 export enum CP {
@@ -46,15 +46,15 @@ export interface IterableWithLength<T> extends Iterable<T> {
   length: number | ((...args: any[]) => number);
 }
 
-export type IterableWithSizeOrLength<T> = IterableWithSize<T> | IterableWithLength<T>
+export type IterableWithSizeOrLength<T> = IterableWithSize<T> | IterableWithLength<T>;
 
-export type BinaryTreePrintOptions = { isShowUndefined?: boolean, isShowNull?: boolean, isShowRedBlackNIL?: boolean }
+export type BinaryTreePrintOptions = { isShowUndefined?: boolean; isShowNull?: boolean; isShowRedBlackNIL?: boolean };
 
 export type BTNEntry<K, V> = [K | null | undefined, V | undefined];
 
 export type BTNKeyOrNode<K, N> = K | null | undefined | N;
 
-export type BTNExemplar<K, V, N> = BTNEntry<K, V> | BTNKeyOrNode<K, N>
+export type KeyOrNodeOrEntry<K, V, N> = BTNEntry<K, V> | BTNKeyOrNode<K, N>;
 
 export type BTNodePureKeyOrNode<K, N> = K | N;
 

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

@@ -1,6 +1,17 @@
-import { IterableElementBase, IterableEntryBase } from "../../../data-structures";
+import { IterableElementBase, IterableEntryBase } from '../../../data-structures';
 
 export type EntryCallback<K, V, R> = (value: V, key: K, index: number, container: IterableEntryBase<K, V>) => R;
 export type ElementCallback<V, R> = (element: V, index: number, container: IterableElementBase<V>) => R;
-export type ReduceEntryCallback<K, V, R> = (accumulator: R, value: V, key: K, index: number, container: IterableEntryBase<K, V>) => R;
-export type ReduceElementCallback<V, R> = (accumulator: R, element: V, index: number, container: IterableElementBase<V>) => R;
+export type ReduceEntryCallback<K, V, R> = (
+  accumulator: R,
+  value: V,
+  key: K,
+  index: number,
+  container: IterableEntryBase<K, V>
+) => R;
+export type ReduceElementCallback<V, R> = (
+  accumulator: R,
+  element: V,
+  index: number,
+  container: IterableElementBase<V>
+) => R;

package/src/types/data-structures/base/index.ts

@@ -1 +1 @@
-export * from './base';
+export * from './base';

package/src/types/data-structures/graph/abstract-graph.ts

@@ -1,6 +1,7 @@
 export type VertexKey = string | number;
 
-export type DijkstraResult<V> = {
+export type DijkstraResult<V> =
+  | {
   distMap: Map<V, number>;
   distPaths?: Map<V, V[]>;
   preMap: Map<V, V | undefined>;
@@ -8,4 +9,5 @@ export type DijkstraResult<V> = {
   paths: V[][];
   minDist: number;
   minPath: V[];
-} | undefined;
+}
+  | undefined;

package/src/types/data-structures/hash/hash-map.ts

@@ -7,7 +7,7 @@ export type HashMapLinkedNode<K, V> = {
 
 export type HashMapOptions<K> = {
   hashFn: (key: K) => string;
-  objHashFn: (key: K) => object
-}
+  objHashFn: (key: K) => object;
+};
 
-export type HashMapStoreItem<K, V> = { key: K, value: V };
+export type HashMapStoreItem<K, V> = { key: K; value: V };

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

@@ -1,3 +1,3 @@
-import { Comparator } from "../../common";
+import { Comparator } from '../../common';
 
-export type HeapOptions<T> = { comparator: Comparator<T> }
+export type HeapOptions<T> = { comparator: Comparator<T> };

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

@@ -1,3 +1,3 @@
-import { HeapOptions } from "../heap";
+import { HeapOptions } from '../heap';
 
-export type PriorityQueueOptions<T> = HeapOptions<T> & {}
+export type PriorityQueueOptions<T> = HeapOptions<T> & {};

package/src/utils/utils.ts

@@ -98,4 +98,10 @@ export const isWeakKey = (input: unknown): input is object => {
   return (inputType === 'object' && input !== null) || inputType === 'function';
 };
 
-export const calcMinUnitsRequired = (totalQuantity: number, unitSize: number) => Math.floor((totalQuantity + unitSize - 1) / unitSize)
+export const calcMinUnitsRequired = (totalQuantity: number, unitSize: number) =>
+  Math.floor((totalQuantity + unitSize - 1) / unitSize);
+
+export const roundFixed = (num: number, digit: number = 10) => {
+  const multiplier = Math.pow(10, digit);
+  return Math.round(num * multiplier) / multiplier;
+};

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

@@ -2,7 +2,24 @@ import { AVLTree, CP } from 'avl-tree-typed';
 
 describe('AVL Tree Test', () => {
   it('should perform various operations on a AVL Tree', () => {
-    const arr: [number, number][] = [[11, 11], [3, 3], [15, 15], [1, 1], [8, 8], [13, 13], [16, 16], [2, 2], [6, 6], [9, 9], [12, 12], [14, 14], [4, 4], [7, 7], [10, 10], [5, 5]];
+    const arr: [number, number][] = [
+      [11, 11],
+      [3, 3],
+      [15, 15],
+      [1, 1],
+      [8, 8],
+      [13, 13],
+      [16, 16],
+      [2, 2],
+      [6, 6],
+      [9, 9],
+      [12, 12],
+      [14, 14],
+      [4, 4],
+      [7, 7],
+      [10, 10],
+      [5, 5]
+    ];
     const tree = new AVLTree();
 
     for (const i of arr) tree.add(i);

package/test/integration/bst.test.ts

@@ -7,7 +7,7 @@ describe('Individual package BST operations test', () => {
     bst.add([11, 11]);
     bst.add([3, 3]);
     const idsOrValues = [15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5];
-    bst.addMany(idsOrValues, false);
+    bst.addMany(idsOrValues, undefined);
     expect(bst.root).toBeInstanceOf(BSTNode);
 
     if (bst.root) expect(bst.root.key).toBe(11);
@@ -204,7 +204,7 @@ describe('Individual package BST operations test', () => {
       [5, { key: 5, keyA: 5 }]
     ];
 
-    objBST.addMany(values, false);
+    objBST.addMany(values, undefined);
 
     expect(objBST.root).toBeInstanceOf(BSTNode);
 

package/test/performance/data-structures/binary-tree/avl-tree.test.ts

@@ -10,27 +10,19 @@ const arr = getRandomIntArray(TEN_THOUSAND, 0, TEN_THOUSAND, true);
 suite
   .add(`${TEN_THOUSAND.toLocaleString()} add randomly`, () => {
     avl.clear();
-    for (let i = 0; i < arr.length; i++) {
-      avl.add(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) avl.add(arr[i]);
   })
   .add(`${TEN_THOUSAND.toLocaleString()} add & delete randomly`, () => {
     avl.clear();
-    for (let i = 0; i < arr.length; i++) {
-      avl.add(arr[i]);
-    }
-    for (let i = 0; i < arr.length; i++) {
-      avl.delete(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) avl.add(arr[i]);
+    for (let i = 0; i < arr.length; i++) avl.delete(arr[i]);
   })
   .add(`${TEN_THOUSAND.toLocaleString()} addMany`, () => {
     avl.clear();
     avl.addMany(arr);
   })
   .add(`${TEN_THOUSAND.toLocaleString()} get`, () => {
-    for (let i = 0; i < arr.length; i++) {
-      avl.get(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) avl.get(arr[i]);
   });
 
 export { suite };

package/test/performance/data-structures/binary-tree/binary-tree-overall.test.ts

@@ -0,0 +1,37 @@
+import { AVLTree, RedBlackTree } from '../../../../src';
+import * as Benchmark from 'benchmark';
+import { getRandomIntArray, magnitude } from '../../../utils';
+
+const suite = new Benchmark.Suite();
+const rbTree = new RedBlackTree();
+const avlTree = new AVLTree();
+const { TEN_THOUSAND } = magnitude;
+const arr = getRandomIntArray(TEN_THOUSAND, 0, TEN_THOUSAND, true);
+
+suite
+  .add(`${TEN_THOUSAND.toLocaleString()} RBTree add`, () => {
+    rbTree.clear();
+    for (let i = 0; i < arr.length; i++) rbTree.add(arr[i]);
+  })
+  .add(`${TEN_THOUSAND.toLocaleString()} RBTree add & delete randomly`, () => {
+    rbTree.clear();
+    for (let i = 0; i < arr.length; i++) rbTree.add(arr[i]);
+    for (let i = 0; i < arr.length; i++) rbTree.delete(arr[i]);
+  })
+  .add(`${TEN_THOUSAND.toLocaleString()} RBTree get`, () => {
+    for (let i = 0; i < arr.length; i++) rbTree.get(arr[i]);
+  })
+  .add(`${TEN_THOUSAND.toLocaleString()} AVLTree add`, () => {
+    avlTree.clear();
+    for (let i = 0; i < arr.length; i++) avlTree.add(arr[i]);
+  })
+  .add(`${TEN_THOUSAND.toLocaleString()} AVLTree add & delete randomly`, () => {
+    avlTree.clear();
+    for (let i = 0; i < arr.length; i++) avlTree.add(arr[i]);
+    for (let i = 0; i < arr.length; i++) avlTree.delete(arr[i]);
+  })
+  .add(`${TEN_THOUSAND.toLocaleString()} AVLTree get`, () => {
+    for (let i = 0; i < arr.length; i++) avlTree.get(arr[i]);
+  });
+
+export { suite };

package/test/performance/data-structures/binary-tree/binary-tree.test.ts

@@ -10,32 +10,22 @@ const arr = getRandomIntArray(THOUSAND, 0, THOUSAND, true);
 suite
   .add(`${THOUSAND.toLocaleString()} add randomly`, () => {
     biTree.clear();
-    for (let i = 0; i < arr.length; i++) {
-      biTree.add(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) biTree.add(arr[i]);
   })
   .add(`${THOUSAND.toLocaleString()} add & delete randomly`, () => {
     biTree.clear();
-    for (let i = 0; i < arr.length; i++) {
-      biTree.add(arr[i]);
-    }
-    for (let i = 0; i < arr.length; i++) {
-      biTree.delete(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) biTree.add(arr[i]);
+    for (let i = 0; i < arr.length; i++) biTree.delete(arr[i]);
   })
   .add(`${THOUSAND.toLocaleString()} addMany`, () => {
     biTree.clear();
     biTree.addMany(arr);
   })
   .add(`${THOUSAND.toLocaleString()} get`, () => {
-    for (let i = 0; i < arr.length; i++) {
-      biTree.get(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) biTree.get(arr[i]);
   })
   .add(`${THOUSAND.toLocaleString()} has`, () => {
-    for (let i = 0; i < arr.length; i++) {
-      biTree.get(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) biTree.get(arr[i]);
   })
   .add(`${THOUSAND.toLocaleString()} dfs`, () => {
     for (let i = 0; i < THOUSAND; i++) biTree.dfs();
@@ -47,4 +37,4 @@ suite
     for (let i = 0; i < THOUSAND; i++) biTree.morris(n => n, 'pre');
   });
 
-export { suite };
+// export { suite };

package/test/performance/data-structures/binary-tree/bst.test.ts

@@ -10,27 +10,19 @@ const arr = getRandomIntArray(TEN_THOUSAND, 0, TEN_THOUSAND, true);
 suite
   .add(`${TEN_THOUSAND.toLocaleString()} add randomly`, () => {
     bst.clear();
-    for (let i = 0; i < arr.length; i++) {
-      bst.add(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) bst.add(arr[i]);
   })
   .add(`${TEN_THOUSAND.toLocaleString()} add & delete randomly`, () => {
     bst.clear();
-    for (let i = 0; i < arr.length; i++) {
-      bst.add(arr[i]);
-    }
-    for (let i = 0; i < arr.length; i++) {
-      bst.delete(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) bst.add(arr[i]);
+    for (let i = 0; i < arr.length; i++) bst.delete(arr[i]);
   })
   .add(`${TEN_THOUSAND.toLocaleString()} addMany`, () => {
     bst.clear();
     bst.addMany(arr);
   })
   .add(`${TEN_THOUSAND.toLocaleString()} get`, () => {
-    for (let i = 0; i < arr.length; i++) {
-      bst.get(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) bst.get(arr[i]);
   });
 
-export { suite };
+// export { suite };

package/test/performance/data-structures/binary-tree/rb-tree.test.ts

@@ -12,40 +12,30 @@ const cOrderedMap = new OrderedMap<number, number>();
 
 suite.add(`${HUNDRED_THOUSAND.toLocaleString()} add`, () => {
   rbTree.clear();
-  for (let i = 0; i < arr.length; i++) {
-    rbTree.add(arr[i]);
-  }
+  for (let i = 0; i < arr.length; i++) rbTree.add(arr[i]);
 });
 
 if (isCompetitor) {
   suite.add(`CPT ${HUNDRED_THOUSAND.toLocaleString()} add`, () => {
-    for (let i = 0; i < arr.length; i++) {
-      cOrderedMap.setElement(arr[i], arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) cOrderedMap.setElement(arr[i], arr[i]);
   });
 }
 
 suite
   .add(`${HUNDRED_THOUSAND.toLocaleString()} add & delete randomly`, () => {
     rbTree.clear();
-    for (let i = 0; i < arr.length; i++) {
-      rbTree.add(arr[i]);
-    }
-    for (let i = 0; i < arr.length; i++) {
-      rbTree.delete(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) rbTree.add(arr[i]);
+    for (let i = 0; i < arr.length; i++) rbTree.delete(arr[i]);
   })
   .add(`${HUNDRED_THOUSAND.toLocaleString()} getNode`, () => {
-    for (let i = 0; i < arr.length; i++) {
-      rbTree.getNode(arr[i]);
-    }
+    for (let i = 0; i < arr.length; i++) rbTree.getNode(arr[i]);
   });
 
 suite.add(`${HUNDRED_THOUSAND.toLocaleString()} add & iterator`, () => {
   rbTree.clear();
   for (let i = 0; i < arr.length; i++) rbTree.add(arr[i]);
   const entries = [...rbTree];
-  return entries.length === HUNDRED_THOUSAND
+  return entries.length === HUNDRED_THOUSAND;
 });
 
 export { suite };

package/test/performance/data-structures/comparison/comparison.test.ts

@@ -22,25 +22,20 @@ const arrHundredThousand = getRandomIntArray(HUNDRED_THOUSAND, 0, HUNDRED_THOUSA
 
 suite
   .add(`SRC PQ ${TEN_THOUSAND.toLocaleString()} add`, () => {
-
     const pq = new SRCPriorityQueue<number>();
     for (let i = 0; i < TEN_THOUSAND; i++) pq.add(i);
   })
   .add(`CJS PQ ${TEN_THOUSAND.toLocaleString()} add`, () => {
-
-
     const pq = new CJSPriorityQueue<number>();
     for (let i = 0; i < TEN_THOUSAND; i++) pq.add(i);
   })
   .add(`MJS PQ ${TEN_THOUSAND.toLocaleString()} add`, () => {
-
     const pq = new MJSPriorityQueue<number>([], { comparator: (a, b) => b - a });
     for (let i = 0; i < TEN_THOUSAND; i++) pq.add(i);
   });
 
 if (isCompetitor) {
   suite.add(`CPT PQ ${TEN_THOUSAND.toLocaleString()} add`, () => {
-
     const pq = new CPriorityQueue<number>();
     for (let i = 0; i < TEN_THOUSAND; i++) pq.push(i);
   });
@@ -66,84 +61,61 @@ suite
     for (let i = 0; i < TEN_THOUSAND; i++) pq.poll();
   });
 
-
 if (isCompetitor) {
-  suite.add(`CPT PQ ${TEN_THOUSAND.toLocaleString()} add & pop`, () => {
-    const pq = new CPriorityQueue<number>();
+  suite
+    .add(`CPT PQ ${TEN_THOUSAND.toLocaleString()} add & pop`, () => {
+      const pq = new CPriorityQueue<number>();
 
-    for (let i = 0; i < TEN_THOUSAND; i++) pq.push(i);
-    for (let i = 0; i < TEN_THOUSAND; i++) pq.pop();
-  })
+      for (let i = 0; i < TEN_THOUSAND; i++) pq.push(i);
+      for (let i = 0; i < TEN_THOUSAND; i++) pq.pop();
+    })
     .add(`CPT OM ${HUNDRED_THOUSAND.toLocaleString()} add`, () => {
-      for (let i = 0; i < arrHundredThousand.length; i++) {
+      for (let i = 0; i < arrHundredThousand.length; i++)
         cOrderedMap.setElement(arrHundredThousand[i], arrHundredThousand[i]);
-      }
     })
     .add(`CPT HM ${TEN_THOUSAND.toLocaleString()} set`, () => {
       const hm = new CHashMap<number, number>();
 
-      for (let i = 0; i < TEN_THOUSAND; i++) {
-        hm.setElement(i, i);
-      }
+      for (let i = 0; i < TEN_THOUSAND; i++) hm.setElement(i, i);
     })
     .add(`CPT HM ${TEN_THOUSAND.toLocaleString()} set & get`, () => {
       const hm = new CHashMap<number, number>();
 
-      for (let i = 0; i < TEN_THOUSAND; i++) {
-        hm.setElement(i, i);
-      }
-      for (let i = 0; i < TEN_THOUSAND; i++) {
-        hm.getElementByKey(i);
-      }
+      for (let i = 0; i < TEN_THOUSAND; i++) hm.setElement(i, i);
+      for (let i = 0; i < TEN_THOUSAND; i++) hm.getElementByKey(i);
     })
     .add(`CPT LL ${MILLION.toLocaleString()} unshift`, () => {
       const list = new CLinkedList<number>();
 
-      for (let i = 0; i < MILLION; i++) {
-        list.pushFront(i);
-      }
+      for (let i = 0; i < MILLION; i++) list.pushFront(i);
     })
     .add(`CPT PQ ${TEN_THOUSAND.toLocaleString()} add & pop`, () => {
       const pq = new CPriorityQueue<number>();
 
-      for (let i = 0; i < TEN_THOUSAND; i++) {
-        pq.push(i);
-      }
+      for (let i = 0; i < TEN_THOUSAND; i++) pq.push(i);
 
-      for (let i = 0; i < TEN_THOUSAND; i++) {
-        pq.pop();
-      }
+      for (let i = 0; i < TEN_THOUSAND; i++) pq.pop();
     })
     .add(`CPT DQ ${MILLION.toLocaleString()} push`, () => {
       const deque = new CDeque<number>();
-      for (let i = 0; i < MILLION; i++) {
-        deque.pushBack(i);
-      }
+      for (let i = 0; i < MILLION; i++) deque.pushBack(i);
     })
     .add(`CPT Q ${MILLION.toLocaleString()} push`, () => {
       const queue = new CQueue<number>();
 
-      for (let i = 0; i < MILLION; i++) {
-        queue.push(i);
-      }
+      for (let i = 0; i < MILLION; i++) queue.push(i);
     })
     .add(`CPT ST ${MILLION.toLocaleString()} push`, () => {
       const queue = new CStack<number>();
 
-      for (let i = 0; i < MILLION; i++) {
-        queue.push(i);
-      }
+      for (let i = 0; i < MILLION; i++) queue.push(i);
     })
     .add(`CPT ST ${MILLION.toLocaleString()} push & pop`, () => {
       const queue = new CStack<number>();
 
-      for (let i = 0; i < MILLION; i++) {
-        queue.push(i);
-      }
-      for (let i = 0; i < MILLION; i++) {
-        queue.pop();
-      }
+      for (let i = 0; i < MILLION; i++) queue.push(i);
+      for (let i = 0; i < MILLION; i++) queue.pop();
     });
 }
 
-export { suite };
+// export { suite };

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

@@ -9,9 +9,7 @@ const vertexes = getRandomWords(THOUSAND);
 
 suite
   .add(`${THOUSAND.toLocaleString()} addVertex`, () => {
-    for (const v of vertexes) {
-      graph.addVertex(v);
-    }
+    for (const v of vertexes) graph.addVertex(v);
   })
   .add(`${THOUSAND.toLocaleString()} addEdge`, () => {
     for (let i = 0; i < THOUSAND; i++) {
@@ -21,29 +19,20 @@ suite
     }
   })
   .add(`${THOUSAND.toLocaleString()} getVertex`, () => {
-    for (let i = 0; i < THOUSAND; i++) {
-      graph.getVertex(vertexes[getRandomIndex(vertexes)]);
-    }
+    for (let i = 0; i < THOUSAND; i++) graph.getVertex(vertexes[getRandomIndex(vertexes)]);
   })
   .add(`${THOUSAND.toLocaleString()} getEdge`, () => {
-    for (let i = 0; i < THOUSAND; i++) {
+    for (let i = 0; i < THOUSAND; i++)
       graph.getEdge(vertexes[getRandomIndex(vertexes)], vertexes[getRandomIndex(vertexes)]);
-    }
   })
   .add(`tarjan`, () => {
-    // for (let i = 0; i < THOUSAND; i++) {
     graph.tarjan(true);
-    // }
   })
   .add(`tarjan all`, () => {
-    // for (let i = 0; i < THOUSAND; i++) {
     graph.tarjan(true, true, true, true);
-    // }
   })
   .add(`topologicalSort`, () => {
-    // for (let i = 0; i < THOUSAND; i++) {
     graph.topologicalSort('key');
-    // }
   });
 
 export { suite };

package/test/performance/data-structures/hash/hash-map.test.ts

@@ -10,18 +10,14 @@ const { MILLION } = magnitude;
 suite.add(`${MILLION.toLocaleString()} set`, () => {
   const hm = new HashMap<number, number>();
 
-  for (let i = 0; i < MILLION; i++) {
-    hm.set(i, i);
-  }
+  for (let i = 0; i < MILLION; i++) hm.set(i, i);
 });
 
 if (isCompetitor) {
   suite.add(`CPT ${MILLION.toLocaleString()} set`, () => {
     const hm = new CHashMap<number, number>();
 
-    for (let i = 0; i < MILLION; i++) {
-      hm.setElement(i, i);
-    }
+    for (let i = 0; i < MILLION; i++) hm.setElement(i, i);
   });
 }
 
@@ -40,45 +36,31 @@ suite.add(`Native Set ${MILLION.toLocaleString()} add`, () => {
 suite.add(`${MILLION.toLocaleString()} set & get`, () => {
   const hm = new HashMap<number, number>();
 
-  for (let i = 0; i < MILLION; i++) {
-    hm.set(i, i);
-  }
-  for (let i = 0; i < MILLION; i++) {
-    hm.get(i);
-  }
+  for (let i = 0; i < MILLION; i++) hm.set(i, i);
+  for (let i = 0; i < MILLION; i++) hm.get(i);
 });
 
 if (isCompetitor) {
   suite.add(`CPT ${MILLION.toLocaleString()} set & get`, () => {
     const hm = new CHashMap<number, number>();
 
-    for (let i = 0; i < MILLION; i++) {
-      hm.setElement(i, i);
-    }
-    for (let i = 0; i < MILLION; i++) {
-      hm.getElementByKey(i);
-    }
+    for (let i = 0; i < MILLION; i++) hm.setElement(i, i);
+    for (let i = 0; i < MILLION; i++) hm.getElementByKey(i);
   });
 }
 
 suite.add(`Native Map ${MILLION.toLocaleString()} set & get`, () => {
   const hm = new Map<number, number>();
 
-  for (let i = 0; i < MILLION; i++) {
-    hm.set(i, i);
-  }
-  for (let i = 0; i < MILLION; i++) {
-    hm.get(i);
-  }
+  for (let i = 0; i < MILLION; i++) hm.set(i, i);
+  for (let i = 0; i < MILLION; i++) hm.get(i);
 });
 
 suite.add(`Native Set ${MILLION.toLocaleString()} add & has`, () => {
   const hs = new Set<number>();
 
   for (let i = 0; i < MILLION; i++) hs.add(i);
-
   for (let i = 0; i < MILLION; i++) hs.has(i);
-
 });
 
 suite.add(`${MILLION.toLocaleString()} ObjKey set & get`, () => {
@@ -86,12 +68,10 @@ suite.add(`${MILLION.toLocaleString()} ObjKey set & get`, () => {
   const objKeys: [number, number][] = [];
   for (let i = 0; i < MILLION; i++) {
     const obj: [number, number] = [i, i];
-    objKeys.push(obj)
+    objKeys.push(obj);
     hm.set(obj, i);
   }
-  for (let i = 0; i < MILLION; i++) {
-    hm.get(objKeys[i]);
-  }
+  for (let i = 0; i < MILLION; i++) hm.get(objKeys[i]);
 });
 
 suite.add(`Native Map ${MILLION.toLocaleString()} ObjKey set & get`, () => {
@@ -99,12 +79,10 @@ suite.add(`Native Map ${MILLION.toLocaleString()} ObjKey set & get`, () => {
   const objs: [number, number][] = [];
   for (let i = 0; i < MILLION; i++) {
     const obj: [number, number] = [i, i];
-    objs.push(obj)
+    objs.push(obj);
     hm.set(obj, i);
   }
-  for (let i = 0; i < MILLION; i++) {
-    hm.get(objs[i]);
-  }
+  for (let i = 0; i < MILLION; i++) hm.get(objs[i]);
 });
 
 suite.add(`Native Set ${MILLION.toLocaleString()} ObjKey add & has`, () => {
@@ -112,12 +90,10 @@ suite.add(`Native Set ${MILLION.toLocaleString()} ObjKey add & has`, () => {
   const objs: [number, number][] = [];
   for (let i = 0; i < MILLION; i++) {
     const obj: [number, number] = [i, i];
-    objs.push(obj)
+    objs.push(obj);
     hs.add(obj);
   }
-  for (let i = 0; i < MILLION; i++) {
-    hs.has(objs[i]);
-  }
+  for (let i = 0; i < MILLION; i++) hs.has(objs[i]);
 });
 
 export { suite };