npm - data-structure-typed - Versions diffs - 1.41.6 → 1.41.8 - Mend

data-structure-typed 1.41.6 → 1.41.8

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (115) hide show

package/test/integration/index.html ADDED Viewed

@@ -0,0 +1,51 @@
+<!DOCTYPE html>
+<html lang='en'>
+<head>
+  <meta charset='UTF-8'>
+  <title>CDN Test</title>
+  <script src='https://cdn.jsdelivr.net/npm/data-structure-typed/dist/umd/data-structure-typed.min.js'></script>
+</head>
+<body>
+<div id='app'>
+  <ul class='modules'>
+  </ul>
+</div>
+<script defer>
+  const $modules = document.querySelector('.modules');
+  try {
+    const {AVLTree, Queue} = window.dataStructureTyped;
+    const avlTree = new AVLTree();
+    const $avlTree = document.createElement('li');
+    const $avlTreeSpan = document.createElement('span');
+    $avlTreeSpan.innerText = 'AVLTree';
+    $avlTree.append($avlTreeSpan);
+    avlTree.add(1, 1);
+    console.log(avlTree.bfs());
+    $modules.append($avlTree);
+    const queue = new Queue();
+    for (let i = 0; i < 1000000; i++) {
+      queue.enqueue(i);
+    }
+    let last = 0;
+    const startTime = performance.now();
+    for (let i = 0; i < 1000000; i++) {
+      last = queue.dequeue();
+    }
+    console.log(performance.now() - startTime);
+  } catch (e) {
+    console.error(e);
+  }
+</script>
+</body>
+</html>

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

@@ -0,0 +1,36 @@
+import {AVLTree} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {getRandomIntArray, magnitude} from '../../../utils';
+const suite = new Benchmark.Suite();
+const avl = new AVLTree<number>();
+const {TEN_THOUSAND} = magnitude;
+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]);
+    }
+  })
+  .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]);
+    }
+  })
+  .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]);
+    }
+  });
+export {suite};

package/test/performance/data-structures/binary-tree/binary-index-tree.test.ts ADDED Viewed

File without changes

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

@@ -0,0 +1,45 @@
+import {BinaryTree} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {getRandomIntArray, magnitude} from '../../../utils';
+const suite = new Benchmark.Suite();
+const biTree = new BinaryTree<number>();
+const {N_LOG_N} = magnitude;
+const arr = getRandomIntArray(N_LOG_N, 0, N_LOG_N, true);
+suite
+  .add(`${N_LOG_N.toLocaleString()} add randomly`, () => {
+    biTree.clear();
+    for (let i = 0; i < arr.length; i++) {
+      biTree.add(arr[i]);
+    }
+  })
+  .add(`${N_LOG_N.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]);
+    }
+  })
+  .add(`${N_LOG_N.toLocaleString()} addMany`, () => {
+    biTree.clear();
+    biTree.addMany(arr);
+  })
+  .add(`${N_LOG_N.toLocaleString()} get`, () => {
+    for (let i = 0; i < arr.length; i++) {
+      biTree.get(arr[i]);
+    }
+  })
+  .add(`${N_LOG_N.toLocaleString()} dfs`, () => {
+    for (let i = 0; i < N_LOG_N; i++) biTree.dfs();
+  })
+  .add(`${N_LOG_N.toLocaleString()} bfs`, () => {
+    for (let i = 0; i < N_LOG_N; i++) biTree.bfs();
+  })
+  .add(`${N_LOG_N.toLocaleString()} morris`, () => {
+    for (let i = 0; i < N_LOG_N; i++) biTree.morris(n => n, 'pre');
+  });
+export {suite};

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

@@ -0,0 +1,36 @@
+import {BST} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {getRandomIntArray, magnitude} from '../../../utils';
+const suite = new Benchmark.Suite();
+const bst = new BST<number>();
+const {TEN_THOUSAND} = magnitude;
+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]);
+    }
+  })
+  .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]);
+    }
+  })
+  .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]);
+    }
+  });
+export {suite};

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

File without changes

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

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

package/test/performance/data-structures/binary-tree/segment-tree.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/binary-tree/tree-multiset.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/graph/abstract-graph.test.ts ADDED Viewed

File without changes

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

@@ -0,0 +1,49 @@
+import {DirectedGraph} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {getRandomIndex, getRandomWords, magnitude} from '../../../utils';
+const suite = new Benchmark.Suite();
+const {THOUSAND} = magnitude;
+const graph = new DirectedGraph<number, number>();
+const vertexes = getRandomWords(THOUSAND);
+suite
+  .add(`${THOUSAND.toLocaleString()} addVertex`, () => {
+    for (const v of vertexes) {
+      graph.addVertex(v);
+    }
+  })
+  .add(`${THOUSAND.toLocaleString()} addEdge`, () => {
+    for (let i = 0; i < THOUSAND; i++) {
+      const v1 = vertexes[getRandomIndex(vertexes)];
+      const v2 = vertexes[getRandomIndex(vertexes)];
+      graph.addEdge(v1, v2);
+    }
+  })
+  .add(`${THOUSAND.toLocaleString()} getVertex`, () => {
+    for (let i = 0; i < THOUSAND; i++) {
+      graph.getVertex(vertexes[getRandomIndex(vertexes)]);
+    }
+  })
+  .add(`${THOUSAND.toLocaleString()} getEdge`, () => {
+    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/graph/map-graph.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/graph/overall.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/graph/undirected-graph.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/hash/coordinate-map.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/hash/coordinate-set.test.ts ADDED Viewed

File without changes

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

File without changes

package/test/performance/data-structures/hash/hash-table.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/heap/heap.test.ts ADDED Viewed

@@ -0,0 +1,30 @@
+import {FibonacciHeap, Heap} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {magnitude} from '../../../utils';
+const suite = new Benchmark.Suite();
+const {TEN_THOUSAND} = magnitude;
+suite
+  .add(`${TEN_THOUSAND.toLocaleString()} add & pop`, () => {
+    const heap = new Heap<number>({comparator: (a, b) => b - a});
+    for (let i = 0; i < TEN_THOUSAND; i++) {
+      heap.add(i);
+    }
+    for (let i = 0; i < TEN_THOUSAND; i++) {
+      heap.pop();
+    }
+  })
+  .add(`${TEN_THOUSAND.toLocaleString()} fib add & pop`, () => {
+    const fbHeap = new FibonacciHeap<number>();
+    for (let i = 1; i <= TEN_THOUSAND; i++) {
+      fbHeap.push(i);
+    }
+    for (let i = 1; i <= TEN_THOUSAND; i++) {
+      fbHeap.pop();
+    }
+  });
+export {suite};

package/test/performance/data-structures/heap/max-heap.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/heap/min-heap.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/linked-list/doubly-linked-list.test.ts ADDED Viewed

@@ -0,0 +1,40 @@
+import {DoublyLinkedList, DoublyLinkedListNode} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {magnitude} from '../../../utils';
+const suite = new Benchmark.Suite();
+const {LINEAR} = magnitude;
+suite
+  .add(`${LINEAR.toLocaleString()} unshift`, () => {
+    const list = new DoublyLinkedList<number>();
+    for (let i = 0; i < LINEAR; i++) {
+      list.unshift(i);
+    }
+  })
+  .add(`${LINEAR.toLocaleString()} unshift & shift`, () => {
+    const list = new DoublyLinkedList<number>();
+    for (let i = 0; i < LINEAR; i++) {
+      list.unshift(i);
+    }
+    for (let i = 0; i < LINEAR; i++) {
+      list.shift();
+    }
+  })
+  .add(`${LINEAR.toLocaleString()} insertBefore`, () => {
+    const doublyList = new DoublyLinkedList<number>();
+    let midNode: DoublyLinkedListNode | null = null;
+    const midIndex = Math.floor(LINEAR / 2);
+    for (let i = 0; i < LINEAR; i++) {
+      doublyList.push(i);
+      if (i === midIndex) {
+        midNode = doublyList.getNode(i);
+      } else if (i > midIndex && midNode) {
+        doublyList.insertBefore(midNode, i);
+      }
+    }
+  });
+export {suite};

package/test/performance/data-structures/linked-list/linked-list.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/linked-list/singly-linked-list.test.ts ADDED Viewed

@@ -0,0 +1,34 @@
+import {SinglyLinkedList, SinglyLinkedListNode} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {magnitude} from '../../../utils';
+const suite = new Benchmark.Suite();
+const {TEN_THOUSAND} = magnitude;
+suite
+  .add(`${TEN_THOUSAND.toLocaleString()} push & pop`, () => {
+    const list = new SinglyLinkedList<number>();
+    for (let i = 0; i < TEN_THOUSAND; i++) {
+      list.push(i);
+    }
+    for (let i = 0; i < TEN_THOUSAND; i++) {
+      list.pop();
+    }
+  })
+  .add(`${TEN_THOUSAND.toLocaleString()} insertBefore`, () => {
+    const singlyList = new SinglyLinkedList<number>();
+    let midSinglyNode: SinglyLinkedListNode | null = null;
+    const midIndex = Math.floor(TEN_THOUSAND / 2);
+    for (let i = 0; i < TEN_THOUSAND; i++) {
+      singlyList.push(i);
+      if (i === midIndex) {
+        midSinglyNode = singlyList.getNode(i);
+      } else if (i > midIndex && midSinglyNode) {
+        singlyList.insertBefore(midSinglyNode.value, i);
+      }
+    }
+  });
+export {suite};

package/test/performance/data-structures/linked-list/skip-linked-list.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/linked-list/skip-list.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/matrix/matrix.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/matrix/matrix2d.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/matrix/navigator.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/matrix/vector2d.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/priority-queue/max-priority-queue.test.ts ADDED Viewed

@@ -0,0 +1,19 @@
+import {MaxPriorityQueue} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {magnitude} from '../../../utils';
+const suite = new Benchmark.Suite();
+const {TEN_THOUSAND} = magnitude;
+suite.add(`${TEN_THOUSAND.toLocaleString()} refill & poll`, () => {
+  const nodes = Array.from(
+    new Set<number>(Array.from(new Array(TEN_THOUSAND), () => Math.floor(Math.random() * TEN_THOUSAND * 100)))
+  );
+  const maxPQ = new MaxPriorityQueue<number>();
+  maxPQ.refill(nodes);
+  while (maxPQ.size > 0) {
+    maxPQ.poll();
+  }
+});
+export {suite};

package/test/performance/data-structures/priority-queue/min-priority-queue.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/priority-queue/priority-queue.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/queue/deque.test.ts ADDED Viewed

@@ -0,0 +1,21 @@
+import {Deque} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {magnitude} from '../../../utils';
+export const suite = new Benchmark.Suite();
+const {LINEAR} = magnitude;
+suite
+  .add(`${LINEAR.toLocaleString()} push`, () => {
+    const deque = new Deque<number>();
+    for (let i = 0; i < LINEAR; i++) {
+      deque.push(i);
+    }
+  })
+  .add(`${LINEAR.toLocaleString()} shift`, () => {
+    const deque = new Deque<number>();
+    for (let i = 0; i < LINEAR; i++) {
+      deque.push(i);
+      deque.shift();
+    }
+  });

package/test/performance/data-structures/queue/queue.test.ts ADDED Viewed

@@ -0,0 +1,25 @@
+import {Queue} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {magnitude} from '../../../utils';
+const suite = new Benchmark.Suite();
+const {LINEAR} = magnitude;
+suite
+  .add(`${LINEAR.toLocaleString()} push`, () => {
+    const queue = new Queue<number>();
+    for (let i = 0; i < LINEAR; i++) {
+      queue.push(i);
+    }
+  })
+  .add(`${LINEAR.toLocaleString()} push & shift`, () => {
+    const queue = new Queue<number>();
+    for (let i = 0; i < LINEAR; i++) {
+      queue.push(i);
+      queue.shift();
+    }
+  });
+export {suite};

package/test/performance/data-structures/stack/stack.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/tree/tree.test.ts ADDED Viewed

File without changes

package/test/performance/data-structures/trie/trie.test.ts ADDED Viewed

@@ -0,0 +1,22 @@
+import {Trie} from '../../../../src';
+import * as Benchmark from 'benchmark';
+import {getRandomWords, magnitude} from '../../../utils';
+const suite = new Benchmark.Suite();
+const {HUNDRED_THOUSAND} = magnitude;
+const trie = new Trie();
+const randomWords = getRandomWords(HUNDRED_THOUSAND, false);
+suite
+  .add(`${HUNDRED_THOUSAND.toLocaleString()} push`, () => {
+    for (let i = 0; i < randomWords.length; i++) {
+      trie.add(randomWords[i]);
+    }
+  })
+  .add(`${HUNDRED_THOUSAND.toLocaleString()} getWords`, () => {
+    for (let i = 0; i < randomWords.length; i++) {
+      trie.getWords(randomWords[i]);
+    }
+  });
+export {suite};