refactor: コードの整形と不要な空行を削除

Author: ysk8hori

src/cli/entry.ts

@@ -62,7 +62,10 @@ program
     'Specify the relative path to the config file (from cwd or specified by -d, --dir). Default is .tsgrc.json.',
   )
   .option('--vue', '(experimental) Enable Vue.js support')
-  .option('--stdout', 'Output both dependency graph (Mermaid) and code metrics (JSON) to stdout');
+  .option(
+    '--stdout',
+    'Output both dependency graph (Mermaid) and code metrics (JSON) to stdout',
+  );
 program.parse();
 
 const opt = program.opts<OptionValues>();

src/feature/graph/utils.ts

@@ -37,27 +37,34 @@ export function updateChangeStatusFromDiff(base: Graph, head: Graph): void {
 function updateNodeChangeStatus(baseNodes: Node[], headNodes: Node[]): void {
   // Mark nodes as deleted if they exist in base but not in head
   baseNodes.forEach(baseNode => {
-    const existsInHead = headNodes.some(headNode => isSameNode(baseNode, headNode));
+    const existsInHead = headNodes.some(headNode =>
+      isSameNode(baseNode, headNode),
+    );
     if (!existsInHead) {
       baseNode.changeStatus = 'deleted';
     }
   });
 
   // Mark nodes as created if they exist in head but not in base
   headNodes.forEach(headNode => {
-    const existsInBase = baseNodes.some(baseNode => isSameNode(headNode, baseNode));
+    const existsInBase = baseNodes.some(baseNode =>
+      isSameNode(headNode, baseNode),
+    );
     if (!existsInBase) {
       headNode.changeStatus = 'created';
     }
   });
 }
 
-function updateRelationChangeStatus(baseRelations: Relation[], headRelations: Relation[]): void {
+function updateRelationChangeStatus(
+  baseRelations: Relation[],
+  headRelations: Relation[],
+): void {
   // Mark relations as deleted if they exist in base but not in head
   baseRelations.forEach(baseRelation => {
     if (baseRelation.kind === 'depends_on') {
-      const existsInHead = headRelations.some(headRelation => 
-        isSameRelation(baseRelation, headRelation)
+      const existsInHead = headRelations.some(headRelation =>
+        isSameRelation(baseRelation, headRelation),
       );
       if (!existsInHead) {
         baseRelation.changeStatus = 'deleted';
@@ -68,8 +75,8 @@ function updateRelationChangeStatus(baseRelations: Relation[], headRelations: Re
   // Mark relations as created if they exist in head but not in base
   headRelations.forEach(headRelation => {
     if (headRelation.kind === 'depends_on') {
-      const existsInBase = baseRelations.some(baseRelation => 
-        isSameRelation(headRelation, baseRelation)
+      const existsInBase = baseRelations.some(baseRelation =>
+        isSameRelation(headRelation, baseRelation),
       );
       if (!existsInBase) {
         headRelation.changeStatus = 'created';

src/feature/mermaid/directoryTreeBuilder.ts

@@ -99,4 +99,4 @@ function buildDirectoryTree(dirAndNodes: DirAndNodes[]): DirAndNodesTree[] {
     item => item.dirHierarchy.length === 1,
   );
   return rootDirectories.flatMap(buildRecursive);
-}
+}

src/feature/mermaid/mermaidUtils.ts

@@ -9,4 +9,4 @@ export function fileNameToMermaidId(fileName: string): string {
 
 export function fileNameToMermaidName(fileName: string): string {
   return fileName.split(/"/).join('//');
-}
+}

src/feature/mermaid/mermaidWriter.ts

@@ -180,4 +180,4 @@ function writeChildGraphs(
 
 function writeSubgraphEnd(write: (arg: string) => void, currentIndent: string) {
   write(`${currentIndent}end\n`);
-}
+}

src/usecase/generateTsg/index.ts

@@ -66,12 +66,12 @@ export async function generateTsg(
   const graph = renameGraph
     ? renameGraph(refineGraph(fullGraph))
     : refineGraph(fullGraph);
-  
+
   // Enable metrics automatically for --stdout option
-  const effectiveOptions = commandOptions.stdout 
+  const effectiveOptions = commandOptions.stdout
     ? { ...commandOptions, metrics: true }
     : commandOptions;
-    
+
   const metrics: CodeMetrics[] = calculateCodeMetrics(
     effectiveOptions,
     traverser,

src/usecase/generateTsg/writeForAiData.ts

@@ -26,24 +26,22 @@ export function writeForAiData(
 ): void {
   // Dependency Graph section
   process.stdout.write('=== DEPENDENCY GRAPH ===\n');
-  mermaidify(
-    (str: string) => process.stdout.write(str),
-    graph,
-    options,
-  );
-  
+  mermaidify((str: string) => process.stdout.write(str), graph, options);
+
   // Code Metrics section
   process.stdout.write('\n=== CODE METRICS ===\n');
-  
+
   // Convert metrics to AI-friendly format
   const aiMetrics: AiMetrics[] = metrics.map(metric => ({
     filePath: metric.filePath,
-    maintainabilityIndex: Math.round(
-      (metric.scores.find(s => s.name === 'Maintainability Index')?.value ?? 0) * 100
-    ) / 100,
-    cyclomaticComplexity: 
+    maintainabilityIndex:
+      Math.round(
+        (metric.scores.find(s => s.name === 'Maintainability Index')?.value ??
+          0) * 100,
+      ) / 100,
+    cyclomaticComplexity:
       metric.scores.find(s => s.name === 'Cyclomatic Complexity')?.value ?? 0,
-    cognitiveComplexity: 
+    cognitiveComplexity:
       metric.scores.find(s => s.name === 'Cognitive Complexity')?.value ?? 0,
   }));
 
@@ -57,4 +55,4 @@ export function writeForAiData(
   };
 
   process.stdout.write(JSON.stringify(aiOutput, null, 2));
-}
+}