data-structure-typed 2.5.1 → 2.5.3

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

@@ -6,7 +6,7 @@
 
 # Class: LinkedHashMap\<K, V, R\>
 
-Defined in: [data-structures/hash/hash-map.ts:795](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L795)
+Defined in: [data-structures/hash/hash-map.ts:920](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L920)
 
 Hash-based map that preserves insertion order via a doubly-linked list.
 
@@ -46,7 +46,7 @@ examples will be generated by unit test
 new LinkedHashMap<K, V, R>(entryOrRawElements?, options?): LinkedHashMap<K, V, R>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:805](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L805)
+Defined in: [data-structures/hash/hash-map.ts:930](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L930)
 
 Create a LinkedHashMap and optionally bulk-insert entries.
 
@@ -90,7 +90,7 @@ IterableEntryBase<K, V>.constructor
 get first(): [K, V] | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:897](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L897)
+Defined in: [data-structures/hash/hash-map.ts:1020](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1020)
 
 Get the first [key, value] pair.
 
@@ -114,7 +114,7 @@ First entry or undefined when empty.
 get head(): HashMapLinkedNode<K, V | undefined>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:859](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L859)
+Defined in: [data-structures/hash/hash-map.ts:984](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L984)
 
 Get the head node (first entry) sentinel link.
 
@@ -138,7 +138,7 @@ Head node or sentinel.
 get last(): [K, V] | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:907](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L907)
+Defined in: [data-structures/hash/hash-map.ts:1030](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1030)
 
 Get the last [key, value] pair.
 
@@ -162,7 +162,7 @@ Last entry or undefined when empty.
 get noObjMap(): Record<string, HashMapLinkedNode<K, V | undefined>>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:843](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L843)
+Defined in: [data-structures/hash/hash-map.ts:968](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L968)
 
 Get the internal record for non-object keys.
 
@@ -186,7 +186,7 @@ Record of hash→node.
 get objHashFn(): (key) => object;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:832](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L832)
+Defined in: [data-structures/hash/hash-map.ts:957](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L957)
 
 Get the hash function for object/weak keys.
 
@@ -210,7 +210,7 @@ Object-hash function.
 get size(): number;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:888](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L888)
+Defined in: [data-structures/hash/hash-map.ts:1011](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1011)
 
 Total number of entries.
 
@@ -238,7 +238,7 @@ Entry count.
 get tail(): HashMapLinkedNode<K, V | undefined>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:870](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L870)
+Defined in: [data-structures/hash/hash-map.ts:995](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L995)
 
 Get the tail node (last entry) sentinel link.
 
@@ -260,7 +260,7 @@ Tail node or sentinel.
 iterator: IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L22)
+Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L22)
 
 Default iterator yielding `[key, value]` entries.
 
@@ -268,7 +268,7 @@ Default iterator yielding `[key, value]` entries.
 
 ##### args
 
-...`any`[]
+...`unknown`[]
 
 #### Returns
 
@@ -292,7 +292,7 @@ Time O(n) to iterate, Space O(1)
 at(index): V | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1021](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L1021)
+Defined in: [data-structures/hash/hash-map.ts:1148](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1148)
 
 Get the value at a given index in insertion order.
 
@@ -322,7 +322,7 @@ Time O(N), Space O(1)
 begin(): Generator<(K | V | undefined)[], void, unknown>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:917](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L917)
+Defined in: [data-structures/hash/hash-map.ts:1040](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1040)
 
 Iterate from head → tail.
 
@@ -344,7 +344,7 @@ Time O(N), Space O(1)
 clear(): void;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1091](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L1091)
+Defined in: [data-structures/hash/hash-map.ts:1220](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1220)
 
 Remove all entries.
 
@@ -365,16 +365,16 @@ Time O(n) typical, Space O(1)
 ### clone()
 
 ```ts
-clone(): any;
+clone(): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1097](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L1097)
+Defined in: [data-structures/hash/hash-map.ts:1226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1226)
 
 Deep clone preserving the concrete subtype.
 
 #### Returns
 
-`any`
+`this`
 
 A new instance of the same concrete class (`this` type).
 
@@ -391,10 +391,10 @@ Time O(n) typical, Space O(n)
 ### deleteAt()
 
 ```ts
-deleteAt(index): boolean;
+deleteAt(index): [K, V | undefined] | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1076](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L1076)
+Defined in: [data-structures/hash/hash-map.ts:1203](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1203)
 
 Delete the entry at a given index.
 
@@ -408,9 +408,9 @@ Zero-based index.
 
 #### Returns
 
-`boolean`
+\[`K`, `V` \| `undefined`\] \| `undefined`
 
-True if removed.
+The removed entry [key, value], or undefined if the index is out of range.
 
 #### Remarks
 
@@ -424,7 +424,7 @@ Time O(N), Space O(1)
 deleteWhere(predicate): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1050](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L1050)
+Defined in: [data-structures/hash/hash-map.ts:1177](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1177)
 
 Delete the first entry that matches a predicate.
 
@@ -454,7 +454,7 @@ Time O(N), Space O(1)
 entries(): IterableIterator<[K, V | undefined]>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L31)
+Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L31)
 
 Iterate over `[key, value]` pairs (may yield `undefined` values).
 
@@ -480,7 +480,7 @@ Time O(n), Space O(1)
 every(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:66](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L66)
+Defined in: [data-structures/base/iterable-entry-base.ts:66](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L66)
 
 Test whether all entries satisfy the predicate.
 
@@ -494,7 +494,7 @@ Test whether all entries satisfy the predicate.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -517,10 +517,10 @@ Time O(n), Space O(1)
 ### filter()
 
 ```ts
-filter(predicate, thisArg?): any;
+filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1102](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L1102)
+Defined in: [data-structures/hash/hash-map.ts:1231](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1231)
 
 Filter entries and return the same-species structure.
 
@@ -532,11 +532,11 @@ Filter entries and return the same-species structure.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 #### Returns
 
-`any`
+`this`
 
 A new instance of the same concrete class (`this` type).
 
@@ -556,7 +556,7 @@ Time O(n), Space O(n)
 find(callbackfn, thisArg?): [K, V] | undefined;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L114)
+Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L114)
 
 Find the first entry that matches a predicate.
 
@@ -570,7 +570,7 @@ Find the first entry that matches a predicate.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -596,7 +596,7 @@ Time O(n), Space O(1)
 forEach(callbackfn, thisArg?): void;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L99)
+Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L99)
 
 Visit each entry, left-to-right.
 
@@ -610,7 +610,7 @@ Visit each entry, left-to-right.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -634,7 +634,7 @@ Time O(n), Space O(1)
 get(key): V | undefined;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1004](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L1004)
+Defined in: [data-structures/hash/hash-map.ts:1131](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1131)
 
 Get the value under a key.
 
@@ -668,7 +668,7 @@ Time O(n) generic, Space O(1)
 has(key): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:995](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L995)
+Defined in: [data-structures/hash/hash-map.ts:1122](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1122)
 
 Whether the given key exists.
 
@@ -702,7 +702,7 @@ Time O(n) generic, Space O(1)
 hasValue(value): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L143)
+Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L143)
 
 Whether there exists an entry with the given value.
 
@@ -736,7 +736,7 @@ Time O(n), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1083](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L1083)
+Defined in: [data-structures/hash/hash-map.ts:1212](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1212)
 
 Whether there are no entries.
 
@@ -762,7 +762,7 @@ Time O(1) typical, Space O(1)
 keys(): IterableIterator<K>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L42)
+Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L42)
 
 Iterate over keys only.
 
@@ -785,10 +785,10 @@ Time O(n), Space O(1)
 ### map()
 
 ```ts
-map<MK, MV>(callback, thisArg?): any;
+map<MK, MV>(callback, thisArg?): LinkedHashMap<MK, MV>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1121](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L1121)
+Defined in: [data-structures/hash/hash-map.ts:1250](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1250)
 
 Map each entry to a new [key, value] pair and preserve order.
 
@@ -812,13 +812,13 @@ Mapping function (key, value, index, map) → [newKey, newValue].
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Value for `this` inside the callback.
 
 #### Returns
 
-`any`
+`LinkedHashMap`\<`MK`, `MV`\>
 
 A new map of the same class with transformed entries.
 
@@ -838,7 +838,7 @@ Time O(N), Space O(N)
 print(): void;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:203](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L203)
+Defined in: [data-structures/base/iterable-entry-base.ts:203](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L203)
 
 Print a human-friendly representation to the console.
 
@@ -862,7 +862,7 @@ Time O(n), Space O(n)
 reduce<U>(callbackfn, initialValue): U;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L171)
+Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L171)
 
 Reduce entries into a single accumulator.
 
@@ -908,7 +908,7 @@ Time O(n), Space O(1)
 reverseBegin(): Generator<(K | V | undefined)[], void, unknown>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:930](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L930)
+Defined in: [data-structures/hash/hash-map.ts:1053](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1053)
 
 Iterate from tail → head.
 
@@ -927,10 +927,10 @@ Time O(N), Space O(1)
 ### set()
 
 ```ts
-set(key, value?): boolean;
+set(key, value?): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:945](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L945)
+Defined in: [data-structures/hash/hash-map.ts:1068](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1068)
 
 Insert or replace a single entry; preserves insertion order.
 
@@ -950,9 +950,9 @@ Value.
 
 #### Returns
 
-`boolean`
+`this`
 
-True when the operation succeeds.
+This map (for chaining).
 
 #### Remarks
 
@@ -966,7 +966,7 @@ Time O(1), Space O(1)
 some(predicate, thisArg?): boolean;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L83)
+Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L83)
 
 Test whether any entry satisfies the predicate.
 
@@ -980,7 +980,7 @@ Test whether any entry satisfies the predicate.
 
 ##### thisArg?
 
-`any`
+`unknown`
 
 Optional `this` for callback.
 
@@ -1006,7 +1006,7 @@ Time O(n), Space O(1)
 toArray(): [K, V][];
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L186)
+Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L186)
 
 Converts data structure to `[key, value]` pairs.
 
@@ -1032,7 +1032,7 @@ Time O(n), Space O(n)
 toVisual(): string | [K, V][];
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L195)
+Defined in: [data-structures/base/iterable-entry-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L195)
 
 Visualize the iterable as an array of `[key, value]` pairs (or a custom string).
 
@@ -1058,7 +1058,7 @@ Time O(n), Space O(n)
 values(): IterableIterator<V>;
 ```
 
-Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L53)
+Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-entry-base.ts#L53)
 
 Iterate over values only.
 
@@ -1087,7 +1087,7 @@ Time O(n), Space O(1)
 protected _getIterator(): IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1132](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/hash/hash-map.ts#L1132)
+Defined in: [data-structures/hash/hash-map.ts:1261](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1261)
 
 Underlying iterator for the default iteration protocol.
 

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

@@ -6,7 +6,7 @@
 
 # Class: LinkedListNode\<E\>
 
-Defined in: [data-structures/base/linear-base.ts:9](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L9)
+Defined in: [data-structures/base/linear-base.ts:9](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L9)
 
 Singly-linked list node.
 
@@ -35,7 +35,7 @@ Element type.
 new LinkedListNode<E>(value): LinkedListNode<E>;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:15](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L15)
+Defined in: [data-structures/base/linear-base.ts:15](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L15)
 
 Initialize a node.
 
@@ -65,7 +65,7 @@ Time O(1), Space O(1)
 get next(): LinkedListNode<E> | undefined;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:47](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L47)
+Defined in: [data-structures/base/linear-base.ts:47](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L47)
 
 Next node getter.
 
@@ -85,7 +85,7 @@ Next node or `undefined`.
 set next(value): void;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:56](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L56)
+Defined in: [data-structures/base/linear-base.ts:56](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L56)
 
 Next node setter.
 
@@ -115,7 +115,7 @@ Next node or `undefined`.
 get value(): E;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:27](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L27)
+Defined in: [data-structures/base/linear-base.ts:27](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L27)
 
 Element payload getter.
 
@@ -135,7 +135,7 @@ Element value.
 set value(value): void;
 ```
 
-Defined in: [data-structures/base/linear-base.ts:36](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/linear-base.ts#L36)
+Defined in: [data-structures/base/linear-base.ts:36](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/linear-base.ts#L36)
 
 Element payload setter.