data-structure-typed 2.6.0 → 2.6.2

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

@@ -6,7 +6,7 @@
 
 # Class: SegmentTree\<E\>
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:30](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L30)
+Defined in: [data-structures/binary-tree/segment-tree.ts:29](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L29)
 
 Generic Segment Tree with flat array internals.
 
@@ -43,7 +43,7 @@ minTree.query(0, 4);    // 1
 iterator: IterableIterator<E>;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:586](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L586)
+Defined in: [data-structures/binary-tree/segment-tree.ts:328](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L328)
 
 Iterates over leaf values in index order.
 
@@ -65,13 +65,11 @@ Iterable.[iterator]
 get(index): E;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:360](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L360)
+Defined in: [data-structures/binary-tree/segment-tree.ts:200](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L200)
 
 Get element at index.
 Time: O(1)
 
- *
-
 #### Parameters
 
 ##### index
@@ -99,15 +97,13 @@ Time: O(1)
 maxRight(left, predicate): number;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:420](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L420)
+Defined in: [data-structures/binary-tree/segment-tree.ts:219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L219)
 
 Find the largest r such that predicate(query(left, r)) is true.
 Returns left-1 if predicate(identity) is false.
 Returns n-1 if predicate holds for the entire range [left, n-1].
 Time: O(log n)
 
- *
-
 #### Parameters
 
 ##### left
@@ -142,15 +138,13 @@ Time: O(log n)
 minLeft(right, predicate): number;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:515](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L515)
+Defined in: [data-structures/binary-tree/segment-tree.ts:269](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L269)
 
 Find the smallest l such that predicate(query(l, right)) is true.
 Returns right+1 if predicate(identity) is false.
 Returns 0 if predicate holds for the entire range [0, right].
 Time: O(log n)
 
- *
-
 #### Parameters
 
 ##### right
@@ -184,13 +178,11 @@ Time: O(log n)
 query(start, end): E;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:286](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L286)
+Defined in: [data-structures/binary-tree/segment-tree.ts:166](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L166)
 
 Range query: returns merger result over [start, end] (inclusive).
 Time: O(log n)
 
- *
-
 #### Parameters
 
 ##### start
@@ -229,13 +221,11 @@ Time: O(log n)
 update(index, value): void;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:217](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L217)
+Defined in: [data-structures/binary-tree/segment-tree.ts:138](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L138)
 
 Point update: set element at index to value.
 Time: O(log n)
 
- *
-
 #### Parameters
 
 ##### index
@@ -279,7 +269,7 @@ Time: O(log n)
 static max(elements): SegmentTree<number>;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:148](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L148)
+Defined in: [data-structures/binary-tree/segment-tree.ts:110](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L110)
 
 Create a max segment tree.
 
@@ -308,12 +298,10 @@ st.query(1, 4); // 5
 static min(elements): SegmentTree<number>;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:133](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L133)
+Defined in: [data-structures/binary-tree/segment-tree.ts:93](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L93)
 
 Create a min segment tree.
 
- *
-
 #### Parameters
 
 ##### elements
@@ -348,7 +336,7 @@ Create a min segment tree.
 static sum(elements): SegmentTree<number>;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:72](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L72)
+Defined in: [data-structures/binary-tree/segment-tree.ts:71](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/segment-tree.ts#L71)
 
 Create a sum segment tree.