binary-tree-typed 2.5.3 → 2.6.0

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

@@ -216,6 +216,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -406,6 +421,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -447,6 +477,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -639,6 +681,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -840,6 +897,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1036,6 +1108,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1223,6 +1310,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1411,6 +1513,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1599,6 +1716,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1788,6 +1920,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -1979,6 +2126,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2169,6 +2331,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2357,6 +2534,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2543,6 +2735,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2728,6 +2935,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -2913,6 +3135,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3101,6 +3338,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3288,6 +3540,21 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3347,6 +3614,9 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -3417,6 +3687,9 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -3465,6 +3738,9 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -3515,6 +3791,9 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
      
      
      
@@ -3666,6 +3945,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3836,6 +4127,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -3998,6 +4301,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -4158,6 +4473,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -4321,6 +4648,18 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -4394,6 +4733,12 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
+     
       * @example
    * // Pagination by position in tree order
    *  const tree = new TreeSet<number>(
@@ -4586,6 +4931,11 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
      
      
      
+     
+     
+     
+     
+     
      
      
      
@@ -4599,5 +4949,93 @@ export declare class TreeSet<K = any, R = K> implements Iterable<K> {
    *       copy.delete(1);
    *       console.log(ts.has(1)); // true;
      */
+    /**
+     * 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>;
+    /**
+     * 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>;
+    /**
+     * 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>;
+    /**
+     * 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>;
+    /**
+     * 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;
+    /**
+     * 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;
+    /**
+     * 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;
+    /**
+   * Deep copy
+  
+   
+   
+   
+   
+   
+   
+   
+   
+    * @example
+ * // Deep clone
+ *  const ts = new TreeSet<number>([1, 2, 3]);
+ *       const copy = ts.clone();
+ *       copy.delete(1);
+ *       console.log(ts.has(1)); // true;
+   */
     clone(): TreeSet<K>;
 }

package/dist/types/data-structures/graph/directed-graph.d.ts

@@ -189,6 +189,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -252,6 +255,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -317,6 +323,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
    
    
    
@@ -370,6 +379,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -422,6 +434,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -502,6 +517,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -564,6 +582,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
    
    
    
@@ -612,6 +633,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
    
    
    
@@ -687,6 +711,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
      
      
      
@@ -758,6 +785,9 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+