binary-tree-typed 2.5.0 → 2.5.1

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

@@ -238,6 +238,90 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -380,6 +464,90 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -442,6 +610,90 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -506,6 +758,69 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
      
      
@@ -534,6 +849,90 @@ export declare class RedBlackTree<K = any, V = any, R = any> extends BST<K, V, R
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
    
    

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

@@ -2,7 +2,6 @@
  * data-structure-typed
  *
  * @author Pablo Zeng
- * @copyright Copyright (c) 2022 Pablo Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
 export type SegmentTreeOptions<E> = {
@@ -57,6 +56,27 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Temperature monitoring with range queries
    *  // Hourly temperatures for a day (24 readings)
@@ -94,6 +114,27 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Dynamic range sum with updates
    *  // Monthly revenue data (in thousands)
@@ -127,6 +168,27 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Range sum query on an array
    *  const tree = SegmentTree.sum([1, 3, 5, 7, 9, 11]);
@@ -155,6 +217,27 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Point access on segment tree
    *  const st = SegmentTree.sum([10, 20, 30, 40]);
@@ -178,6 +261,27 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Find rightmost position where predicate holds
    *  // Prefix sums: find the rightmost index where prefix sum < 10
@@ -204,6 +308,27 @@ export declare class SegmentTree<E = number> implements Iterable<E> {
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Find leftmost position where predicate holds
    *  const st = SegmentTree.sum([3, 1, 4, 1, 5]);