From c177a4f87d61c448b310cb9b29bdb36b298ed4c9 Mon Sep 17 00:00:00 2001
From: Revone <zrwusa@gmail.com>
Date: Mon, 23 Oct 2023 03:06:55 +0800
Subject: [PATCH] [pkg] v1.37.1 publishing

---
 package.json                                                    | 2 +-
 .../data-structures/priority-queue/max-priority-queue.test.ts   | 2 +-
 2 files changed, 2 insertions(+), 2 deletions(-)

diff --git a/package.json b/package.json
index 5b20ca9..997a320 100644
--- a/package.json
+++ b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.37.0",
+  "version": "1.37.1",
   "description": "Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue.",
   "main": "dist/index.js",
   "module": "lib/index.js",
diff --git a/test/unit/data-structures/priority-queue/max-priority-queue.test.ts b/test/unit/data-structures/priority-queue/max-priority-queue.test.ts
index ff486cd..f8a63bc 100644
--- a/test/unit/data-structures/priority-queue/max-priority-queue.test.ts
+++ b/test/unit/data-structures/priority-queue/max-priority-queue.test.ts
@@ -90,7 +90,7 @@ describe('MaxPriorityQueue Performance Test', () => {
       }
     }
     const cost = performance.now() - startTime;
-    expect(cost).toBeLessThan(bigO.LINEAR * 20);
+    expect(cost).toBeLessThan(bigO.LINEAR * 30);
     expect(prev).toBeGreaterThan(0);
   });