diff --git a/CHANGELOG.md b/CHANGELOG.md
index 7b8288c..15df49a 100644
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -8,7 +8,7 @@ All notable changes to this project will be documented in this file.
- [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
- [`auto-changelog`](https://github.com/CookPete/auto-changelog)
-## [v1.50.8](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)
+## [v1.50.9](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)
### Changes
diff --git a/README.md b/README.md
index 49d2f8b..1edd0c8 100644
--- a/README.md
+++ b/README.md
@@ -667,6 +667,67 @@ Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.key) // ['A', 'B', '
+## Benchmark
+
+MacBook Pro (15-inch, 2018)
+
+Processor 2.2 GHz 6-Core Intel Core i7
+
+Memory 16 GB 2400 MHz DDR4
+
+Graphics Radeon Pro 555X 4 GB
+
+Intel UHD Graphics 630 1536 MB
+
+macOS Big Sur
+
+Version 11.7.9
+
+
+[//]: # (No deletion!!! Start of Replace Section)
+
+
heap
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
100,000 add | 6.58 | 152.07 | 3.13e-4 |
100,000 add & poll | 35.67 | 28.03 | 0.01 |
+
+
rb-tree
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
100,000 add | 55.91 | 17.89 | 0.01 |
100,000 get | 125.11 | 7.99 | 0.01 |
100,000 iterator | 27.97 | 35.76 | 0.01 |
100,000 add & delete orderly | 125.06 | 8.00 | 0.00 |
100,000 add & delete randomly | 242.78 | 4.12 | 0.01 |
+
+
queue
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 push | 44.81 | 22.32 | 0.01 |
100,000 push & shift | 4.99 | 200.39 | 7.40e-4 |
Native JS Array 100,000 push & shift | 2234.97 | 0.45 | 0.19 |
+
+
deque
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 push | 24.34 | 41.08 | 0.01 |
1,000,000 push & pop | 31.41 | 31.83 | 0.00 |
1,000,000 push & shift | 31.12 | 32.13 | 0.00 |
100,000 push & shift | 3.27 | 306.17 | 2.62e-4 |
Native JS Array 100,000 push & shift | 2362.95 | 0.42 | 0.12 |
100,000 unshift & shift | 2.89 | 345.46 | 3.23e-4 |
Native JS Array 100,000 unshift & shift | 4313.81 | 0.23 | 0.13 |
+
+
hash-map
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 set | 118.81 | 8.42 | 0.02 |
Native JS Map 1,000,000 set | 218.24 | 4.58 | 0.02 |
Native JS Set 1,000,000 add | 180.64 | 5.54 | 0.03 |
1,000,000 set & get | 121.23 | 8.25 | 0.01 |
Native JS Map 1,000,000 set & get | 273.71 | 3.65 | 0.01 |
Native JS Set 1,000,000 add & has | 173.69 | 5.76 | 0.01 |
1,000,000 ObjKey set & get | 331.89 | 3.01 | 0.04 |
Native JS Map 1,000,000 ObjKey set & get | 331.49 | 3.02 | 0.05 |
Native JS Set 1,000,000 ObjKey add & has | 308.15 | 3.25 | 0.04 |
+
+
trie
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
100,000 push | 58.78 | 17.01 | 0.02 |
100,000 getWords | 95.99 | 10.42 | 0.01 |
+
+
avl-tree
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
10,000 add randomly | 50.17 | 19.93 | 0.01 |
10,000 get | 20.86 | 47.94 | 0.00 |
10,000 add & delete randomly | 79.18 | 12.63 | 0.00 |
10,000 addMany | 52.92 | 18.90 | 0.00 |
+
+
binary-tree-overall
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
10,000 RBTree add | 5.69 | 175.82 | 5.70e-4 |
10,000 RBTree add & delete randomly | 19.94 | 50.16 | 0.00 |
10,000 RBTree get | 0.65 | 1543.77 | 1.81e-5 |
10,000 AVLTree add | 44.46 | 22.49 | 0.00 |
10,000 AVLTree get | 20.07 | 49.84 | 0.00 |
10,000 AVLTree add & delete randomly | 77.29 | 12.94 | 0.01 |
+
+
directed-graph
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000 addVertex | 0.10 | 9883.75 | 9.48e-7 |
1,000 addEdge | 6.05 | 165.15 | 1.08e-4 |
1,000 getVertex | 0.05 | 2.15e+4 | 5.74e-7 |
1,000 getEdge | 23.58 | 42.41 | 0.00 |
tarjan | 208.84 | 4.79 | 0.01 |
topologicalSort | 180.27 | 5.55 | 0.00 |
+
+
doubly-linked-list
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 push | 208.91 | 4.79 | 0.07 |
1,000,000 unshift | 202.73 | 4.93 | 0.03 |
1,000,000 unshift & shift | 182.70 | 5.47 | 0.06 |
1,000,000 addBefore | 314.16 | 3.18 | 0.06 |
+
+
singly-linked-list
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 push & shift | 207.94 | 4.81 | 0.05 |
10,000 push & pop | 216.07 | 4.63 | 0.01 |
10,000 addBefore | 246.19 | 4.06 | 0.00 |
+
+
priority-queue
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
100,000 add | 27.00 | 37.04 | 2.43e-4 |
100,000 add & poll | 77.16 | 12.96 | 0.00 |
+
+
stack
+
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 push | 39.29 | 25.45 | 0.00 |
1,000,000 push & pop | 48.05 | 20.81 | 0.00 |
+
+
+[//]: # (No deletion!!! End of Replace Section)
+
## The corresponding relationships between data structures in different language standard libraries.
@@ -982,69 +1043,6 @@ concurrently.
-## Benchmark
-
-MacBook Pro (15-inch, 2018)
-
-Processor 2.2 GHz 6-Core Intel Core i7
-
-Memory 16 GB 2400 MHz DDR4
-
-Graphics Radeon Pro 555X 4 GB
-
-Intel UHD Graphics 630 1536 MB
-
-macOS Big Sur
-
-Version 11.7.9
-
-
-[//]: # (No deletion!!! Start of Replace Section)
-
-
heap
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
100,000 add | 6.46 | 154.91 | 3.36e-4 |
100,000 add & poll | 31.62 | 31.62 | 8.04e-4 |
-
-
rb-tree
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
100,000 add | 92.86 | 10.77 | 0.00 |
100,000 get | 112.39 | 8.90 | 8.37e-4 |
100,000 iterator | 30.56 | 32.72 | 0.00 |
100,000 add & delete orderly | 175.06 | 5.71 | 0.02 |
100,000 add & delete randomly | 263.48 | 3.80 | 0.00 |
-
-
-
-
queue
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 push | 44.07 | 22.69 | 0.01 |
100,000 push & shift | 4.89 | 204.65 | 5.60e-4 |
Native JS Array 100,000 push & shift | 2305.44 | 0.43 | 0.31 |
-
-
deque
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 push | 24.69 | 40.50 | 0.00 |
1,000,000 push & pop | 31.59 | 31.66 | 0.00 |
1,000,000 push & shift | 31.17 | 32.09 | 0.00 |
100,000 push & shift | 3.27 | 305.75 | 2.76e-4 |
Native JS Array 100,000 push & shift | 2511.34 | 0.40 | 0.37 |
100,000 unshift & shift | 2.97 | 336.26 | 2.53e-4 |
Native JS Array 100,000 unshift & shift | 4097.31 | 0.24 | 0.34 |
-
-
hash-map
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 set | 114.37 | 8.74 | 0.02 |
Native JS Map 1,000,000 set | 202.67 | 4.93 | 0.00 |
Native JS Set 1,000,000 add | 168.24 | 5.94 | 0.00 |
1,000,000 set & get | 124.10 | 8.06 | 0.03 |
Native JS Map 1,000,000 set & get | 266.46 | 3.75 | 0.01 |
Native JS Set 1,000,000 add & has | 175.14 | 5.71 | 0.02 |
1,000,000 ObjKey set & get | 341.26 | 2.93 | 0.05 |
Native JS Map 1,000,000 ObjKey set & get | 311.60 | 3.21 | 0.04 |
Native JS Set 1,000,000 ObjKey add & has | 274.81 | 3.64 | 0.03 |
-
-
trie
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
100,000 push | 59.08 | 16.93 | 0.00 |
100,000 getWords | 82.92 | 12.06 | 0.00 |
-
-
avl-tree
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
10,000 add randomly | 48.66 | 20.55 | 0.01 |
10,000 get | 19.36 | 51.64 | 2.95e-4 |
10,000 add & delete randomly | 77.68 | 12.87 | 0.00 |
10,000 addMany | 52.04 | 19.22 | 0.01 |
-
-
binary-tree-overall
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
10,000 RBTree add | 8.07 | 123.87 | 8.53e-5 |
10,000 RBTree add & delete randomly | 22.38 | 44.68 | 5.81e-4 |
10,000 RBTree get | 0.62 | 1602.15 | 7.37e-6 |
10,000 AVLTree add | 46.27 | 21.61 | 8.12e-4 |
10,000 AVLTree get | 20.02 | 49.95 | 4.21e-4 |
10,000 AVLTree add & delete randomly | 75.96 | 13.16 | 0.00 |
-
-
directed-graph
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000 addVertex | 0.10 | 9647.19 | 9.43e-7 |
1,000 addEdge | 6.06 | 164.98 | 1.09e-4 |
1,000 getVertex | 0.05 | 2.17e+4 | 2.85e-7 |
1,000 getEdge | 23.47 | 42.60 | 0.00 |
tarjan | 208.86 | 4.79 | 0.01 |
topologicalSort | 186.70 | 5.36 | 0.02 |
-
-
doubly-linked-list
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 push | 209.57 | 4.77 | 0.06 |
1,000,000 unshift | 203.85 | 4.91 | 0.03 |
1,000,000 unshift & shift | 172.64 | 5.79 | 0.02 |
1,000,000 addBefore | 315.26 | 3.17 | 0.08 |
-
-
singly-linked-list
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 push & shift | 218.01 | 4.59 | 0.06 |
10,000 push & pop | 216.06 | 4.63 | 0.01 |
10,000 addBefore | 248.62 | 4.02 | 0.01 |
-
-
priority-queue
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
100,000 add | 27.52 | 36.34 | 0.00 |
100,000 add & poll | 75.49 | 13.25 | 5.41e-4 |
-
-
stack
-
test name | time taken (ms) | executions per sec | sample deviation |
---|
1,000,000 push | 41.24 | 24.25 | 0.01 |
1,000,000 push & pop | 49.67 | 20.13 | 0.01 |
-
-
-[//]: # (No deletion!!! End of Replace Section)
-
## supported module system
Now you can use it in Node.js and browser environments
diff --git a/package-lock.json b/package-lock.json
index 8b18a0e..a83a61c 100644
--- a/package-lock.json
+++ b/package-lock.json
@@ -1,12 +1,12 @@
{
"name": "data-structure-typed",
- "version": "1.50.7",
+ "version": "1.50.9",
"lockfileVersion": 3,
"requires": true,
"packages": {
"": {
"name": "data-structure-typed",
- "version": "1.50.7",
+ "version": "1.50.9",
"license": "MIT",
"devDependencies": {
"@swc/core": "^1.3.96",
@@ -16,11 +16,11 @@
"@typescript-eslint/eslint-plugin": "^6.7.4",
"@typescript-eslint/parser": "^6.7.4",
"auto-changelog": "^2.4.0",
- "avl-tree-typed": "^1.50.7",
+ "avl-tree-typed": "^1.50.9",
"benchmark": "^2.1.4",
- "binary-tree-typed": "^1.50.7",
- "bst-typed": "^1.50.7",
- "data-structure-typed": "^1.50.7",
+ "binary-tree-typed": "^1.50.9",
+ "bst-typed": "^1.50.9",
+ "data-structure-typed": "^1.50.9",
"dependency-cruiser": "^14.1.0",
"doctoc": "^2.2.1",
"eslint": "^8.50.0",
@@ -29,7 +29,7 @@
"eslint-import-resolver-typescript": "^3.6.1",
"eslint-plugin-import": "^2.28.1",
"fast-glob": "^3.3.1",
- "heap-typed": "^1.50.7",
+ "heap-typed": "^1.50.9",
"istanbul-badges-readme": "^1.8.5",
"jest": "^29.7.0",
"js-sdsl": "^4.4.2",
@@ -3097,12 +3097,12 @@
}
},
"node_modules/avl-tree-typed": {
- "version": "1.50.7",
- "resolved": "https://registry.npmjs.org/avl-tree-typed/-/avl-tree-typed-1.50.7.tgz",
- "integrity": "sha512-zYo8Oa4IrM5i3evHGO0FhELFHpDITUOpa2d8cGd06LHR74I9JL0OX7X0J+yuy6RBSuiIiNieJ99EKmhuggGbTg==",
+ "version": "1.50.9",
+ "resolved": "https://registry.npmjs.org/avl-tree-typed/-/avl-tree-typed-1.50.9.tgz",
+ "integrity": "sha512-0cFjnUr3b0dFD3RM+tqBW9iSeUJo8q25BCG2vF4DG2/YbtQxcYvxrlwW319EQORaqhQivmtqy1YLmRq+9/oUQA==",
"dev": true,
"dependencies": {
- "data-structure-typed": "^1.50.7"
+ "data-structure-typed": "^1.50.9"
}
},
"node_modules/babel-jest": {
@@ -3306,12 +3306,12 @@
}
},
"node_modules/binary-tree-typed": {
- "version": "1.50.7",
- "resolved": "https://registry.npmjs.org/binary-tree-typed/-/binary-tree-typed-1.50.7.tgz",
- "integrity": "sha512-L1kVL9q+1jsXyTNuZ/PJrBD1HUK4MyWFOwQmH4coy7WmOlTg2z2+ZuXCgmT8X/ADYFoKc9hq94niS/Yvy6RpOg==",
+ "version": "1.50.9",
+ "resolved": "https://registry.npmjs.org/binary-tree-typed/-/binary-tree-typed-1.50.9.tgz",
+ "integrity": "sha512-OVI+Azj8cDifYRp8jKANiQySFF5Zxk9RbUr58YDswgKZ9z1snucLkTvauDXqr9wtkA42OxT3Fhdc5OohB0t6wg==",
"dev": true,
"dependencies": {
- "data-structure-typed": "^1.50.7"
+ "data-structure-typed": "^1.50.9"
}
},
"node_modules/brace-expansion": {
@@ -3390,12 +3390,12 @@
}
},
"node_modules/bst-typed": {
- "version": "1.50.7",
- "resolved": "https://registry.npmjs.org/bst-typed/-/bst-typed-1.50.7.tgz",
- "integrity": "sha512-grhnOajT8DBZYivgT5Q+qVQKpBbUPIyMJ2KVOx2EBH68l1pFA78zlf/BJWhEL+UcLwDqIJ6DpbvqcyTAjcfE9A==",
+ "version": "1.50.9",
+ "resolved": "https://registry.npmjs.org/bst-typed/-/bst-typed-1.50.9.tgz",
+ "integrity": "sha512-d4neM/KL4BBqfBoot5MumOenL61pWHBG3aP9nQQoVtwn6mpn8yXWV4+tTXbRlzJ9bXEpCL6v7BrbD+tJNqyzHw==",
"dev": true,
"dependencies": {
- "data-structure-typed": "^1.50.7"
+ "data-structure-typed": "^1.50.9"
}
},
"node_modules/buffer-from": {
@@ -3838,9 +3838,9 @@
}
},
"node_modules/data-structure-typed": {
- "version": "1.50.7",
- "resolved": "https://registry.npmjs.org/data-structure-typed/-/data-structure-typed-1.50.7.tgz",
- "integrity": "sha512-TPLHMD4yxQFp4YbigA7i4zAVsQwZEarmYah2KXMmhczzasDXt+bbYLg7/BlRkq58N55Qr8UZuI5MAlH2YKaibQ==",
+ "version": "1.50.9",
+ "resolved": "https://registry.npmjs.org/data-structure-typed/-/data-structure-typed-1.50.9.tgz",
+ "integrity": "sha512-16vbeS+PSNW+ZwjAAtA7AMKrywbn8JpoCOXwl5sHbrErLATp+ejuRr46yH9nJ7Q7/qgvv3mlPLyhp4ux8pq4bg==",
"dev": true
},
"node_modules/debug": {
@@ -5363,12 +5363,12 @@
}
},
"node_modules/heap-typed": {
- "version": "1.50.7",
- "resolved": "https://registry.npmjs.org/heap-typed/-/heap-typed-1.50.7.tgz",
- "integrity": "sha512-124SW17qSl+7aVp0d4gdFVTusW/Lq+x8S89yvyTUfSj6YadqUjP0EKblDx4oShiYC91g3YRPKqKV5juN2SDx5w==",
+ "version": "1.50.9",
+ "resolved": "https://registry.npmjs.org/heap-typed/-/heap-typed-1.50.9.tgz",
+ "integrity": "sha512-XG5KHlDktK3A3t2swtBVW2PRmp4RwHYHZODCN6NIQragXxlEJK7Illts0a8tb32NYlwVNSEQTSxReqx6iQn94A==",
"dev": true,
"dependencies": {
- "data-structure-typed": "^1.50.7"
+ "data-structure-typed": "^1.50.9"
}
},
"node_modules/html-escaper": {
diff --git a/package.json b/package.json
index beda901..a15f1eb 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
{
"name": "data-structure-typed",
- "version": "1.50.8",
+ "version": "1.50.9",
"description": "Javascript Data Structure. Heap, Binary Tree, Red Black Tree, Linked List, Deque, Trie, HashMap, Directed Graph, Undirected Graph, Binary Search Tree(BST), AVL Tree, Priority Queue, Graph, Queue, Tree Multiset, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue, Stack. Benchmark compared with C++ STL. API aligned with ES6 and Java.util. Usability is comparable to Python",
"main": "dist/cjs/index.js",
"module": "dist/mjs/index.js",
@@ -34,7 +34,7 @@
"format:test": "prettier --write 'test/**/*.{js,ts}'",
"format": "npm run format:src && npm run format:test",
"check:exist-latest": "sh scripts/check_exist_remotely.sh",
- "ci": "env && git fetch --tags && npm run inspect && npm run lint && npm run build && npm run test:unit && npm run changelog",
+ "ci": "env && git fetch --tags && npm run update:subs && npm run inspect && npm run lint && npm run build && npm run test:unit && npm run changelog",
"update:subs": "npm i avl-tree-typed binary-tree-typed bst-typed heap-typed data-structure-typed --save-dev",
"install:all-subs": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multimap-typed trie-typed undirected-graph-typed queue-typed --save-dev",
"changelog": "auto-changelog",
@@ -66,11 +66,11 @@
"@typescript-eslint/eslint-plugin": "^6.7.4",
"@typescript-eslint/parser": "^6.7.4",
"auto-changelog": "^2.4.0",
- "avl-tree-typed": "^1.50.7",
+ "avl-tree-typed": "^1.50.9",
"benchmark": "^2.1.4",
- "binary-tree-typed": "^1.50.7",
- "bst-typed": "^1.50.7",
- "data-structure-typed": "^1.50.7",
+ "binary-tree-typed": "^1.50.9",
+ "bst-typed": "^1.50.9",
+ "data-structure-typed": "^1.50.9",
"dependency-cruiser": "^14.1.0",
"doctoc": "^2.2.1",
"eslint": "^8.50.0",
@@ -79,7 +79,7 @@
"eslint-import-resolver-typescript": "^3.6.1",
"eslint-plugin-import": "^2.28.1",
"fast-glob": "^3.3.1",
- "heap-typed": "^1.50.7",
+ "heap-typed": "^1.50.9",
"istanbul-badges-readme": "^1.8.5",
"jest": "^29.7.0",
"js-sdsl": "^4.4.2",
diff --git a/test/integration/avl-tree.test.ts b/test/integration/avl-tree.test.ts
index faac053..4a6d967 100644
--- a/test/integration/avl-tree.test.ts
+++ b/test/integration/avl-tree.test.ts
@@ -44,7 +44,7 @@ describe('AVL Tree Test', () => {
expect(subTreeSum).toBe(70);
let lesserSum = 0;
- tree.lesserOrGreaterTraverse(node => (lesserSum += node.key), CP.lt, 10);
+ tree.lesserOrGreaterTraverse(node => (lesserSum += node.key), 'LT', 10);
expect(lesserSum).toBe(45);
// node15 has type problem. After the uniform design, the generics of containers (DirectedGraph, BST) are based on the type of value. However, this design has a drawback: when I attempt to inherit from the Vertex or BSTNode classes, the types of the results obtained by all methods are those of the parent class.
diff --git a/test/integration/bst.test.ts b/test/integration/bst.test.ts
index 5d2ead6..ad3440b 100644
--- a/test/integration/bst.test.ts
+++ b/test/integration/bst.test.ts
@@ -38,7 +38,7 @@ describe('Individual package BST operations test', () => {
expect(subTreeSum).toBe(70);
let lesserSum = 0;
- bst.lesserOrGreaterTraverse(node => (lesserSum += node.key), CP.lt, 10);
+ bst.lesserOrGreaterTraverse(node => (lesserSum += node.key), 'LT', 10);
expect(lesserSum).toBe(45);
expect(node15).toBeInstanceOf(BSTNode);
@@ -235,7 +235,7 @@ describe('Individual package BST operations test', () => {
expect(subTreeSum).toBe(70);
let lesserSum = 0;
- objBST.lesserOrGreaterTraverse(node => (lesserSum += node.key), CP.lt, 10);
+ objBST.lesserOrGreaterTraverse(node => (lesserSum += node.key), 'LT', 10);
expect(lesserSum).toBe(45);
expect(node15).toBeInstanceOf(BSTNode);
diff --git a/test/performance/data-structures/binary-tree/avl-tree.test.ts b/test/performance/data-structures/binary-tree/avl-tree.test.ts
index 5a928b2..3885c1b 100644
--- a/test/performance/data-structures/binary-tree/avl-tree.test.ts
+++ b/test/performance/data-structures/binary-tree/avl-tree.test.ts
@@ -3,26 +3,31 @@ import * as Benchmark from 'benchmark';
import { getRandomIntArray, magnitude } from '../../../utils';
const suite = new Benchmark.Suite();
-const avl = new AVLTree();
-const { TEN_THOUSAND } = magnitude;
-const arr = getRandomIntArray(TEN_THOUSAND, 0, TEN_THOUSAND, true);
+const avlTree = new AVLTree();
+const { HUNDRED_THOUSAND } = magnitude;
+const randomArray = getRandomIntArray(HUNDRED_THOUSAND, 0, HUNDRED_THOUSAND - 1, true);
suite
- .add(`${TEN_THOUSAND.toLocaleString()} add randomly`, () => {
- avl.clear();
- for (let i = 0; i < arr.length; i++) avl.add(arr[i]);
+ .add(`${HUNDRED_THOUSAND.toLocaleString()} add`, () => {
+ avlTree.clear();
+ for (let i = 0; i < randomArray.length; i++) avlTree.add(i);
})
- .add(`${TEN_THOUSAND.toLocaleString()} get`, () => {
- for (let i = 0; i < arr.length; i++) avl.get(arr[i]);
+ .add(`${HUNDRED_THOUSAND.toLocaleString()} get`, () => {
+ for (let i = 0; i < randomArray.length; i++) avlTree.get(randomArray[i]);
})
- .add(`${TEN_THOUSAND.toLocaleString()} add & delete randomly`, () => {
- avl.clear();
- for (let i = 0; i < arr.length; i++) avl.add(arr[i]);
- for (let i = 0; i < arr.length; i++) avl.delete(arr[i]);
+ .add(`${HUNDRED_THOUSAND.toLocaleString()} iterator`, () => {
+ const entries = [...avlTree];
+ return entries.length === HUNDRED_THOUSAND;
})
- .add(`${TEN_THOUSAND.toLocaleString()} addMany`, () => {
- avl.clear();
- avl.addMany(arr);
+ .add(`${HUNDRED_THOUSAND.toLocaleString()} add & delete orderly`, () => {
+ avlTree.clear();
+ for (let i = 0; i < randomArray.length; i++) avlTree.add(i);
+ for (let i = 0; i < randomArray.length; i++) avlTree.delete(i);
+ })
+ .add(`${HUNDRED_THOUSAND.toLocaleString()} add & delete randomly`, () => {
+ avlTree.clear();
+ for (let i = 0; i < randomArray.length; i++) avlTree.add(randomArray[i]);
+ for (let i = 0; i < randomArray.length; i++) avlTree.delete(randomArray[i]);
});
export { suite };