data-structure-typed 2.4.1 → 2.4.3

package/test/performance/data-structures/binary-tree/tree-multi-set.test.mjs

@@ -1,91 +0,0 @@
-import { TreeMultiSet } from '../../../../dist/esm/index.mjs';
-import Benchmark from 'benchmark';
-import { getRandomIntArray, magnitude } from '../../../utils/perf.mjs';
-
-const suite = new Benchmark.Suite();
-
-const { HUNDRED_THOUSAND, MILLION } = magnitude;
-
-// MultiSet operations: add/delete/setCount
-const N_ADD = MILLION;
-const N_QUERY = MILLION;
-const N_MUTATE = HUNDRED_THOUSAND;
-
-const randomAdd = getRandomIntArray(N_ADD, 0, N_ADD / 10, false); // Allow duplicates (MultiSet scenario)
-const randomQuery = getRandomIntArray(N_QUERY, 0, N_ADD / 10, false);
-
-// Prebuilt for lookup-only benchmarks
-const tmsPrebuilt = new TreeMultiSet();
-for (let i = 0; i < randomAdd.length; i++) {
-  tmsPrebuilt.add(randomAdd[i]);
-}
-
-suite
-  // Add benchmarks: fresh container inside each run
-  .add(`${N_ADD.toLocaleString()} add (TreeMultiSet, expanded iteration)`, function () {
-    const tms = new TreeMultiSet();
-    for (let i = 0; i < randomAdd.length; i++) tms.add(randomAdd[i]);
-    this.val = tms;
-  })
-
-  // Lookup-only benchmarks (no rebuild)
-  .add(`${N_QUERY.toLocaleString()} has-only (TreeMultiSet)`, function () {
-    for (let i = 0; i < randomQuery.length; i++) tmsPrebuilt.has(randomQuery[i]);
-  })
-  .add(`${N_QUERY.toLocaleString()} count-only (TreeMultiSet)`, function () {
-    for (let i = 0; i < randomQuery.length; i++) tmsPrebuilt.count(randomQuery[i]);
-  })
-
-  // Build + lookup
-  .add(`${N_QUERY.toLocaleString()} build+has (TreeMultiSet)`, function () {
-    const tms = new TreeMultiSet();
-    for (let i = 0; i < randomAdd.length; i++) tms.add(randomAdd[i]);
-    for (let i = 0; i < randomQuery.length; i++) tms.has(randomQuery[i]);
-    this.val = tms;
-  })
-  .add(`${N_QUERY.toLocaleString()} build+count (TreeMultiSet)`, function () {
-    const tms = new TreeMultiSet();
-    for (let i = 0; i < randomAdd.length; i++) tms.add(randomAdd[i]);
-    for (let i = 0; i < randomQuery.length; i++) tms.count(randomQuery[i]);
-    this.val = tms;
-  })
-
-  // Mutation: delete one occurrence
-  .add(`${N_MUTATE.toLocaleString()} delete-one (TreeMultiSet)`, function () {
-    const tms = new TreeMultiSet();
-    for (let i = 0; i < randomAdd.length; i++) tms.add(randomAdd[i]);
-    for (let i = 0; i < N_MUTATE; i++) tms.delete(randomQuery[i]);
-    this.val = tms;
-  })
-
-  // setCount operation
-  .add(`${N_MUTATE.toLocaleString()} setCount (TreeMultiSet)`, function () {
-    const tms = new TreeMultiSet();
-    for (let i = 0; i < randomAdd.length; i++) tms.add(randomAdd[i]);
-    for (let i = 0; i < N_MUTATE; i++) tms.setCount(randomQuery[i], 5);
-    this.val = tms;
-  })
-
-  // Iteration: expanded (default)
-  .add(`${N_ADD.toLocaleString()} expanded iteration (TreeMultiSet)`, function () {
-    let sum = 0;
-    for (const val of tmsPrebuilt) sum += val;
-    this.val = sum;
-  })
-
-  // Iteration: entries view
-  .add(`${N_ADD.toLocaleString()} entries view (TreeMultiSet)`, function () {
-    let sum = 0;
-    for (const [val, count] of tmsPrebuilt.entries()) sum += val * count;
-    this.val = sum;
-  })
-
-  // Size operations
-  .add(`${N_ADD.toLocaleString()} size property (TreeMultiSet)`, function () {
-    this.val = tmsPrebuilt.size;
-  })
-  .add(`${N_ADD.toLocaleString()} distinctSize property (TreeMultiSet)`, function () {
-    this.val = tmsPrebuilt.distinctSize;
-  });
-
-export { suite };

package/test/performance/data-structures/binary-tree/tree-set.test.cpp

@@ -1,127 +0,0 @@
-#include <benchmark/benchmark.h>
-#include <set>
-#include <vector>
-#include <random>
-#include <string>
-
-static const int MILLION = 1000000;
-static const int HUNDRED_THOUSAND = 100000;
-
-// Global RNG
-static std::mt19937 gen(42);
-
-static std::vector<int> generateRandomArray(int size, int max_value) {
-  std::vector<int> arr;
-  arr.reserve(size);
-  std::uniform_int_distribution<> dist(0, max_value - 1);
-  for (int i = 0; i < size; i++) arr.push_back(dist(gen));
-  return arr;
-}
-
-static const auto randomKeys = generateRandomArray(MILLION, MILLION - 1);
-
-// Prebuilt set for lookup-only benchmarks
-static std::set<int> prebuiltSet;
-static bool setInitialized = false;
-
-static void initializeSet() {
-  if (!setInitialized) {
-    for (int i = 0; i < MILLION; i++) {
-      prebuiltSet.insert(randomKeys[i]);
-    }
-    setInitialized = true;
-  }
-}
-
-// -----------------
-// ADD (insert)
-// -----------------
-static void Add1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::set<int> st;
-    for (int i = 0; i < MILLION; i++) {
-      st.insert(randomKeys[i]);
-    }
-    benchmark::DoNotOptimize(st);
-  }
-}
-BENCHMARK(Add1M)->Name("1M add std::set")->Unit(benchmark::kMillisecond);
-
-// -----------------
-// HAS (find, lookup-only)
-// -----------------
-static void Has1M(benchmark::State& state) {
-  initializeSet();
-  for (auto _ : state) {
-    int count = 0;
-    for (int i = 0; i < MILLION; i++) {
-      if (prebuiltSet.find(randomKeys[i]) != prebuiltSet.end()) count++;
-    }
-    benchmark::DoNotOptimize(count);
-  }
-}
-BENCHMARK(Has1M)->Name("1M has std::set")->Unit(benchmark::kMillisecond);
-
-// -----------------
-// BUILD + HAS
-// -----------------
-static void BuildHas1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::set<int> st;
-    for (int i = 0; i < MILLION; i++) {
-      st.insert(randomKeys[i]);
-    }
-    int count = 0;
-    for (int i = 0; i < MILLION; i++) {
-      if (st.find(randomKeys[i]) != st.end()) count++;
-    }
-    benchmark::DoNotOptimize(count);
-  }
-}
-BENCHMARK(BuildHas1M)->Name("1M build+has std::set")->Unit(benchmark::kMillisecond);
-
-// -----------------
-// RANGE SEARCH (using lower_bound/upper_bound)
-// -----------------
-static void RangeSearch100K(benchmark::State& state) {
-  initializeSet();
-  for (auto _ : state) {
-    int count = 0;
-    auto lo = prebuiltSet.lower_bound(0);
-    auto hi = prebuiltSet.upper_bound(HUNDRED_THOUSAND - 1);
-    for (auto it = lo; it != hi; ++it) {
-      count++;
-    }
-    benchmark::DoNotOptimize(count);
-  }
-}
-BENCHMARK(RangeSearch100K)->Name("100K rangeSearch std::set")->Unit(benchmark::kMillisecond);
-
-// -----------------
-// NAVIGABLE (ceiling/floor/higher/lower equivalent)
-// -----------------
-static void Navigable100K(benchmark::State& state) {
-  initializeSet();
-  for (auto _ : state) {
-    int sum = 0;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      // lower_bound = ceiling
-      auto ceiling = prebuiltSet.lower_bound(i);
-      // floor = --upper_bound (if not begin)
-      auto floor = prebuiltSet.upper_bound(i);
-      if (floor != prebuiltSet.begin()) --floor;
-      // higher = upper_bound
-      auto higher = prebuiltSet.upper_bound(i);
-      // lower = --lower_bound (if not begin)
-      auto lower = prebuiltSet.lower_bound(i);
-      if (lower != prebuiltSet.begin()) --lower;
-      
-      if (ceiling != prebuiltSet.end()) sum += *ceiling;
-      if (higher != prebuiltSet.end()) sum += *higher;
-    }
-    benchmark::DoNotOptimize(sum);
-  }
-}
-BENCHMARK(Navigable100K)->Name("100K navigable std::set")->Unit(benchmark::kMillisecond);
-
-BENCHMARK_MAIN();

package/test/performance/data-structures/binary-tree/tree-set.test.mjs

@@ -1,174 +0,0 @@
-import { RedBlackTree, TreeSet } from '../../../../dist/esm/index.mjs';
-import { OrderedSet } from 'js-sdsl';
-import Benchmark from 'benchmark';
-import { getRandomIntArray, magnitude } from '../../../utils/perf.mjs';
-
-const suite = new Benchmark.Suite();
-
-const { HUNDRED_THOUSAND, MILLION } = magnitude;
-
-// Keep add/get/has large; keep range operations smaller.
-const N_ADD = MILLION;
-const N_QUERY = MILLION;
-const N_RANGE = HUNDRED_THOUSAND;
-
-const randomAdd = getRandomIntArray(N_ADD, 0, N_ADD - 1, true);
-const randomQuery = randomAdd;
-
-// Prebuilt containers for lookup-only benchmarks (read-only during runs)
-const treeSetOn = new TreeSet();
-const treeSetOff = new TreeSet([], { isMapMode: false });
-const rbtSetOn = new RedBlackTree();
-const rbtSetOff = new RedBlackTree([], { isMapMode: false });
-const sdslSet = new OrderedSet();
-
-for (let i = 0; i < randomAdd.length; i++) {
-  const k = randomAdd[i];
-  treeSetOn.add(k);
-  treeSetOff.add(k);
-  rbtSetOn.set(k, undefined);
-  rbtSetOff.set(k, undefined);
-  sdslSet.insert(k);
-}
-const sdslEnd = sdslSet.end();
-
-suite
-  // Insert benchmarks: fresh container inside each run.
-  .add(`${N_ADD.toLocaleString()} add TreeSet`, function () {
-    const st = new TreeSet();
-    for (let i = 0; i < randomAdd.length; i++) st.add(randomAdd[i]);
-    this.val = st;
-  })
-  .add(`${N_ADD.toLocaleString()} add TreeSet (Node)`, function () {
-    const st = new TreeSet([], { isMapMode: false });
-    for (let i = 0; i < randomAdd.length; i++) st.add(randomAdd[i]);
-    this.val = st;
-  })
-  .add(`${N_ADD.toLocaleString()} add RBT`, function () {
-    const st = new RedBlackTree();
-    for (let i = 0; i < randomAdd.length; i++) st.set(randomAdd[i], undefined);
-    this.val = st;
-  })
-  .add(`${N_ADD.toLocaleString()} add RBT (Node)`, function () {
-    const st = new RedBlackTree([], { isMapMode: false });
-    for (let i = 0; i < randomAdd.length; i++) st.set(randomAdd[i], undefined);
-    this.val = st;
-  })
-  .add(`${N_ADD.toLocaleString()} add js-sdsl`, function () {
-    const st = new OrderedSet();
-    for (let i = 0; i < randomAdd.length; i++) st.insert(randomAdd[i]);
-    this.val = st;
-  })
-
-  // Lookup-only benchmarks (no rebuild).
-  .add(`${N_QUERY.toLocaleString()} has TreeSet`, function () {
-    for (let i = 0; i < randomQuery.length; i++) treeSetOn.has(randomQuery[i]);
-  })
-  .add(`${N_QUERY.toLocaleString()} has TreeSet (Node)`, function () {
-    for (let i = 0; i < randomQuery.length; i++) treeSetOff.has(randomQuery[i]);
-  })
-  .add(`${N_QUERY.toLocaleString()} has RBT`, function () {
-    for (let i = 0; i < randomQuery.length; i++) rbtSetOn.has(randomQuery[i]);
-  })
-  .add(`${N_QUERY.toLocaleString()} has RBT (Node)`, function () {
-    for (let i = 0; i < randomQuery.length; i++) rbtSetOff.has(randomQuery[i]);
-  })
-  .add(`${N_QUERY.toLocaleString()} has js-sdsl`, function () {
-    for (let i = 0; i < randomQuery.length; i++) sdslSet.find(randomQuery[i]).equals(sdslEnd);
-  })
-
-  // Lookup benchmarks: build + lookup.
-  .add(`${N_QUERY.toLocaleString()} build+has TreeSet`, function () {
-    const st = new TreeSet();
-    for (let i = 0; i < randomAdd.length; i++) st.add(randomAdd[i]);
-    for (let i = 0; i < randomQuery.length; i++) st.has(randomQuery[i]);
-    this.val = st;
-  })
-  .add(`${N_QUERY.toLocaleString()} build+has TreeSet (Node)`, function () {
-    const st = new TreeSet([], { isMapMode: false });
-    for (let i = 0; i < randomAdd.length; i++) st.add(randomAdd[i]);
-    for (let i = 0; i < randomQuery.length; i++) st.has(randomQuery[i]);
-    this.val = st;
-  })
-  .add(`${N_QUERY.toLocaleString()} build+has RBT`, function () {
-    const st = new RedBlackTree();
-    for (let i = 0; i < randomAdd.length; i++) st.set(randomAdd[i], undefined);
-    for (let i = 0; i < randomQuery.length; i++) st.has(randomQuery[i]);
-    this.val = st;
-  })
-  .add(`${N_QUERY.toLocaleString()} build+has RBT (Node)`, function () {
-    const st = new RedBlackTree([], { isMapMode: false });
-    for (let i = 0; i < randomAdd.length; i++) st.set(randomAdd[i], undefined);
-    for (let i = 0; i < randomQuery.length; i++) st.has(randomQuery[i]);
-    this.val = st;
-  })
-  .add(`${N_QUERY.toLocaleString()} build+has js-sdsl`, function () {
-    const st = new OrderedSet();
-    for (let i = 0; i < randomAdd.length; i++) st.insert(randomAdd[i]);
-    for (let i = 0; i < randomQuery.length; i++) st.find(randomQuery[i]).equals(st.end());
-    this.val = st;
-  })
-
-  // Range operations (lookup-only).
-  .add(`${N_RANGE.toLocaleString()} rangeSearch TreeSet`, function () {
-    const out = treeSetOn.rangeSearch([0, N_RANGE - 1]);
-    this.val = out.length;
-  })
-  .add(`${N_RANGE.toLocaleString()} rangeSearch TreeSet (Node)`, function () {
-    const out = treeSetOff.rangeSearch([0, N_RANGE - 1]);
-    this.val = out.length;
-  })
-  .add(`${N_RANGE.toLocaleString()} navigable TreeSet`, function () {
-    for (let i = 0; i < N_RANGE; i++) {
-      treeSetOn.ceiling(i);
-      treeSetOn.floor(i);
-      treeSetOn.higher(i);
-      treeSetOn.lower(i);
-    }
-  })
-  .add(`${N_RANGE.toLocaleString()} navigable TreeSet (Node)`, function () {
-    for (let i = 0; i < N_RANGE; i++) {
-      treeSetOff.ceiling(i);
-      treeSetOff.floor(i);
-      treeSetOff.higher(i);
-      treeSetOff.lower(i);
-    }
-  })
-
-  // Range operations (build + range).
-  .add(`${N_RANGE.toLocaleString()} build+rangeSearch TreeSet`, function () {
-    const st = new TreeSet();
-    for (let i = 0; i < randomAdd.length; i++) st.add(randomAdd[i]);
-    const out = st.rangeSearch([0, N_RANGE - 1]);
-    this.val = out.length;
-  })
-  .add(`${N_RANGE.toLocaleString()} build+rangeSearch TreeSet (Node)`, function () {
-    const st = new TreeSet([], { isMapMode: false });
-    for (let i = 0; i < randomAdd.length; i++) st.add(randomAdd[i]);
-    const out = st.rangeSearch([0, N_RANGE - 1]);
-    this.val = out.length;
-  })
-  .add(`${N_RANGE.toLocaleString()} build+navigable TreeSet`, function () {
-    const st = new TreeSet();
-    for (let i = 0; i < randomAdd.length; i++) st.add(randomAdd[i]);
-    for (let i = 0; i < N_RANGE; i++) {
-      st.ceiling(i);
-      st.floor(i);
-      st.higher(i);
-      st.lower(i);
-    }
-    this.val = st;
-  })
-  .add(`${N_RANGE.toLocaleString()} build+navigable TreeSet (Node)`, function () {
-    const st = new TreeSet([], { isMapMode: false });
-    for (let i = 0; i < randomAdd.length; i++) st.add(randomAdd[i]);
-    for (let i = 0; i < N_RANGE; i++) {
-      st.ceiling(i);
-      st.floor(i);
-      st.higher(i);
-      st.lower(i);
-    }
-    this.val = st;
-  });
-
-export { suite };

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

@@ -1,99 +0,0 @@
-import { Heap as SRCPriorityQueue } from '../../../../dist/esm/index.mjs';
-import {
-  Deque as CDeque,
-  HashMap as CHashMap,
-  LinkList as CLinkedList,
-  OrderedMap,
-  PriorityQueue as CPriorityQueue,
-  Queue as CQueue,
-  Stack as CStack
-} from 'js-sdsl';
-
-import Benchmark from 'benchmark';
-import { getRandomIntArray, magnitude } from '../../../utils/perf.mjs'
-import { isCompetitor } from '../../../config.mjs';
-
-const suite = new Benchmark.Suite();
-const { HUNDRED_THOUSAND, MILLION } = magnitude;
-const cOrderedMap = new OrderedMap();
-const arrHundredThousand = getRandomIntArray(HUNDRED_THOUSAND, 0, HUNDRED_THOUSAND, true);
-
-suite.add(`SRC PQ ${MILLION.toLocaleString()} add`, () => {
-  const pq = new SRCPriorityQueue();
-  for (let i = 0; i < MILLION; i++) pq.add(i);
-});
-
-if (isCompetitor) {
-  suite.add(`CPT PQ ${HUNDRED_THOUSAND.toLocaleString()} add`, () => {
-    const pq = new CPriorityQueue();
-    for (let i = 0; i < HUNDRED_THOUSAND; i++) pq.push(i);
-  });
-}
-
-suite.add(`SRC PQ ${HUNDRED_THOUSAND.toLocaleString()} add & poll`, () => {
-  const pq = new SRCPriorityQueue([], {
-    comparator: (a, b) => b - a
-  });
-
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) pq.add(i);
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) pq.poll();
-});
-
-if (isCompetitor) {
-  suite
-    .add(`CPT PQ ${MILLION.toLocaleString()} add & pop`, () => {
-      const pq = new CPriorityQueue();
-
-      for (let i = 0; i < MILLION; i++) pq.push(i);
-      for (let i = 0; i < MILLION; i++) pq.pop();
-    })
-    .add(`CPT OM ${HUNDRED_THOUSAND.toLocaleString()} add`, () => {
-      for (let i = 0; i < arrHundredThousand.length; i++)
-        cOrderedMap.setElement(arrHundredThousand[i], arrHundredThousand[i]);
-    })
-    .add(`CPT HM ${HUNDRED_THOUSAND.toLocaleString()} set`, () => {
-      const hm = new CHashMap();
-
-      for (let i = 0; i < HUNDRED_THOUSAND; i++) hm.setElement(i, i);
-    })
-    .add(`CPT HM ${HUNDRED_THOUSAND.toLocaleString()} set & get`, () => {
-      const hm = new CHashMap();
-
-      for (let i = 0; i < HUNDRED_THOUSAND; i++) hm.setElement(i, i);
-      for (let i = 0; i < HUNDRED_THOUSAND; i++) hm.getElementByKey(i);
-    })
-    .add(`CPT LL ${MILLION.toLocaleString()} unshift`, () => {
-      const list = new CLinkedList();
-
-      for (let i = 0; i < MILLION; i++) list.pushFront(i);
-    })
-    .add(`CPT PQ ${HUNDRED_THOUSAND.toLocaleString()} add & pop`, () => {
-      const pq = new CPriorityQueue();
-
-      for (let i = 0; i < HUNDRED_THOUSAND; i++) pq.push(i);
-
-      for (let i = 0; i < HUNDRED_THOUSAND; i++) pq.pop();
-    })
-    .add(`CPT DQ ${MILLION.toLocaleString()} push`, () => {
-      const deque = new CDeque();
-      for (let i = 0; i < MILLION; i++) deque.pushBack(i);
-    })
-    .add(`CPT Q ${MILLION.toLocaleString()} push`, () => {
-      const queue = new CQueue();
-
-      for (let i = 0; i < MILLION; i++) queue.push(i);
-    })
-    .add(`CPT ST ${MILLION.toLocaleString()} push`, () => {
-      const queue = new CStack();
-
-      for (let i = 0; i < MILLION; i++) queue.push(i);
-    })
-    .add(`CPT ST ${MILLION.toLocaleString()} push & pop`, () => {
-      const queue = new CStack();
-
-      for (let i = 0; i < MILLION; i++) queue.push(i);
-      for (let i = 0; i < MILLION; i++) queue.pop();
-    });
-}
-
-export { suite };

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

@@ -1,38 +0,0 @@
-import { DirectedGraph } from '../../../../dist/esm/index.mjs';
-import Benchmark from 'benchmark';
-import { getRandomIndex, getRandomWords, magnitude } from '../../../utils/perf.mjs'
-
-const suite = new Benchmark.Suite();
-const { THOUSAND } = magnitude;
-const graph = new DirectedGraph();
-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`, () => {
-    graph.tarjan();
-  })
-  // .add(`tarjan all`, () => {
-  //   graph.tarjan(true, true, true, true);
-  // })
-  .add(`topologicalSort`, () => {
-    graph.topologicalSort('key');
-  });
-
-export { suite };