格式化

Author: masx200

cache.ts

@@ -7,11 +7,7 @@ import {
 } from "./deps.ts";
 import { split_by_count } from "./utils/split_by_count.ts";
 
-function searchFilesNames({
-    skip,
-}: {
-    skip?: RegExp | RegExp[];
-}) {
+function searchFilesNames({ skip }: { skip?: RegExp | RegExp[] }) {
     const entry_iter = walk(".", {
         includeFiles: true,
         includeDirs: false,
@@ -26,7 +22,7 @@ if (import.meta.main) {
 
 async function parallel_cache(
     entry_iter: AsyncIterableIterator<WalkEntry>,
-    limiter: AsyncCurrentLimiter,
+    limiter: AsyncCurrentLimiter
 ) {
     const files: string[] = [];
 
@@ -38,21 +34,24 @@ async function parallel_cache(
 
     await Promise.all(
         entries.map((stack) =>
-            limiter.run(function (stack: string[]) {
-                return runDenocache(stack);
-            }.bind(null, stack))
-        ),
+            limiter.run(
+                function (stack: string[]) {
+                    return runDenocache(stack);
+                }.bind(null, stack)
+            )
+        )
     );
 }
 async function start() {
     const limiter = new AsyncLimiterClass(1);
     const args = parse(Deno.args);
     console.log(args);
-    const skip = typeof args.skip === "string"
-        ? new RegExp(String(args.skip))
-        : Array.isArray(args.skip)
-        ? args.skip.map((s: string | RegExp) => new RegExp(s))
-        : undefined;
+    const skip =
+        typeof args.skip === "string"
+            ? new RegExp(String(args.skip))
+            : Array.isArray(args.skip)
+            ? args.skip.map((s: string | RegExp) => new RegExp(s))
+            : undefined;
     const entry_iter = searchFilesNames({ skip });
     await parallel_cache(entry_iter, limiter);
 }
@@ -74,7 +73,7 @@ async function runDenocache(stack: string[]) {
     if (!success) {
         throw new Error(
             "type cache failed:" +
-                JSON.stringify({ code, success, stdout: out, stderr: err }),
+                JSON.stringify({ code, success, stdout: out, stderr: err })
         );
     }
 }

check.ts

@@ -7,11 +7,7 @@ import {
 } from "./deps.ts";
 import { split_by_count } from "./utils/split_by_count.ts";
 
-function searchFilesNames({
-    skip,
-}: {
-    skip?: RegExp | RegExp[];
-}) {
+function searchFilesNames({ skip }: { skip?: RegExp | RegExp[] }) {
     const entry_iter = walk(".", {
         includeFiles: true,
         includeDirs: false,
@@ -26,7 +22,7 @@ if (import.meta.main) {
 
 async function parallel_check(
     entry_iter: AsyncIterableIterator<WalkEntry>,
-    limiter: AsyncCurrentLimiter,
+    limiter: AsyncCurrentLimiter
 ) {
     const files: string[] = [];
 
@@ -38,21 +34,24 @@ async function parallel_check(
 
     await Promise.all(
         entries.map((stack) =>
-            limiter.run(function (stack: string[]) {
-                return runDenoCheck(stack);
-            }.bind(null, stack))
-        ),
+            limiter.run(
+                function (stack: string[]) {
+                    return runDenoCheck(stack);
+                }.bind(null, stack)
+            )
+        )
     );
 }
 async function start() {
     const limiter = new AsyncLimiterClass(navigator.hardwareConcurrency);
     const args = parse(Deno.args);
     console.log(args);
-    const skip = typeof args.skip === "string"
-        ? new RegExp(String(args.skip))
-        : Array.isArray(args.skip)
-        ? args.skip.map((s: string | RegExp) => new RegExp(s))
-        : undefined;
+    const skip =
+        typeof args.skip === "string"
+            ? new RegExp(String(args.skip))
+            : Array.isArray(args.skip)
+            ? args.skip.map((s: string | RegExp) => new RegExp(s))
+            : undefined;
     const entry_iter = searchFilesNames({ skip });
     await parallel_check(entry_iter, limiter);
 }
@@ -74,7 +73,7 @@ async function runDenoCheck(stack: string[]) {
     if (!success) {
         throw new Error(
             "type cache failed:" +
-                JSON.stringify({ code, success, stdout: out, stderr: err }),
+                JSON.stringify({ code, success, stdout: out, stderr: err })
         );
     }
 }

deno.json

@@ -30,11 +30,7 @@
     },
     "fmt": {
         "files": {
-            "exclude": [
-                "target",
-                "x64",
-                "*.cxx.ifc.d.json"
-            ]
+            "exclude": ["target", "x64", "*.cxx.ifc.d.json"]
         },
         "options": {
             "indentWidth": 4,
@@ -43,9 +39,7 @@
     },
     "test": {
         "files": {
-            "exclude": [
-                "target"
-            ]
+            "exclude": ["target"]
         }
     }
 }

format.json

@@ -1,11 +1,5 @@
 {
     "style": "WebKit",
-    "filter": [
-        "*.cpp",
-
-        "*.ixx"
-    ],
-    "dirs": [
-        "./"
-    ]
+    "filter": ["*.cpp", "*.ixx"],
+    "dirs": ["./"]
 }

mod.ts

@@ -3,9 +3,7 @@ import { InOrderIterator } from "./binary-search-tree-iterator-ii/index.ts";
 import { inorder } from "./binary-tree-inorder-traversal/inorder.ts";
 import { TreeNode } from "./binary-tree-inorder-traversal/TreeNode.ts";
 import { level } from "./binary-tree-level-order-traversal-ii/level.ts";
-import {
-    binaryCountOneBigint,
-} from "./cells-with-odd-values-in-a-matrix/binary_count_one_bigint.ts";
+import { binaryCountOneBigint } from "./cells-with-odd-values-in-a-matrix/binary_count_one_bigint.ts";
 import { Node as GraphNode } from "./clone-graph/Node.ts";
 import { parseComplex } from "./complex-number-multiplication/parse_complex.ts";
 import { buildBST } from "./convert-sorted-list-to-binary-search-tree/buildBST.ts";
@@ -14,22 +12,16 @@ import { DoublyLinkedList } from "./design-linked-list/DoublyLinkedList.ts";
 import { HashMap } from "./design-movie-rental-system/HashMap.ts";
 import RedBlackTree from "./dinner-plate-stacks/RedBlackTree.ts";
 import { reverseInOrderIterator } from "./dinner-plate-stacks/reverseInOrderIterator.ts";
-import {
-    ArrayToCircularDoublyTreeList,
-} from "./er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/ArrayToCircularDoublyTreeList.ts";
+import { ArrayToCircularDoublyTreeList } from "./er-cha-sou-suo-shu-yu-shuang-xiang-lian-biao-lcof/ArrayToCircularDoublyTreeList.ts";
 import { NestedIntegerFrom } from "./flatten-nested-list-iterator/NestedIntegerFrom.ts";
 import { deduplication } from "./fraction-addition-and-subtraction/deduplication.ts";
 import { Fraction } from "./fraction-addition-and-subtraction/Fraction.ts";
 import { parseFraction } from "./fraction-addition-and-subtraction/parseFraction.ts";
 import { absBigint } from "./fraction-to-recurring-decimal/abs_bigint.ts";
 import { rand7 } from "./implement-rand10-using-rand7/rand7.ts";
 import { TrieNode } from "./implement-trie-ii-prefix-tree/TrieNode.ts";
-import {
-    TrieNodeCountWordsEqualTo,
-} from "./implement-trie-ii-prefix-tree/TrieNodeCountWordsEqualTo.ts";
-import {
-    TrieNodeCountWordsStartingWith,
-} from "./implement-trie-ii-prefix-tree/TrieNodeCountWordsStartingWith.ts";
+import { TrieNodeCountWordsEqualTo } from "./implement-trie-ii-prefix-tree/TrieNodeCountWordsEqualTo.ts";
+import { TrieNodeCountWordsStartingWith } from "./implement-trie-ii-prefix-tree/TrieNodeCountWordsStartingWith.ts";
 import { TrieNodeErase } from "./implement-trie-ii-prefix-tree/TrieNodeErase.ts";
 import { TrieNodeInsert } from "./implement-trie-ii-prefix-tree/TrieNodeInsert.ts";
 import { PrefixTree } from "./implement-trie-prefix-tree/PrefixTree.ts";
@@ -41,13 +33,9 @@ import { PriorityQueue } from "./kth-largest-element-in-a-stream/PriorityQueue.t
 import { UnionFind } from "./largest-component-size-by-common-factor/UnionFind.ts";
 import { MyLinkedList } from "./lfu-cache/MyLinkedList.ts";
 import { PrefixTreeSearchEach } from "./longest-word-in-dictionary/PrefixTreeSearchEach.ts";
-import {
-    PrefixTreeSearchPrefixEach,
-} from "./longest-word-in-dictionary/PrefixTreeSearchPrefixEach.ts";
+import { PrefixTreeSearchPrefixEach } from "./longest-word-in-dictionary/PrefixTreeSearchPrefixEach.ts";
 import { PrefixTreeWithSum } from "./map-sum-pairs/PrefixTreeWithSum.ts";
-import {
-    calculateStraightLineEquation,
-} from "./max-points-on-a-line/calculateStraightLineEquation.ts";
+import { calculateStraightLineEquation } from "./max-points-on-a-line/calculateStraightLineEquation.ts";
 import { gcd } from "./max-points-on-a-line/greatest_common_divisor.ts";
 import { uniqueStraightLineEquation } from "./max-points-on-a-line/uniqueStraightLineEquation.ts";
 import { bigintMax } from "./maximum-width-of-binary-tree/bigint_max.ts";

package.json

@@ -2,7 +2,6 @@
     "type": "module",
     "name": "@masx200/leetcode-test",
     "version": "10.10.0",
-
     "repository": {
         "type": "git",
         "url": "https://github.com/masx200/leetcode-test"
@@ -11,7 +10,7 @@
     "license": "MIT",
     "description": "#### 介绍",
     "scripts": {
-        "format": "prettier --w  *.xml"
+        "format": "prettier --w  *.xml *.ts *.json  *.md"
     },
     "keywords": [],
     "devDependencies": {

retry.ts

@@ -15,7 +15,7 @@ export async function retry<T>(
         retryOnError?:
             | ((error: any) => Promise<boolean>)
             | ((error: any) => boolean);
-    },
+    }
 ) {
     const retryOnError = opts?.retryOnError ?? (() => true);
     const options: Required<RetryOptions> = {
@@ -34,7 +34,7 @@ export async function retry<T>(
         try {
             return await fn();
         } catch (err) {
-            if (!await retryOnError(err)) {
+            if (!(await retryOnError(err))) {
                 throw err;
             }
 

xmake.ts

@@ -6,7 +6,7 @@ import { retry } from "./retry.ts";
 
 async function* findFilesRecursive(
     path: string,
-    name: string,
+    name: string
 ): AsyncGenerator<string, void, unknown> {
     for await (const entry of Deno.readDir(path)) {
         const fullPath = resolve(join(path, entry.name));
@@ -37,7 +37,7 @@ async function RunXmake(
     sdk: string,
     executable: string,
     group: string,
-    mode: string,
+    mode: string
 ) {
     await RunXmakeConfig(file, toolchain, sdk, executable, mode);
     await retry(RunXmakeBuild.bind(null, file, executable, group), {
@@ -50,11 +50,11 @@ async function RunXmake(
                 const cwd = path.dirname(file);
                 const dirtobecreate = path.join(
                     cwd,
-                    path.dirname(filepathmatched),
+                    path.dirname(filepathmatched)
                 );
 
                 console.log(
-                    "Ensures that the directory exists:" + dirtobecreate,
+                    "Ensures that the directory exists:" + dirtobecreate
                 );
                 await ensureDir(dirtobecreate);
                 return true;
@@ -69,7 +69,7 @@ async function RunXmakeConfig(
     toolchain: string,
     sdk: string,
     executable: string,
-    mode: string,
+    mode: string
 ) {
     console.log({ file });
     const cwd = path.dirname(file);
@@ -88,9 +88,10 @@ export async function RunCommandShell(others: string[], cwd?: string) {
 
     const cmd = os === "windows" ? "powershell.exe" : "bash";
 
-    const args = os === "windows"
-        ? ["-command", others.join(" \n ")]
-        : ["-c", others.join(" && ")];
+    const args =
+        os === "windows"
+            ? ["-command", others.join(" \n ")]
+            : ["-c", others.join(" && ")];
 
     console.log(JSON.stringify({ cmd, cwd, args }));
     const command = new Deno.Command(cmd, { cwd: cwd, args });