data-structure-typed 2.6.0 → 2.6.2

package/dist/esm/priority-queue.mjs

@@ -315,61 +315,19 @@ var Heap = class _Heap extends IterableElementBase {
     return this._elements;
   }
   /**
-    * Get the number of elements.
-    * @remarks Time O(1), Space O(1)
-    * @returns Heap size.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Track heap capacity
-  *  const heap = new Heap<number>();
-  *     console.log(heap.size); // 0;
-  *     heap.add(10);
-  *     heap.add(20);
-  *     console.log(heap.size); // 2;
-  *     heap.poll();
-  *     console.log(heap.size); // 1;
-    */
+   * Get the number of elements.
+   * @remarks Time O(1), Space O(1)
+   * @returns Heap size.
+   * @example
+   * // Track heap capacity
+   *  const heap = new Heap<number>();
+   *     console.log(heap.size); // 0;
+   *     heap.add(10);
+   *     heap.add(20);
+   *     console.log(heap.size); // 2;
+   *     heap.poll();
+   *     console.log(heap.size); // 1;
+   */
   get size() {
     return this.elements.length;
   }
@@ -381,6 +339,14 @@ var Heap = class _Heap extends IterableElementBase {
   get leaf() {
     return this.elements[this.size - 1] ?? void 0;
   }
+  /**
+   * Get the comparator used to order elements.
+   * @remarks Time O(1), Space O(1)
+   * @returns Comparator function.
+   */
+  get comparator() {
+    return this._comparator;
+  }
   /**
    * Create a heap of the same class from an iterable.
    * @remarks Time O(N), Space O(N)
@@ -407,123 +373,42 @@ var Heap = class _Heap extends IterableElementBase {
     return new _Heap(elements, options);
   }
   /**
-    * Insert an element.
-    * @remarks Time O(log N) amortized, Space O(1)
-    * @param element - Element to insert.
-    * @returns True.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // basic Heap creation and add operation
-  *  // Create a min heap (default)
-  *     const minHeap = new Heap([5, 3, 7, 1, 9, 2]);
-  *
-  *     // Verify size
-  *     console.log(minHeap.size); // 6;
-  *
-  *     // Add new element
-  *     minHeap.add(4);
-  *     console.log(minHeap.size); // 7;
-  *
-  *     // Min heap property: smallest element at root
-  *     const min = minHeap.peek();
-  *     console.log(min); // 1;
-    */
+   * Insert an element.
+   * @remarks Time O(log N) amortized, Space O(1)
+   * @param element - Element to insert.
+   * @returns True.
+   * @example
+   * // basic Heap creation and add operation
+   *  // Create a min heap (default)
+   *     const minHeap = new Heap([5, 3, 7, 1, 9, 2]);
+   *
+   *     // Verify size
+   *     console.log(minHeap.size); // 6;
+   *
+   *     // Add new element
+   *     minHeap.add(4);
+   *     console.log(minHeap.size); // 7;
+   *
+   *     // Min heap property: smallest element at root
+   *     const min = minHeap.peek();
+   *     console.log(min); // 1;
+   */
   add(element) {
     this._elements.push(element);
     return this._bubbleUp(this.elements.length - 1);
   }
   /**
-    * Insert many elements from an iterable.
-    * @remarks Time O(N log N), Space O(1)
-    * @param elements - Iterable of elements or raw values.
-    * @returns Array of per-element success flags.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Add multiple elements
-  *  const heap = new Heap<number>([], { comparator: (a, b) => a - b });
-  *     heap.addMany([5, 3, 7, 1]);
-  *     console.log(heap.peek()); // 1;
-  *     console.log(heap.size); // 4;
-    */
+   * Insert many elements from an iterable.
+   * @remarks Time O(N log N), Space O(1)
+   * @param elements - Iterable of elements or raw values.
+   * @returns Array of per-element success flags.
+   * @example
+   * // Add multiple elements
+   *  const heap = new Heap<number>([], { comparator: (a, b) => a - b });
+   *     heap.addMany([5, 3, 7, 1]);
+   *     console.log(heap.peek()); // 1;
+   *     console.log(heap.size); // 4;
+   */
   addMany(elements) {
     const flags = [];
     for (const el of elements) {
@@ -538,104 +423,63 @@ var Heap = class _Heap extends IterableElementBase {
     return flags;
   }
   /**
-    * Remove and return the top element.
-    * @remarks Time O(log N), Space O(1)
-    * @returns Top element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Heap with custom comparator (MaxHeap behavior)
-  *  interface Task {
-  *       id: number;
-  *       priority: number;
-  *       name: string;
-  *     }
-  *
-  *     // Custom comparator for max heap behavior (higher priority first)
-  *     const tasks: Task[] = [
-  *       { id: 1, priority: 5, name: 'Email' },
-  *       { id: 2, priority: 3, name: 'Chat' },
-  *       { id: 3, priority: 8, name: 'Alert' }
-  *     ];
-  *
-  *     const maxHeap = new Heap(tasks, {
-  *       comparator: (a: Task, b: Task) => b.priority - a.priority
-  *     });
-  *
-  *     console.log(maxHeap.size); // 3;
-  *
-  *     // Peek returns highest priority task
-  *     const topTask = maxHeap.peek();
-  *     console.log(topTask?.priority); // 8;
-  *     console.log(topTask?.name); // 'Alert';
-    */
-  /**
-    * @deprecated Use `pop` instead. Will be removed in a future major version.
-    
-    
-    
-     * @example
-  * // Heap with custom comparator (MaxHeap behavior)
-  *  interface Task {
-  *       id: number;
-  *       priority: number;
-  *       name: string;
-  *     }
-  *
-  *     // Custom comparator for max heap behavior (higher priority first)
-  *     const tasks: Task[] = [
-  *       { id: 1, priority: 5, name: 'Email' },
-  *       { id: 2, priority: 3, name: 'Chat' },
-  *       { id: 3, priority: 8, name: 'Alert' }
-  *     ];
-  *
-  *     const maxHeap = new Heap(tasks, {
-  *       comparator: (a: Task, b: Task) => b.priority - a.priority
-  *     });
-  *
-  *     console.log(maxHeap.size); // 3;
-  *
-  *     // Peek returns highest priority task
-  *     const topTask = maxHeap.peek();
-  *     console.log(topTask?.priority); // 8;
-  *     console.log(topTask?.name); // 'Alert';
-    */
+   * Remove and return the top element.
+   * @remarks Time O(log N), Space O(1)
+   * @returns Top element or undefined.
+   * @example
+   * // Heap with custom comparator (MaxHeap behavior)
+   *  interface Task {
+   *       id: number;
+   *       priority: number;
+   *       name: string;
+   *     }
+   *
+   *     // Custom comparator for max heap behavior (higher priority first)
+   *     const tasks: Task[] = [
+   *       { id: 1, priority: 5, name: 'Email' },
+   *       { id: 2, priority: 3, name: 'Chat' },
+   *       { id: 3, priority: 8, name: 'Alert' }
+   *     ];
+   *
+   *     const maxHeap = new Heap(tasks, {
+   *       comparator: (a: Task, b: Task) => b.priority - a.priority
+   *     });
+   *
+   *     console.log(maxHeap.size); // 3;
+   *
+   *     // Peek returns highest priority task
+   *     const topTask = maxHeap.peek();
+   *     console.log(topTask?.priority); // 8;
+   *     console.log(topTask?.name); // 'Alert';
+   */
+  /**
+   * @deprecated Use `pop` instead. Will be removed in a future major version.
+   * @example
+   * // Heap with custom comparator (MaxHeap behavior)
+   *  interface Task {
+   *       id: number;
+   *       priority: number;
+   *       name: string;
+   *     }
+   *
+   *     // Custom comparator for max heap behavior (higher priority first)
+   *     const tasks: Task[] = [
+   *       { id: 1, priority: 5, name: 'Email' },
+   *       { id: 2, priority: 3, name: 'Chat' },
+   *       { id: 3, priority: 8, name: 'Alert' }
+   *     ];
+   *
+   *     const maxHeap = new Heap(tasks, {
+   *       comparator: (a: Task, b: Task) => b.priority - a.priority
+   *     });
+   *
+   *     console.log(maxHeap.size); // 3;
+   *
+   *     // Peek returns highest priority task
+   *     const topTask = maxHeap.peek();
+   *     console.log(topTask?.priority); // 8;
+   *     console.log(topTask?.name); // 'Alert';
+   */
   poll() {
     return this.pop();
   }
@@ -655,319 +499,125 @@ var Heap = class _Heap extends IterableElementBase {
     return value;
   }
   /**
-    * Get the current top element without removing it.
-    * @remarks Time O(1), Space O(1)
-    * @returns Top element or undefined.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Heap for event processing with priority
-  *  interface Event {
-  *       id: number;
-  *       type: 'critical' | 'warning' | 'info';
-  *       timestamp: number;
-  *       message: string;
-  *     }
-  *
-  *     // Custom priority: critical > warning > info
-  *     const priorityMap = { critical: 3, warning: 2, info: 1 };
-  *
-  *     const eventHeap = new Heap<Event>([], {
-  *       comparator: (a: Event, b: Event) => {
-  *         const priorityA = priorityMap[a.type];
-  *         const priorityB = priorityMap[b.type];
-  *         return priorityB - priorityA; // Higher priority first
-  *       }
-  *     });
-  *
-  *     // Add events in random order
-  *     eventHeap.add({ id: 1, type: 'info', timestamp: 100, message: 'User logged in' });
-  *     eventHeap.add({ id: 2, type: 'critical', timestamp: 101, message: 'Server down' });
-  *     eventHeap.add({ id: 3, type: 'warning', timestamp: 102, message: 'High memory' });
-  *     eventHeap.add({ id: 4, type: 'info', timestamp: 103, message: 'Cache cleared' });
-  *     eventHeap.add({ id: 5, type: 'critical', timestamp: 104, message: 'Database error' });
-  *
-  *     console.log(eventHeap.size); // 5;
-  *
-  *     // Process events by priority (critical first)
-  *     const processedOrder: Event[] = [];
-  *     while (eventHeap.size > 0) {
-  *       const event = eventHeap.poll();
-  *       if (event) {
-  *         processedOrder.push(event);
-  *       }
-  *     }
-  *
-  *     // Verify critical events came first
-  *     console.log(processedOrder[0].type); // 'critical';
-  *     console.log(processedOrder[1].type); // 'critical';
-  *     console.log(processedOrder[2].type); // 'warning';
-  *     console.log(processedOrder[3].type); // 'info';
-  *     console.log(processedOrder[4].type); // 'info';
-  *
-  *     // Verify O(log n) operations
-  *     const newHeap = new Heap<number>([5, 3, 7, 1]);
-  *
-  *     // Add - O(log n)
-  *     newHeap.add(2);
-  *     console.log(newHeap.size); // 5;
-  *
-  *     // Poll - O(log n)
-  *     const removed = newHeap.poll();
-  *     console.log(removed); // 1;
-  *
-  *     // Peek - O(1)
-  *     const top = newHeap.peek();
-  *     console.log(top); // 2;
-    */
+   * Get the current top element without removing it.
+   * @remarks Time O(1), Space O(1)
+   * @returns Top element or undefined.
+   * @example
+   * // Heap for event processing with priority
+   *  interface Event {
+   *       id: number;
+   *       type: 'critical' | 'warning' | 'info';
+   *       timestamp: number;
+   *       message: string;
+   *     }
+   *
+   *     // Custom priority: critical > warning > info
+   *     const priorityMap = { critical: 3, warning: 2, info: 1 };
+   *
+   *     const eventHeap = new Heap<Event>([], {
+   *       comparator: (a: Event, b: Event) => {
+   *         const priorityA = priorityMap[a.type];
+   *         const priorityB = priorityMap[b.type];
+   *         return priorityB - priorityA; // Higher priority first
+   *       }
+   *     });
+   *
+   *     // Add events in random order
+   *     eventHeap.add({ id: 1, type: 'info', timestamp: 100, message: 'User logged in' });
+   *     eventHeap.add({ id: 2, type: 'critical', timestamp: 101, message: 'Server down' });
+   *     eventHeap.add({ id: 3, type: 'warning', timestamp: 102, message: 'High memory' });
+   *     eventHeap.add({ id: 4, type: 'info', timestamp: 103, message: 'Cache cleared' });
+   *     eventHeap.add({ id: 5, type: 'critical', timestamp: 104, message: 'Database error' });
+   *
+   *     console.log(eventHeap.size); // 5;
+   *
+   *     // Process events by priority (critical first)
+   *     const processedOrder: Event[] = [];
+   *     while (eventHeap.size > 0) {
+   *       const event = eventHeap.poll();
+   *       if (event) {
+   *         processedOrder.push(event);
+   *       }
+   *     }
+   *
+   *     // Verify critical events came first
+   *     console.log(processedOrder[0].type); // 'critical';
+   *     console.log(processedOrder[1].type); // 'critical';
+   *     console.log(processedOrder[2].type); // 'warning';
+   *     console.log(processedOrder[3].type); // 'info';
+   *     console.log(processedOrder[4].type); // 'info';
+   *
+   *     // Verify O(log n) operations
+   *     const newHeap = new Heap<number>([5, 3, 7, 1]);
+   *
+   *     // Add - O(log n)
+   *     newHeap.add(2);
+   *     console.log(newHeap.size); // 5;
+   *
+   *     // Poll - O(log n)
+   *     const removed = newHeap.poll();
+   *     console.log(removed); // 1;
+   *
+   *     // Peek - O(1)
+   *     const top = newHeap.peek();
+   *     console.log(top); // 2;
+   */
   peek() {
     return this.elements[0];
   }
   /**
-    * Check whether the heap is empty.
-    * @remarks Time O(1), Space O(1)
-    * @returns True if size is 0.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check if heap is empty
-  *  const heap = new Heap<number>([], { comparator: (a, b) => a - b });
-  *     console.log(heap.isEmpty()); // true;
-  *     heap.add(1);
-  *     console.log(heap.isEmpty()); // false;
-    */
+   * Check whether the heap is empty.
+   * @remarks Time O(1), Space O(1)
+   * @returns True if size is 0.
+   * @example
+   * // Check if heap is empty
+   *  const heap = new Heap<number>([], { comparator: (a, b) => a - b });
+   *     console.log(heap.isEmpty()); // true;
+   *     heap.add(1);
+   *     console.log(heap.isEmpty()); // false;
+   */
   isEmpty() {
     return this.size === 0;
   }
   /**
-    * Remove all elements.
-    * @remarks Time O(1), Space O(1)
-    * @returns void
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove all elements
-  *  const heap = new Heap<number>([1, 2, 3], { comparator: (a, b) => a - b });
-  *     heap.clear();
-  *     console.log(heap.isEmpty()); // true;
-    */
+   * Remove all elements.
+   * @remarks Time O(1), Space O(1)
+   * @returns void
+   * @example
+   * // Remove all elements
+   *  const heap = new Heap<number>([1, 2, 3], { comparator: (a, b) => a - b });
+   *     heap.clear();
+   *     console.log(heap.isEmpty()); // true;
+   */
   clear() {
     this._elements = [];
   }
   /**
-    * Check if an equal element exists in the heap.
-    * @remarks Time O(N), Space O(1)
-    * @param element - Element to search for.
-    * @returns True if found.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Check element existence
-  *  const heap = new Heap<number>([3, 1, 2], { comparator: (a, b) => a - b });
-  *     console.log(heap.has(1)); // true;
-  *     console.log(heap.has(99)); // false;
-    */
+   * Check if an equal element exists in the heap.
+   * @remarks Time O(N), Space O(1)
+   * @param element - Element to search for.
+   * @returns True if found.
+   * @example
+   * // Check element existence
+   *  const heap = new Heap<number>([3, 1, 2], { comparator: (a, b) => a - b });
+   *     console.log(heap.has(1)); // true;
+   *     console.log(heap.has(99)); // false;
+   */
   has(element) {
     for (const el of this.elements) if (this._equals(el, element)) return true;
     return false;
   }
   /**
-    * Delete one occurrence of an element.
-    * @remarks Time O(N), Space O(1)
-    * @param element - Element to delete.
-    * @returns True if an element was removed.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Remove specific element
-  *  const heap = new Heap<number>([3, 1, 4, 1, 5], { comparator: (a, b) => a - b });
-  *     heap.delete(4);
-  *     console.log(heap.toArray().includes(4)); // false;
-    */
+   * Delete one occurrence of an element.
+   * @remarks Time O(N), Space O(1)
+   * @param element - Element to delete.
+   * @returns True if an element was removed.
+   * @example
+   * // Remove specific element
+   *  const heap = new Heap<number>([3, 1, 4, 1, 5], { comparator: (a, b) => a - b });
+   *     heap.delete(4);
+   *     console.log(heap.toArray().includes(4)); // false;
+   */
   delete(element) {
     let index = -1;
     for (let i = 0; i < this.elements.length; i++) {
@@ -1031,49 +681,16 @@ var Heap = class _Heap extends IterableElementBase {
     return this;
   }
   /**
-    * Traverse the binary heap as a complete binary tree and collect elements.
-    * @remarks Time O(N), Space O(H)
-    * @param [order] - Traversal order: 'PRE' | 'IN' | 'POST'.
-    * @returns Array of visited elements.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Depth-first traversal
-  *  const heap = new Heap<number>([3, 1, 2], { comparator: (a, b) => a - b });
-  *     const result = heap.dfs('IN');
-  *     console.log(result.length); // 3;
-    */
+   * Traverse the binary heap as a complete binary tree and collect elements.
+   * @remarks Time O(N), Space O(H)
+   * @param [order] - Traversal order: 'PRE' | 'IN' | 'POST'.
+   * @returns Array of visited elements.
+   * @example
+   * // Depth-first traversal
+   *  const heap = new Heap<number>([3, 1, 2], { comparator: (a, b) => a - b });
+   *     const result = heap.dfs('IN');
+   *     console.log(result.length); // 3;
+   */
   dfs(order = "PRE") {
     const result = [];
     const _dfs = /* @__PURE__ */ __name((index) => {
@@ -1110,57 +727,15 @@ var Heap = class _Heap extends IterableElementBase {
     return results;
   }
   /**
-    * Return all elements in ascending order by repeatedly polling.
-    * @remarks Time O(N log N), Space O(N)
-    * @returns Sorted array of elements.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Sort elements using heap
-  *  const heap = new Heap<number>([5, 1, 3, 2, 4]);
-  *     const sorted = heap.sort();
-  *     console.log(sorted); // [1, 2, 3, 4, 5];
-    */
+   * Return all elements in ascending order by repeatedly polling.
+   * @remarks Time O(N log N), Space O(N)
+   * @returns Sorted array of elements.
+   * @example
+   * // Sort elements using heap
+   *  const heap = new Heap<number>([5, 1, 3, 2, 4]);
+   *     const sorted = heap.sort();
+   *     console.log(sorted); // [1, 2, 3, 4, 5];
+   */
   sort() {
     const visited = [];
     const cloned = this._createInstance();
@@ -1172,114 +747,34 @@ var Heap = class _Heap extends IterableElementBase {
     return visited;
   }
   /**
-    * Deep clone this heap.
-    * @remarks Time O(N), Space O(N)
-    * @returns A new heap with the same elements.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Create independent copy
-  *  const heap = new Heap<number>([3, 1, 4], { comparator: (a, b) => a - b });
-  *     const copy = heap.clone();
-  *     copy.poll();
-  *     console.log(heap.size); // 3;
-  *     console.log(copy.size); // 2;
-    */
+   * Deep clone this heap.
+   * @remarks Time O(N), Space O(N)
+   * @returns A new heap with the same elements.
+   * @example
+   * // Create independent copy
+   *  const heap = new Heap<number>([3, 1, 4], { comparator: (a, b) => a - b });
+   *     const copy = heap.clone();
+   *     copy.poll();
+   *     console.log(heap.size); // 3;
+   *     console.log(copy.size); // 2;
+   */
   clone() {
     const next = this._createInstance();
     for (const x of this.elements) next.add(x);
     return next;
   }
   /**
-    * Filter elements into a new heap of the same class.
-    * @remarks Time O(N log N), Space O(N)
-    * @param callback - Predicate (element, index, heap) → boolean to keep element.
-    * @param [thisArg] - Value for `this` inside the callback.
-    * @returns A new heap with the kept elements.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Filter elements
-  *  const heap = new Heap<number>([1, 2, 3, 4, 5], { comparator: (a, b) => a - b });
-  *     const evens = heap.filter(x => x % 2 === 0);
-  *     console.log(evens.size); // 2;
-    */
+   * Filter elements into a new heap of the same class.
+   * @remarks Time O(N log N), Space O(N)
+   * @param callback - Predicate (element, index, heap) → boolean to keep element.
+   * @param [thisArg] - Value for `this` inside the callback.
+   * @returns A new heap with the kept elements.
+   * @example
+   * // Filter elements
+   *  const heap = new Heap<number>([1, 2, 3, 4, 5], { comparator: (a, b) => a - b });
+   *     const evens = heap.filter(x => x % 2 === 0);
+   *     console.log(evens.size); // 2;
+   */
   filter(callback, thisArg) {
     const out = this._createInstance();
     let i = 0;
@@ -1293,59 +788,20 @@ var Heap = class _Heap extends IterableElementBase {
     return out;
   }
   /**
-    * Map elements into a new heap of possibly different element type.
-    * @remarks Time O(N log N), Space O(N)
-    * @template EM
-    * @template RM
-    * @param callback - Mapping function (element, index, heap) → newElement.
-    * @param options - Options for the output heap, including comparator for EM.
-    * @param [thisArg] - Value for `this` inside the callback.
-    * @returns A new heap with mapped elements.
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-    
-     * @example
-  * // Transform elements
-  *  const heap = new Heap<number>([1, 2, 3], { comparator: (a, b) => a - b });
-  *     const doubled = heap.map(x => x * 2, { comparator: (a, b) => a - b });
-  *     console.log(doubled.peek()); // 2;
-    */
+   * Map elements into a new heap of possibly different element type.
+   * @remarks Time O(N log N), Space O(N)
+   * @template EM
+   * @template RM
+   * @param callback - Mapping function (element, index, heap) → newElement.
+   * @param options - Options for the output heap, including comparator for EM.
+   * @param [thisArg] - Value for `this` inside the callback.
+   * @returns A new heap with mapped elements.
+   * @example
+   * // Transform elements
+   *  const heap = new Heap<number>([1, 2, 3], { comparator: (a, b) => a - b });
+   *     const doubled = heap.map(x => x * 2, { comparator: (a, b) => a - b });
+   *     console.log(doubled.peek()); // 2;
+   */
   map(callback, options, thisArg) {
     const { comparator, toElementFn, ...rest } = options ?? {};
     if (!comparator) raise(TypeError, ERR.comparatorRequired("Heap.map"));
@@ -1382,14 +838,6 @@ var Heap = class _Heap extends IterableElementBase {
     return 0;
   }, "_DEFAULT_COMPARATOR");
   _comparator = this._DEFAULT_COMPARATOR;
-  /**
-   * Get the comparator used to order elements.
-   * @remarks Time O(1), Space O(1)
-   * @returns Comparator function.
-   */
-  get comparator() {
-    return this._comparator;
-  }
   *_getIterator() {
     for (const element of this.elements) yield element;
   }