Update dependencies

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

@@ -1,4 +1,4 @@
-import { assertEquals } from "https://deno.land/std@0.166.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.167.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.166.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.167.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.166.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.167.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.166.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.167.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.166.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.167.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.166.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.167.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.166.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.167.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.166.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.167.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.166.0/testing/asserts.ts";
+import { assertEquals } from "https://deno.land/std@0.167.0/testing/asserts.ts";
 
 import deleteTreeNodes from "./index.ts";
 

deno.json

@@ -10,8 +10,8 @@
     },
     "importMap": "import_map.json",
     "tasks": {
-        "udd": " deno run -A https://deno.land/x/udd@0.8.1/main.ts  '*.json' deps.ts '*.ts' '*/*.ts'",
-        "install-udd": "deno install -A -f -n udd https://deno.land/x/udd@0.8.1/main.ts",
+        "udd": " deno run -A https://deno.land/x/udd@0.8.2/main.ts  '*.json' deps.ts '*.ts' '*/*.ts'",
+        "install-udd": "deno install -A -f -n udd https://deno.land/x/udd@0.8.2/main.ts",
         "fmt": " deno fmt --config deno.json",
         "test": "deno test  --parallel --unstable -A --config deno.json",
         "lint": "deno lint --config deno.json",

deps.ts

@@ -5,7 +5,7 @@ export {
     assertFalse,
     assertStrictEquals,
     equal,
-} from "https://deno.land/std@0.166.0/testing/asserts.ts";
+} from "https://deno.land/std@0.167.0/testing/asserts.ts";
 export { default as random } from "https://cdn.skypack.dev/lodash@4.17.21/random?dts";
 export { default as countBy } from "https://cdn.skypack.dev/lodash@4.17.21/countBy?dts";
 export { default as zip } from "https://cdn.skypack.dev/lodash@4.17.21/zip?dts";
@@ -14,10 +14,10 @@ export { default as uniqBy } from "https://cdn.skypack.dev/lodash@4.17.21/uniqBy
 
 export { default as intersection } from "https://cdn.skypack.dev/lodash@4.17.21/intersection?dts";
 
-export { walk } from "https://deno.land/std@0.166.0/fs/mod.ts";
-export { parse } from "https://deno.land/std@0.166.0/flags/mod.ts";
+export { walk } from "https://deno.land/std@0.167.0/fs/mod.ts";
+export { parse } from "https://deno.land/std@0.167.0/flags/mod.ts";
 export { combinations } from "https://deno.land/x/combinatorics@1.1.2/mod.ts";
-export { isIP } from "https://deno.land/std@0.166.0/node/internal/net.ts";
+export { isIP } from "https://deno.land/std@0.167.0/node/internal/net.ts";
 export { Heap } from "https://esm.sh/@datastructures-js/heap@4.1.2/";
 export {
     AvlTree,
@@ -31,7 +31,7 @@ export {
     TreeNode,
 } from "https://esm.sh/@masx200/leetcode-class@1.2.5";
 
-export type { WalkEntry } from "https://deno.land/std@0.166.0/fs/_util.ts";
+export type { WalkEntry } from "https://deno.land/std@0.167.0/fs/_util.ts";
 import AsyncLimiterClass, {
     AsyncCurrentLimiter,
 } from "https://cdn.skypack.dev/@masx200/async-task-current-limiter@2.1.0?dts";

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

@@ -63,4 +63,4 @@ export default class FileSharing {
         return usersList;
     }
 }
-import { BinaryHeap } from "https://deno.land/std@0.166.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.167.0/collections/binary_heap.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.166.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.167.0/collections/binary_heap.ts";
 export default function findTheCity(
     n: number,
     edges: number[][],

import_map.json

@@ -2,6 +2,6 @@
     "imports": {
         "assert": "https://esm.sh/assert@2.0.0",
         "leetcode-class": "https://esm.sh/@masx200/leetcode-class@1.2.5",
-        "asserts": "https://deno.land/std@0.166.0/testing/asserts.ts"
+        "asserts": "https://deno.land/std@0.167.0/testing/asserts.ts"
     }
 }

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.166.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.167.0/collections/binary_heap.ts";

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.166.0/collections/binary_heap.ts";
+import { BinaryHeap } from "https://deno.land/std@0.167.0/collections/binary_heap.ts";

utils/split_by_count.ts

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