data-structure-typed 2.6.0 → 2.6.2

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:920](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L920)
+Defined in: [data-structures/hash/hash-map.ts:523](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L523)
 
 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:930](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L930)
+Defined in: [data-structures/hash/hash-map.ts:533](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L533)
 
 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:1020](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1020)
+Defined in: [data-structures/hash/hash-map.ts:615](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L615)
 
 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:984](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L984)
+Defined in: [data-structures/hash/hash-map.ts:585](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L585)
 
 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:1030](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1030)
+Defined in: [data-structures/hash/hash-map.ts:625](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L625)
 
 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:968](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L968)
+Defined in: [data-structures/hash/hash-map.ts:569](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L569)
 
 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:957](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L957)
+Defined in: [data-structures/hash/hash-map.ts:558](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L558)
 
 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:1011](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1011)
+Defined in: [data-structures/hash/hash-map.ts:606](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L606)
 
 Total number of entries.
 
@@ -238,7 +238,7 @@ Entry count.
 get tail(): HashMapLinkedNode<K, V | undefined>;
 ```
 
-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)
+Defined in: [data-structures/hash/hash-map.ts:596](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L596)
 
 Get the tail node (last entry) sentinel link.
 
@@ -292,7 +292,7 @@ Time O(n) to iterate, Space O(1)
 at(index): V | undefined;
 ```
 
-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)
+Defined in: [data-structures/hash/hash-map.ts:740](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L740)
 
 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:1040](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1040)
+Defined in: [data-structures/hash/hash-map.ts:635](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L635)
 
 Iterate from head → tail.
 
@@ -344,7 +344,7 @@ Time O(N), Space O(1)
 clear(): void;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1221](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1221)
+Defined in: [data-structures/hash/hash-map.ts:813](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L813)
 
 Remove all entries.
 
@@ -368,7 +368,7 @@ Time O(n) typical, Space O(1)
 clone(): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1227)
+Defined in: [data-structures/hash/hash-map.ts:819](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L819)
 
 Deep clone preserving the concrete subtype.
 
@@ -394,7 +394,7 @@ Time O(n) typical, Space O(n)
 deleteAt(index): [K, V | undefined];
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1204](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1204)
+Defined in: [data-structures/hash/hash-map.ts:796](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L796)
 
 Delete the entry at a given index.
 
@@ -428,7 +428,7 @@ If index is out of bounds.
 deleteWhere(predicate): boolean;
 ```
 
-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)
+Defined in: [data-structures/hash/hash-map.ts:769](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L769)
 
 Delete the first entry that matches a predicate.
 
@@ -524,7 +524,7 @@ Time O(n), Space O(1)
 filter(predicate, thisArg?): this;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1232](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1232)
+Defined in: [data-structures/hash/hash-map.ts:824](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L824)
 
 Filter entries and return the same-species structure.
 
@@ -638,7 +638,7 @@ Time O(n), Space O(1)
 get(key): V | undefined;
 ```
 
-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)
+Defined in: [data-structures/hash/hash-map.ts:723](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L723)
 
 Get the value under a key.
 
@@ -672,7 +672,7 @@ Time O(n) generic, Space O(1)
 has(key): boolean;
 ```
 
-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)
+Defined in: [data-structures/hash/hash-map.ts:714](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L714)
 
 Whether the given key exists.
 
@@ -740,7 +740,7 @@ Time O(n), Space O(1)
 isEmpty(): boolean;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1213](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1213)
+Defined in: [data-structures/hash/hash-map.ts:805](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L805)
 
 Whether there are no entries.
 
@@ -792,7 +792,7 @@ Time O(n), Space O(1)
 map<MK, MV>(callback, thisArg?): LinkedHashMap<MK, MV>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1251](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1251)
+Defined in: [data-structures/hash/hash-map.ts:843](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L843)
 
 Map each entry to a new [key, value] pair and preserve order.
 
@@ -912,7 +912,7 @@ Time O(n), Space O(1)
 reverseBegin(): Generator<(K | V | undefined)[], void, unknown>;
 ```
 
-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)
+Defined in: [data-structures/hash/hash-map.ts:648](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L648)
 
 Iterate from tail → head.
 
@@ -934,7 +934,7 @@ Time O(N), Space O(1)
 set(key, value?): this;
 ```
 
-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)
+Defined in: [data-structures/hash/hash-map.ts:663](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L663)
 
 Insert or replace a single entry; preserves insertion order.
 
@@ -1091,7 +1091,7 @@ Time O(n), Space O(1)
 protected _getIterator(): IterableIterator<[K, V]>;
 ```
 
-Defined in: [data-structures/hash/hash-map.ts:1262](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L1262)
+Defined in: [data-structures/hash/hash-map.ts:867](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/hash/hash-map.ts#L867)
 
 Underlying iterator for the default iteration protocol.