data-structure-typed 1.45.0 → 1.45.1

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

@@ -1,11 +1,11 @@
-import {PriorityQueue} from '../../../../src';
-import {PriorityQueue as CPriorityQueue} from 'js-sdsl';
-import {isDebugTest} from '../../../config';
+import { PriorityQueue } from '../../../../src';
+import { PriorityQueue as CPriorityQueue } from 'js-sdsl';
+import { isDebugTest } from '../../../config';
 
 const isDebug = isDebugTest;
 describe('PriorityQueue Operation Test', () => {
   it('should PriorityQueue poll, pee, heapify, toArray work well', function () {
-    const minPQ = new PriorityQueue<number>({comparator: (a, b) => a - b});
+    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();
@@ -13,16 +13,16 @@ describe('PriorityQueue Operation Test', () => {
     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
-    ]);
+    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});
+    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();
@@ -30,16 +30,16 @@ describe('PriorityQueue Operation Test', () => {
     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
-    ]);
+    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});
+    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());
@@ -52,7 +52,7 @@ describe('PriorityQueue Operation Test', () => {
 
 describe('Priority Queue Performance Test', () => {
   it('should numeric heap work well', function () {
-    const pq = new PriorityQueue({comparator: (a, b) => b - a});
+    const pq = new PriorityQueue({ comparator: (a, b) => b - a });
 
     const tS = performance.now();
 

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

@@ -1,6 +1,6 @@
-import {ArrayDeque, Deque, ObjectDeque} from '../../../../src';
-import {bigO} from '../../../utils';
-import {isDebugTest} from '../../../config';
+import { ArrayDeque, Deque, ObjectDeque } from '../../../../src';
+import { bigO } from '../../../utils';
+import { isDebugTest } from '../../../config';
 
 const isDebug = isDebugTest;
 describe('Deque Tests', () => {

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

@@ -1,6 +1,6 @@
-import {LinkedListQueue, Queue} from '../../../../src';
-import {bigO} from '../../../utils';
-import {isDebugTest} from '../../../config';
+import { LinkedListQueue, Queue } from '../../../../src';
+import { bigO } from '../../../utils';
+import { isDebugTest } from '../../../config';
 
 const isDebug = isDebugTest;
 describe('Queue Operation Test', () => {

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

@@ -1,4 +1,4 @@
-import {Stack} from '../../../../src';
+import { Stack } from '../../../../src';
 
 describe('Stack', () => {
   let stack: Stack<number>;

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

@@ -1,4 +1,4 @@
-import {TreeNode} from '../../../../src';
+import { TreeNode } from '../../../../src';
 
 describe('TreeNode', () => {
   it('should create a TreeNode with the given key and value', () => {

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

@@ -1,4 +1,4 @@
-import {Trie, TrieNode} from '../../../../src';
+import { Trie, TrieNode } from '../../../../src';
 
 describe('TrieNode', () => {
   it('should create a TrieNode with the given value', () => {

package/test/utils/array.ts

@@ -1,4 +1,4 @@
-import {getRandomInt} from './number';
+import { getRandomInt } from './number';
 
 export function getRandomIntArray(length: number = 1000, min: number = -1000, max: number = 1000, isDistinct = true) {
   if (isDistinct) {

package/test/utils/big-o.ts

@@ -1,5 +1,5 @@
-import {AnyFunction} from '../types';
-import {isDebugTest} from '../config';
+import { AnyFunction } from '../types';
+import { isDebugTest } from '../config';
 
 const isDebug = isDebugTest;
 const orderReducedBy = 1; // reduction of bigO's order compared to the baseline bigO
@@ -32,7 +32,7 @@ export const bigO = {
 
 function findPotentialN(input: any): number {
   let longestArray: any[] = [];
-  let mostProperties: {[key: string]: any} = {};
+  let mostProperties: { [key: string]: any } = {};
 
   function recurse(obj: any) {
     if (Array.isArray(obj)) {
@@ -81,7 +81,7 @@ function linearRegression(x: number[], y: number[]) {
 
   const rSquared = 1 - totalVariation / explainedVariation;
 
-  return {slope, intercept, rSquared};
+  return { slope, intercept, rSquared };
 }
 
 function estimateBigO(runtimes: number[], dataSizes: number[]): string {

package/test/utils/json2html.ts

@@ -1,5 +1,5 @@
 import * as _ from './is';
-import {Json2htmlOptions} from '../types';
+import { Json2htmlOptions } from '../types';
 
 function toggleJS(options?: Json2htmlOptions): string {
   if (options?.plainHtml) {
@@ -14,7 +14,9 @@ function makeLabelDiv(options: any, level: number, keyName: string | number, dat
     return `<div class='index'><span class='json-to-html-label'>${keyName}&nbsp;</span></div>`;
   } else if (typeof keyName === 'string') {
     if (datatype === 'array') {
-      return `<div class='collapsible level${level}' ${toggleJS(options)}><span class='json-to-html-label'>${keyName}</span></div>`;
+      return `<div class='collapsible level${level}' ${toggleJS(
+        options
+      )}><span class='json-to-html-label'>${keyName}</span></div>`;
     } else if (datatype === 'object') {
       return `<div class='attribute collapsible level${level}' ${toggleJS(
         options
@@ -120,7 +122,9 @@ function _render(name: string, data: any, options: Json2htmlOptions, level: numb
     } else {
       subs =
         "<div class='altRows'>" +
-        data.map((val: any, idx: number) => _render(idx.toString(), val, options, level + 1, idx % 2)).join("</div><div class='altRows'>") +
+        data
+          .map((val: any, idx: number) => _render(idx.toString(), val, options, level + 1, idx % 2))
+          .join("</div><div class='altRows'>") +
         '</div>';
     }
     return `<div class="json-to-html-collapse clearfix ${altRow}">