data-structure-typed 2.5.0 → 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/.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 +5 -1
- package/README.md +124 -29
- package/dist/cjs/binary-tree.cjs +26282 -0
- package/dist/cjs/graph.cjs +5422 -0
- package/dist/cjs/hash.cjs +1310 -0
- package/dist/cjs/heap.cjs +1602 -0
- package/dist/cjs/index.cjs +31257 -14673
- package/dist/cjs/linked-list.cjs +4576 -0
- package/dist/cjs/matrix.cjs +1080 -0
- package/dist/cjs/priority-queue.cjs +1376 -0
- package/dist/cjs/queue.cjs +4264 -0
- package/dist/cjs/stack.cjs +907 -0
- package/dist/cjs/trie.cjs +1223 -0
- package/dist/cjs-legacy/binary-tree.cjs +26319 -0
- package/dist/cjs-legacy/graph.cjs +5420 -0
- package/dist/cjs-legacy/hash.cjs +1310 -0
- package/dist/cjs-legacy/heap.cjs +1599 -0
- package/dist/cjs-legacy/index.cjs +31268 -14679
- package/dist/cjs-legacy/linked-list.cjs +4582 -0
- package/dist/cjs-legacy/matrix.cjs +1083 -0
- package/dist/cjs-legacy/priority-queue.cjs +1374 -0
- package/dist/cjs-legacy/queue.cjs +4262 -0
- package/dist/cjs-legacy/stack.cjs +907 -0
- package/dist/cjs-legacy/trie.cjs +1222 -0
- package/dist/esm/binary-tree.mjs +26267 -0
- package/dist/esm/graph.mjs +5409 -0
- package/dist/esm/hash.mjs +1307 -0
- package/dist/esm/heap.mjs +1596 -0
- package/dist/esm/index.mjs +31254 -14674
- package/dist/esm/linked-list.mjs +4569 -0
- package/dist/esm/matrix.mjs +1076 -0
- package/dist/esm/priority-queue.mjs +1372 -0
- package/dist/esm/queue.mjs +4260 -0
- package/dist/esm/stack.mjs +905 -0
- package/dist/esm/trie.mjs +1220 -0
- package/dist/esm-legacy/binary-tree.mjs +26304 -0
- package/dist/esm-legacy/graph.mjs +5407 -0
- package/dist/esm-legacy/hash.mjs +1307 -0
- package/dist/esm-legacy/heap.mjs +1593 -0
- package/dist/esm-legacy/index.mjs +31265 -14680
- package/dist/esm-legacy/linked-list.mjs +4575 -0
- package/dist/esm-legacy/matrix.mjs +1079 -0
- package/dist/esm-legacy/priority-queue.mjs +1370 -0
- package/dist/esm-legacy/queue.mjs +4258 -0
- package/dist/esm-legacy/stack.mjs +905 -0
- package/dist/esm-legacy/trie.mjs +1219 -0
- package/dist/types/common/error.d.ts +9 -0
- package/dist/types/common/index.d.ts +1 -1
- 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 +288 -0
- package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts +336 -0
- package/dist/types/data-structures/binary-tree/binary-tree.d.ts +618 -18
- package/dist/types/data-structures/binary-tree/bst.d.ts +676 -1
- package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +456 -0
- package/dist/types/data-structures/binary-tree/segment-tree.d.ts +144 -1
- package/dist/types/data-structures/binary-tree/tree-map.d.ts +3307 -399
- package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +3285 -360
- package/dist/types/data-structures/binary-tree/tree-multi-set.d.ts +2674 -325
- package/dist/types/data-structures/binary-tree/tree-set.d.ts +3072 -287
- package/dist/types/data-structures/graph/abstract-graph.d.ts +4 -4
- package/dist/types/data-structures/graph/directed-graph.d.ts +240 -0
- package/dist/types/data-structures/graph/undirected-graph.d.ts +216 -0
- package/dist/types/data-structures/hash/hash-map.d.ts +274 -10
- package/dist/types/data-structures/heap/heap.d.ts +336 -0
- package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts +411 -3
- package/dist/types/data-structures/linked-list/singly-linked-list.d.ts +363 -3
- package/dist/types/data-structures/linked-list/skip-linked-list.d.ts +434 -2
- package/dist/types/data-structures/matrix/matrix.d.ts +192 -0
- package/dist/types/data-structures/queue/deque.d.ts +364 -4
- package/dist/types/data-structures/queue/queue.d.ts +288 -0
- package/dist/types/data-structures/stack/stack.d.ts +240 -0
- package/dist/types/data-structures/trie/trie.d.ts +292 -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/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/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 +31196 -14608
- package/dist/umd/data-structure-typed.min.js +11 -5
- 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 +6644 -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 +6293 -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 +6888 -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 +1389 -0
- package/docs-site-docusaurus/docs/api/classes/TreeMultiMap.md +1591 -0
- package/docs-site-docusaurus/docs/api/classes/TreeSet.md +1246 -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 +615 -0
- package/docs-site-docusaurus/docs/guide/concepts.md +451 -0
- package/docs-site-docusaurus/docs/guide/faq.md +180 -0
- package/docs-site-docusaurus/docs/guide/guides.md +597 -0
- package/docs-site-docusaurus/docs/guide/installation.md +62 -0
- package/docs-site-docusaurus/docs/guide/integrations.md +825 -0
- package/docs-site-docusaurus/docs/guide/overview.md +645 -0
- package/docs-site-docusaurus/docs/guide/performance.md +835 -0
- package/docs-site-docusaurus/docs/guide/quick-start.md +104 -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 +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 +120 -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/llms.txt +37 -0
- package/docs-site-docusaurus/static/robots.txt +4 -0
- package/docs-site-docusaurus/typedoc.json +23 -0
- package/llms.txt +37 -0
- package/package.json +159 -55
- package/src/common/error.ts +19 -1
- package/src/common/index.ts +1 -1
- package/src/data-structures/base/index.ts +1 -0
- package/src/data-structures/base/iterable-element-base.ts +3 -2
- 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 +287 -0
- package/src/data-structures/binary-tree/binary-indexed-tree.ts +327 -5
- package/src/data-structures/binary-tree/binary-tree.ts +581 -6
- package/src/data-structures/binary-tree/bst.ts +922 -7
- package/src/data-structures/binary-tree/red-black-tree.ts +453 -0
- package/src/data-structures/binary-tree/segment-tree.ts +139 -2
- package/src/data-structures/binary-tree/tree-map.ts +3300 -495
- package/src/data-structures/binary-tree/tree-multi-map.ts +3384 -563
- package/src/data-structures/binary-tree/tree-multi-set.ts +2757 -493
- package/src/data-structures/binary-tree/tree-set.ts +3122 -440
- package/src/data-structures/graph/abstract-graph.ts +6 -6
- package/src/data-structures/graph/directed-graph.ts +230 -0
- package/src/data-structures/graph/undirected-graph.ts +207 -0
- package/src/data-structures/hash/hash-map.ts +270 -19
- package/src/data-structures/heap/heap.ts +326 -4
- package/src/data-structures/heap/max-heap.ts +2 -2
- package/src/data-structures/linked-list/doubly-linked-list.ts +394 -3
- package/src/data-structures/linked-list/singly-linked-list.ts +348 -3
- package/src/data-structures/linked-list/skip-linked-list.ts +421 -7
- package/src/data-structures/matrix/matrix.ts +194 -10
- package/src/data-structures/priority-queue/max-priority-queue.ts +2 -2
- package/src/data-structures/queue/deque.ts +350 -5
- package/src/data-structures/queue/queue.ts +276 -0
- package/src/data-structures/stack/stack.ts +230 -0
- package/src/data-structures/trie/trie.ts +283 -7
- package/src/interfaces/graph.ts +1 -1
- package/src/types/common.ts +2 -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
- 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
package/dist/leetcode/stack.mjs
DELETED
|
@@ -1,217 +0,0 @@
|
|
|
1
|
-
var __defProp = Object.defineProperty;
|
|
2
|
-
var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
|
|
3
|
-
var IterableElementBase = class {
|
|
4
|
-
static {
|
|
5
|
-
__name(this, "IterableElementBase");
|
|
6
|
-
}
|
|
7
|
-
constructor(options) {
|
|
8
|
-
if (options) {
|
|
9
|
-
const { toElementFn } = options;
|
|
10
|
-
if (typeof toElementFn === "function") this._toElementFn = toElementFn;
|
|
11
|
-
else if (toElementFn) throw new TypeError("toElementFn must be a function type");
|
|
12
|
-
}
|
|
13
|
-
}
|
|
14
|
-
_toElementFn;
|
|
15
|
-
get toElementFn() {
|
|
16
|
-
return this._toElementFn;
|
|
17
|
-
}
|
|
18
|
-
*[Symbol.iterator](...args) {
|
|
19
|
-
yield* this._getIterator(...args);
|
|
20
|
-
}
|
|
21
|
-
*values() {
|
|
22
|
-
for (const item of this) yield item;
|
|
23
|
-
}
|
|
24
|
-
every(predicate, thisArg) {
|
|
25
|
-
let index = 0;
|
|
26
|
-
for (const item of this) {
|
|
27
|
-
if (thisArg === void 0) {
|
|
28
|
-
if (!predicate(item, index++, this)) return false;
|
|
29
|
-
} else {
|
|
30
|
-
const fn = predicate;
|
|
31
|
-
if (!fn.call(thisArg, item, index++, this)) return false;
|
|
32
|
-
}
|
|
33
|
-
}
|
|
34
|
-
return true;
|
|
35
|
-
}
|
|
36
|
-
some(predicate, thisArg) {
|
|
37
|
-
let index = 0;
|
|
38
|
-
for (const item of this) {
|
|
39
|
-
if (thisArg === void 0) {
|
|
40
|
-
if (predicate(item, index++, this)) return true;
|
|
41
|
-
} else {
|
|
42
|
-
const fn = predicate;
|
|
43
|
-
if (fn.call(thisArg, item, index++, this)) return true;
|
|
44
|
-
}
|
|
45
|
-
}
|
|
46
|
-
return false;
|
|
47
|
-
}
|
|
48
|
-
forEach(callbackfn, thisArg) {
|
|
49
|
-
let index = 0;
|
|
50
|
-
for (const item of this) {
|
|
51
|
-
if (thisArg === void 0) {
|
|
52
|
-
callbackfn(item, index++, this);
|
|
53
|
-
} else {
|
|
54
|
-
const fn = callbackfn;
|
|
55
|
-
fn.call(thisArg, item, index++, this);
|
|
56
|
-
}
|
|
57
|
-
}
|
|
58
|
-
}
|
|
59
|
-
find(predicate, thisArg) {
|
|
60
|
-
let index = 0;
|
|
61
|
-
for (const item of this) {
|
|
62
|
-
if (thisArg === void 0) {
|
|
63
|
-
if (predicate(item, index++, this)) return item;
|
|
64
|
-
} else {
|
|
65
|
-
const fn = predicate;
|
|
66
|
-
if (fn.call(thisArg, item, index++, this)) return item;
|
|
67
|
-
}
|
|
68
|
-
}
|
|
69
|
-
return;
|
|
70
|
-
}
|
|
71
|
-
has(element) {
|
|
72
|
-
for (const ele of this) if (ele === element) return true;
|
|
73
|
-
return false;
|
|
74
|
-
}
|
|
75
|
-
reduce(callbackfn, initialValue) {
|
|
76
|
-
let index = 0;
|
|
77
|
-
const iter = this[Symbol.iterator]();
|
|
78
|
-
let acc;
|
|
79
|
-
if (arguments.length >= 2) {
|
|
80
|
-
acc = initialValue;
|
|
81
|
-
} else {
|
|
82
|
-
const first = iter.next();
|
|
83
|
-
if (first.done) throw new TypeError("Reduce of empty structure with no initial value");
|
|
84
|
-
acc = first.value;
|
|
85
|
-
index = 1;
|
|
86
|
-
}
|
|
87
|
-
for (const value of iter) {
|
|
88
|
-
acc = callbackfn(acc, value, index++, this);
|
|
89
|
-
}
|
|
90
|
-
return acc;
|
|
91
|
-
}
|
|
92
|
-
toArray() {
|
|
93
|
-
return [...this];
|
|
94
|
-
}
|
|
95
|
-
toVisual() {
|
|
96
|
-
return [...this];
|
|
97
|
-
}
|
|
98
|
-
print() {
|
|
99
|
-
console.log(this.toVisual());
|
|
100
|
-
}
|
|
101
|
-
};
|
|
102
|
-
var Stack = class extends IterableElementBase {
|
|
103
|
-
static {
|
|
104
|
-
__name(this, "Stack");
|
|
105
|
-
}
|
|
106
|
-
_equals = Object.is;
|
|
107
|
-
constructor(elements = [], options) {
|
|
108
|
-
super(options);
|
|
109
|
-
this.pushMany(elements);
|
|
110
|
-
}
|
|
111
|
-
_elements = [];
|
|
112
|
-
get elements() {
|
|
113
|
-
return this._elements;
|
|
114
|
-
}
|
|
115
|
-
get size() {
|
|
116
|
-
return this.elements.length;
|
|
117
|
-
}
|
|
118
|
-
static fromArray(elements, options) {
|
|
119
|
-
return new this(elements, options);
|
|
120
|
-
}
|
|
121
|
-
isEmpty() {
|
|
122
|
-
return this.elements.length === 0;
|
|
123
|
-
}
|
|
124
|
-
peek() {
|
|
125
|
-
return this.isEmpty() ? void 0 : this.elements[this.elements.length - 1];
|
|
126
|
-
}
|
|
127
|
-
push(element) {
|
|
128
|
-
this.elements.push(element);
|
|
129
|
-
return true;
|
|
130
|
-
}
|
|
131
|
-
pop() {
|
|
132
|
-
return this.isEmpty() ? void 0 : this.elements.pop();
|
|
133
|
-
}
|
|
134
|
-
pushMany(elements) {
|
|
135
|
-
const ans = [];
|
|
136
|
-
for (const el of elements) {
|
|
137
|
-
if (this.toElementFn) ans.push(this.push(this.toElementFn(el)));
|
|
138
|
-
else ans.push(this.push(el));
|
|
139
|
-
}
|
|
140
|
-
return ans;
|
|
141
|
-
}
|
|
142
|
-
delete(element) {
|
|
143
|
-
const idx = this._indexOfByEquals(element);
|
|
144
|
-
return this.deleteAt(idx);
|
|
145
|
-
}
|
|
146
|
-
deleteAt(index) {
|
|
147
|
-
if (index < 0 || index >= this.elements.length) return false;
|
|
148
|
-
const spliced = this.elements.splice(index, 1);
|
|
149
|
-
return spliced.length === 1;
|
|
150
|
-
}
|
|
151
|
-
deleteWhere(predicate) {
|
|
152
|
-
for (let i = 0; i < this.elements.length; i++) {
|
|
153
|
-
if (predicate(this.elements[i], i, this)) {
|
|
154
|
-
this.elements.splice(i, 1);
|
|
155
|
-
return true;
|
|
156
|
-
}
|
|
157
|
-
}
|
|
158
|
-
return false;
|
|
159
|
-
}
|
|
160
|
-
clear() {
|
|
161
|
-
this._elements = [];
|
|
162
|
-
}
|
|
163
|
-
clone() {
|
|
164
|
-
const out = this._createInstance({ toElementFn: this.toElementFn });
|
|
165
|
-
for (const v of this) out.push(v);
|
|
166
|
-
return out;
|
|
167
|
-
}
|
|
168
|
-
filter(predicate, thisArg) {
|
|
169
|
-
const out = this._createInstance({ toElementFn: this.toElementFn });
|
|
170
|
-
let index = 0;
|
|
171
|
-
for (const v of this) {
|
|
172
|
-
if (predicate.call(thisArg, v, index, this)) out.push(v);
|
|
173
|
-
index++;
|
|
174
|
-
}
|
|
175
|
-
return out;
|
|
176
|
-
}
|
|
177
|
-
mapSame(callback, thisArg) {
|
|
178
|
-
const out = this._createInstance({ toElementFn: this.toElementFn });
|
|
179
|
-
let index = 0;
|
|
180
|
-
for (const v of this) {
|
|
181
|
-
const mv = thisArg === void 0 ? callback(v, index++, this) : callback.call(thisArg, v, index++, this);
|
|
182
|
-
out.push(mv);
|
|
183
|
-
}
|
|
184
|
-
return out;
|
|
185
|
-
}
|
|
186
|
-
map(callback, options, thisArg) {
|
|
187
|
-
const out = this._createLike([], { ...options ?? {} });
|
|
188
|
-
let index = 0;
|
|
189
|
-
for (const v of this) {
|
|
190
|
-
out.push(thisArg === void 0 ? callback(v, index, this) : callback.call(thisArg, v, index, this));
|
|
191
|
-
index++;
|
|
192
|
-
}
|
|
193
|
-
return out;
|
|
194
|
-
}
|
|
195
|
-
setEquality(equals) {
|
|
196
|
-
this._equals = equals;
|
|
197
|
-
return this;
|
|
198
|
-
}
|
|
199
|
-
_indexOfByEquals(target) {
|
|
200
|
-
for (let i = 0; i < this.elements.length; i++) if (this._equals(this.elements[i], target)) return i;
|
|
201
|
-
return -1;
|
|
202
|
-
}
|
|
203
|
-
_createInstance(options) {
|
|
204
|
-
const Ctor = this.constructor;
|
|
205
|
-
return new Ctor([], options);
|
|
206
|
-
}
|
|
207
|
-
_createLike(elements = [], options) {
|
|
208
|
-
const Ctor = this.constructor;
|
|
209
|
-
return new Ctor(elements, options);
|
|
210
|
-
}
|
|
211
|
-
*_getIterator() {
|
|
212
|
-
for (let i = 0; i < this.elements.length; i++) yield this.elements[i];
|
|
213
|
-
}
|
|
214
|
-
};
|
|
215
|
-
export {
|
|
216
|
-
Stack
|
|
217
|
-
};
|