data-structure-typed 2.4.3 → 2.4.5

package/.github/workflows/release.yml

@@ -0,0 +1,27 @@
+name: Release
+
+on:
+  push:
+    tags:
+      - 'v*'
+
+permissions:
+  contents: write
+
+jobs:
+  release:
+    runs-on: ubuntu-latest
+    steps:
+      - name: Checkout
+        uses: actions/checkout@v4
+        with:
+          fetch-depth: 0
+
+      - name: Create GitHub Release
+        uses: softprops/action-gh-release@v1
+        with:
+          generate_release_notes: true
+          draft: false
+          prerelease: ${{ contains(github.ref, '-alpha') || contains(github.ref, '-beta') || contains(github.ref, '-rc') }}
+        env:
+          GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}

package/CHANGELOG.md

@@ -8,7 +8,30 @@ 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.3](https://github.com/zrwusa/data-structure-typed/compare/v2.2.3...main) (upcoming)
+## [v2.4.5](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)
 
 ## [v2.2.3](https://github.com/zrwusa/data-structure-typed/compare/v2.2.2...v2.2.3) (6 January 2026)
 

package/README.md

@@ -4,6 +4,8 @@ English | [简体中文](./README_CN.md)
 
 A comprehensive TypeScript data structures library with production-ready implementations.
 
+**We TypeScript/JavaScript devs want something like C++'s `STL`, Java's `java.util` Collections, or Python's `collections` — but with an API that feels as intuitive and ergonomic as JavaScript's native `Array`.** If that's what you're looking for, you're in the right place. This is a zero-dependency library, and you can also install individual data structure packages separately if you prefer a more modular setup.
+
 ![npm](https://img.shields.io/npm/dm/data-structure-typed)
 ![GitHub contributors](https://img.shields.io/github/contributors/zrwusa/data-structure-typed)
 ![GITHUB Star](https://img.shields.io/github/stars/zrwusa/data-structure-typed)
@@ -12,19 +14,55 @@ A comprehensive TypeScript data structures library with production-ready impleme
 ![NPM](https://img.shields.io/npm/l/data-structure-typed)
 ![npm](https://img.shields.io/npm/v/data-structure-typed)
 
-**📚 [Installation](#-installation) • [Quick Start](#-quick-start-30-seconds) • [Full Docs](#-documentation) • [API Reference](./docs/REFERENCE.md) • [Playground](#playground) • [Examples](./docs/GUIDES.md)**
+**📦 [Installation](#-installation) • 🎮 [Playground](#-playground) • ⚡ [Quick Start](#-quick-start-30-seconds) • 📖 [Docs](#-documentation) • 📋 [API](./docs/REFERENCE.md) • 💡 [Examples](./docs/GUIDES.md)**
 
 ---
 
 ## Table of Contents
 
-1. [Who Should Use This?](#-who-should-use-this)
-2. [Why Not Just Array or Map?](#-why-not-just-array-or-map)
-3. [Key Features](#-key-features)
-4. [Installation](#-installation)
-5. [Quick Start](#-quick-start-30-seconds)
-6. [Data Structures](#-data-structures-available)
-7. [Documentation](#-documentation)
+1. [Installation](#-installation)
+2. [Playground](#-playground)
+3. [Quick Start](#-quick-start-30-seconds)
+4. [Who Should Use This?](#-who-should-use-this)
+5. [Why Not Just Array or Map?](#-why-not-just-array-or-map)
+6. [Key Features](#-key-features)
+7. [Data Structures](#-data-structures-available)
+8. [Documentation](#-documentation)
+
+---
+
+## 📦 Installation
+
+```bash
+npm i data-structure-typed
+```
+
+```bash
+yarn add data-structure-typed
+```
+
+```bash
+pnpm add data-structure-typed
+```
+
+### Individual Packages
+
+Use only what you need:
+
+```bash
+npm i heap-typed deque-typed red-black-tree-typed
+```
+
+---
+
+## 🎮 Playground
+
+Try it instantly:
+
+- [Node.js TypeScript](https://stackblitz.com/edit/stackblitz-starters-e1vdy3zw?file=src%2Findex.ts)
+- [Node.js JavaScript](https://stackblitz.com/edit/stackblitz-starters-oczhrfzn?file=src%2Findex.js)
+- [React TypeScript](https://stackblitz.com/edit/vitejs-vite-7bva1zhd?file=src%2FApp.tsx)
+- [NestJS](https://stackblitz.com/edit/nestjs-typescript-starter-q9n7okgc?file=src%2Fproduct%2Fservices%2Fproduct-price-index.service.ts)
 
 ---
 
@@ -92,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 | 962.76 | - | 462.00 | 640.31 |
+| TreeMap | 1M set | 996.95 | - | 512.00 | 624.82 |
+| TreeMultiSet | 1M add (TreeMultiSet expanded iteration) | 218.78 | - | 752.00 | - |
+| TreeMultiMap | 1M add (TreeMultiMap bucketed) | 387.80 | - | 731.00 | - |
+| RedBlackTree | 1M get | 108.02 | - | 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)
 
 ---
 
@@ -144,30 +205,6 @@ const set = new Set(tree);             // Set constructor
 
 ---
 
-## 📥 Installation
-
-```bash
-pnpm add data-structure-typed
-```
-
-```bash
-npm i data-structure-typed --save
-```
-
-```bash
-yarn add data-structure-typed
-```
-
-### Individual Packages
-
-Use only what you need:
-
-```bash
-pnpm add heap-typed deque-typed red-black-tree-typed
-```
-
----
-
 ## 💡 When Should I Consider This Library?
 
 ✅ **When you need:**
@@ -494,24 +531,6 @@ const tree = new RedBlackTree([5, 2, 8]);
 console.log([...tree]);  // [2, 5, 8] - Automatically sorted!
 ```
 
-## Playground
-
-🏃🏻‍♀️ Try it instantly:
-
-- [Node.js TypeScript](https://stackblitz.com/edit/stackblitz-starters-e1vdy3zw?file=src%2Findex.ts)
-- [Node.js JavaScript](https://stackblitz.com/edit/stackblitz-starters-oczhrfzn?file=src%2Findex.js)
-- [React TypeScript](https://stackblitz.com/edit/vitejs-vite-7bva1zhd?file=src%2FApp.tsx)
-- [NestJS](https://stackblitz.com/edit/nestjs-typescript-starter-q9n7okgc?file=src%2Fproduct%2Fservices%2Fproduct-price-index.service.ts)
-
-
-### Step 4: Learn More
-
-👉 Check [CONCEPTS.md](./docs/CONCEPTS.md) for core concepts  
-👉 See [GUIDES.md](./docs/GUIDES.md) for production examples  
-👉 Read [REFERENCE.md](./docs/REFERENCE.md) for complete API
-
----
-
 ## 📊 Comparison Chart
 
 ```