A sharded Set implementation for storing large numbers of numeric node IDs efficiently. Uses multiple internal Set instances to avoid V8's single-set performance degradation at high cardinalities. Provides add, has, delete, and iteration operations. Reusable in any context requiring large numeric ID tracking, such as graph traversal or deduplication.

Abstract base class for leak filter rules implementing the chain-of-responsibility pattern. Each rule can decide to filter (remove) a leak object, keep it, or defer to the next rule. Provides a clean interface for adding custom leak classification logic. Reusable in any system that needs a composable, ordered decision pipeline.

Provides WeakMapPlus, a drop-in replacement for WeakMap that falls back to a regular Map when WeakMap is unavailable (e.g., in certain sandboxed environments). Includes native WeakRef detection, periodic cleanup for the fallback, and a WeakSet variant. Demonstrates careful handling of memory safety across different JavaScript runtimes.

Implements a wall-clock budget for heap analysis operations. Provides a tick() function that throws ScanTimeoutError when the budget is exceeded, allowing long-running heap walks to be interrupted gracefully. Includes progress reporting via MCP notifications. Reusable in any system that needs bounded execution time for iterative algorithms.

Provides a withSnapshotAt() helper that temporarily loads a heap snapshot from disk, executes a callback, and then releases it. This avoids keeping multiple large snapshots resident simultaneously. Includes error handling and cleanup guarantees. Reusable in any application that needs to process large files one at a time without exhausting memory.