max-priority-queue-typed 2.4.4 → 2.5.0

package/dist/types/data-structures/binary-tree/tree-map.d.ts

@@ -13,6 +13,11 @@ import type { TreeMapEntryCallback, TreeMapOptions, TreeMapRangeOptions, TreeMap
  *
  * - Iteration order is ascending by key.
  * - No node exposure: all APIs use keys/values only.
+ * @example
+ * // Set multiple key-value pairs
+ *  const tm = new TreeMap<number, string>();
+ *     tm.setMany([[1, 'a'], [2, 'b'], [3, 'c']]);
+ *     console.log(tm.size); // 3;
  */
 export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[K, V | undefined]> {
     #private;
@@ -50,35 +55,408 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
     get size(): number;
     /**
      * Whether the map is empty.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Check empty
+   *  console.log(new TreeMap().isEmpty()); // true;
      */
     isEmpty(): boolean;
     /**
      * Set or overwrite a value for a key.
      * @remarks Expected time O(log n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Sorted dictionary for a contact book
+   *  const contacts = new TreeMap<string, string>([
+   *       ['Bob', '555-0102'],
+   *       ['Alice', '555-0101'],
+   *       ['Charlie', '555-0103']
+   *     ]);
+   *
+   *     // Contacts are automatically sorted by name
+   *     console.log([...contacts.keys()]); // ['Alice', 'Bob', 'Charlie'];
+   *     console.log(contacts.get('Bob')); // '555-0102';
+   *
+   *     // Find the first contact alphabetically after 'B'
+   *     console.log(contacts.ceiling('B')); // ['Bob', '555-0102'];
+   *
+   *     // Find contacts in range
+   *     console.log(contacts.rangeSearch(['Alice', 'Bob'])); // [
+   *  //      ['Alice', '555-0101'],
+   *  //      ['Bob', '555-0102']
+   *  //    ];
      */
     set(key: K, value: V | undefined): this;
     /**
      * Get the value under a key.
      * @remarks Expected time O(log n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Configuration registry with typed lookups
+   *  const config = new TreeMap<string, number>([
+   *       ['maxRetries', 3],
+   *       ['timeout', 5000],
+   *       ['poolSize', 10]
+   *     ]);
+   *
+   *     console.log(config.get('timeout')); // 5000;
+   *     console.log(config.get('missing')); // undefined;
+   *     console.log(config.size); // 3;
      */
     get(key: K): V | undefined;
     /**
      * Test whether a key exists.
      * @remarks Expected time O(log n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Feature flag checking
+   *  const flags = new TreeMap<string, boolean>([
+   *       ['darkMode', true],
+   *       ['betaFeature', false],
+   *       ['notifications', true]
+   *     ]);
+   *
+   *     console.log(flags.has('darkMode')); // true;
+   *     console.log(flags.has('unknownFlag')); // false;
      */
     has(key: K): boolean;
     /**
      * Delete a key.
      * @returns `true` if the key existed; otherwise `false`.
      * @remarks Expected time O(log n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Session management with expiry
+   *  const sessions = new TreeMap<string, number>([
+   *       ['sess_abc', Date.now()],
+   *       ['sess_def', Date.now()],
+   *       ['sess_ghi', Date.now()]
+   *     ]);
+   *
+   *     console.log(sessions.size); // 3;
+   *     sessions.delete('sess_def');
+   *     console.log(sessions.has('sess_def')); // false;
+   *     console.log(sessions.size); // 2;
      */
     delete(key: K): boolean;
     /**
      * Remove all entries.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Remove all
+   *  const tm = new TreeMap<number, string>([[1, 'a']]);
+   *       tm.clear();
+   *       console.log(tm.isEmpty()); // true;
      */
     clear(): void;
     /**
      * Iterate over keys in ascending order.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Get sorted keys
+   *  const tm = new TreeMap<number, string>([[3, 'c'], [1, 'a']]);
+   *       console.log([...tm.keys()]); // [1, 3];
      */
     keys(): IterableIterator<K>;
     private _entryFromKey;
@@ -86,12 +464,96 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      * Iterate over values in ascending key order.
      *
      * Note: values may be `undefined` (TreeMap allows storing `undefined`, like native `Map`).
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Get values in key order
+   *  const tm = new TreeMap<number, string>([[2, 'b'], [1, 'a']]);
+   *       console.log([...tm.values()]); // ['a', 'b'];
      */
     values(): IterableIterator<V | undefined>;
     /**
      * Iterate over `[key, value]` entries in ascending key order.
      *
      * Note: values may be `undefined`.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Iterate key-value pairs
+   *  const tm = new TreeMap<number, string>([[3, 'c'], [1, 'a'], [2, 'b']]);
+   *       console.log([...tm.entries()]); // [[1, 'a'], [2, 'b'], [3, 'c']];
      */
     entries(): IterableIterator<[K, V | undefined]>;
     [Symbol.iterator](): IterableIterator<[K, V | undefined]>;
@@ -99,6 +561,50 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      * Visit each entry in ascending key order.
      *
      * Note: callback value may be `undefined`.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Execute for each entry
+   *  const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+   *       const pairs: string[] = [];
+   *       tm.forEach((v, k) => pairs.push(`${k}:${v}`));
+   *       console.log(pairs); // ['1:a', '2:b'];
      */
     forEach(cb: (value: V | undefined, key: K, map: TreeMap<K, V>) => void, thisArg?: any): void;
     /**
@@ -106,6 +612,49 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      *
      * This mirrors `RedBlackTree.map`: mapping produces a new ordered container.
      * @remarks Time O(n log n) expected, Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Transform entries
+   *  const tm = new TreeMap<number, number>([[1, 10], [2, 20]]);
+   *       const doubled = tm.map((v, k) => [k, (v ?? 0) * 2] as [number, number]);
+   *       console.log([...doubled.values()]); // [20, 40];
      */
     map<MK, MV>(callbackfn: TreeMapEntryCallback<K, V, [MK, MV], TreeMap<K, V>>, options?: Omit<TreeMapOptions<MK, MV>, 'toEntryFn'> & {
         comparator?: (a: MK, b: MK) => number;
@@ -113,69 +662,688 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
     /**
      * Create a new TreeMap containing only entries that satisfy the predicate.
      * @remarks Time O(n log n) expected, Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Filter entries
+   *  const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b'], [3, 'c']]);
+   *       const filtered = tm.filter((v, k) => k > 1);
+   *       console.log([...filtered.keys()]); // [2, 3];
      */
     filter(callbackfn: TreeMapEntryCallback<K, V, boolean, TreeMap<K, V>>, thisArg?: unknown): TreeMap<K, V>;
     /**
      * Reduce entries into a single accumulator.
      * @remarks Time O(n), Space O(1)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Aggregate values
+   *  const tm = new TreeMap<number, number>([[1, 10], [2, 20]]);
+   *       console.log(tm.reduce((acc, v) => acc + (v ?? 0), 0)); // 30;
      */
     reduce<A>(callbackfn: TreeMapReduceCallback<K, V, A, TreeMap<K, V>>, initialValue: A): A;
     /**
      * Test whether all entries satisfy a predicate.
      * @remarks Time O(n), Space O(1)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Test all entries
+   *  const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+   *       console.log(tm.every((v, k) => k > 0)); // true;
      */
     every(callbackfn: TreeMapEntryCallback<K, V, boolean, TreeMap<K, V>>, thisArg?: unknown): boolean;
     /**
      * Test whether any entry satisfies a predicate.
      * @remarks Time O(n), Space O(1)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Test any entry
+   *  const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+   *       console.log(tm.some((v, k) => k === 2)); // true;
      */
     some(callbackfn: TreeMapEntryCallback<K, V, boolean, TreeMap<K, V>>, thisArg?: unknown): boolean;
     /**
      * Find the first entry that satisfies a predicate.
      * @returns The first matching `[key, value]` tuple, or `undefined`.
      * @remarks Time O(n), Space O(1)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Find matching entry
+   *  const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+   *       console.log(tm.find(v => v === 'b')?.[0]); // 2;
      */
     find(callbackfn: TreeMapEntryCallback<K, V, boolean, TreeMap<K, V>>, thisArg?: unknown): [K, V | undefined] | undefined;
     /**
      * Materialize the map into an array of `[key, value]` tuples.
      * @remarks Time O(n), Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Convert to array
+   *  const tm = new TreeMap<number, string>([[2, 'b'], [1, 'a']]);
+   *       console.log(tm.toArray()); // [[1, 'a'], [2, 'b']];
      */
     toArray(): Array<[K, V | undefined]>;
     /**
      * Print a human-friendly representation.
      * @remarks Time O(n), Space O(n)
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Display tree
+   *  const tm = new TreeMap<number, string>([[1, 'a']]);
+   *       expect(() => tm.print()).not.toThrow();
      */
     print(): void;
     /**
      * Smallest entry by key.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Leaderboard with ranked scores
+   *  // Use score as key (descending), player name as value
+   *     const leaderboard = new TreeMap<number, string>([], {
+   *       comparator: (a, b) => b - a // descending
+   *     });
+   *
+   *     leaderboard.set(1500, 'Alice');
+   *     leaderboard.set(2200, 'Bob');
+   *     leaderboard.set(1800, 'Charlie');
+   *     leaderboard.set(2500, 'Diana');
+   *
+   *     // Top 3 players (first 3 in descending order)
+   *     const top3 = [...leaderboard.entries()].slice(0, 3);
+   *     console.log(top3); // [
+   *  //      [2500, 'Diana'],
+   *  //      [2200, 'Bob'],
+   *  //      [1800, 'Charlie']
+   *  //    ];
+   *
+   *     // Highest scorer
+   *     console.log(leaderboard.first()); // [2500, 'Diana'];
+   *
+   *     // Remove lowest scorer
+   *     console.log(leaderboard.pollLast()); // [1500, 'Alice'];
+   *     console.log(leaderboard.size); // 3;
      */
     first(): [K, V | undefined] | undefined;
     /**
      * Largest entry by key.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Access the maximum entry
+   *  const scores = new TreeMap<number, string>([
+   *       [85, 'Bob'],
+   *       [92, 'Alice'],
+   *       [78, 'Charlie']
+   *     ]);
+   *
+   *     console.log(scores.last()); // [92, 'Alice'];
+   *     console.log(scores.first()); // [78, 'Charlie'];
      */
     last(): [K, V | undefined] | undefined;
     /**
      * Remove and return the smallest entry.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Process items from lowest priority
+   *  const tasks = new TreeMap<number, string>([
+   *       [3, 'Low'],
+   *       [1, 'Critical'],
+   *       [2, 'Medium']
+   *     ]);
+   *
+   *     // Process lowest priority first
+   *     console.log(tasks.pollFirst()); // [1, 'Critical'];
+   *     console.log(tasks.pollFirst()); // [2, 'Medium'];
+   *     console.log(tasks.size); // 1;
      */
     pollFirst(): [K, V | undefined] | undefined;
     /**
      * Remove and return the largest entry.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Remove the maximum entry
+   *  const bids = new TreeMap<number, string>([
+   *       [100, 'Alice'],
+   *       [150, 'Bob'],
+   *       [120, 'Charlie']
+   *     ]);
+   *
+   *     // Remove highest bid
+   *     console.log(bids.pollLast()); // [150, 'Bob'];
+   *     console.log(bids.size); // 2;
+   *     console.log(bids.last()); // [120, 'Charlie'];
      */
     pollLast(): [K, V | undefined] | undefined;
     /**
      * Smallest entry whose key is >= the given key.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Event scheduler with time-based lookup
+   *  const events = new TreeMap<Date, string>();
+   *
+   *     const meeting = new Date('2024-01-15T10:00:00Z');
+   *     const lunch = new Date('2024-01-15T12:00:00Z');
+   *     const review = new Date('2024-01-15T15:00:00Z');
+   *     const standup = new Date('2024-01-15T09:00:00Z');
+   *
+   *     events.set(meeting, 'Team Meeting');
+   *     events.set(lunch, 'Lunch Break');
+   *     events.set(review, 'Code Review');
+   *     events.set(standup, 'Daily Standup');
+   *
+   *     // Events are sorted chronologically
+   *     console.log([...events.values()]); // [
+   *  //      'Daily Standup',
+   *  //      'Team Meeting',
+   *  //      'Lunch Break',
+   *  //      'Code Review'
+   *  //    ];
+   *
+   *     // Next event after 11:00
+   *     const after11 = new Date('2024-01-15T11:00:00Z');
+   *     console.log(events.ceiling(after11)?.[1]); // 'Lunch Break';
+   *
+   *     // Events between 9:30 and 13:00
+   *     const from = new Date('2024-01-15T09:30:00Z');
+   *     const to = new Date('2024-01-15T13:00:00Z');
+   *     const window = events.rangeSearch([from, to]);
+   *     console.log(window.map(([, v]) => v)); // ['Team Meeting', 'Lunch Break'];
      */
     ceiling(key: K): [K, V | undefined] | undefined;
     /**
      * Largest entry whose key is <= the given key.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Find the largest key ≤ target
+   *  const versions = new TreeMap<number, string>([
+   *       [1, 'v1.0'],
+   *       [3, 'v3.0'],
+   *       [5, 'v5.0'],
+   *       [7, 'v7.0']
+   *     ]);
+   *
+   *     // Largest version ≤ 4
+   *     console.log(versions.floor(4)); // [3, 'v3.0'];
+   *     // Largest version ≤ 5 (exact match)
+   *     console.log(versions.floor(5)); // [5, 'v5.0'];
+   *     // No version ≤ 0
+   *     console.log(versions.floor(0)); // undefined;
      */
     floor(key: K): [K, V | undefined] | undefined;
     /**
      * Smallest entry whose key is > the given key.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Find the smallest key strictly > target
+   *  const prices = new TreeMap<number, string>([
+   *       [10, 'Basic'],
+   *       [25, 'Standard'],
+   *       [50, 'Premium'],
+   *       [100, 'Enterprise']
+   *     ]);
+   *
+   *     // Next tier above $25
+   *     console.log(prices.higher(25)); // [50, 'Premium'];
+   *     // Next tier above $99
+   *     console.log(prices.higher(99)); // [100, 'Enterprise'];
+   *     // Nothing above $100
+   *     console.log(prices.higher(100)); // undefined;
      */
     higher(key: K): [K, V | undefined] | undefined;
     /**
      * Largest entry whose key is < the given key.
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Find the largest key strictly < target
+   *  const temps = new TreeMap<number, string>([
+   *       [0, 'Freezing'],
+   *       [20, 'Cool'],
+   *       [30, 'Warm'],
+   *       [40, 'Hot']
+   *     ]);
+   *
+   *     // Largest reading below 30
+   *     console.log(temps.lower(30)); // [20, 'Cool'];
+   *     // Nothing below 0
+   *     console.log(temps.lower(0)); // undefined;
      */
     lower(key: K): [K, V | undefined] | undefined;
     /**
@@ -183,16 +1351,124 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
      *
      * @param range `[low, high]`
      * @param options Inclusive/exclusive bounds (defaults to inclusive).
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Inventory system with price-sorted products
+   *  interface Product {
+   *       name: string;
+   *       price: number;
+   *       stock: number;
+   *     }
+   *
+   *     const inventory = new TreeMap<string, Product, Product>(
+   *       [
+   *         { name: 'Widget', price: 9.99, stock: 100 },
+   *         { name: 'Gadget', price: 24.99, stock: 50 },
+   *         { name: 'Doohickey', price: 4.99, stock: 200 }
+   *       ],
+   *       { toEntryFn: p => [p.name, p] }
+   *     );
+   *
+   *     // Sorted alphabetically by product name
+   *     console.log([...inventory.keys()]); // ['Doohickey', 'Gadget', 'Widget'];
+   *
+   *     // Filter high-stock items
+   *     const highStock = inventory.filter(p => (p?.stock ?? 0) > 75);
+   *     console.log([...highStock.keys()]); // ['Doohickey', 'Widget'];
+   *
+   *     // Calculate total inventory value
+   *     const totalValue = inventory.reduce(
+   *       (sum, p) => sum + (p ? p.price * p.stock : 0),
+   *       0
+   *     );
+   *     console.log(totalValue); // toBeCloseTo;
      */
     rangeSearch(range: [K, K], options?: TreeMapRangeOptions): Array<[K, V | undefined]>;
     /**
      * Creates a shallow clone of this map.
      * @remarks Time O(n log n), Space O(n)
-     * @example
-     * const original = new TreeMap([['a', 1], ['b', 2]]);
-     * const copy = original.clone();
-     * copy.set('c', 3);
-     * original.has('c'); // false (original unchanged)
+    
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+      * @example
+   * // Deep clone
+   *  const tm = new TreeMap<number, string>([[1, 'a'], [2, 'b']]);
+   *       const copy = tm.clone();
+   *       copy.delete(1);
+   *       console.log(tm.has(1)); // true;
      */
     clone(): TreeMap<K, V>;
 }