Merge pull request #127 from masx200/deno-dependency-updates

Update dependencies

Author: masx200

add-two-polynomials-represented-as-linked-lists/test.ts

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 
 import { ArrayToPolyNode } from "./ArrayToPolyNode.ts";
 import addPoly from "./index.ts";

basic-calculator-iv/test.ts

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 
 import basicCalculatorIV from "./index.ts";
 import { Poly } from "./Poly.ts";

booking-concert-tickets-in-groups/test.ts

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 import { runScript } from "leetcode-class";
 
 import BookMyShow from "./index.ts";

brace-expansion-ii/test.ts

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 
 import braceExpansionII from "./index.ts";
 

brace-expansion/test.ts

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 
 import expand from "./index.ts";
 

construct-binary-search-tree-from-preorder-traversal/test.ts

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 
 import { TreeNodeLeetCodeFromJSON } from "../utils/TreeNodeLeetCodeParse.ts";
 import { TreeNodeLeetCodeToJSON } from "../utils/TreeNodeLeetCodeStringify.ts";

construct-binary-tree-from-string/test.ts

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 
 import str2tree from "./index.ts";
 

count-of-smaller-numbers-after-self/test.ts

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 
 import countSmaller from "./index.ts";
 

delete-tree-nodes/test.ts

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 
 import deleteTreeNodes from "./index.ts";
 

deps.ts

@@ -1,14 +1,14 @@
-import * as path from "https://deno.land/std@0.187.0/path/mod.ts";
+import * as path from "https://deno.land/std@0.188.0/path/mod.ts";
 
 import AsyncLimiterClass, {
     AsyncCurrentLimiter,
 } from "https://esm.sh/@masx200/async-task-current-limiter@2.1.0/";
-import { join, resolve } from "https://deno.land/std@0.187.0/path/mod.ts";
+import { join, resolve } from "https://deno.land/std@0.188.0/path/mod.ts";
 
-import { BinaryHeap } from "https://deno.land/std@0.187.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.188.0/collections/binary_heap.ts";
 import { Deque } from "https://esm.sh/@datastructures-js/deque@1.0.4/";
-import { RedBlackNode } from "https://deno.land/std@0.187.0/collections/red_black_node.ts";
-import { ensureDir } from "https://deno.land/std@0.187.0/fs/mod.ts";
+import { RedBlackNode } from "https://deno.land/std@0.188.0/collections/red_black_node.ts";
+import { ensureDir } from "https://deno.land/std@0.188.0/fs/mod.ts";
 import memoize from "https://cdn.skypack.dev/lodash@4.17.21/memoize?dts";
 import { retry } from "./retry.ts";
 
@@ -21,7 +21,7 @@ export {
     assertFalse,
     assertStrictEquals,
     equal,
-} from "https://deno.land/std@0.187.0/testing/asserts.ts";
+} from "https://deno.land/std@0.188.0/testing/asserts.ts";
 
 export { Deque };
 export { default as random } from "https://cdn.skypack.dev/lodash@4.17.21/random?dts";
@@ -34,8 +34,8 @@ export { default as sum } from "https://cdn.skypack.dev/lodash@4.17.21/sum?dts";
 export { default as intersection } from "https://cdn.skypack.dev/lodash@4.17.21/intersection?dts";
 
 export { BinaryHeap };
-export { walk } from "https://deno.land/std@0.187.0/fs/mod.ts";
-export { parse } from "https://deno.land/std@0.187.0/flags/mod.ts";
+export { walk } from "https://deno.land/std@0.188.0/fs/mod.ts";
+export { parse } from "https://deno.land/std@0.188.0/flags/mod.ts";
 export { combinations } from "https://deno.land/x/combinatorics@1.1.2/mod.ts";
 export { isIP } from "node:net";
 export { Heap } from "npm:@datastructures-js/heap@4.3.1";
@@ -51,7 +51,7 @@ export {
     TreeNode,
 } from "https://esm.sh/@masx200/leetcode-class@1.2.7/";
 
-export type { WalkEntry } from "https://deno.land/std@0.187.0/fs/_util.ts";
+export type { WalkEntry } from "https://deno.land/std@0.188.0/fs/_util.ts";
 
 export { AsyncLimiterClass };
 export type { AsyncCurrentLimiter };

design-a-file-sharing-system/index.ts

@@ -65,4 +65,4 @@ export default class FileSharing {
         return usersList;
     }
 }
-import { BinaryHeap } from "https://deno.land/std@0.187.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.188.0/collections/binary_heap.ts";

dinner-plate-stacks/RedBlackTree.ts

@@ -1,8 +1,8 @@
 import {
     Direction,
     RedBlackNode,
-} from "https://deno.land/std@0.187.0/collections/red_black_node.ts";
-import { RedBlackTree } from "https://deno.land/std@0.187.0/collections/red_black_tree.ts";
+} from "https://deno.land/std@0.188.0/collections/red_black_node.ts";
+import { RedBlackTree } from "https://deno.land/std@0.188.0/collections/red_black_tree.ts";
 
 export default class RedBlackTreeExtended<T> extends RedBlackTree<T> {
     insertGetNode(value: T): RedBlackNode<T> | null {

dinner-plate-stacks/index.ts

@@ -1,4 +1,4 @@
-import { ascend } from "https://deno.land/std@0.187.0/collections/binary_search_tree.ts";
+import { ascend } from "https://deno.land/std@0.188.0/collections/binary_search_tree.ts";
 
 import RedBlackTree from "./RedBlackTree.ts";
 import { reverseInOrderIterator } from "./reverseInOrderIterator.ts";

find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/findTheCity.ts

@@ -1,4 +1,4 @@
-import { BinaryHeap } from "https://deno.land/std@0.187.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.188.0/collections/binary_heap.ts";
 
 export default function findTheCity(
     n: number,

finding-mk-average/MultiRedBlackTree.ts

@@ -1,6 +1,6 @@
-import { ascend } from "https://deno.land/std@0.187.0/collections/_comparators.ts";
-import { Direction } from "https://deno.land/std@0.187.0/collections/binary_search_node.ts";
-import { RedBlackNode } from "https://deno.land/std@0.187.0/collections/red_black_node.ts";
+import { ascend } from "https://deno.land/std@0.188.0/collections/_comparators.ts";
+import { Direction } from "https://deno.land/std@0.188.0/collections/binary_search_node.ts";
+import { RedBlackNode } from "https://deno.land/std@0.188.0/collections/red_black_node.ts";
 
 import RedBlackTreeExtended from "../dinner-plate-stacks/RedBlackTree.ts";
 

finding-mk-average/simple.test.ts

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 import { runScript } from "leetcode-class";
 
 import MKAverage from "./index.ts";

import_map.json

@@ -1,6 +1,6 @@
 {
     "imports": {
-        "asserts": "https://deno.land/std@0.187.0/testing/asserts.ts",
+        "asserts": "https://deno.land/std@0.188.0/testing/asserts.ts",
         "leetcode-class": "https://esm.sh/@masx200/leetcode-class@1.2.7/",
         "assert": "https://esm.sh/assert@2.0.0"
     },

lua-format.ts

@@ -1,6 +1,6 @@
 import { RunCommandShell } from "./xmake.ts";
 import parse from "npm:@masx200/mini-cli-args-parser@1.0.5";
-import { walk } from "https://deno.land/std@0.187.0/fs/walk.ts";
+import { walk } from "https://deno.land/std@0.188.0/fs/walk.ts";
 if (import.meta.main) {
     await start();
 }

minimum-path-sum/test.ts

@@ -1,4 +1,4 @@
-import { assertStrictEquals } from "https://deno.land/std@0.187.0/testing/asserts.ts";
+import { assertStrictEquals } from "https://deno.land/std@0.188.0/testing/asserts.ts";
 import minPathSum from "./index.ts";
 
 Deno.test("minimum-path-sum", () => {

path-with-minimum-effort/minimumEffortPath.ts

@@ -1,4 +1,4 @@
-import { BinaryHeap } from "https://deno.land/std@0.187.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.188.0/collections/binary_heap.ts";
 
 function minimumEffortPath(heights: number[][]): number {
     const dirs = [

reachable-nodes-in-subdivided-graph/index.ts

@@ -44,4 +44,4 @@ export default function reachableNodes(
     }
     return reachableNodes;
 }
-import { BinaryHeap } from "https://deno.land/std@0.187.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.188.0/collections/binary_heap.ts";

retry.ts

@@ -1,7 +1,7 @@
 import {
     RetryError,
     RetryOptions,
-} from "https://deno.land/std@0.187.0/async/retry.ts";
+} from "https://deno.land/std@0.188.0/async/retry.ts";
 
 export const defaultRetryOptions = {
     multiplier: 2,

split-a-circular-linked-list/test.cpp

@@ -17,28 +17,31 @@ using namespace leetcode_test::split_a_circular_linked_list;
 using namespace std;
 using std::vector;
 template <class T>
-concept sizable = requires(T& t) {
+concept sizable = requires(T& t)
+{
     {
         t.size()
-    } -> std::same_as<size_t>;
+        } -> std::same_as<size_t>;
 };
 template <class T>
-concept iterable = requires(T& t) {
+concept iterable = requires(T& t)
+{
     ++t.begin();
     {
         t.begin() != t.end()
 
-    } -> std::same_as<bool>;
+        } -> std::same_as<bool>;
 };
 
 template <class T, typename Y>
-concept equalable = requires(T& t, Y& y, size_t i) {
+concept equalable = requires(T& t, Y& y, size_t i)
+{
     {
         *t.begin() == *y.begin()
-    } -> std::same_as<bool>;
+        } -> std::same_as<bool>;
 };
 template <typename T, typename Y>
-    requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
+requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
 auto assertContentEquals(T& left, Y& right)
 {
 

total-cost-to-hire-k-workers/index.ts

@@ -30,4 +30,4 @@ export default function totalCost(
     costs.sort(compare);
     return ans + costs.slice(0, k).reduce((p, c) => p + c, 0);
 }
-import { BinaryHeap } from "https://deno.land/std@0.187.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.188.0/collections/binary_heap.ts";

utils/split_by_count.ts

@@ -1,4 +1,4 @@
-import { chunk } from "https://deno.land/std@0.187.0/collections/chunk.ts";
+import { chunk } from "https://deno.land/std@0.188.0/collections/chunk.ts";
 
 export function split_by_count<T>(files: T[], limit: number): T[][] {
     return chunk(files, limit) as T[][];

web-crawler-multithreaded/format.json

@@ -1,15 +1,15 @@
 {
-  "style": "WebKit",
-  "filter": [
-  "*.ixx",
-    "*.c",
-    "*.cc",
-    "*.cpp",
-    "*.h",
-    "*.hh",
-    "*.hpp"
-  ],
-  "dirs": [
-    "./"
-  ]
-}
+    "style": "WebKit",
+    "filter": [
+        "*.ixx",
+        "*.c",
+        "*.cc",
+        "*.cpp",
+        "*.h",
+        "*.hh",
+        "*.hpp"
+    ],
+    "dirs": [
+        "./"
+    ]
+}

web-crawler-multithreaded/test.cpp

@@ -11,27 +11,30 @@ import leetcode_test.web_crawler_multithreaded.Solution;
 using namespace std;
 using namespace leetcode_test::web_crawler_multithreaded;
 template <class T>
-concept sizable = requires(T& t) {
+concept sizable = requires(T& t)
+{
     {
         t.size()
-    } -> std::same_as<size_t>;
+        } -> std::same_as<size_t>;
 };
 template <class T>
-concept iterable = requires(T& t) {
+concept iterable = requires(T& t)
+{
     ++t.begin();
     {
         t.begin() != t.end()
-    } -> std::same_as<bool>;
+        } -> std::same_as<bool>;
 };
 
 template <class T, typename Y>
-concept equalable = requires(T& t, Y& y, size_t i) {
+concept equalable = requires(T& t, Y& y, size_t i)
+{
     {
         *t.begin() == *y.begin()
-    } -> std::same_as<bool>;
+        } -> std::same_as<bool>;
 };
 template <typename T, typename Y>
-    requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
+requires sizable<T> and sizable<Y> and equalable<T, Y> and iterable<T> and iterable<Y>
 auto assertContentEquals(const T& left, const Y& right)
 {