Skip to content

Commit

Permalink
release: 1.47.6
Browse files Browse the repository at this point in the history
  • Loading branch information
zrwusa committed Nov 24, 2023
1 parent 4930f87 commit 451f6c5
Show file tree
Hide file tree
Showing 3 changed files with 8 additions and 7 deletions.
2 changes: 1 addition & 1 deletion CHANGELOG.md
Original file line number Diff line number Diff line change
Expand Up @@ -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.47.5](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)
## [v1.47.6](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)

### Changes

Expand Down
2 changes: 1 addition & 1 deletion package.json
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
{
"name": "data-structure-typed",
"version": "1.47.5",
"version": "1.47.6",
"description": "Data Structures of Javascript & TypeScript. Heap, Binary Tree, RedBlack 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.",
"main": "dist/cjs/index.js",
"module": "dist/mjs/index.js",
Expand Down
11 changes: 6 additions & 5 deletions test/performance/data-structures/comparison/comparison.test.ts
Original file line number Diff line number Diff line change
Expand Up @@ -23,17 +23,18 @@ const arrHundredThousand = getRandomIntArray(HUNDRED_THOUSAND, 0, HUNDRED_THOUSA
suite
.add(`SRC PQ ${TEN_THOUSAND.toLocaleString()} add`, () => {

const pq = new SRCPriorityQueue<number>([], { comparator: (a, b) => b - a });
const pq = new SRCPriorityQueue<number>();
for (let i = 0; i < TEN_THOUSAND; i++) pq.add(i);
})
.add(`CJS PQ ${TEN_THOUSAND.toLocaleString()} add`, () => {

const pq = new CJSPriorityQueue<number>({ comparator: (a, b) => b - a });

const pq = new CJSPriorityQueue<number>();
for (let i = 0; i < TEN_THOUSAND; i++) pq.add(i);
})
.add(`MJS PQ ${TEN_THOUSAND.toLocaleString()} add`, () => {

const pq = new MJSPriorityQueue<number>({ comparator: (a, b) => b - a });
const pq = new MJSPriorityQueue<number>([],{ comparator: (a, b) => b - a });
for (let i = 0; i < TEN_THOUSAND; i++) pq.add(i);
});

Expand All @@ -53,13 +54,13 @@ suite
for (let i = 0; i < TEN_THOUSAND; i++) pq.pop();
})
.add(`CJS PQ ${TEN_THOUSAND.toLocaleString()} add & pop`, () => {
const pq = new CJSPriorityQueue<number>({ comparator: (a, b) => b - a });
const pq = new CJSPriorityQueue<number>([],{ comparator: (a, b) => b - a });

for (let i = 0; i < TEN_THOUSAND; i++) pq.add(i);
for (let i = 0; i < TEN_THOUSAND; i++) pq.pop();
})
.add(`MJS PQ ${TEN_THOUSAND.toLocaleString()} add & pop`, () => {
const pq = new MJSPriorityQueue<number>({ comparator: (a, b) => b - a });
const pq = new MJSPriorityQueue<number>([],{ comparator: (a, b) => b - a });

for (let i = 0; i < TEN_THOUSAND; i++) pq.add(i);
for (let i = 0; i < TEN_THOUSAND; i++) pq.pop();
Expand Down

0 comments on commit 451f6c5

Please sign in to comment.