data-structure-typed 2.4.1 → 2.4.3

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

@@ -1,183 +0,0 @@
-#include <benchmark/benchmark.h>
-#include <unordered_map>
-#include <unordered_set>
-
-const int MILLION = 1000000;
-
-std::string formatNumber(int num) {
-  std::string result = std::to_string(num);
-  int n = result.length() - 3;
-  while (n > 0) {
-    result.insert(n, ",");
-    n -= 3;
-  }
-  return result;
-}
-
-// Test 1: 1M set
-static void Set1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::unordered_map<int, int> hm;
-    for (int i = 0; i < MILLION; i++) {
-      hm[i] = i;
-    }
-    benchmark::DoNotOptimize(hm);
-  }
-}
-BENCHMARK(Set1M)->Name("1M set");
-
-// Test 2: Native std::map 1M set (for comparison)
-static void StdMapSet1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::map<int, int> hm;
-    for (int i = 0; i < MILLION; i++) {
-      hm[i] = i;
-    }
-    benchmark::DoNotOptimize(hm);
-  }
-}
-BENCHMARK(StdMapSet1M)->Name("std::map 1M set");
-
-// Test 3: std::unordered_set 1M add
-static void UnorderedSetAdd1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::unordered_set<int> hs;
-    for (int i = 0; i < MILLION; i++) {
-      hs.insert(i);
-    }
-    benchmark::DoNotOptimize(hs);
-  }
-}
-BENCHMARK(UnorderedSetAdd1M)->Name("std::unordered_set 1M add");
-
-// Test 4: 1M set & get
-static void SetAndGet1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::unordered_map<int, int> hm;
-    for (int i = 0; i < MILLION; i++) {
-      hm[i] = i;
-    }
-    int count = 0;
-    for (int i = 0; i < MILLION; i++) {
-      if (hm.find(i) != hm.end()) {
-        count++;
-      }
-    }
-    benchmark::DoNotOptimize(count);
-  }
-}
-BENCHMARK(SetAndGet1M)->Name("1M set & get");
-
-// Test 5: std::map 1M set & get
-static void StdMapSetAndGet1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::map<int, int> hm;
-    for (int i = 0; i < MILLION; i++) {
-      hm[i] = i;
-    }
-    int count = 0;
-    for (int i = 0; i < MILLION; i++) {
-      if (hm.find(i) != hm.end()) {
-        count++;
-      }
-    }
-    benchmark::DoNotOptimize(count);
-  }
-}
-BENCHMARK(StdMapSetAndGet1M)->Name("std::map 1M set & get");
-
-// Test 6: std::unordered_set 1M add & has
-static void UnorderedSetAddAndHas1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::unordered_set<int> hs;
-    for (int i = 0; i < MILLION; i++) {
-      hs.insert(i);
-    }
-    int count = 0;
-    for (int i = 0; i < MILLION; i++) {
-      if (hs.find(i) != hs.end()) {
-        count++;
-      }
-    }
-    benchmark::DoNotOptimize(count);
-  }
-}
-BENCHMARK(UnorderedSetAddAndHas1M)->Name("std::unordered_set 1M add & has");
-
-// Test 7: 1M ObjKey set & get
-static void ObjKeySetAndGet1M(benchmark::State& state) {
-  for (auto _ : state) {
-    struct Obj { int key; int value; };
-    struct ObjHash { size_t operator()(const Obj& o) const { return std::hash<int>()(o.key); } };
-    struct ObjEqual { bool operator()(const Obj& a, const Obj& b) const { return a.key == b.key; } };
-    
-    std::unordered_map<Obj, int, ObjHash, ObjEqual> hm;
-    std::vector<Obj> objKeys;
-    for (int i = 0; i < MILLION; i++) {
-      Obj obj = {i, i};
-      objKeys.push_back(obj);
-      hm[obj] = i;
-    }
-    
-    int count = 0;
-    for (int i = 0; i < MILLION; i++) {
-      if (hm.find(objKeys[i]) != hm.end()) {
-        count++;
-      }
-    }
-    benchmark::DoNotOptimize(count);
-  }
-}
-BENCHMARK(ObjKeySetAndGet1M)->Name("1M ObjKey set & get");
-
-// Test 8: std::map 1M ObjKey set & get
-static void StdMapObjKeySetAndGet1M(benchmark::State& state) {
-  for (auto _ : state) {
-    struct Obj { int key; int value; bool operator<(const Obj& other) const { return key < other.key; } };
-    
-    std::map<Obj, int> hm;
-    std::vector<Obj> objs;
-    for (int i = 0; i < MILLION; i++) {
-      Obj obj = {i, i};
-      objs.push_back(obj);
-      hm[obj] = i;
-    }
-    
-    int count = 0;
-    for (int i = 0; i < MILLION; i++) {
-      if (hm.find(objs[i]) != hm.end()) {
-        count++;
-      }
-    }
-    benchmark::DoNotOptimize(count);
-  }
-}
-BENCHMARK(StdMapObjKeySetAndGet1M)->Name("std::map 1M ObjKey set & get");
-
-// Test 9: std::unordered_set 1M ObjKey add & has
-static void UnorderedSetObjKeyAddAndHas1M(benchmark::State& state) {
-  for (auto _ : state) {
-    struct Obj { int key; int value; };
-    struct ObjHash { size_t operator()(const Obj& o) const { return std::hash<int>()(o.key); } };
-    struct ObjEqual { bool operator()(const Obj& a, const Obj& b) const { return a.key == b.key; } };
-    
-    std::unordered_set<Obj, ObjHash, ObjEqual> hs;
-    std::vector<Obj> objs;
-    for (int i = 0; i < MILLION; i++) {
-      Obj obj = {i, i};
-      objs.push_back(obj);
-      hs.insert(obj);
-    }
-    
-    int count = 0;
-    for (int i = 0; i < MILLION; i++) {
-      if (hs.find(objs[i]) != hs.end()) {
-        count++;
-      }
-    }
-    benchmark::DoNotOptimize(count);
-  }
-}
-BENCHMARK(UnorderedSetObjKeyAddAndHas1M)->Name("std::unordered_set 1M ObjKey add & has");
-
-BENCHMARK_MAIN();

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

@@ -1,187 +0,0 @@
-import { HashMap } from '../../../../dist/esm/index.mjs';
-import { HashMap as SdslHashMap, HashSet as SdslHashSet } from 'js-sdsl';
-import Benchmark from 'benchmark';
-import { magnitude } from '../../../utils/perf.mjs';
-
-const suite = new Benchmark.Suite();
-const { MILLION } = magnitude;
-
-suite.add('1M set', function() {
-  const hm = new HashMap();
-  for (let i = 0; i < MILLION; i++) {
-    hm.set(i, i);
-  }
-  this.val = hm;
-});
-
-suite.add('1M set (js-sdsl)', function() {
-  const hm = new SdslHashMap();
-  for (let i = 0; i < MILLION; i++) {
-    hm.setElement(i, i);
-  }
-  this.val = hm;
-});
-
-suite.add('Native JS Map 1M set', function() {
-  const hm = new Map();
-  for (let i = 0; i < MILLION; i++) {
-    hm.set(i, i);
-  }
-  this.val = hm;
-});
-
-suite.add('Native JS Set 1M add', function() {
-  const hs = new Set();
-  for (let i = 0; i < MILLION; i++) {
-    hs.add(i);
-  }
-  this.val = hs;
-});
-
-suite.add('1M add HashSet (js-sdsl)', function() {
-  const hs = new SdslHashSet();
-  for (let i = 0; i < MILLION; i++) {
-    hs.insert(i);
-  }
-  this.val = hs;
-});
-
-suite.add('1M set & get', function() {
-  const hm = new HashMap();
-  for (let i = 0; i < MILLION; i++) {
-    hm.set(i, i);
-  }
-  let count = 0;
-  for (let i = 0; i < MILLION; i++) {
-    if (hm.get(i) !== undefined) {
-      count++;
-    }
-  }
-  this.val = count;
-});
-
-suite.add('1M set & get (js-sdsl)', function() {
-  const hm = new SdslHashMap();
-  for (let i = 0; i < MILLION; i++) {
-    hm.setElement(i, i);
-  }
-  let count = 0;
-  for (let i = 0; i < MILLION; i++) {
-    if (hm.getElementByKey(i) !== undefined) {
-      count++;
-    }
-  }
-  this.val = count;
-});
-
-suite.add('Native JS Map 1M set & get', function() {
-  const hm = new Map();
-  for (let i = 0; i < MILLION; i++) {
-    hm.set(i, i);
-  }
-  let count = 0;
-  for (let i = 0; i < MILLION; i++) {
-    if (hm.get(i) !== undefined) {
-      count++;
-    }
-  }
-  this.val = count;
-});
-
-suite.add('Native JS Set 1M add & has', function() {
-  const hs = new Set();
-  for (let i = 0; i < MILLION; i++) {
-    hs.add(i);
-  }
-  let count = 0;
-  for (let i = 0; i < MILLION; i++) {
-    if (hs.has(i)) {
-      count++;
-    }
-  }
-  this.val = count;
-});
-
-suite.add('1M add & has HashSet (js-sdsl)', function() {
-  const hs = new SdslHashSet();
-  for (let i = 0; i < MILLION; i++) {
-    hs.insert(i);
-  }
-  let count = 0;
-  for (let i = 0; i < MILLION; i++) {
-    if (hs.find(i).equals(hs.end()) === false) {
-      count++;
-    }
-  }
-  this.val = count;
-});
-
-suite.add('1M ObjKey set & get', function() {
-  const hm = new HashMap();
-  const objKeys = [];
-  for (let i = 0; i < MILLION; i++) {
-    const obj = { key: i, value: i };
-    objKeys.push(obj);
-    hm.set(obj, i);
-  }
-  let count = 0;
-  for (let i = 0; i < MILLION; i++) {
-    if (hm.get(objKeys[i]) !== undefined) {
-      count++;
-    }
-  }
-  this.val = count;
-});
-
-suite.add('1M ObjKey set & get (js-sdsl)', function() {
-  const hm = new SdslHashMap();
-  const objKeys = [];
-  for (let i = 0; i < MILLION; i++) {
-    const obj = { key: i, value: i };
-    objKeys.push(obj);
-    hm.setElement(obj, i);
-  }
-  let count = 0;
-  for (let i = 0; i < MILLION; i++) {
-    if (hm.getElementByKey(objKeys[i]) !== undefined) {
-      count++;
-    }
-  }
-  this.val = count;
-});
-
-suite.add('Native JS Map 1M ObjKey set & get', function() {
-  const hm = new Map();
-  const objs = [];
-  for (let i = 0; i < MILLION; i++) {
-    const obj = { key: i, value: i };
-    objs.push(obj);
-    hm.set(obj, i);
-  }
-  let count = 0;
-  for (let i = 0; i < MILLION; i++) {
-    if (hm.get(objs[i]) !== undefined) {
-      count++;
-    }
-  }
-  this.val = count;
-});
-
-suite.add('Native JS Set 1M ObjKey add & has', function() {
-  const hs = new Set();
-  const objs = [];
-  for (let i = 0; i < MILLION; i++) {
-    const obj = { key: i, value: i };
-    objs.push(obj);
-    hs.add(obj);
-  }
-  let count = 0;
-  for (let i = 0; i < MILLION; i++) {
-    if (hs.has(objs[i])) {
-      count++;
-    }
-  }
-  this.val = count;
-});
-
-export { suite };

package/test/performance/data-structures/heap/heap.test.cpp

@@ -1,61 +0,0 @@
-#include <benchmark/benchmark.h>
-#include <queue>
-#include <random>
-#include <vector>
-
-const int HUNDRED_THOUSAND = 100000;
-
-// Global random number generator
-std::mt19937 gen(std::random_device{}());
-std::uniform_int_distribution<> dis(0, HUNDRED_THOUSAND - 1);
-
-// Generate random array
-std::vector<int> generateRandomArray(int size) {
-  std::vector<int> arr;
-  arr.reserve(size);
-  for (int i = 0; i < size; i++) {
-    arr.push_back(dis(gen));
-  }
-  return arr;
-}
-
-static const auto indicesHT = generateRandomArray(HUNDRED_THOUSAND);
-
-std::string formatNumber(int num) {
-  std::string result = std::to_string(num);
-  int n = result.length() - 3;
-  while (n > 0) {
-    result.insert(n, ",");
-    n -= 3;
-  }
-  return result;
-}
-
-// Test 1: 100K add
-static void Add100K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::priority_queue<int, std::vector<int>, std::greater<int>> heap;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      heap.push(indicesHT[i]);
-    }
-    benchmark::DoNotOptimize(heap);
-  }
-}
-BENCHMARK(Add100K)->Name(formatNumber(HUNDRED_THOUSAND) + " add");
-
-// Test 2: 100K add & poll
-static void AddAndPoll100K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::priority_queue<int, std::vector<int>, std::greater<int>> heap;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      heap.push(indicesHT[i]);
-    }
-    while (!heap.empty()) {
-      heap.pop();
-    }
-    benchmark::DoNotOptimize(heap);
-  }
-}
-BENCHMARK(AddAndPoll100K)->Name(formatNumber(HUNDRED_THOUSAND) + " add & poll");
-
-BENCHMARK_MAIN();

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

@@ -1,31 +0,0 @@
-import { Heap } from '../../../../dist/esm/index.mjs';
-import Benchmark from 'benchmark';
-import { getRandomInt, magnitude } from '../../../utils/perf.mjs';
-
-const suite = new Benchmark.Suite();
-const { HUNDRED_THOUSAND } = magnitude;
-
-const indicesHT = new Array(HUNDRED_THOUSAND)
-    .fill(0)
-    .map(() => getRandomInt(0, HUNDRED_THOUSAND - 1));
-
-suite.add('100K add', function() {
-    const heap = new Heap([], { comparator: (a, b) => b - a });
-    for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-        heap.add(indicesHT[i]);
-    }
-    this.val = heap;
-});
-
-suite.add('100K add & poll', function() {
-    const heap = new Heap([], { comparator: (a, b) => b - a });
-    for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-        heap.add(indicesHT[i]);
-    }
-    for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-        heap.poll();
-    }
-    this.val = heap;
-});
-
-export { suite };

package/test/performance/data-structures/linked-list/doubly-linked-list.test.cpp

@@ -1,84 +0,0 @@
-#include <benchmark/benchmark.h>
-#include <list>
-
-const int HUNDRED_THOUSAND = 100000;
-
-// Test 1: 100k push
-static void Push1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::list<int> list;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      list.push_back(i);
-    }
-    benchmark::DoNotOptimize(list);
-  }
-}
-BENCHMARK(Push1M)->Name("100k push");
-
-// Test 2: 100k unshift
-static void Unshift1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::list<int> list;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      list.push_front(i);
-    }
-    benchmark::DoNotOptimize(list);
-  }
-}
-BENCHMARK(Unshift1M)->Name("100k unshift");
-
-// Test 3: 100k unshift & shift
-static void UnshiftAndShift1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::list<int> list;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      list.push_front(i);
-    }
-    while (!list.empty()) {
-      list.pop_front();
-    }
-    benchmark::DoNotOptimize(list);
-  }
-}
-BENCHMARK(UnshiftAndShift1M)->Name("100k unshift & shift");
-
-// Test 4: 100k addAt(mid): index-like insertion (re-locate mid iterator for each insert)
-static void AddAtMid1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::list<int> list;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      list.push_back(i);
-    }
-
-    for (int i = 0; i < HUNDRED_THOUSAND / 10; i++) {
-      auto it = list.begin();
-      std::advance(it, HUNDRED_THOUSAND / 2);
-      list.insert(it, i);
-    }
-
-    benchmark::DoNotOptimize(list);
-  }
-}
-// Keep iterations low: this workload is intentionally heavy (O(n * inserts)).
-BENCHMARK(AddAtMid1M)->Name("100k addAt(mid)")->Iterations(1);
-
-// Test 5: 100k addBefore (cursor): insert before a fixed cursor (iterator)
-static void AddBeforeCursor1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::list<int> list;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      list.push_back(i);
-    }
-
-    auto cursor = list.begin();
-    std::advance(cursor, HUNDRED_THOUSAND / 2);
-
-    for (int i = 0; i < HUNDRED_THOUSAND / 10; i++) {
-      list.insert(cursor, i);
-    }
-    benchmark::DoNotOptimize(list);
-  }
-}
-BENCHMARK(AddBeforeCursor1M)->Name("100k addBefore (cursor)");
-
-BENCHMARK_MAIN();

package/test/performance/data-structures/linked-list/doubly-linked-list.test.mjs

@@ -1,125 +0,0 @@
-import { DoublyLinkedList } from '../../../../dist/esm/index.mjs';
-import { LinkList as SdslLinkList } from 'js-sdsl';
-import Benchmark from 'benchmark';
-import { magnitude } from '../../../utils/perf.mjs';
-
-const suite = new Benchmark.Suite();
-const { HUNDRED_THOUSAND } = magnitude;
-
-// NOTE: Avoid mutating a global list in a benchmark case.
-// Benchmark.js will call the test function many times, so a global list would grow and
-// slow down over time, distorting results.
-
-suite.add('100k push', function() {
-  const list = new DoublyLinkedList();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    list.push(i);
-  }
-  this.val = list;
-});
-
-suite.add('Native JS Array 100k push', function() {
-  const arr = [];
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    arr.push(i);
-  }
-  this.val = arr;
-});
-
-suite.add('100k unshift', function() {
-  const list = new DoublyLinkedList();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    list.unshift(i);
-  }
-  this.val = list;
-});
-
-suite.add('Native JS Array 100k unshift', function() {
-  const arr = [];
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    arr.unshift(i);
-  }
-  this.val = arr;
-});
-
-suite.add('100k unshift & shift', function() {
-  const list = new DoublyLinkedList();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    list.unshift(i);
-  }
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    list.shift();
-  }
-  this.val = list;
-});
-
-suite.add('Native JS Array 100k unshift & shift', function() {
-  const arr = [];
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    arr.unshift(i);
-  }
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    arr.shift();
-  }
-  this.val = arr;
-});
-
-suite.add('100k addAt(mid)', function() {
-  const list = new DoublyLinkedList();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    list.push(i);
-  }
-
-  const midIndex = Math.floor(HUNDRED_THOUSAND / 2);
-  for (let i = 0; i < HUNDRED_THOUSAND / 10; i++) {
-    list.addAt(midIndex, i);
-  }
-
-  this.val = list;
-});
-
-// Cursor-based insertion: comparable to C++ std::list::insert(it, value)
-// (known position insertion without paying index-to-node lookup each time)
-suite.add('100k addBefore (cursor)', function() {
-  const list = new DoublyLinkedList();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    list.push(i);
-  }
-
-  const cursor = list.getNodeAt(Math.floor(HUNDRED_THOUSAND / 2));
-  for (let i = 0; i < HUNDRED_THOUSAND / 10; i++) {
-    list.addBefore(cursor, i);
-  }
-
-  this.val = list;
-});
-
-// js-sdsl LinkList comparison
-suite.add('100k push (js-sdsl)', function() {
-  const list = new SdslLinkList();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    list.pushBack(i);
-  }
-  this.val = list;
-});
-
-suite.add('100k unshift (js-sdsl)', function() {
-  const list = new SdslLinkList();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    list.pushFront(i);
-  }
-  this.val = list;
-});
-
-suite.add('100k unshift & shift (js-sdsl)', function() {
-  const list = new SdslLinkList();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    list.pushFront(i);
-  }
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    list.popFront();
-  }
-  this.val = list;
-});
-
-export { suite };