data-structure-typed 2.5.0 → 2.5.1
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/.vitepress/cache/deps_temp_51f5f1b0/chunk-7OIKW5WK.js +12984 -0
- package/.vitepress/cache/deps_temp_51f5f1b0/package.json +3 -0
- package/.vitepress/cache/deps_temp_51f5f1b0/vitepress___@vue_devtools-api.js +4505 -0
- package/.vitepress/cache/deps_temp_51f5f1b0/vitepress___@vueuse_core.js +9731 -0
- package/.vitepress/cache/deps_temp_51f5f1b0/vue.js +347 -0
- package/CHANGELOG.md +3 -1
- package/README.md +63 -26
- package/dist/cjs/binary-tree.cjs +23698 -0
- package/dist/cjs/graph.cjs +5236 -0
- package/dist/cjs/hash.cjs +1262 -0
- package/dist/cjs/heap.cjs +1540 -0
- package/dist/cjs/index.cjs +28244 -14795
- package/dist/cjs/linked-list.cjs +4370 -0
- package/dist/cjs/matrix.cjs +1042 -0
- package/dist/cjs/priority-queue.cjs +1314 -0
- package/dist/cjs/queue.cjs +4090 -0
- package/dist/cjs/stack.cjs +861 -0
- package/dist/cjs/trie.cjs +1173 -0
- package/dist/cjs-legacy/binary-tree.cjs +23730 -0
- package/dist/cjs-legacy/graph.cjs +5234 -0
- package/dist/cjs-legacy/hash.cjs +1262 -0
- package/dist/cjs-legacy/heap.cjs +1537 -0
- package/dist/cjs-legacy/index.cjs +28239 -14790
- package/dist/cjs-legacy/linked-list.cjs +4376 -0
- package/dist/cjs-legacy/matrix.cjs +1045 -0
- package/dist/cjs-legacy/priority-queue.cjs +1312 -0
- package/dist/cjs-legacy/queue.cjs +4088 -0
- package/dist/cjs-legacy/stack.cjs +861 -0
- package/dist/cjs-legacy/trie.cjs +1172 -0
- package/dist/esm/binary-tree.mjs +23683 -0
- package/dist/esm/graph.mjs +5223 -0
- package/dist/esm/hash.mjs +1259 -0
- package/dist/esm/heap.mjs +1534 -0
- package/dist/esm/index.mjs +28242 -14796
- package/dist/esm/linked-list.mjs +4363 -0
- package/dist/esm/matrix.mjs +1038 -0
- package/dist/esm/priority-queue.mjs +1310 -0
- package/dist/esm/queue.mjs +4086 -0
- package/dist/esm/stack.mjs +859 -0
- package/dist/esm/trie.mjs +1170 -0
- package/dist/esm-legacy/binary-tree.mjs +23715 -0
- package/dist/esm-legacy/graph.mjs +5221 -0
- package/dist/esm-legacy/hash.mjs +1259 -0
- package/dist/esm-legacy/heap.mjs +1531 -0
- package/dist/esm-legacy/index.mjs +28237 -14791
- package/dist/esm-legacy/linked-list.mjs +4369 -0
- package/dist/esm-legacy/matrix.mjs +1041 -0
- package/dist/esm-legacy/priority-queue.mjs +1308 -0
- package/dist/esm-legacy/queue.mjs +4084 -0
- package/dist/esm-legacy/stack.mjs +859 -0
- package/dist/esm-legacy/trie.mjs +1169 -0
- package/dist/types/data-structures/base/index.d.ts +1 -0
- package/dist/types/data-structures/base/iterable-entry-base.d.ts +8 -8
- package/dist/types/data-structures/base/linear-base.d.ts +3 -3
- package/dist/types/data-structures/binary-tree/avl-tree.d.ts +240 -0
- package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts +280 -0
- package/dist/types/data-structures/binary-tree/binary-tree.d.ts +502 -2
- package/dist/types/data-structures/binary-tree/bst.d.ts +481 -1
- package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +380 -0
- package/dist/types/data-structures/binary-tree/segment-tree.d.ts +120 -1
- package/dist/types/data-structures/binary-tree/tree-map.d.ts +2764 -384
- package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +2753 -353
- package/dist/types/data-structures/binary-tree/tree-multi-set.d.ts +2241 -321
- package/dist/types/data-structures/binary-tree/tree-set.d.ts +2554 -274
- package/dist/types/data-structures/graph/abstract-graph.d.ts +4 -4
- package/dist/types/data-structures/graph/directed-graph.d.ts +200 -0
- package/dist/types/data-structures/graph/undirected-graph.d.ts +180 -0
- package/dist/types/data-structures/hash/hash-map.d.ts +230 -10
- package/dist/types/data-structures/heap/heap.d.ts +280 -0
- package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts +343 -3
- package/dist/types/data-structures/linked-list/singly-linked-list.d.ts +303 -3
- package/dist/types/data-structures/linked-list/skip-linked-list.d.ts +362 -2
- package/dist/types/data-structures/matrix/matrix.d.ts +160 -0
- package/dist/types/data-structures/queue/deque.d.ts +304 -4
- package/dist/types/data-structures/queue/queue.d.ts +240 -0
- package/dist/types/data-structures/stack/stack.d.ts +200 -0
- package/dist/types/data-structures/trie/trie.d.ts +244 -4
- package/dist/types/interfaces/graph.d.ts +1 -1
- package/dist/types/types/common.d.ts +2 -2
- package/dist/types/types/data-structures/heap/heap.d.ts +1 -0
- package/dist/types/types/data-structures/priority-queue/priority-queue.d.ts +1 -0
- package/dist/types/types/utils/validate-type.d.ts +4 -4
- package/dist/umd/data-structure-typed.js +28022 -14573
- package/dist/umd/data-structure-typed.min.js +9 -3
- package/docs-site-docusaurus/README.md +41 -0
- package/docs-site-docusaurus/docs/api/README.md +52 -0
- package/docs-site-docusaurus/docs/api/classes/AVLTree.md +6130 -0
- package/docs-site-docusaurus/docs/api/classes/AVLTreeNode.md +282 -0
- package/docs-site-docusaurus/docs/api/classes/AbstractGraph.md +2266 -0
- package/docs-site-docusaurus/docs/api/classes/BST.md +5831 -0
- package/docs-site-docusaurus/docs/api/classes/BSTNode.md +333 -0
- package/docs-site-docusaurus/docs/api/classes/BinaryIndexedTree.md +455 -0
- package/docs-site-docusaurus/docs/api/classes/BinaryTree.md +4647 -0
- package/docs-site-docusaurus/docs/api/classes/BinaryTreeNode.md +331 -0
- package/docs-site-docusaurus/docs/api/classes/Deque.md +2767 -0
- package/docs-site-docusaurus/docs/api/classes/DirectedGraph.md +2999 -0
- package/docs-site-docusaurus/docs/api/classes/DoublyLinkedList.md +2685 -0
- package/docs-site-docusaurus/docs/api/classes/DoublyLinkedListNode.md +221 -0
- package/docs-site-docusaurus/docs/api/classes/FibonacciHeap.md +253 -0
- package/docs-site-docusaurus/docs/api/classes/FibonacciHeapNode.md +21 -0
- package/docs-site-docusaurus/docs/api/classes/HashMap.md +1333 -0
- package/docs-site-docusaurus/docs/api/classes/Heap.md +1881 -0
- package/docs-site-docusaurus/docs/api/classes/IterableElementBase.md +800 -0
- package/docs-site-docusaurus/docs/api/classes/IterableEntryBase.md +644 -0
- package/docs-site-docusaurus/docs/api/classes/LinearBase.md +1632 -0
- package/docs-site-docusaurus/docs/api/classes/LinearLinkedBase.md +1853 -0
- package/docs-site-docusaurus/docs/api/classes/LinkedHashMap.md +1108 -0
- package/docs-site-docusaurus/docs/api/classes/LinkedListNode.md +156 -0
- package/docs-site-docusaurus/docs/api/classes/LinkedListQueue.md +2824 -0
- package/docs-site-docusaurus/docs/api/classes/MapGraph.md +2929 -0
- package/docs-site-docusaurus/docs/api/classes/Matrix.md +1026 -0
- package/docs-site-docusaurus/docs/api/classes/MaxHeap.md +1866 -0
- package/docs-site-docusaurus/docs/api/classes/MaxPriorityQueue.md +1883 -0
- package/docs-site-docusaurus/docs/api/classes/MinHeap.md +1879 -0
- package/docs-site-docusaurus/docs/api/classes/MinPriorityQueue.md +1882 -0
- package/docs-site-docusaurus/docs/api/classes/Navigator.md +109 -0
- package/docs-site-docusaurus/docs/api/classes/PriorityQueue.md +1839 -0
- package/docs-site-docusaurus/docs/api/classes/Queue.md +2244 -0
- package/docs-site-docusaurus/docs/api/classes/RedBlackTree.md +6374 -0
- package/docs-site-docusaurus/docs/api/classes/SegmentTree.md +372 -0
- package/docs-site-docusaurus/docs/api/classes/SinglyLinkedList.md +2897 -0
- package/docs-site-docusaurus/docs/api/classes/SinglyLinkedListNode.md +169 -0
- package/docs-site-docusaurus/docs/api/classes/SkipList.md +1229 -0
- package/docs-site-docusaurus/docs/api/classes/Stack.md +1573 -0
- package/docs-site-docusaurus/docs/api/classes/TreeMap.md +1257 -0
- package/docs-site-docusaurus/docs/api/classes/TreeMultiMap.md +1475 -0
- package/docs-site-docusaurus/docs/api/classes/TreeSet.md +1117 -0
- package/docs-site-docusaurus/docs/api/classes/Trie.md +1708 -0
- package/docs-site-docusaurus/docs/api/classes/TrieNode.md +199 -0
- package/docs-site-docusaurus/docs/api/classes/UndirectedGraph.md +2979 -0
- package/docs-site-docusaurus/docs/guide/_category_.json +6 -0
- package/docs-site-docusaurus/docs/guide/architecture.md +613 -0
- package/docs-site-docusaurus/docs/guide/concepts.md +420 -0
- package/docs-site-docusaurus/docs/guide/guides.md +611 -0
- package/docs-site-docusaurus/docs/guide/installation.md +60 -0
- package/docs-site-docusaurus/docs/guide/integrations.md +823 -0
- package/docs-site-docusaurus/docs/guide/overview.md +638 -0
- package/docs-site-docusaurus/docs/guide/performance.md +833 -0
- package/docs-site-docusaurus/docs/guide/quick-start.md +73 -0
- package/docs-site-docusaurus/docusaurus.config.ts +159 -0
- package/docs-site-docusaurus/fix-mdx-generics.mjs +75 -0
- package/docs-site-docusaurus/package-lock.json +18667 -0
- package/docs-site-docusaurus/package.json +50 -0
- package/docs-site-docusaurus/prefix-class-to-methods.mjs +48 -0
- package/docs-site-docusaurus/sidebars.ts +23 -0
- package/docs-site-docusaurus/sort-protected.mjs +87 -0
- package/docs-site-docusaurus/src/css/custom.css +96 -0
- package/docs-site-docusaurus/src/pages/index.module.css +13 -0
- package/docs-site-docusaurus/src/pages/index.tsx +71 -0
- package/docs-site-docusaurus/src/pages/markdown-page.md +7 -0
- package/docs-site-docusaurus/src/theme/TOCItems/index.tsx +34 -0
- package/docs-site-docusaurus/static/.nojekyll +0 -0
- package/docs-site-docusaurus/static/img/docusaurus-social-card.jpg +0 -0
- package/docs-site-docusaurus/static/img/docusaurus.png +0 -0
- package/docs-site-docusaurus/static/img/favicon.ico +0 -0
- package/docs-site-docusaurus/static/img/favicon.png +0 -0
- package/docs-site-docusaurus/static/img/logo-180.png +0 -0
- package/docs-site-docusaurus/static/img/logo.jpg +0 -0
- package/docs-site-docusaurus/static/img/logo.png +0 -0
- package/docs-site-docusaurus/static/img/logo.svg +1 -0
- package/docs-site-docusaurus/static/img/og-image.png +0 -0
- package/docs-site-docusaurus/static/img/undraw_docusaurus_mountain.svg +171 -0
- package/docs-site-docusaurus/static/img/undraw_docusaurus_react.svg +170 -0
- package/docs-site-docusaurus/static/img/undraw_docusaurus_tree.svg +40 -0
- package/docs-site-docusaurus/static/robots.txt +4 -0
- package/docs-site-docusaurus/typedoc.json +23 -0
- package/package.json +106 -10
- package/src/data-structures/base/index.ts +1 -0
- package/src/data-structures/base/iterable-entry-base.ts +8 -8
- package/src/data-structures/base/linear-base.ts +3 -3
- package/src/data-structures/binary-tree/avl-tree.ts +240 -0
- package/src/data-structures/binary-tree/binary-indexed-tree.ts +281 -1
- package/src/data-structures/binary-tree/binary-tree.ts +502 -2
- package/src/data-structures/binary-tree/bst.ts +481 -1
- package/src/data-structures/binary-tree/red-black-tree.ts +380 -0
- package/src/data-structures/binary-tree/segment-tree.ts +121 -2
- package/src/data-structures/binary-tree/tree-map.ts +2862 -482
- package/src/data-structures/binary-tree/tree-multi-map.ts +2963 -563
- package/src/data-structures/binary-tree/tree-multi-set.ts +2399 -479
- package/src/data-structures/binary-tree/tree-set.ts +2685 -405
- package/src/data-structures/graph/abstract-graph.ts +4 -4
- package/src/data-structures/graph/directed-graph.ts +200 -0
- package/src/data-structures/graph/undirected-graph.ts +180 -0
- package/src/data-structures/hash/hash-map.ts +235 -15
- package/src/data-structures/heap/heap.ts +280 -0
- package/src/data-structures/linked-list/doubly-linked-list.ts +343 -3
- package/src/data-structures/linked-list/singly-linked-list.ts +303 -3
- package/src/data-structures/linked-list/skip-linked-list.ts +362 -2
- package/src/data-structures/matrix/matrix.ts +161 -1
- package/src/data-structures/queue/deque.ts +305 -5
- package/src/data-structures/queue/queue.ts +240 -0
- package/src/data-structures/stack/stack.ts +200 -0
- package/src/data-structures/trie/trie.ts +245 -5
- package/src/interfaces/graph.ts +1 -1
- package/src/types/common.ts +2 -2
- package/src/types/data-structures/heap/heap.ts +1 -0
- package/src/types/data-structures/priority-queue/priority-queue.ts +1 -0
- package/src/types/utils/validate-type.ts +4 -4
- package/vercel.json +6 -0
- package/dist/leetcode/avl-tree-counter.mjs +0 -2957
- package/dist/leetcode/avl-tree-multi-map.mjs +0 -2889
- package/dist/leetcode/avl-tree.mjs +0 -2720
- package/dist/leetcode/binary-tree.mjs +0 -1594
- package/dist/leetcode/bst.mjs +0 -2398
- package/dist/leetcode/deque.mjs +0 -683
- package/dist/leetcode/directed-graph.mjs +0 -1733
- package/dist/leetcode/doubly-linked-list.mjs +0 -709
- package/dist/leetcode/hash-map.mjs +0 -493
- package/dist/leetcode/heap.mjs +0 -542
- package/dist/leetcode/max-heap.mjs +0 -375
- package/dist/leetcode/max-priority-queue.mjs +0 -383
- package/dist/leetcode/min-heap.mjs +0 -363
- package/dist/leetcode/min-priority-queue.mjs +0 -371
- package/dist/leetcode/priority-queue.mjs +0 -363
- package/dist/leetcode/queue.mjs +0 -943
- package/dist/leetcode/red-black-tree.mjs +0 -2765
- package/dist/leetcode/singly-linked-list.mjs +0 -754
- package/dist/leetcode/stack.mjs +0 -217
- package/dist/leetcode/tree-counter.mjs +0 -3039
- package/dist/leetcode/tree-multi-map.mjs +0 -2913
- package/dist/leetcode/trie.mjs +0 -413
- package/dist/leetcode/undirected-graph.mjs +0 -1650
|
@@ -0,0 +1,644 @@
|
|
|
1
|
+
[**data-structure-typed**](../README.md)
|
|
2
|
+
|
|
3
|
+
***
|
|
4
|
+
|
|
5
|
+
[data-structure-typed](../README.md) / IterableEntryBase
|
|
6
|
+
|
|
7
|
+
# Abstract Class: IterableEntryBase\<K, V\>
|
|
8
|
+
|
|
9
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:9](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L9)
|
|
10
|
+
|
|
11
|
+
Iterable view over key-value entries.
|
|
12
|
+
|
|
13
|
+
## Remarks
|
|
14
|
+
|
|
15
|
+
Time O(1), Space O(1)
|
|
16
|
+
|
|
17
|
+
## Extended by
|
|
18
|
+
|
|
19
|
+
- [`HashMap`](HashMap.md)
|
|
20
|
+
- [`LinkedHashMap`](LinkedHashMap.md)
|
|
21
|
+
- [`SkipList`](SkipList.md)
|
|
22
|
+
- [`AbstractGraph`](AbstractGraph.md)
|
|
23
|
+
- [`BinaryTree`](BinaryTree.md)
|
|
24
|
+
|
|
25
|
+
## Type Parameters
|
|
26
|
+
|
|
27
|
+
### K
|
|
28
|
+
|
|
29
|
+
`K` = `any`
|
|
30
|
+
|
|
31
|
+
Key type.
|
|
32
|
+
|
|
33
|
+
### V
|
|
34
|
+
|
|
35
|
+
`V` = `any`
|
|
36
|
+
|
|
37
|
+
Value type.
|
|
38
|
+
|
|
39
|
+
## Accessors
|
|
40
|
+
|
|
41
|
+
### size
|
|
42
|
+
|
|
43
|
+
#### Get Signature
|
|
44
|
+
|
|
45
|
+
```ts
|
|
46
|
+
get abstract size(): number;
|
|
47
|
+
```
|
|
48
|
+
|
|
49
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:15](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L15)
|
|
50
|
+
|
|
51
|
+
Total number of entries.
|
|
52
|
+
|
|
53
|
+
##### Remarks
|
|
54
|
+
|
|
55
|
+
Time O(1), Space O(1)
|
|
56
|
+
|
|
57
|
+
##### Returns
|
|
58
|
+
|
|
59
|
+
`number`
|
|
60
|
+
|
|
61
|
+
Entry count.
|
|
62
|
+
|
|
63
|
+
## Methods
|
|
64
|
+
|
|
65
|
+
### \[iterator\]()
|
|
66
|
+
|
|
67
|
+
```ts
|
|
68
|
+
iterator: IterableIterator<[K, V]>;
|
|
69
|
+
```
|
|
70
|
+
|
|
71
|
+
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)
|
|
72
|
+
|
|
73
|
+
Default iterator yielding `[key, value]` entries.
|
|
74
|
+
|
|
75
|
+
#### Parameters
|
|
76
|
+
|
|
77
|
+
##### args
|
|
78
|
+
|
|
79
|
+
...`any`[]
|
|
80
|
+
|
|
81
|
+
#### Returns
|
|
82
|
+
|
|
83
|
+
`IterableIterator`\<\[`K`, `V`\]\>
|
|
84
|
+
|
|
85
|
+
Iterator of `[K, V]`.
|
|
86
|
+
|
|
87
|
+
#### Remarks
|
|
88
|
+
|
|
89
|
+
Time O(n) to iterate, Space O(1)
|
|
90
|
+
|
|
91
|
+
***
|
|
92
|
+
|
|
93
|
+
### clear()
|
|
94
|
+
|
|
95
|
+
```ts
|
|
96
|
+
abstract clear(): void;
|
|
97
|
+
```
|
|
98
|
+
|
|
99
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:218](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L218)
|
|
100
|
+
|
|
101
|
+
Remove all entries.
|
|
102
|
+
|
|
103
|
+
#### Returns
|
|
104
|
+
|
|
105
|
+
`void`
|
|
106
|
+
|
|
107
|
+
#### Remarks
|
|
108
|
+
|
|
109
|
+
Time O(n) typical, Space O(1)
|
|
110
|
+
|
|
111
|
+
***
|
|
112
|
+
|
|
113
|
+
### clone()
|
|
114
|
+
|
|
115
|
+
```ts
|
|
116
|
+
abstract clone(): this;
|
|
117
|
+
```
|
|
118
|
+
|
|
119
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:225](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L225)
|
|
120
|
+
|
|
121
|
+
Deep clone preserving the concrete subtype.
|
|
122
|
+
|
|
123
|
+
#### Returns
|
|
124
|
+
|
|
125
|
+
`this`
|
|
126
|
+
|
|
127
|
+
A new instance of the same concrete class (`this` type).
|
|
128
|
+
|
|
129
|
+
#### Remarks
|
|
130
|
+
|
|
131
|
+
Time O(n) typical, Space O(n)
|
|
132
|
+
|
|
133
|
+
***
|
|
134
|
+
|
|
135
|
+
### entries()
|
|
136
|
+
|
|
137
|
+
```ts
|
|
138
|
+
entries(): IterableIterator<[K, V | undefined]>;
|
|
139
|
+
```
|
|
140
|
+
|
|
141
|
+
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)
|
|
142
|
+
|
|
143
|
+
Iterate over `[key, value]` pairs (may yield `undefined` values).
|
|
144
|
+
|
|
145
|
+
#### Returns
|
|
146
|
+
|
|
147
|
+
`IterableIterator`\<\[`K`, `V` \| `undefined`\]\>
|
|
148
|
+
|
|
149
|
+
Iterator of `[K, V | undefined]`.
|
|
150
|
+
|
|
151
|
+
#### Remarks
|
|
152
|
+
|
|
153
|
+
Time O(n), Space O(1)
|
|
154
|
+
|
|
155
|
+
***
|
|
156
|
+
|
|
157
|
+
### every()
|
|
158
|
+
|
|
159
|
+
```ts
|
|
160
|
+
every(predicate, thisArg?): boolean;
|
|
161
|
+
```
|
|
162
|
+
|
|
163
|
+
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)
|
|
164
|
+
|
|
165
|
+
Test whether all entries satisfy the predicate.
|
|
166
|
+
|
|
167
|
+
#### Parameters
|
|
168
|
+
|
|
169
|
+
##### predicate
|
|
170
|
+
|
|
171
|
+
`EntryCallback`\<`K`, `V`, `boolean`\>
|
|
172
|
+
|
|
173
|
+
`(key, value, index, self) => boolean`.
|
|
174
|
+
|
|
175
|
+
##### thisArg?
|
|
176
|
+
|
|
177
|
+
`any`
|
|
178
|
+
|
|
179
|
+
Optional `this` for callback.
|
|
180
|
+
|
|
181
|
+
#### Returns
|
|
182
|
+
|
|
183
|
+
`boolean`
|
|
184
|
+
|
|
185
|
+
`true` if all pass; otherwise `false`.
|
|
186
|
+
|
|
187
|
+
#### Remarks
|
|
188
|
+
|
|
189
|
+
Time O(n), Space O(1)
|
|
190
|
+
|
|
191
|
+
***
|
|
192
|
+
|
|
193
|
+
### filter()
|
|
194
|
+
|
|
195
|
+
```ts
|
|
196
|
+
abstract filter(...args): this;
|
|
197
|
+
```
|
|
198
|
+
|
|
199
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:238](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L238)
|
|
200
|
+
|
|
201
|
+
Filter entries and return the same-species structure.
|
|
202
|
+
|
|
203
|
+
#### Parameters
|
|
204
|
+
|
|
205
|
+
##### args
|
|
206
|
+
|
|
207
|
+
...`any`[]
|
|
208
|
+
|
|
209
|
+
#### Returns
|
|
210
|
+
|
|
211
|
+
`this`
|
|
212
|
+
|
|
213
|
+
A new instance of the same concrete class (`this` type).
|
|
214
|
+
|
|
215
|
+
#### Remarks
|
|
216
|
+
|
|
217
|
+
Time O(n), Space O(n)
|
|
218
|
+
|
|
219
|
+
***
|
|
220
|
+
|
|
221
|
+
### find()
|
|
222
|
+
|
|
223
|
+
```ts
|
|
224
|
+
find(callbackfn, thisArg?): [K, V] | undefined;
|
|
225
|
+
```
|
|
226
|
+
|
|
227
|
+
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)
|
|
228
|
+
|
|
229
|
+
Find the first entry that matches a predicate.
|
|
230
|
+
|
|
231
|
+
#### Parameters
|
|
232
|
+
|
|
233
|
+
##### callbackfn
|
|
234
|
+
|
|
235
|
+
`EntryCallback`\<`K`, `V`, `boolean`\>
|
|
236
|
+
|
|
237
|
+
`(key, value, index, self) => boolean`.
|
|
238
|
+
|
|
239
|
+
##### thisArg?
|
|
240
|
+
|
|
241
|
+
`any`
|
|
242
|
+
|
|
243
|
+
Optional `this` for callback.
|
|
244
|
+
|
|
245
|
+
#### Returns
|
|
246
|
+
|
|
247
|
+
\[`K`, `V`\] \| `undefined`
|
|
248
|
+
|
|
249
|
+
Matching `[key, value]` or `undefined`.
|
|
250
|
+
|
|
251
|
+
#### Remarks
|
|
252
|
+
|
|
253
|
+
Time O(n), Space O(1)
|
|
254
|
+
|
|
255
|
+
***
|
|
256
|
+
|
|
257
|
+
### forEach()
|
|
258
|
+
|
|
259
|
+
```ts
|
|
260
|
+
forEach(callbackfn, thisArg?): void;
|
|
261
|
+
```
|
|
262
|
+
|
|
263
|
+
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)
|
|
264
|
+
|
|
265
|
+
Visit each entry, left-to-right.
|
|
266
|
+
|
|
267
|
+
#### Parameters
|
|
268
|
+
|
|
269
|
+
##### callbackfn
|
|
270
|
+
|
|
271
|
+
`EntryCallback`\<`K`, `V`, `void`\>
|
|
272
|
+
|
|
273
|
+
`(key, value, index, self) => void`.
|
|
274
|
+
|
|
275
|
+
##### thisArg?
|
|
276
|
+
|
|
277
|
+
`any`
|
|
278
|
+
|
|
279
|
+
Optional `this` for callback.
|
|
280
|
+
|
|
281
|
+
#### Returns
|
|
282
|
+
|
|
283
|
+
`void`
|
|
284
|
+
|
|
285
|
+
#### Remarks
|
|
286
|
+
|
|
287
|
+
Time O(n), Space O(1)
|
|
288
|
+
|
|
289
|
+
***
|
|
290
|
+
|
|
291
|
+
### get()
|
|
292
|
+
|
|
293
|
+
```ts
|
|
294
|
+
get(key): V | undefined;
|
|
295
|
+
```
|
|
296
|
+
|
|
297
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:156](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L156)
|
|
298
|
+
|
|
299
|
+
Get the value under a key.
|
|
300
|
+
|
|
301
|
+
#### Parameters
|
|
302
|
+
|
|
303
|
+
##### key
|
|
304
|
+
|
|
305
|
+
`K`
|
|
306
|
+
|
|
307
|
+
Key to look up.
|
|
308
|
+
|
|
309
|
+
#### Returns
|
|
310
|
+
|
|
311
|
+
`V` \| `undefined`
|
|
312
|
+
|
|
313
|
+
Value or `undefined`.
|
|
314
|
+
|
|
315
|
+
#### Remarks
|
|
316
|
+
|
|
317
|
+
Time O(n) generic, Space O(1)
|
|
318
|
+
|
|
319
|
+
***
|
|
320
|
+
|
|
321
|
+
### has()
|
|
322
|
+
|
|
323
|
+
```ts
|
|
324
|
+
has(key): boolean;
|
|
325
|
+
```
|
|
326
|
+
|
|
327
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:129](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L129)
|
|
328
|
+
|
|
329
|
+
Whether the given key exists.
|
|
330
|
+
|
|
331
|
+
#### Parameters
|
|
332
|
+
|
|
333
|
+
##### key
|
|
334
|
+
|
|
335
|
+
`K`
|
|
336
|
+
|
|
337
|
+
Key to test.
|
|
338
|
+
|
|
339
|
+
#### Returns
|
|
340
|
+
|
|
341
|
+
`boolean`
|
|
342
|
+
|
|
343
|
+
`true` if found; otherwise `false`.
|
|
344
|
+
|
|
345
|
+
#### Remarks
|
|
346
|
+
|
|
347
|
+
Time O(n) generic, Space O(1)
|
|
348
|
+
|
|
349
|
+
***
|
|
350
|
+
|
|
351
|
+
### hasValue()
|
|
352
|
+
|
|
353
|
+
```ts
|
|
354
|
+
hasValue(value): boolean;
|
|
355
|
+
```
|
|
356
|
+
|
|
357
|
+
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)
|
|
358
|
+
|
|
359
|
+
Whether there exists an entry with the given value.
|
|
360
|
+
|
|
361
|
+
#### Parameters
|
|
362
|
+
|
|
363
|
+
##### value
|
|
364
|
+
|
|
365
|
+
`V`
|
|
366
|
+
|
|
367
|
+
Value to test.
|
|
368
|
+
|
|
369
|
+
#### Returns
|
|
370
|
+
|
|
371
|
+
`boolean`
|
|
372
|
+
|
|
373
|
+
`true` if found; otherwise `false`.
|
|
374
|
+
|
|
375
|
+
#### Remarks
|
|
376
|
+
|
|
377
|
+
Time O(n), Space O(1)
|
|
378
|
+
|
|
379
|
+
***
|
|
380
|
+
|
|
381
|
+
### isEmpty()
|
|
382
|
+
|
|
383
|
+
```ts
|
|
384
|
+
abstract isEmpty(): boolean;
|
|
385
|
+
```
|
|
386
|
+
|
|
387
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:212](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L212)
|
|
388
|
+
|
|
389
|
+
Whether there are no entries.
|
|
390
|
+
|
|
391
|
+
#### Returns
|
|
392
|
+
|
|
393
|
+
`boolean`
|
|
394
|
+
|
|
395
|
+
`true` if empty; `false` otherwise.
|
|
396
|
+
|
|
397
|
+
#### Remarks
|
|
398
|
+
|
|
399
|
+
Time O(1) typical, Space O(1)
|
|
400
|
+
|
|
401
|
+
***
|
|
402
|
+
|
|
403
|
+
### keys()
|
|
404
|
+
|
|
405
|
+
```ts
|
|
406
|
+
keys(): IterableIterator<K>;
|
|
407
|
+
```
|
|
408
|
+
|
|
409
|
+
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)
|
|
410
|
+
|
|
411
|
+
Iterate over keys only.
|
|
412
|
+
|
|
413
|
+
#### Returns
|
|
414
|
+
|
|
415
|
+
`IterableIterator`\<`K`\>
|
|
416
|
+
|
|
417
|
+
Iterator of keys.
|
|
418
|
+
|
|
419
|
+
#### Remarks
|
|
420
|
+
|
|
421
|
+
Time O(n), Space O(1)
|
|
422
|
+
|
|
423
|
+
***
|
|
424
|
+
|
|
425
|
+
### map()
|
|
426
|
+
|
|
427
|
+
```ts
|
|
428
|
+
abstract map(...args): any;
|
|
429
|
+
```
|
|
430
|
+
|
|
431
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:231](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L231)
|
|
432
|
+
|
|
433
|
+
Map entries using an implementation-specific strategy.
|
|
434
|
+
|
|
435
|
+
#### Parameters
|
|
436
|
+
|
|
437
|
+
##### args
|
|
438
|
+
|
|
439
|
+
...`any`[]
|
|
440
|
+
|
|
441
|
+
#### Returns
|
|
442
|
+
|
|
443
|
+
`any`
|
|
444
|
+
|
|
445
|
+
#### Remarks
|
|
446
|
+
|
|
447
|
+
Time O(n), Space O(n)
|
|
448
|
+
|
|
449
|
+
***
|
|
450
|
+
|
|
451
|
+
### print()
|
|
452
|
+
|
|
453
|
+
```ts
|
|
454
|
+
print(): void;
|
|
455
|
+
```
|
|
456
|
+
|
|
457
|
+
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)
|
|
458
|
+
|
|
459
|
+
Print a human-friendly representation to the console.
|
|
460
|
+
|
|
461
|
+
#### Returns
|
|
462
|
+
|
|
463
|
+
`void`
|
|
464
|
+
|
|
465
|
+
#### Remarks
|
|
466
|
+
|
|
467
|
+
Time O(n), Space O(n)
|
|
468
|
+
|
|
469
|
+
***
|
|
470
|
+
|
|
471
|
+
### reduce()
|
|
472
|
+
|
|
473
|
+
```ts
|
|
474
|
+
reduce<U>(callbackfn, initialValue): U;
|
|
475
|
+
```
|
|
476
|
+
|
|
477
|
+
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)
|
|
478
|
+
|
|
479
|
+
Reduce entries into a single accumulator.
|
|
480
|
+
|
|
481
|
+
#### Type Parameters
|
|
482
|
+
|
|
483
|
+
##### U
|
|
484
|
+
|
|
485
|
+
`U`
|
|
486
|
+
|
|
487
|
+
#### Parameters
|
|
488
|
+
|
|
489
|
+
##### callbackfn
|
|
490
|
+
|
|
491
|
+
`ReduceEntryCallback`\<`K`, `V`, `U`\>
|
|
492
|
+
|
|
493
|
+
`(acc, value, key, index, self) => acc`.
|
|
494
|
+
|
|
495
|
+
##### initialValue
|
|
496
|
+
|
|
497
|
+
`U`
|
|
498
|
+
|
|
499
|
+
Initial accumulator.
|
|
500
|
+
|
|
501
|
+
#### Returns
|
|
502
|
+
|
|
503
|
+
`U`
|
|
504
|
+
|
|
505
|
+
Final accumulator.
|
|
506
|
+
|
|
507
|
+
#### Remarks
|
|
508
|
+
|
|
509
|
+
Time O(n), Space O(1)
|
|
510
|
+
|
|
511
|
+
***
|
|
512
|
+
|
|
513
|
+
### some()
|
|
514
|
+
|
|
515
|
+
```ts
|
|
516
|
+
some(predicate, thisArg?): boolean;
|
|
517
|
+
```
|
|
518
|
+
|
|
519
|
+
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)
|
|
520
|
+
|
|
521
|
+
Test whether any entry satisfies the predicate.
|
|
522
|
+
|
|
523
|
+
#### Parameters
|
|
524
|
+
|
|
525
|
+
##### predicate
|
|
526
|
+
|
|
527
|
+
`EntryCallback`\<`K`, `V`, `boolean`\>
|
|
528
|
+
|
|
529
|
+
`(key, value, index, self) => boolean`.
|
|
530
|
+
|
|
531
|
+
##### thisArg?
|
|
532
|
+
|
|
533
|
+
`any`
|
|
534
|
+
|
|
535
|
+
Optional `this` for callback.
|
|
536
|
+
|
|
537
|
+
#### Returns
|
|
538
|
+
|
|
539
|
+
`boolean`
|
|
540
|
+
|
|
541
|
+
`true` if any passes; otherwise `false`.
|
|
542
|
+
|
|
543
|
+
#### Remarks
|
|
544
|
+
|
|
545
|
+
Time O(n), Space O(1)
|
|
546
|
+
|
|
547
|
+
***
|
|
548
|
+
|
|
549
|
+
### toArray()
|
|
550
|
+
|
|
551
|
+
```ts
|
|
552
|
+
toArray(): [K, V][];
|
|
553
|
+
```
|
|
554
|
+
|
|
555
|
+
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)
|
|
556
|
+
|
|
557
|
+
Converts data structure to `[key, value]` pairs.
|
|
558
|
+
|
|
559
|
+
#### Returns
|
|
560
|
+
|
|
561
|
+
\[`K`, `V`\][]
|
|
562
|
+
|
|
563
|
+
Array of entries.
|
|
564
|
+
|
|
565
|
+
#### Remarks
|
|
566
|
+
|
|
567
|
+
Time O(n), Space O(n)
|
|
568
|
+
|
|
569
|
+
***
|
|
570
|
+
|
|
571
|
+
### toVisual()
|
|
572
|
+
|
|
573
|
+
```ts
|
|
574
|
+
toVisual(): string | [K, V][];
|
|
575
|
+
```
|
|
576
|
+
|
|
577
|
+
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)
|
|
578
|
+
|
|
579
|
+
Visualize the iterable as an array of `[key, value]` pairs (or a custom string).
|
|
580
|
+
|
|
581
|
+
#### Returns
|
|
582
|
+
|
|
583
|
+
`string` \| \[`K`, `V`\][]
|
|
584
|
+
|
|
585
|
+
Array of entries (default) or a string.
|
|
586
|
+
|
|
587
|
+
#### Remarks
|
|
588
|
+
|
|
589
|
+
Time O(n), Space O(n)
|
|
590
|
+
|
|
591
|
+
***
|
|
592
|
+
|
|
593
|
+
### values()
|
|
594
|
+
|
|
595
|
+
```ts
|
|
596
|
+
values(): IterableIterator<V>;
|
|
597
|
+
```
|
|
598
|
+
|
|
599
|
+
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)
|
|
600
|
+
|
|
601
|
+
Iterate over values only.
|
|
602
|
+
|
|
603
|
+
#### Returns
|
|
604
|
+
|
|
605
|
+
`IterableIterator`\<`V`\>
|
|
606
|
+
|
|
607
|
+
Iterator of values.
|
|
608
|
+
|
|
609
|
+
#### Remarks
|
|
610
|
+
|
|
611
|
+
Time O(n), Space O(1)
|
|
612
|
+
|
|
613
|
+
|
|
614
|
+
---
|
|
615
|
+
|
|
616
|
+
## Protected Members
|
|
617
|
+
|
|
618
|
+
### \_getIterator()
|
|
619
|
+
|
|
620
|
+
```ts
|
|
621
|
+
abstract protected _getIterator(...args): IterableIterator<[K, V]>;
|
|
622
|
+
```
|
|
623
|
+
|
|
624
|
+
Defined in: [data-structures/base/iterable-entry-base.ts:245](https://github.com/zrwusa/data-structure-typed/blob/2f6ceb3aee852228efc88b111e19c0809753e805/src/data-structures/base/iterable-entry-base.ts#L245)
|
|
625
|
+
|
|
626
|
+
Underlying iterator for the default iteration protocol.
|
|
627
|
+
|
|
628
|
+
#### Parameters
|
|
629
|
+
|
|
630
|
+
##### args
|
|
631
|
+
|
|
632
|
+
...`any`[]
|
|
633
|
+
|
|
634
|
+
#### Returns
|
|
635
|
+
|
|
636
|
+
`IterableIterator`\<\[`K`, `V`\]\>
|
|
637
|
+
|
|
638
|
+
Iterator of `[K, V]`.
|
|
639
|
+
|
|
640
|
+
#### Remarks
|
|
641
|
+
|
|
642
|
+
Time O(n), Space O(1)
|
|
643
|
+
|
|
644
|
+
***
|