data-structure-typed 2.5.1 → 2.5.2
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +3 -1
- package/README.md +75 -17
- package/dist/cjs/binary-tree.cjs +2723 -139
- package/dist/cjs/graph.cjs +192 -6
- package/dist/cjs/hash.cjs +63 -15
- package/dist/cjs/heap.cjs +93 -31
- package/dist/cjs/index.cjs +3514 -379
- package/dist/cjs/linked-list.cjs +237 -31
- package/dist/cjs/matrix.cjs +47 -9
- package/dist/cjs/priority-queue.cjs +92 -30
- package/dist/cjs/queue.cjs +176 -2
- package/dist/cjs/stack.cjs +48 -2
- package/dist/cjs/trie.cjs +78 -28
- package/dist/cjs-legacy/binary-tree.cjs +2725 -136
- package/dist/cjs-legacy/graph.cjs +192 -6
- package/dist/cjs-legacy/hash.cjs +63 -15
- package/dist/cjs-legacy/heap.cjs +93 -31
- package/dist/cjs-legacy/index.cjs +3389 -249
- package/dist/cjs-legacy/linked-list.cjs +237 -31
- package/dist/cjs-legacy/matrix.cjs +47 -9
- package/dist/cjs-legacy/priority-queue.cjs +92 -30
- package/dist/cjs-legacy/queue.cjs +176 -2
- package/dist/cjs-legacy/stack.cjs +48 -2
- package/dist/cjs-legacy/trie.cjs +78 -28
- package/dist/esm/binary-tree.mjs +2723 -139
- package/dist/esm/graph.mjs +192 -6
- package/dist/esm/hash.mjs +63 -15
- package/dist/esm/heap.mjs +93 -31
- package/dist/esm/index.mjs +3514 -380
- package/dist/esm/linked-list.mjs +237 -31
- package/dist/esm/matrix.mjs +47 -9
- package/dist/esm/priority-queue.mjs +92 -30
- package/dist/esm/queue.mjs +176 -2
- package/dist/esm/stack.mjs +48 -2
- package/dist/esm/trie.mjs +78 -28
- package/dist/esm-legacy/binary-tree.mjs +2725 -136
- package/dist/esm-legacy/graph.mjs +192 -6
- package/dist/esm-legacy/hash.mjs +63 -15
- package/dist/esm-legacy/heap.mjs +93 -31
- package/dist/esm-legacy/index.mjs +3389 -250
- package/dist/esm-legacy/linked-list.mjs +237 -31
- package/dist/esm-legacy/matrix.mjs +47 -9
- package/dist/esm-legacy/priority-queue.mjs +92 -30
- package/dist/esm-legacy/queue.mjs +176 -2
- package/dist/esm-legacy/stack.mjs +48 -2
- package/dist/esm-legacy/trie.mjs +78 -28
- package/dist/types/common/error.d.ts +9 -0
- package/dist/types/common/index.d.ts +1 -1
- package/dist/types/data-structures/binary-tree/avl-tree.d.ts +48 -0
- package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts +56 -0
- package/dist/types/data-structures/binary-tree/binary-tree.d.ts +102 -2
- package/dist/types/data-structures/binary-tree/bst.d.ts +195 -0
- package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +76 -0
- package/dist/types/data-structures/binary-tree/segment-tree.d.ts +24 -0
- package/dist/types/data-structures/binary-tree/tree-map.d.ts +528 -0
- package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +531 -6
- package/dist/types/data-structures/binary-tree/tree-multi-set.d.ts +435 -6
- package/dist/types/data-structures/binary-tree/tree-set.d.ts +505 -0
- package/dist/types/data-structures/graph/directed-graph.d.ts +40 -0
- package/dist/types/data-structures/graph/undirected-graph.d.ts +36 -0
- package/dist/types/data-structures/hash/hash-map.d.ts +44 -0
- package/dist/types/data-structures/heap/heap.d.ts +56 -0
- package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts +68 -0
- package/dist/types/data-structures/linked-list/singly-linked-list.d.ts +60 -0
- package/dist/types/data-structures/linked-list/skip-linked-list.d.ts +72 -0
- package/dist/types/data-structures/matrix/matrix.d.ts +32 -0
- package/dist/types/data-structures/queue/deque.d.ts +60 -0
- package/dist/types/data-structures/queue/queue.d.ts +48 -0
- package/dist/types/data-structures/stack/stack.d.ts +40 -0
- package/dist/types/data-structures/trie/trie.d.ts +48 -0
- package/dist/types/types/data-structures/binary-tree/bst.d.ts +1 -0
- package/dist/types/types/data-structures/binary-tree/tree-map.d.ts +5 -0
- package/dist/types/types/data-structures/binary-tree/tree-multi-set.d.ts +4 -0
- package/dist/types/types/data-structures/binary-tree/tree-set.d.ts +4 -0
- package/dist/umd/data-structure-typed.js +3404 -265
- package/dist/umd/data-structure-typed.min.js +5 -5
- package/docs-site-docusaurus/docs/api/classes/AVLTree.md +650 -136
- package/docs-site-docusaurus/docs/api/classes/AVLTreeNode.md +11 -11
- package/docs-site-docusaurus/docs/api/classes/AbstractGraph.md +71 -71
- package/docs-site-docusaurus/docs/api/classes/BST.md +591 -129
- package/docs-site-docusaurus/docs/api/classes/BSTNode.md +13 -13
- package/docs-site-docusaurus/docs/api/classes/BinaryIndexedTree.md +15 -15
- package/docs-site-docusaurus/docs/api/classes/BinaryTree.md +107 -107
- package/docs-site-docusaurus/docs/api/classes/BinaryTreeNode.md +13 -13
- package/docs-site-docusaurus/docs/api/classes/Deque.md +82 -82
- package/docs-site-docusaurus/docs/api/classes/DirectedGraph.md +82 -82
- package/docs-site-docusaurus/docs/api/classes/DoublyLinkedList.md +74 -74
- package/docs-site-docusaurus/docs/api/classes/DoublyLinkedListNode.md +8 -8
- package/docs-site-docusaurus/docs/api/classes/FibonacciHeap.md +9 -9
- package/docs-site-docusaurus/docs/api/classes/FibonacciHeapNode.md +1 -1
- package/docs-site-docusaurus/docs/api/classes/HashMap.md +47 -47
- package/docs-site-docusaurus/docs/api/classes/Heap.md +45 -45
- package/docs-site-docusaurus/docs/api/classes/IterableElementBase.md +25 -25
- package/docs-site-docusaurus/docs/api/classes/IterableEntryBase.md +33 -33
- package/docs-site-docusaurus/docs/api/classes/LinearBase.md +50 -50
- package/docs-site-docusaurus/docs/api/classes/LinearLinkedBase.md +55 -55
- package/docs-site-docusaurus/docs/api/classes/LinkedHashMap.md +49 -49
- package/docs-site-docusaurus/docs/api/classes/LinkedListNode.md +6 -6
- package/docs-site-docusaurus/docs/api/classes/LinkedListQueue.md +78 -78
- package/docs-site-docusaurus/docs/api/classes/MapGraph.md +82 -82
- package/docs-site-docusaurus/docs/api/classes/Matrix.md +31 -31
- package/docs-site-docusaurus/docs/api/classes/MaxHeap.md +45 -45
- package/docs-site-docusaurus/docs/api/classes/MaxPriorityQueue.md +45 -45
- package/docs-site-docusaurus/docs/api/classes/MinHeap.md +45 -45
- package/docs-site-docusaurus/docs/api/classes/MinPriorityQueue.md +45 -45
- package/docs-site-docusaurus/docs/api/classes/Navigator.md +5 -5
- package/docs-site-docusaurus/docs/api/classes/PriorityQueue.md +44 -44
- package/docs-site-docusaurus/docs/api/classes/Queue.md +60 -60
- package/docs-site-docusaurus/docs/api/classes/RedBlackTree.md +660 -146
- package/docs-site-docusaurus/docs/api/classes/SegmentTree.md +10 -10
- package/docs-site-docusaurus/docs/api/classes/SinglyLinkedList.md +78 -78
- package/docs-site-docusaurus/docs/api/classes/SinglyLinkedListNode.md +6 -6
- package/docs-site-docusaurus/docs/api/classes/SkipList.md +44 -44
- package/docs-site-docusaurus/docs/api/classes/Stack.md +39 -39
- package/docs-site-docusaurus/docs/api/classes/TreeMap.md +165 -33
- package/docs-site-docusaurus/docs/api/classes/TreeMultiMap.md +162 -46
- package/docs-site-docusaurus/docs/api/classes/TreeSet.md +161 -32
- package/docs-site-docusaurus/docs/api/classes/Trie.md +47 -47
- package/docs-site-docusaurus/docs/api/classes/TrieNode.md +8 -8
- package/docs-site-docusaurus/docs/api/classes/UndirectedGraph.md +81 -81
- package/docs-site-docusaurus/docs/guide/architecture.md +2 -0
- package/docs-site-docusaurus/docs/guide/concepts.md +32 -1
- package/docs-site-docusaurus/docs/guide/faq.md +180 -0
- package/docs-site-docusaurus/docs/guide/guides.md +40 -54
- package/docs-site-docusaurus/docs/guide/installation.md +2 -0
- package/docs-site-docusaurus/docs/guide/integrations.md +2 -0
- package/docs-site-docusaurus/docs/guide/overview.md +7 -0
- package/docs-site-docusaurus/docs/guide/performance.md +2 -0
- package/docs-site-docusaurus/docs/guide/quick-start.md +31 -0
- package/docs-site-docusaurus/docs/guide/use-cases/_category_.json +6 -0
- package/docs-site-docusaurus/docs/guide/use-cases/array-sort-alternative.md +158 -0
- package/docs-site-docusaurus/docs/guide/use-cases/heap-vs-sorting.md +92 -0
- package/docs-site-docusaurus/docs/guide/use-cases/map-vs-treemap.md +151 -0
- package/docs-site-docusaurus/docs/guide/use-cases/priority-queue-typescript.md +113 -0
- package/docs-site-docusaurus/docs/guide/use-cases/treemap-javascript.md +151 -0
- package/docs-site-docusaurus/docusaurus.config.ts +1 -1
- package/docs-site-docusaurus/src/pages/index.tsx +51 -2
- package/docs-site-docusaurus/static/llms.txt +37 -0
- package/llms.txt +37 -0
- package/package.json +64 -56
- package/src/common/error.ts +19 -1
- package/src/common/index.ts +1 -1
- package/src/data-structures/base/iterable-element-base.ts +3 -2
- package/src/data-structures/binary-tree/avl-tree.ts +47 -0
- package/src/data-structures/binary-tree/binary-indexed-tree.ts +46 -4
- package/src/data-structures/binary-tree/binary-tree.ts +79 -4
- package/src/data-structures/binary-tree/bst.ts +441 -6
- package/src/data-structures/binary-tree/red-black-tree.ts +73 -0
- package/src/data-structures/binary-tree/segment-tree.ts +18 -0
- package/src/data-structures/binary-tree/tree-map.ts +434 -9
- package/src/data-structures/binary-tree/tree-multi-map.ts +426 -5
- package/src/data-structures/binary-tree/tree-multi-set.ts +350 -6
- package/src/data-structures/binary-tree/tree-set.ts +410 -8
- package/src/data-structures/graph/abstract-graph.ts +2 -2
- package/src/data-structures/graph/directed-graph.ts +30 -0
- package/src/data-structures/graph/undirected-graph.ts +27 -0
- package/src/data-structures/hash/hash-map.ts +35 -4
- package/src/data-structures/heap/heap.ts +46 -4
- package/src/data-structures/heap/max-heap.ts +2 -2
- package/src/data-structures/linked-list/doubly-linked-list.ts +51 -0
- package/src/data-structures/linked-list/singly-linked-list.ts +45 -0
- package/src/data-structures/linked-list/skip-linked-list.ts +59 -5
- package/src/data-structures/matrix/matrix.ts +33 -9
- package/src/data-structures/priority-queue/max-priority-queue.ts +2 -2
- package/src/data-structures/queue/deque.ts +45 -0
- package/src/data-structures/queue/queue.ts +36 -0
- package/src/data-structures/stack/stack.ts +30 -0
- package/src/data-structures/trie/trie.ts +38 -2
- package/src/types/data-structures/binary-tree/bst.ts +1 -0
- package/src/types/data-structures/binary-tree/tree-map.ts +6 -0
- package/src/types/data-structures/binary-tree/tree-multi-set.ts +5 -0
- package/src/types/data-structures/binary-tree/tree-set.ts +5 -0
|
@@ -6,7 +6,7 @@
|
|
|
6
6
|
|
|
7
7
|
# Abstract Class: IterableEntryBase\<K, V\>
|
|
8
8
|
|
|
9
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:9](https://github.com/zrwusa/data-structure-typed/blob/
|
|
9
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:9](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L9)
|
|
10
10
|
|
|
11
11
|
Iterable view over key-value entries.
|
|
12
12
|
|
|
@@ -46,7 +46,7 @@ Value type.
|
|
|
46
46
|
get abstract size(): number;
|
|
47
47
|
```
|
|
48
48
|
|
|
49
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:15](https://github.com/zrwusa/data-structure-typed/blob/
|
|
49
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:15](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L15)
|
|
50
50
|
|
|
51
51
|
Total number of entries.
|
|
52
52
|
|
|
@@ -68,7 +68,7 @@ Entry count.
|
|
|
68
68
|
iterator: IterableIterator<[K, V]>;
|
|
69
69
|
```
|
|
70
70
|
|
|
71
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/
|
|
71
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:22](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L22)
|
|
72
72
|
|
|
73
73
|
Default iterator yielding `[key, value]` entries.
|
|
74
74
|
|
|
@@ -76,7 +76,7 @@ Default iterator yielding `[key, value]` entries.
|
|
|
76
76
|
|
|
77
77
|
##### args
|
|
78
78
|
|
|
79
|
-
...`
|
|
79
|
+
...`unknown`[]
|
|
80
80
|
|
|
81
81
|
#### Returns
|
|
82
82
|
|
|
@@ -96,7 +96,7 @@ Time O(n) to iterate, Space O(1)
|
|
|
96
96
|
abstract clear(): void;
|
|
97
97
|
```
|
|
98
98
|
|
|
99
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:218](https://github.com/zrwusa/data-structure-typed/blob/
|
|
99
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:218](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L218)
|
|
100
100
|
|
|
101
101
|
Remove all entries.
|
|
102
102
|
|
|
@@ -116,7 +116,7 @@ Time O(n) typical, Space O(1)
|
|
|
116
116
|
abstract clone(): this;
|
|
117
117
|
```
|
|
118
118
|
|
|
119
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:225](https://github.com/zrwusa/data-structure-typed/blob/
|
|
119
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:225](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L225)
|
|
120
120
|
|
|
121
121
|
Deep clone preserving the concrete subtype.
|
|
122
122
|
|
|
@@ -138,7 +138,7 @@ Time O(n) typical, Space O(n)
|
|
|
138
138
|
entries(): IterableIterator<[K, V | undefined]>;
|
|
139
139
|
```
|
|
140
140
|
|
|
141
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/
|
|
141
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:31](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L31)
|
|
142
142
|
|
|
143
143
|
Iterate over `[key, value]` pairs (may yield `undefined` values).
|
|
144
144
|
|
|
@@ -160,7 +160,7 @@ Time O(n), Space O(1)
|
|
|
160
160
|
every(predicate, thisArg?): boolean;
|
|
161
161
|
```
|
|
162
162
|
|
|
163
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:66](https://github.com/zrwusa/data-structure-typed/blob/
|
|
163
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:66](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L66)
|
|
164
164
|
|
|
165
165
|
Test whether all entries satisfy the predicate.
|
|
166
166
|
|
|
@@ -174,7 +174,7 @@ Test whether all entries satisfy the predicate.
|
|
|
174
174
|
|
|
175
175
|
##### thisArg?
|
|
176
176
|
|
|
177
|
-
`
|
|
177
|
+
`unknown`
|
|
178
178
|
|
|
179
179
|
Optional `this` for callback.
|
|
180
180
|
|
|
@@ -196,7 +196,7 @@ Time O(n), Space O(1)
|
|
|
196
196
|
abstract filter(...args): this;
|
|
197
197
|
```
|
|
198
198
|
|
|
199
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:238](https://github.com/zrwusa/data-structure-typed/blob/
|
|
199
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:238](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L238)
|
|
200
200
|
|
|
201
201
|
Filter entries and return the same-species structure.
|
|
202
202
|
|
|
@@ -204,7 +204,7 @@ Filter entries and return the same-species structure.
|
|
|
204
204
|
|
|
205
205
|
##### args
|
|
206
206
|
|
|
207
|
-
...`
|
|
207
|
+
...`unknown`[]
|
|
208
208
|
|
|
209
209
|
#### Returns
|
|
210
210
|
|
|
@@ -224,7 +224,7 @@ Time O(n), Space O(n)
|
|
|
224
224
|
find(callbackfn, thisArg?): [K, V] | undefined;
|
|
225
225
|
```
|
|
226
226
|
|
|
227
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/
|
|
227
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:114](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L114)
|
|
228
228
|
|
|
229
229
|
Find the first entry that matches a predicate.
|
|
230
230
|
|
|
@@ -238,7 +238,7 @@ Find the first entry that matches a predicate.
|
|
|
238
238
|
|
|
239
239
|
##### thisArg?
|
|
240
240
|
|
|
241
|
-
`
|
|
241
|
+
`unknown`
|
|
242
242
|
|
|
243
243
|
Optional `this` for callback.
|
|
244
244
|
|
|
@@ -260,7 +260,7 @@ Time O(n), Space O(1)
|
|
|
260
260
|
forEach(callbackfn, thisArg?): void;
|
|
261
261
|
```
|
|
262
262
|
|
|
263
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/
|
|
263
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:99](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L99)
|
|
264
264
|
|
|
265
265
|
Visit each entry, left-to-right.
|
|
266
266
|
|
|
@@ -274,7 +274,7 @@ Visit each entry, left-to-right.
|
|
|
274
274
|
|
|
275
275
|
##### thisArg?
|
|
276
276
|
|
|
277
|
-
`
|
|
277
|
+
`unknown`
|
|
278
278
|
|
|
279
279
|
Optional `this` for callback.
|
|
280
280
|
|
|
@@ -294,7 +294,7 @@ Time O(n), Space O(1)
|
|
|
294
294
|
get(key): V | undefined;
|
|
295
295
|
```
|
|
296
296
|
|
|
297
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:156](https://github.com/zrwusa/data-structure-typed/blob/
|
|
297
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:156](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L156)
|
|
298
298
|
|
|
299
299
|
Get the value under a key.
|
|
300
300
|
|
|
@@ -324,7 +324,7 @@ Time O(n) generic, Space O(1)
|
|
|
324
324
|
has(key): boolean;
|
|
325
325
|
```
|
|
326
326
|
|
|
327
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:129](https://github.com/zrwusa/data-structure-typed/blob/
|
|
327
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:129](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L129)
|
|
328
328
|
|
|
329
329
|
Whether the given key exists.
|
|
330
330
|
|
|
@@ -354,7 +354,7 @@ Time O(n) generic, Space O(1)
|
|
|
354
354
|
hasValue(value): boolean;
|
|
355
355
|
```
|
|
356
356
|
|
|
357
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/
|
|
357
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:143](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L143)
|
|
358
358
|
|
|
359
359
|
Whether there exists an entry with the given value.
|
|
360
360
|
|
|
@@ -384,7 +384,7 @@ Time O(n), Space O(1)
|
|
|
384
384
|
abstract isEmpty(): boolean;
|
|
385
385
|
```
|
|
386
386
|
|
|
387
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:212](https://github.com/zrwusa/data-structure-typed/blob/
|
|
387
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:212](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L212)
|
|
388
388
|
|
|
389
389
|
Whether there are no entries.
|
|
390
390
|
|
|
@@ -406,7 +406,7 @@ Time O(1) typical, Space O(1)
|
|
|
406
406
|
keys(): IterableIterator<K>;
|
|
407
407
|
```
|
|
408
408
|
|
|
409
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/
|
|
409
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:42](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L42)
|
|
410
410
|
|
|
411
411
|
Iterate over keys only.
|
|
412
412
|
|
|
@@ -425,10 +425,10 @@ Time O(n), Space O(1)
|
|
|
425
425
|
### map()
|
|
426
426
|
|
|
427
427
|
```ts
|
|
428
|
-
abstract map(...args):
|
|
428
|
+
abstract map(...args): unknown;
|
|
429
429
|
```
|
|
430
430
|
|
|
431
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:231](https://github.com/zrwusa/data-structure-typed/blob/
|
|
431
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:231](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L231)
|
|
432
432
|
|
|
433
433
|
Map entries using an implementation-specific strategy.
|
|
434
434
|
|
|
@@ -436,11 +436,11 @@ Map entries using an implementation-specific strategy.
|
|
|
436
436
|
|
|
437
437
|
##### args
|
|
438
438
|
|
|
439
|
-
...`
|
|
439
|
+
...`unknown`[]
|
|
440
440
|
|
|
441
441
|
#### Returns
|
|
442
442
|
|
|
443
|
-
`
|
|
443
|
+
`unknown`
|
|
444
444
|
|
|
445
445
|
#### Remarks
|
|
446
446
|
|
|
@@ -454,7 +454,7 @@ Time O(n), Space O(n)
|
|
|
454
454
|
print(): void;
|
|
455
455
|
```
|
|
456
456
|
|
|
457
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:203](https://github.com/zrwusa/data-structure-typed/blob/
|
|
457
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:203](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L203)
|
|
458
458
|
|
|
459
459
|
Print a human-friendly representation to the console.
|
|
460
460
|
|
|
@@ -474,7 +474,7 @@ Time O(n), Space O(n)
|
|
|
474
474
|
reduce<U>(callbackfn, initialValue): U;
|
|
475
475
|
```
|
|
476
476
|
|
|
477
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/
|
|
477
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:171](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L171)
|
|
478
478
|
|
|
479
479
|
Reduce entries into a single accumulator.
|
|
480
480
|
|
|
@@ -516,7 +516,7 @@ Time O(n), Space O(1)
|
|
|
516
516
|
some(predicate, thisArg?): boolean;
|
|
517
517
|
```
|
|
518
518
|
|
|
519
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/
|
|
519
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:83](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L83)
|
|
520
520
|
|
|
521
521
|
Test whether any entry satisfies the predicate.
|
|
522
522
|
|
|
@@ -530,7 +530,7 @@ Test whether any entry satisfies the predicate.
|
|
|
530
530
|
|
|
531
531
|
##### thisArg?
|
|
532
532
|
|
|
533
|
-
`
|
|
533
|
+
`unknown`
|
|
534
534
|
|
|
535
535
|
Optional `this` for callback.
|
|
536
536
|
|
|
@@ -552,7 +552,7 @@ Time O(n), Space O(1)
|
|
|
552
552
|
toArray(): [K, V][];
|
|
553
553
|
```
|
|
554
554
|
|
|
555
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/
|
|
555
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:186](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L186)
|
|
556
556
|
|
|
557
557
|
Converts data structure to `[key, value]` pairs.
|
|
558
558
|
|
|
@@ -574,7 +574,7 @@ Time O(n), Space O(n)
|
|
|
574
574
|
toVisual(): string | [K, V][];
|
|
575
575
|
```
|
|
576
576
|
|
|
577
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/
|
|
577
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:195](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L195)
|
|
578
578
|
|
|
579
579
|
Visualize the iterable as an array of `[key, value]` pairs (or a custom string).
|
|
580
580
|
|
|
@@ -596,7 +596,7 @@ Time O(n), Space O(n)
|
|
|
596
596
|
values(): IterableIterator<V>;
|
|
597
597
|
```
|
|
598
598
|
|
|
599
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/
|
|
599
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:53](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L53)
|
|
600
600
|
|
|
601
601
|
Iterate over values only.
|
|
602
602
|
|
|
@@ -621,7 +621,7 @@ Time O(n), Space O(1)
|
|
|
621
621
|
abstract protected _getIterator(...args): IterableIterator<[K, V]>;
|
|
622
622
|
```
|
|
623
623
|
|
|
624
|
-
Defined in: [data-structures/base/iterable-entry-base.ts:245](https://github.com/zrwusa/data-structure-typed/blob/
|
|
624
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:245](https://github.com/zrwusa/data-structure-typed/blob/8292cb978daf85ebe846186c7c7572aece04fb7b/src/data-structures/base/iterable-entry-base.ts#L245)
|
|
625
625
|
|
|
626
626
|
Underlying iterator for the default iteration protocol.
|
|
627
627
|
|
|
@@ -629,7 +629,7 @@ Underlying iterator for the default iteration protocol.
|
|
|
629
629
|
|
|
630
630
|
##### args
|
|
631
631
|
|
|
632
|
-
...`
|
|
632
|
+
...`unknown`[]
|
|
633
633
|
|
|
634
634
|
#### Returns
|
|
635
635
|
|