data-structure-typed 2.5.2 → 2.6.0

package/docs-site-docusaurus/docs/api/classes/BSTNode.md

@@ -6,7 +6,7 @@
 
 # Class: BSTNode\<K, V\>
 
-Defined in: [data-structures/binary-tree/bst.ts:37](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L37)
+Defined in: [data-structures/binary-tree/bst.ts:36](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L36)
 
 Represents a Node in a Binary Search Tree.
 
@@ -32,7 +32,7 @@ The type of the value.
 new BSTNode<K, V>(key, value?): BSTNode<K, V>;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:49](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L49)
+Defined in: [data-structures/binary-tree/bst.ts:48](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L48)
 
 Creates an instance of BSTNode.
 
@@ -68,7 +68,7 @@ Time O(1), Space O(1)
 get color(): RBTNColor;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:133](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L133)
+Defined in: [data-structures/binary-tree/bst.ts:132](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L132)
 
 Gets the color of the node (used in Red-Black trees).
 
@@ -88,7 +88,7 @@ The node's color.
 set color(value): void;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:144](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L144)
+Defined in: [data-structures/binary-tree/bst.ts:143](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L143)
 
 Sets the color of the node.
 
@@ -118,7 +118,7 @@ The new color.
 get count(): number;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:157](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L157)
+Defined in: [data-structures/binary-tree/bst.ts:156](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L156)
 
 Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
 
@@ -138,7 +138,7 @@ The subtree node count.
 set count(value): void;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:168](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L168)
+Defined in: [data-structures/binary-tree/bst.ts:167](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L167)
 
 Sets the count of nodes in the subtree.
 
@@ -168,7 +168,7 @@ The new count.
 get familyPosition(): FamilyPosition;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:178](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L178)
+Defined in: [data-structures/binary-tree/bst.ts:177](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L177)
 
 Gets the position of the node relative to its parent.
 
@@ -192,7 +192,7 @@ The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
 get height(): number;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:109](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L109)
+Defined in: [data-structures/binary-tree/bst.ts:108](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L108)
 
 Gets the height of the node (used in self-balancing trees).
 
@@ -212,7 +212,7 @@ The height.
 set height(value): void;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:120](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L120)
+Defined in: [data-structures/binary-tree/bst.ts:119](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L119)
 
 Sets the height of the node.
 
@@ -242,7 +242,7 @@ The new height.
 get left(): BSTNode<K, V> | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:62](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L62)
+Defined in: [data-structures/binary-tree/bst.ts:61](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L61)
 
 Gets the left child of the node.
 
@@ -262,7 +262,7 @@ The left child.
 set left(v): void;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:72](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L72)
+Defined in: [data-structures/binary-tree/bst.ts:71](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L71)
 
 Sets the left child of the node and updates its parent reference.
 
@@ -292,7 +292,7 @@ The node to set as the left child.
 get right(): BSTNode<K, V> | null | undefined;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:85](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L85)
+Defined in: [data-structures/binary-tree/bst.ts:84](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L84)
 
 Gets the right child of the node.
 
@@ -312,7 +312,7 @@ The right child.
 set right(v): void;
 ```
 
-Defined in: [data-structures/binary-tree/bst.ts:95](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/bst.ts#L95)
+Defined in: [data-structures/binary-tree/bst.ts:94](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L94)
 
 Sets the right child of the node and updates its parent reference.
 

package/docs-site-docusaurus/docs/api/classes/BinaryIndexedTree.md

@@ -6,7 +6,7 @@
 
 # Class: BinaryIndexedTree
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:30](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L30)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:30](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L30)
 
 Binary Indexed Tree (Fenwick Tree).
 
@@ -40,7 +40,7 @@ bit.get(1);         // point value at index 1 = 2
 new BinaryIndexedTree(sizeOrElements): BinaryIndexedTree;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:38](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L38)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:38](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L38)
 
 Construct a BIT of given size (all zeros), or from an initial values array.
 
@@ -64,7 +64,7 @@ number of elements, or an array of initial values
 iterator: IterableIterator<number>;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:648](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L648)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:704](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L704)
 
 Iterate over point values in index order.
 
@@ -86,7 +86,7 @@ Iterable.[iterator]
 get(index): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:281](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L281)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:305](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L305)
 
 Get the point value at index (0-based).
 Time: O(log n)
@@ -120,7 +120,7 @@ Time: O(log n)
 lowerBound(sum): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:516](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L516)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:564](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L564)
 
 Find the smallest index i such that prefix sum [0..i] >= sum.
 Requires all values to be non-negative (behavior undefined otherwise).
@@ -156,7 +156,7 @@ Time: O(log n)
 query(index): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:357](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L357)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:389](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L389)
 
 Prefix sum query: returns sum of elements [0..index] (inclusive, 0-based).
 Time: O(log n)
@@ -189,7 +189,7 @@ Time: O(log n)
 queryRange(start, end): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:432](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L432)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:472](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L472)
 
 Range sum query: returns sum of elements [start..end] (inclusive, 0-based).
 Time: O(log n)
@@ -226,7 +226,7 @@ Time: O(log n)
 set(index, value): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:204](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L204)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:220](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L220)
 
 Point set: set the value at index to an absolute value (0-based).
 Time: O(log n)
@@ -264,7 +264,7 @@ Time: O(log n)
 toArray(): number[];
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:637](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L637)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:693](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L693)
 
 Returns the point values as a plain array.
 Time: O(n log n)
@@ -291,7 +291,7 @@ Time: O(n log n)
 update(index, delta): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:127](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L127)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:135](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L135)
 
 Point update: add delta to the value at index (0-based).
 Time: O(log n)
@@ -329,7 +329,7 @@ Time: O(log n)
 upperBound(sum): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:569](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L569)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:621](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L621)
 
 Find the smallest index i such that prefix sum [0..i] > sum.
 Requires all values to be non-negative (behavior undefined otherwise).
@@ -368,7 +368,7 @@ Time: O(log n)
 protected _highBit(n): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:718](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L718)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:774](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L774)
 
 Returns highest power of 2 <= n.
 
@@ -390,7 +390,7 @@ Returns highest power of 2 <= n.
 protected _pointQuery(pos): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:697](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L697)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:753](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L753)
 
 1-based point query: get exact value at pos.
 
@@ -412,7 +412,7 @@ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:697](https://git
 protected _pointUpdate(pos, delta): void;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:689](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L689)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:745](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L745)
 
 1-based point update: add delta to position pos.
 
@@ -438,7 +438,7 @@ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:689](https://git
 protected _prefixSum(pos): number;
 ```
 
-Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:679](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/binary-indexed-tree.ts#L679)
+Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:735](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L735)
 
 1-based prefix sum up to pos (inclusive).