data-structure-typed 2.4.4 → 2.5.0

package/CHANGELOG.md

@@ -8,7 +8,28 @@ All notable changes to this project will be documented in this file.
 - [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
 - [`auto-changelog`](https://github.com/CookPete/auto-changelog)
 
-## [v2.4.4](https://github.com/zrwusa/data-structure-typed/compare/v2.4.3...main) (upcoming)
+## [v2.5.0](https://github.com/zrwusa/data-structure-typed/compare/v2.4.3...main) (upcoming)
+
+### Changes
+
+- fix(binary-tree): null nodes no longer count toward size [`#70`](https://github.com/zrwusa/data-structure-typed/pull/70)
+- feat(graph): add biconnected components and cycle detection for undirected graph [`#77`](https://github.com/zrwusa/data-structure-typed/pull/77)
+- fix(rbt): override perfectlyBalance to preserve RBT invariants [`#79`](https://github.com/zrwusa/data-structure-typed/pull/79)
+- feat(bst): support Date keys in default comparator [`#107`](https://github.com/zrwusa/data-structure-typed/pull/107)
+- refactor(binary-tree): iterative _displayAux to prevent stack overflow on deep trees [`#104`](https://github.com/zrwusa/data-structure-typed/pull/104)
+- fix(binary-tree): leaves() iterative mode uses DFS stack to match recursive order [`#102`](https://github.com/zrwusa/data-structure-typed/pull/102)
+- refactor: migrate all throw sites to ERR message templates [`#130`](https://github.com/zrwusa/data-structure-typed/pull/130)
+- refactor: lightweight centralized error messages via ERR templates [`#130`](https://github.com/zrwusa/data-structure-typed/pull/130)
+- feat: centralized error handling with DSTError/DSTRangeError/DSTTypeError [`#130`](https://github.com/zrwusa/data-structure-typed/pull/130)
+- refactor(deque): improve auto-compact with counter + element-based ratio [`#92`](https://github.com/zrwusa/data-structure-typed/pull/92)
+- perf(deque): optimize auto-compact with counter-based checking and element ratio [`#92`](https://github.com/zrwusa/data-structure-typed/pull/92)
+- feat(deque): add compact() method and autoCompactRatio option [`#92`](https://github.com/zrwusa/data-structure-typed/pull/92)
+- fix(deque): add constructor overloads for better type inference [`#97`](https://github.com/zrwusa/data-structure-typed/pull/97)
+- test(graph): add edge case tests for visual output [`#113`](https://github.com/zrwusa/data-structure-typed/pull/113)
+- test(graph): add visual output tests for DirectedGraph and UndirectedGraph [`#113`](https://github.com/zrwusa/data-structure-typed/pull/113)
+- feat(graph): add print, toVisual, and toDot methods for all graphs [`#113`](https://github.com/zrwusa/data-structure-typed/pull/113)
+- fix(hash-map): deleteAt/deleteWhere now removes entry from hash table [`#99`](https://github.com/zrwusa/data-structure-typed/pull/99)
+- fix(deque): shrinkToFit now updates _bucketCount and handles single-bucket case [`#98`](https://github.com/zrwusa/data-structure-typed/pull/98)
 
 ## [v2.4.3](https://github.com/zrwusa/data-structure-typed/compare/v2.2.3...v2.4.3) (3 March 2026)
 

package/README.md

@@ -130,7 +130,30 @@ for (let i = 0; i < 100000; i++) {
 
 - **Tree-shakable** ESM / CJS / legacy builds
 
-📊 [Full benchmarks →](./docs/benchmark.html)
+[//]: # (No deletion!!! Start of README Performance Section)
+
+| Data Structure | Test Case | DST (ms) | Native (ms) | C++ (ms) | js-sdsl (ms) |
+|----------------|-----------|----------|-------------|----------|---------------|
+| Queue | 1M push | 26.93 | 23.83 | 1.70 | 27.59 |
+| Deque | 1M push | 9.77 | 26.81 | 1.76 | 7.79 |
+| DoublyLinkedList | 100k push | 5.70 | 2.40 | 5.70 | 1.90 |
+| SinglyLinkedList | 100K unshift & shift | 3.77 | 1958.39 | 4.80 | - |
+| PriorityQueue | 100K add | 4.00 | - | 1.05 | 4.96 |
+| TreeSet | 1M add | 995.72 | - | 462.00 | 677.58 |
+| TreeMap | 1M set | 978.72 | - | 512.00 | 623.23 |
+| TreeMultiSet | 1M add (TreeMultiSet expanded iteration) | 217.73 | - | 752.00 | - |
+| TreeMultiMap | 1M add (TreeMultiMap bucketed) | 366.19 | - | 731.00 | - |
+| RedBlackTree | 1M get | 99.24 | - | 52.97 | - |
+| BST | 10K add randomly | 5.50 | - | - | - |
+| BinaryTree | 1K add randomly | 9.77 | - | - | - |
+| HashMap | 1M set | 146.17 | 144.83 | 76.26 | 94.16 |
+| Trie | 100K add | 141.10 | - | - | - |
+| DirectedGraph | 1K addVertex | 0.05 | - | - | - |
+| Stack | 1M push | 46.38 | 30.28 | 1.65 | 32.38 |
+
+[//]: # (No deletion!!! End of README Performance Section)
+
+📊 [Full benchmarks →](./docs/PERFORMANCE.md) | [Interactive report →](./docs/benchmark.html)
 
 ---
 
@@ -271,6 +294,10 @@ queue.push(6);  // Add to back: O(1)
 | **Stack**                | Undo/redo, expression parsing     | O(1)            | [npm](https://www.npmjs.com/package/stack-typed)          |
 | **LinkedList**           | Dynamic sizing, no index shift    | O(1)*           | [npm](https://www.npmjs.com/package/linked-list-typed)    |
 | **AVLTree**              | Stricter balance than RB-Tree     | O(log n)        | [npm](https://www.npmjs.com/package/avl-tree-typed)       |
+| **SkipList**             | Sorted KV, TreeMap alternative    | O(log n) avg    | —                                                         |
+| **SegmentTree**          | Range sum/min/max/custom queries  | O(log n)        | —                                                         |
+| **BinaryIndexedTree**    | Prefix sums, frequency counting   | O(log n)        | —                                                         |
+| **Matrix**               | 2D grid arithmetic                | O(n²) add       | —                                                         |
 
 👉 [See all 20+ structures →](./docs/REFERENCE.md)
 
@@ -526,6 +553,12 @@ Need prefix/text matching?
 Need graph operations?
   → DirectedGraph/UndirectedGraph
 
+Need range queries on array (sum/min/max)?
+  → SegmentTree (any merge op) or BinaryIndexedTree (prefix sums only)
+
+Need sorted key-value with same API as TreeMap?
+  → SkipList (O(log n) avg, probabilistic balancing)
+
 Otherwise?
   → Use Array (simplest case)
 ```