data-structure-typed 2.4.1 → 2.4.3

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

@@ -1,77 +0,0 @@
-#include <benchmark/benchmark.h>
-#include <forward_list>
-
-const int HUNDRED_THOUSAND = 100000;
-const int TEN_THOUSAND = 10000;
-
-// Head operations (push_front/pop_front) - O(1) for std::forward_list
-// Fair comparison with JS SinglyLinkedList unshift/shift
-
-static void UnshiftAndShift100K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::forward_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(UnshiftAndShift100K)->Name("100K unshift & shift")->Unit(benchmark::kMillisecond);
-
-static void UnshiftAndShift10K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::forward_list<int> list;
-    for (int i = 0; i < TEN_THOUSAND; i++) {
-      list.push_front(i);
-    }
-    while (!list.empty()) {
-      list.pop_front();
-    }
-    benchmark::DoNotOptimize(list);
-  }
-}
-BENCHMARK(UnshiftAndShift10K)->Name("10K unshift & shift")->Unit(benchmark::kMillisecond);
-
-// Index-based insertion: advance to middle for each insert (O(n) per insert)
-static void AddAtMid10K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::forward_list<int> list;
-    for (int i = 0; i < TEN_THOUSAND; i++) {
-      list.push_front(i);
-    }
-
-    for (int i = 0; i < TEN_THOUSAND / 10; i++) {
-      auto it = list.begin();
-      std::advance(it, TEN_THOUSAND / 2);
-      list.insert_after(it, i);
-    }
-
-    benchmark::DoNotOptimize(list);
-  }
-}
-BENCHMARK(AddAtMid10K)->Name("10K addAt(mid)")->Iterations(1)->Unit(benchmark::kMillisecond);
-
-// Cursor-based insertion: insert at a fixed iterator (O(1) per insert)
-static void AddBeforeCursor10K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::forward_list<int> list;
-    for (int i = 0; i < TEN_THOUSAND; i++) {
-      list.push_front(i);
-    }
-
-    auto cursor = list.begin();
-    std::advance(cursor, TEN_THOUSAND / 2);
-
-    for (int i = 0; i < TEN_THOUSAND / 10; i++) {
-      list.insert_after(cursor, i);
-    }
-
-    benchmark::DoNotOptimize(list);
-  }
-}
-BENCHMARK(AddBeforeCursor10K)->Name("10K addBefore (cursor)")->Unit(benchmark::kMillisecond);
-
-BENCHMARK_MAIN();

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

@@ -1,84 +0,0 @@
-import { SinglyLinkedList } from '../../../../dist/esm/index.mjs';
-import Benchmark from 'benchmark';
-import { magnitude } from '../../../utils/perf.mjs';
-
-const suite = new Benchmark.Suite();
-const { HUNDRED_THOUSAND, TEN_THOUSAND } = magnitude;
-
-// Head operations (unshift/shift) - O(1) for SinglyLinkedList, fair comparison with std::forward_list
-
-suite.add('100K unshift & shift', function() {
-  const list = new SinglyLinkedList();
-  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('10K unshift & shift', function() {
-  const list = new SinglyLinkedList();
-  for (let i = 0; i < TEN_THOUSAND; i++) {
-    list.unshift(i);
-  }
-  for (let i = 0; i < TEN_THOUSAND; i++) {
-    list.shift();
-  }
-  this.val = list;
-});
-
-suite.add('Native JS Array 10K unshift & shift', function() {
-  const arr = [];
-  for (let i = 0; i < TEN_THOUSAND; i++) {
-    arr.unshift(i);
-  }
-  for (let i = 0; i < TEN_THOUSAND; i++) {
-    arr.shift();
-  }
-  this.val = arr;
-});
-
-// Index-based insertion (O(n) operation)
-suite.add('10K addAt(mid)', function() {
-  const list = new SinglyLinkedList();
-  for (let i = 0; i < TEN_THOUSAND; i++) {
-    list.push(i);
-  }
-
-  const midIndex = Math.floor(TEN_THOUSAND / 2);
-  for (let i = 0; i < TEN_THOUSAND / 10; i++) {
-    list.addAt(midIndex, i);
-  }
-
-  this.val = list;
-});
-
-// Cursor-based insertion (O(1) with known position)
-suite.add('10K addBefore (cursor)', function() {
-  const list = new SinglyLinkedList();
-  for (let i = 0; i < TEN_THOUSAND; i++) {
-    list.push(i);
-  }
-
-  const cursor = list.getNodeAt(Math.floor(TEN_THOUSAND / 2));
-  for (let i = 0; i < TEN_THOUSAND / 10; i++) {
-    list.addBefore(cursor, i);
-  }
-
-  this.val = list;
-});
-
-export { suite };

package/test/performance/data-structures/priority-queue/max-priority-queue.test.mjs

@@ -1,40 +0,0 @@
-import { MaxPriorityQueue } from '../../../../dist/esm/index.mjs';
-import Benchmark from 'benchmark';
-import { magnitude } from '../../../utils/perf.mjs';
-
-/**
- * Max Priority Queue Benchmark Suite
- * Tests heap-based max priority queue operations
- *
- * Fixes applied:
- * ✅ Added this.val for optimization prevention
- * ✅ Uncommented export statement
- * ✅ Proper refill & poll pattern
- */
-
-const suite = new Benchmark.Suite();
-const { TEN_THOUSAND } = magnitude;
-
-// Test: 10K refill & poll
-suite.add(`${TEN_THOUSAND.toLocaleString()} refill & poll`, function() {
-  // Generate unique random nodes
-  const nodes = Array.from(
-      new Set(
-          Array.from(
-              new Array(TEN_THOUSAND),
-              () => Math.floor(Math.random() * TEN_THOUSAND * 100)
-          )
-      )
-  );
-
-  const maxPQ = new MaxPriorityQueue();
-  maxPQ.refill(nodes);
-
-  while (maxPQ.size > 0) {
-    maxPQ.poll();
-  }
-
-  this.val = maxPQ;  // Prevent JIT optimization
-});
-
-export { suite };

package/test/performance/data-structures/priority-queue/priority-queue.test.cpp

@@ -1,59 +0,0 @@
-#include <benchmark/benchmark.h>
-#include <queue>
-#include <vector>
-
-const int HUNDRED_THOUSAND = 100000;
-
-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) {
-    // Max-heap by default (greater values have higher priority)
-    std::priority_queue<int> pq;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      pq.push(i);
-    }
-    benchmark::DoNotOptimize(pq);
-  }
-}
-BENCHMARK(Add100K)->Name(formatNumber(HUNDRED_THOUSAND) + " add");
-
-// Test 2: 100K add & poll
-static void AddAndPoll100K(benchmark::State& state) {
-  for (auto _ : state) {
-    // Max-heap by default
-    std::priority_queue<int> pq;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      pq.push(i);
-    }
-    while (!pq.empty()) {
-      pq.pop();
-    }
-    benchmark::DoNotOptimize(pq);
-  }
-}
-BENCHMARK(AddAndPoll100K)->Name(formatNumber(HUNDRED_THOUSAND) + " add & poll");
-
-// Test 3: Min-heap for comparison
-static void MinHeapAdd100K(benchmark::State& state) {
-  for (auto _ : state) {
-    // Min-heap using greater comparator
-    std::priority_queue<int, std::vector<int>, std::greater<int>> pq;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      pq.push(i);
-    }
-    benchmark::DoNotOptimize(pq);
-  }
-}
-BENCHMARK(MinHeapAdd100K)->Name(formatNumber(HUNDRED_THOUSAND) + " add (min-heap)");
-
-BENCHMARK_MAIN();

package/test/performance/data-structures/priority-queue/priority-queue.test.mjs

@@ -1,64 +0,0 @@
-import { PriorityQueue } from '../../../../dist/esm/index.mjs';
-import { PriorityQueue as SdslPriorityQueue } from 'js-sdsl';
-import Benchmark from 'benchmark';
-import { magnitude } from '../../../utils/perf.mjs';
-
-/**
- * Priority Queue Benchmark Suite
- * Measures performance of heap-based priority queue operations
- *
- * Fixes applied:
- * ✅ Removed competitor tests (js-sdsl comparison)
- * ✅ Removed all .on() event handlers
- * ✅ Removed .run() call
- * ✅ Each test creates independent instance
- * ✅ Added this.val for optimization prevention
- * ✅ Changed to standard function form (not chained)
- * ✅ Test names aligned with best practices
- */
-
-const suite = new Benchmark.Suite();
-
-const { HUNDRED_THOUSAND } = magnitude;
-
-// Test 1: 100K add
-suite.add(`${HUNDRED_THOUSAND.toLocaleString()} add`, function() {
-  const pq = new PriorityQueue([], { comparator: (a, b) => b - a });
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    pq.add(i);
-  }
-  this.val = pq;  // Prevent JIT optimization
-});
-
-suite.add(`${HUNDRED_THOUSAND.toLocaleString()} add (js-sdsl)`, function() {
-  const pq = new SdslPriorityQueue([], (a, b) => b - a);
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    pq.push(i);
-  }
-  this.val = pq;
-});
-
-// Test 2: 100K add & poll
-suite.add(`${HUNDRED_THOUSAND.toLocaleString()} add & poll`, function() {
-  const pq = new PriorityQueue([], { 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();
-  }
-  this.val = pq;  // Prevent JIT optimization
-});
-
-suite.add(`${HUNDRED_THOUSAND.toLocaleString()} add & poll (js-sdsl)`, function() {
-  const pq = new SdslPriorityQueue([], (a, b) => b - a);
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    pq.push(i);
-  }
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    pq.pop();
-  }
-  this.val = pq;
-});
-
-export { suite };

package/test/performance/data-structures/queue/deque.test.cpp

@@ -1,119 +0,0 @@
-#include <benchmark/benchmark.h>
-#include <deque>
-
-const int MILLION = 1000000;
-const int HUNDRED_THOUSAND = 100000;
-
-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 push
-static void Push1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::deque<int> deque;
-    for (int i = 0; i < MILLION; i++) {
-      deque.push_back(i);
-    }
-    benchmark::DoNotOptimize(deque);
-  }
-}
-BENCHMARK(Push1M)->Name("1M push");
-
-// Test 2: 1M push & pop (LIFO - Stack behavior)
-static void PushAndPop1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::deque<int> deque;
-    for (int i = 0; i < MILLION; i++) {
-      deque.push_back(i);
-    }
-    while (!deque.empty()) {
-      deque.pop_back();
-    }
-    benchmark::DoNotOptimize(deque);
-  }
-}
-BENCHMARK(PushAndPop1M)->Name("1M push & pop");
-
-// Test 3: 1M push & shift (FIFO - Queue behavior)
-static void PushAndShift1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::deque<int> deque;
-    for (int i = 0; i < MILLION; i++) {
-      deque.push_back(i);
-    }
-    while (!deque.empty()) {
-      deque.pop_front();
-    }
-    benchmark::DoNotOptimize(deque);
-  }
-}
-BENCHMARK(PushAndShift1M)->Name("1M push & shift");
-
-// Test 4: 100K push & shift
-static void PushAndShift100K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::deque<int> deque;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      deque.push_back(i);
-    }
-    while (!deque.empty()) {
-      deque.pop_front();
-    }
-    benchmark::DoNotOptimize(deque);
-  }
-}
-BENCHMARK(PushAndShift100K)->Name("100K push & shift");
-
-// Test 5: Native vector 100K push & shift (for comparison)
-static void VectorPushAndShift100K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::vector<int> arr;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      arr.push_back(i);
-    }
-    while (!arr.empty()) {
-      arr.erase(arr.begin());
-    }
-    benchmark::DoNotOptimize(arr);
-  }
-}
-BENCHMARK(VectorPushAndShift100K)->Name("Native vector 100K push & shift");
-
-// Test 6: 100K unshift & shift (add to front)
-static void UnshiftAndShift100K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::deque<int> deque;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      deque.push_front(i);
-    }
-    while (!deque.empty()) {
-      deque.pop_front();
-    }
-    benchmark::DoNotOptimize(deque);
-  }
-}
-BENCHMARK(UnshiftAndShift100K)->Name("100K unshift & shift");
-
-// Test 7: Native vector 100K unshift & shift (for comparison)
-static void VectorUnshiftAndShift100K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::vector<int> arr;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      arr.insert(arr.begin(), i);
-    }
-    while (!arr.empty()) {
-      arr.erase(arr.begin());
-    }
-    benchmark::DoNotOptimize(arr);
-  }
-}
-BENCHMARK(VectorUnshiftAndShift100K)->Name("Native vector 100K unshift & shift");
-
-BENCHMARK_MAIN();

package/test/performance/data-structures/queue/deque.test.mjs

@@ -1,144 +0,0 @@
-import { Deque } from '../../../../dist/esm/index.mjs';
-import { Deque as SdslDeque } from 'js-sdsl';
-import Benchmark from 'benchmark';
-import { magnitude } from '../../../utils/perf.mjs';
-
-const suite = new Benchmark.Suite();
-const { MILLION, HUNDRED_THOUSAND } = magnitude;
-
-suite.add('1M push', function() {
-  const deque = new Deque();
-  for (let i = 0; i < MILLION; i++) {
-    deque.push(i);
-  }
-  this.val = deque;
-});
-
-suite.add('Native JS Array 1M push', function() {
-  const array = [];
-  for (let i = 0; i < MILLION; i++) {
-    array.push(i);
-  }
-  this.val = array;
-});
-
-suite.add('1M push & pop', function() {
-  const deque = new Deque();
-  for (let i = 0; i < MILLION; i++) {
-    deque.push(i);
-  }
-  for (let i = 0; i < MILLION; i++) {
-    deque.pop();
-  }
-  this.val = deque;
-});
-
-suite.add('Native JS Array 1M push & pop', function() {
-  const array = [];
-  for (let i = 0; i < MILLION; i++) {
-    array.push(i);
-  }
-  for (let i = 0; i < MILLION; i++) {
-    array.pop();
-  }
-  this.val = array;
-});
-
-suite.add('1M push & shift', function() {
-  const deque = new Deque();
-  for (let i = 0; i < MILLION; i++) {
-    deque.push(i);
-  }
-  for (let i = 0; i < MILLION; i++) {
-    deque.shift();
-  }
-  this.val = deque;
-});
-
-suite.add('100K push & shift', function() {
-  const deque = new Deque();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    deque.push(i);
-  }
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    deque.shift();
-  }
-  this.val = deque;
-});
-
-suite.add('Native JS Array 100K push & shift', function() {
-  const array = [];
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    array.push(i);
-  }
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    array.shift();
-  }
-  this.val = array;
-});
-
-suite.add('100K unshift & shift', function() {
-  const deque = new Deque();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    deque.unshift(i);
-  }
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    deque.shift();
-  }
-  this.val = deque;
-});
-
-suite.add('Native JS Array 100K unshift & shift', function() {
-  const array = [];
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    array.unshift(i);
-  }
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    array.shift();
-  }
-  this.val = array;
-});
-
-// js-sdsl Deque comparison
-suite.add('1M push (js-sdsl)', function() {
-  const deque = new SdslDeque();
-  for (let i = 0; i < MILLION; i++) {
-    deque.pushBack(i);
-  }
-  this.val = deque;
-});
-
-suite.add('1M push & pop (js-sdsl)', function() {
-  const deque = new SdslDeque();
-  for (let i = 0; i < MILLION; i++) {
-    deque.pushBack(i);
-  }
-  for (let i = 0; i < MILLION; i++) {
-    deque.popBack();
-  }
-  this.val = deque;
-});
-
-suite.add('100K push & shift (js-sdsl)', function() {
-  const deque = new SdslDeque();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    deque.pushBack(i);
-  }
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    deque.popFront();
-  }
-  this.val = deque;
-});
-
-suite.add('100K unshift & shift (js-sdsl)', function() {
-  const deque = new SdslDeque();
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    deque.pushFront(i);
-  }
-  for (let i = 0; i < HUNDRED_THOUSAND; i++) {
-    deque.popFront();
-  }
-  this.val = deque;
-});
-
-export { suite };

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

@@ -1,59 +0,0 @@
-#include <benchmark/benchmark.h>
-#include <queue>
-
-const int MILLION = 1000000;
-const int HUNDRED_THOUSAND = 100000;
-
-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 push
-static void Push1M(benchmark::State& state) {
-  for (auto _ : state) {
-    std::queue<int> queue;
-    for (int i = 0; i < MILLION; i++) {
-      queue.push(i);
-    }
-    benchmark::DoNotOptimize(queue);
-  }
-}
-BENCHMARK(Push1M)->Name(formatNumber(MILLION) + " push");
-
-// Test 2: 100K push & shift (FIFO - Queue behavior)
-static void PushAndShift100K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::queue<int> queue;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      queue.push(i);
-    }
-    while (!queue.empty()) {
-      queue.pop();
-    }
-    benchmark::DoNotOptimize(queue);
-  }
-}
-BENCHMARK(PushAndShift100K)->Name(formatNumber(HUNDRED_THOUSAND) + " push & shift");
-
-// Test 3: Native std::deque 100K push & shift (for comparison)
-static void DequeNativePushAndShift100K(benchmark::State& state) {
-  for (auto _ : state) {
-    std::deque<int> deque;
-    for (int i = 0; i < HUNDRED_THOUSAND; i++) {
-      deque.push_back(i);
-    }
-    while (!deque.empty()) {
-      deque.pop_front();
-    }
-    benchmark::DoNotOptimize(deque);
-  }
-}
-BENCHMARK(DequeNativePushAndShift100K)->Name("Native std::deque " + formatNumber(HUNDRED_THOUSAND) + " push & shift");
-
-BENCHMARK_MAIN();