binary-tree-typed 2.5.0 → 2.5.2

package/dist/types/data-structures/heap/heap.d.ts

@@ -176,6 +176,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Track heap capacity
    *  const heap = new Heap<number>();
@@ -230,6 +254,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // basic Heap creation and add operation
    *  // Create a min heap (default)
@@ -260,6 +308,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Add multiple elements
    *  const heap = new Heap<number>([], { comparator: (a, b) => a - b });
@@ -283,6 +355,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Heap with custom comparator (MaxHeap behavior)
    *  interface Task {
@@ -325,6 +421,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Heap for event processing with priority
    *  interface Event {
@@ -399,6 +519,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Check if heap is empty
    *  const heap = new Heap<number>([], { comparator: (a, b) => a - b });
@@ -420,6 +564,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove all elements
    *  const heap = new Heap<number>([1, 2, 3], { comparator: (a, b) => a - b });
@@ -441,6 +609,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      * @returns True if found.
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Check element existence
    *  const heap = new Heap<number>([3, 1, 2], { comparator: (a, b) => a - b });
@@ -461,6 +653,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove specific element
    *  const heap = new Heap<number>([3, 1, 4, 1, 5], { comparator: (a, b) => a - b });
@@ -489,6 +705,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      * @returns Array of visited elements.
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Depth-first traversal
    *  const heap = new Heap<number>([3, 1, 2], { comparator: (a, b) => a - b });
@@ -517,6 +757,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Sort elements using heap
    *  const heap = new Heap<number>([5, 1, 3, 2, 4]);
@@ -537,6 +801,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Create independent copy
    *  const heap = new Heap<number>([3, 1, 4], { comparator: (a, b) => a - b });
@@ -561,6 +849,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Filter elements
    *  const heap = new Heap<number>([1, 2, 3, 4, 5], { comparator: (a, b) => a - b });
@@ -585,6 +897,30 @@ export declare class Heap<E = any, R = any> extends IterableElementBase<E, R> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Transform elements
    *  const heap = new Heap<number>([1, 2, 3], { comparator: (a, b) => a - b });