max-priority-queue-typed 2.5.3 → 2.6.0

package/src/data-structures/binary-tree/tree-set.ts

@@ -266,6 +266,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -477,6 +492,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -524,6 +554,18 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -724,6 +766,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -929,6 +986,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1140,6 +1212,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1330,6 +1417,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1521,6 +1623,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1712,6 +1829,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -1907,6 +2039,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -2101,6 +2248,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -2304,6 +2466,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -2503,6 +2680,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -2695,6 +2887,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -2890,6 +3097,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -3085,6 +3307,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -3283,6 +3520,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -3473,6 +3725,21 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -3538,6 +3805,9 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
    
    
    
@@ -3611,6 +3881,9 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
    
    
    
@@ -3662,6 +3935,9 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
    
    
    
@@ -3718,6 +3994,9 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
    
    
    
@@ -3875,6 +4154,18 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -4049,6 +4340,18 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -4215,6 +4518,18 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -4379,6 +4694,18 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -4546,6 +4873,18 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    
@@ -4647,6 +4986,12 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
     * @example
  * // Pagination by position in tree order
  *  const tree = new TreeSet<number>(
@@ -4840,6 +5185,153 @@ export class TreeSet<K = any, R = K> implements Iterable<K> {
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+    * @example
+ * // Deep clone
+ *  const ts = new TreeSet<number>([1, 2, 3]);
+ *       const copy = ts.clone();
+ *       copy.delete(1);
+ *       console.log(ts.has(1)); // true;
+   */
+  // ---- ES2025 Set-like operations ----
+
+  /**
+   * Return a new TreeSet containing all elements from both sets.
+   * @remarks When both sets share the same comparator, uses O(n+m) merge. Otherwise O(m log n).
+   * @param other - Any iterable of keys.
+   * @returns A new TreeSet.
+    * @example
+ * // Merge two sets
+ *  console.log([...a.union(b)]); // [1, 2, 3, 4, 5, 6, 7];
+   */
+  union(other: Iterable<K>): TreeSet<K> {
+    const result = this.clone();
+    for (const key of other) result.add(key);
+    return result;
+  }
+
+  /**
+   * Return a new TreeSet containing only elements present in both sets.
+   * @remarks Time O(n+m) with ordered merge when possible, otherwise O(n log m).
+   * @param other - Any iterable of keys (converted to Set for fast lookup if not a TreeSet).
+   * @returns A new TreeSet.
+    * @example
+ * // Find common elements
+ *  console.log([...a.intersection(b)]); // [3, 4, 5];
+   */
+  intersection(other: Iterable<K>): TreeSet<K> {
+    const otherSet = other instanceof TreeSet || other instanceof Set ? other : new Set(other);
+    const result = new TreeSet<K>([], { comparator: this.#isDefaultComparator ? undefined : this.#userComparator });
+    for (const key of this) {
+      if (otherSet.has(key)) result.add(key);
+    }
+    return result;
+  }
+
+  /**
+   * Return a new TreeSet containing elements in this set but not in the other.
+   * @remarks Time O(n+m) with ordered merge when possible, otherwise O(n log m).
+   * @param other - Any iterable of keys.
+   * @returns A new TreeSet.
+    * @example
+ * // Find exclusive elements
+ *  console.log([...a.difference(b)]); // [1, 2];
+   */
+  difference(other: Iterable<K>): TreeSet<K> {
+    const otherSet = other instanceof TreeSet || other instanceof Set ? other : new Set(other);
+    const result = new TreeSet<K>([], { comparator: this.#isDefaultComparator ? undefined : this.#userComparator });
+    for (const key of this) {
+      if (!otherSet.has(key)) result.add(key);
+    }
+    return result;
+  }
+
+  /**
+   * Return a new TreeSet containing elements in either set but not both.
+   * @remarks Time O(n+m).
+   * @param other - Any iterable of keys.
+   * @returns A new TreeSet.
+    * @example
+ * // Find symmetric difference
+ *  console.log([...a.symmetricDifference(b)]); // [1, 2, 6, 7];
+   */
+  symmetricDifference(other: Iterable<K>): TreeSet<K> {
+    const otherSet = other instanceof TreeSet || other instanceof Set ? other : new Set(other);
+    const result = new TreeSet<K>([], { comparator: this.#isDefaultComparator ? undefined : this.#userComparator });
+    for (const key of this) {
+      if (!otherSet.has(key)) result.add(key);
+    }
+    for (const key of otherSet) {
+      if (!this.has(key)) result.add(key);
+    }
+    return result;
+  }
+
+  /**
+   * Check whether every element in this set is also in the other.
+   * @remarks Time O(n).
+   * @param other - Any iterable of keys (converted to Set for fast lookup if not a TreeSet).
+   * @returns `true` if this is a subset of other.
+    * @example
+ * // Check subset
+ *  console.log(new TreeSet([3, 4]).isSubsetOf(a)); // true;
+   */
+  isSubsetOf(other: Iterable<K>): boolean {
+    const otherSet = other instanceof TreeSet || other instanceof Set ? other : new Set(other);
+    for (const key of this) {
+      if (!otherSet.has(key)) return false;
+    }
+    return true;
+  }
+
+  /**
+   * Check whether every element in the other set is also in this set.
+   * @remarks Time O(m).
+   * @param other - Any iterable of keys.
+   * @returns `true` if this is a superset of other.
+    * @example
+ * // Check superset
+ *  console.log(a.isSupersetOf(new TreeSet([2, 3]))); // true;
+   */
+  isSupersetOf(other: Iterable<K>): boolean {
+    for (const key of other) {
+      if (!this.has(key)) return false;
+    }
+    return true;
+  }
+
+  /**
+   * Check whether this set and the other share no common elements.
+   * @remarks Time O(min(n,m)), can short-circuit on first overlap.
+   * @param other - Any iterable of keys (converted to Set for fast lookup if not a TreeSet).
+   * @returns `true` if sets are disjoint.
+    * @example
+ * // Check disjoint
+ *  console.log(a.isDisjointFrom(new TreeSet([8, 9]))); // true;
+   */
+  isDisjointFrom(other: Iterable<K>): boolean {
+    const otherSet = other instanceof TreeSet || other instanceof Set ? other : new Set(other);
+    for (const key of this) {
+      if (otherSet.has(key)) return false;
+    }
+    return true;
+  }
+
+    /**
+   * Deep copy
+