data-structure-typed 2.5.2 → 2.5.3

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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/segment-tree.ts#L30)
+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)
 
 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:562](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/segment-tree.ts#L562)
+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)
 
 Iterates over leaf values in index order.
 
@@ -65,7 +65,7 @@ Iterable.[iterator]
 get(index): E;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:344](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/segment-tree.ts#L344)
+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)
 
 Get element at index.
 Time: O(1)
@@ -99,7 +99,7 @@ Time: O(1)
 maxRight(left, predicate): number;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:400](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/segment-tree.ts#L400)
+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)
 
 Find the largest r such that predicate(query(left, r)) is true.
 Returns left-1 if predicate(identity) is false.
@@ -142,7 +142,7 @@ Time: O(log n)
 minLeft(right, predicate): number;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:491](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/segment-tree.ts#L491)
+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)
 
 Find the smallest l such that predicate(query(l, right)) is true.
 Returns right+1 if predicate(identity) is false.
@@ -184,7 +184,7 @@ Time: O(log n)
 query(start, end): E;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:274](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/segment-tree.ts#L274)
+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)
 
 Range query: returns merger result over [start, end] (inclusive).
 Time: O(log n)
@@ -229,7 +229,7 @@ Time: O(log n)
 update(index, value): void;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:209](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/segment-tree.ts#L209)
+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)
 
 Point update: set element at index to value.
 Time: O(log n)
@@ -279,7 +279,7 @@ Time: O(log n)
 static max(elements): SegmentTree<number>;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:144](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/segment-tree.ts#L144)
+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)
 
 Create a max segment tree.
 
@@ -308,7 +308,7 @@ st.query(1, 4); // 5
 static min(elements): SegmentTree<number>;
 ```
 
-Defined in: [data-structures/binary-tree/segment-tree.ts:129](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/segment-tree.ts#L129)
+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)
 
 Create a min segment tree.
 
@@ -348,7 +348,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/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/binary-tree/segment-tree.ts#L72)
+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)
 
 Create a sum segment tree.