codebase-onboarder 0.6.0 → 1.0.0

package/shared/analyzer/metrics.d.ts

@@ -0,0 +1,20 @@
+export declare function codeStats(source: any, lang?: string): {
+    lines: number;
+    code: number;
+    comment: number;
+    blank: number;
+};
+export declare function complexityOf(source: any, lang: any): number;
+export declare function halsteadMetrics(source: any, lang: any): {
+    n1: number;
+    n2: number;
+    N1: number;
+    N2: number;
+    vocabulary: number;
+    length: number;
+    volume: number;
+    difficulty: number;
+    effort: number;
+};
+export declare function cognitiveComplexity(source: any, lang: any): number;
+export declare function maintainabilityIndex(halstead: any, complexity: any, loc: any): number;

package/shared/analyzer/metrics.js

@@ -1,120 +1,128 @@
 import { blankComments } from './util.js';
-
 const DECISIONS = {
-  javascript: /\b(if|for|while|case|catch|do|else if)\b/g,
-  python: /\b(if|elif|for|while|except)\b/g,
-  go: /\b(if|for|case|go|select)\b/g,
+    javascript: /\b(if|for|while|case|catch|do|else if)\b/g,
+    python: /\b(if|elif|for|while|except)\b/g,
+    go: /\b(if|for|case|go|select)\b/g,
 };
 const GENERIC = /\b(if|elif|for|while|case|catch|except|switch)\b/g;
-
 export function codeStats(source, lang = '') {
-  const lines = String(source).split('\n');
-  let blank = 0;
-  let comment = 0;
-  let code = 0;
-  let inBlock = false;
-  const isHashComment = ['python', 'ruby', 'yaml', 'toml', 'shell', 'bash', 'sh'].includes(lang)
-    || (!lang && (source.includes('#!') || /\b(def|import|class)\b/.test(source)));
-
-  for (const raw of lines) {
-    const l = raw.trim();
-    if (!l) { blank++; continue; }
-    if (inBlock) { comment++; if (l.includes('*/')) inBlock = false; continue; }
-    if (l.startsWith('//') || (isHashComment && l.startsWith('#'))) { comment++; continue; }
-    if (l.startsWith('/*')) { comment++; if (!l.includes('*/')) inBlock = true; continue; }
-    code++;
-  }
-  return { lines: lines.length, code, comment, blank };
+    const lines = String(source).split('\n');
+    let blank = 0;
+    let comment = 0;
+    let code = 0;
+    let inBlock = false;
+    const isHashComment = ['python', 'ruby', 'yaml', 'toml', 'shell', 'bash', 'sh'].includes(lang)
+        || (!lang && (source.includes('#!') || /\b(def|import|class)\b/.test(source)));
+    for (const raw of lines) {
+        const l = raw.trim();
+        if (!l) {
+            blank++;
+            continue;
+        }
+        if (inBlock) {
+            comment++;
+            if (l.includes('*/'))
+                inBlock = false;
+            continue;
+        }
+        if (l.startsWith('//') || (isHashComment && l.startsWith('#'))) {
+            comment++;
+            continue;
+        }
+        if (l.startsWith('/*')) {
+            comment++;
+            if (!l.includes('*/'))
+                inBlock = true;
+            continue;
+        }
+        code++;
+    }
+    return { lines: lines.length, code, comment, blank };
 }
-
 export function complexityOf(source, lang) {
-  const isHash = ['python', 'ruby', 'yaml', 'toml', 'shell'].includes(lang);
-  const clean = blankComments(String(source), { lineChar: isHash ? '#' : '//' });
-  const rx = DECISIONS[lang] || GENERIC;
-  let score = 1;
-  const decisions = clean.match(rx);
-  score += decisions ? decisions.length : 0;
-  const bools = clean.match(/&&|\|\||\?/g); // boolean ops + ternaries
-  score += bools ? bools.length : 0;
-  return score;
+    const isHash = ['python', 'ruby', 'yaml', 'toml', 'shell'].includes(lang);
+    const clean = blankComments(String(source), { lineChar: isHash ? '#' : '//' });
+    const rx = DECISIONS[lang] || GENERIC;
+    let score = 1;
+    const decisions = clean.match(rx);
+    score += decisions ? decisions.length : 0;
+    const bools = clean.match(/&&|\|\||\?/g); // boolean ops + ternaries
+    score += bools ? bools.length : 0;
+    return score;
 }
-
 export function halsteadMetrics(source, lang) {
-  const isHash = ['python', 'ruby', 'yaml', 'toml', 'shell'].includes(lang);
-  const clean = blankComments(String(source), { lineChar: isHash ? '#' : '//' });
-  
-  const ops = ['\+', '-', '\*', '/', '=', '==', '===', '!=', '!==', '<', '>', '<=', '>=', '&&', '\|\|', '!', '%', '\*\*', '\+\+', '--', '\+=', '-=', '\*=', '/=', '=>', '\?\?', '\?\.', '\.\.\.'];
-  const opPattern = new RegExp(ops.map(o => o.replace(/[.*+?^$\\{}()|[\]\\]/g, '\\$&')).join('|'), 'g');
-  
-  const operators = new Set();
-  let N1 = 0;
-  for (const m of clean.matchAll(opPattern)) {
-    operators.add(m[0]);
-    N1++;
-  }
-  const n1 = operators.size;
-
-  const operands = new Set();
-  let N2 = 0;
-  for (const m of clean.matchAll(/\b[a-zA-Z_][a-zA-Z0-9_]*\b|\b\d+\b|['"][^'"]*['"]/g)) {
-    const val = m[0];
-    if (["if", "else", "for", "while", "return", "function", "class", "import", "export", "var", "let", "const", "true", "false", "null"].includes(val)) continue;
-    operands.add(val);
-    N2++;
-  }
-  const n2 = operands.size;
-
-  const vocabulary = n1 + n2;
-  const length = N1 + N2;
-  const volume = vocabulary === 0 ? 0 : length * Math.log2(vocabulary);
-  const difficulty = (n2 === 0 || n1 === 0) ? 0 : (n1 / 2) * (N2 / n2);
-  const effort = difficulty * volume;
-
-  return { n1, n2, N1, N2, vocabulary, length, volume, difficulty, effort };
+    const isHash = ['python', 'ruby', 'yaml', 'toml', 'shell'].includes(lang);
+    const clean = blankComments(String(source), { lineChar: isHash ? '#' : '//' });
+    const ops = ['\+', '-', '\*', '/', '=', '==', '===', '!=', '!==', '<', '>', '<=', '>=', '&&', '\|\|', '!', '%', '\*\*', '\+\+', '--', '\+=', '-=', '\*=', '/=', '=>', '\?\?', '\?\.', '\.\.\.'];
+    const opPattern = new RegExp(ops.map(o => o.replace(/[.*+?^$\\{}()|[\]\\]/g, '\\$&')).join('|'), 'g');
+    const operators = new Set();
+    let N1 = 0;
+    for (const m of clean.matchAll(opPattern)) {
+        operators.add(m[0]);
+        N1++;
+    }
+    const n1 = operators.size;
+    const operands = new Set();
+    let N2 = 0;
+    for (const m of clean.matchAll(/\b[a-zA-Z_][a-zA-Z0-9_]*\b|\b\d+\b|['"][^'"]*['"]/g)) {
+        const val = m[0];
+        if (["if", "else", "for", "while", "return", "function", "class", "import", "export", "var", "let", "const", "true", "false", "null"].includes(val))
+            continue;
+        operands.add(val);
+        N2++;
+    }
+    const n2 = operands.size;
+    const vocabulary = n1 + n2;
+    const length = N1 + N2;
+    const volume = vocabulary === 0 ? 0 : length * Math.log2(vocabulary);
+    const difficulty = (n2 === 0 || n1 === 0) ? 0 : (n1 / 2) * (N2 / n2);
+    const effort = difficulty * volume;
+    return { n1, n2, N1, N2, vocabulary, length, volume, difficulty, effort };
 }
-
 export function cognitiveComplexity(source, lang) {
-  const isHash = ['python', 'ruby', 'yaml', 'toml', 'shell'].includes(lang);
-  const clean = blankComments(String(source), { lineChar: isHash ? '#' : '//' });
-  
-  let score = 0;
-  let nesting = 0;
-  let inSwitch = false;
-
-  const lines = clean.split('\n');
-  for (const line of lines) {
-    const l = line.trim();
-    if (l.includes('{')) {
-      if (/\b(if|for|while|do|switch|catch)\b/.test(l)) {
-        if (/\bswitch\b/.test(l)) {
-          inSwitch = true;
-          score += (1 + nesting);
-          nesting++;
-        } else {
-          score += (1 + nesting);
-          nesting++;
+    const isHash = ['python', 'ruby', 'yaml', 'toml', 'shell'].includes(lang);
+    const clean = blankComments(String(source), { lineChar: isHash ? '#' : '//' });
+    let score = 0;
+    let nesting = 0;
+    let inSwitch = false;
+    const lines = clean.split('\n');
+    for (const line of lines) {
+        const l = line.trim();
+        if (l.includes('{')) {
+            if (/\b(if|for|while|do|switch|catch)\b/.test(l)) {
+                if (/\bswitch\b/.test(l)) {
+                    inSwitch = true;
+                    score += (1 + nesting);
+                    nesting++;
+                }
+                else {
+                    score += (1 + nesting);
+                    nesting++;
+                }
+            }
+            else {
+                nesting++;
+            }
         }
-      } else {
-        nesting++;
-      }
-    }
-    if (l.includes('}')) {
-      nesting = Math.max(0, nesting - 1);
-    }
-    if (!l.includes('{') && /\b(if|else if|for|while|do|catch)\b/.test(l)) {
-        score += (1 + nesting);
-    }
-    if (/\belse\b(?!\s+if)/.test(l)) {
-       score += 1;
+        if (l.includes('}')) {
+            nesting = Math.max(0, nesting - 1);
+        }
+        if (!l.includes('{') && /\b(if|else if|for|while|do|catch)\b/.test(l)) {
+            score += (1 + nesting);
+        }
+        if (/\belse\b(?!\s+if)/.test(l)) {
+            score += 1;
+        }
+        const ops = l.match(/&&|\|\||\?/g);
+        if (ops)
+            score += ops.length;
     }
-    const ops = l.match(/&&|\|\||\?/g);
-    if (ops) score += ops.length;
-  }
-  return score;
+    return score;
 }
-
 export function maintainabilityIndex(halstead, complexity, loc) {
-  if (halstead.volume === 0 || loc === 0) return 100;
-  let MI = (171 - 5.2 * Math.log(halstead.volume) - 0.23 * complexity - 16.2 * Math.log(loc)) * 100 / 171;
-  return Math.max(0, Math.min(100, MI));
+    if (halstead.volume === 0 || loc === 0)
+        return 100;
+    let MI = (171 - 5.2 * Math.log(halstead.volume) - 0.23 * complexity - 16.2 * Math.log(loc)) * 100 / 171;
+    return Math.max(0, Math.min(100, MI));
 }
+//# sourceMappingURL=metrics.js.map

package/shared/analyzer/metrics.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics.js","sourceRoot":"","sources":["../../src/shared/analyzer/metrics.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAE1C,MAAM,SAAS,GAAG;IAChB,UAAU,EAAE,2CAA2C;IACvD,MAAM,EAAE,iCAAiC;IACzC,EAAE,EAAE,8BAA8B;CACnC,CAAC;AACF,MAAM,OAAO,GAAG,mDAAmD,CAAC;AAEpE,MAAM,UAAU,SAAS,CAAC,MAAM,EAAE,IAAI,GAAG,EAAE;IACzC,MAAM,KAAK,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,MAAM,aAAa,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;WACzF,CAAC,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,wBAAwB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAEjF,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,EAAE,CAAC;YAAC,KAAK,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC;QAC9B,IAAI,OAAO,EAAE,CAAC;YAAC,OAAO,EAAE,CAAC;YAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,OAAO,GAAG,KAAK,CAAC;YAAC,SAAS;QAAC,CAAC;QAC5E,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAAC,OAAO,EAAE,CAAC;YAAC,SAAS;QAAC,CAAC;QACxF,IAAI,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAAC,OAAO,EAAE,CAAC;YAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC;gBAAE,OAAO,GAAG,IAAI,CAAC;YAAC,SAAS;QAAC,CAAC;QACvF,IAAI,EAAE,CAAC;IACT,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;AACvD,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,MAAM,EAAE,IAAI;IACvC,MAAM,MAAM,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC1E,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC/E,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC;IACtC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAClC,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,0BAA0B;IACpE,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAClC,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,MAAM,EAAE,IAAI;IAC1C,MAAM,MAAM,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC1E,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAE/E,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;IAChM,MAAM,SAAS,GAAG,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,uBAAuB,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;IAEtG,MAAM,SAAS,GAAG,IAAI,GAAG,EAAE,CAAC;IAC5B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1C,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,EAAE,EAAE,CAAC;IACP,CAAC;IACD,MAAM,EAAE,GAAG,SAAS,CAAC,IAAI,CAAC;IAE1B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC;IAC3B,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,oDAAoD,CAAC,EAAE,CAAC;QACrF,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC;YAAE,SAAS;QAC9J,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClB,EAAE,EAAE,CAAC;IACP,CAAC;IACD,MAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC;IAEzB,MAAM,UAAU,GAAG,EAAE,GAAG,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,CAAC;IACvB,MAAM,MAAM,GAAG,UAAU,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACrE,MAAM,UAAU,GAAG,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;IACrE,MAAM,MAAM,GAAG,UAAU,GAAG,MAAM,CAAC;IAEnC,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC;AAC5E,CAAC;AAED,MAAM,UAAU,mBAAmB,CAAC,MAAM,EAAE,IAAI;IAC9C,MAAM,MAAM,GAAG,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC1E,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAE/E,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,QAAQ,GAAG,KAAK,CAAC;IAErB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QACtB,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,IAAI,oCAAoC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;gBACjD,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;oBACzB,QAAQ,GAAG,IAAI,CAAC;oBAChB,KAAK,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;oBACvB,OAAO,EAAE,CAAC;gBACZ,CAAC;qBAAM,CAAC;oBACN,KAAK,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;oBACvB,OAAO,EAAE,CAAC;gBACZ,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,OAAO,EAAE,CAAC;YACZ,CAAC;QACH,CAAC;QACD,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACpB,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;QACrC,CAAC;QACD,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,qCAAqC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YACpE,KAAK,IAAI,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,mBAAmB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/B,KAAK,IAAI,CAAC,CAAC;QACd,CAAC;QACD,MAAM,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QACnC,IAAI,GAAG;YAAE,KAAK,IAAI,GAAG,CAAC,MAAM,CAAC;IAC/B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,oBAAoB,CAAC,QAAQ,EAAE,UAAU,EAAE,GAAG;IAC5D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IACnD,IAAI,EAAE,GAAG,CAAC,GAAG,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,IAAI,GAAG,UAAU,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;IACxG,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;AACxC,CAAC","sourcesContent":["import { blankComments } from './util.js';\n\nconst DECISIONS = {\n  javascript: /\\b(if|for|while|case|catch|do|else if)\\b/g,\n  python: /\\b(if|elif|for|while|except)\\b/g,\n  go: /\\b(if|for|case|go|select)\\b/g,\n};\nconst GENERIC = /\\b(if|elif|for|while|case|catch|except|switch)\\b/g;\n\nexport function codeStats(source, lang = '') {\n  const lines = String(source).split('\\n');\n  let blank = 0;\n  let comment = 0;\n  let code = 0;\n  let inBlock = false;\n  const isHashComment = ['python', 'ruby', 'yaml', 'toml', 'shell', 'bash', 'sh'].includes(lang)\n    || (!lang && (source.includes('#!') || /\\b(def|import|class)\\b/.test(source)));\n\n  for (const raw of lines) {\n    const l = raw.trim();\n    if (!l) { blank++; continue; }\n    if (inBlock) { comment++; if (l.includes('*/')) inBlock = false; continue; }\n    if (l.startsWith('//') || (isHashComment && l.startsWith('#'))) { comment++; continue; }\n    if (l.startsWith('/*')) { comment++; if (!l.includes('*/')) inBlock = true; continue; }\n    code++;\n  }\n  return { lines: lines.length, code, comment, blank };\n}\n\nexport function complexityOf(source, lang) {\n  const isHash = ['python', 'ruby', 'yaml', 'toml', 'shell'].includes(lang);\n  const clean = blankComments(String(source), { lineChar: isHash ? '#' : '//' });\n  const rx = DECISIONS[lang] || GENERIC;\n  let score = 1;\n  const decisions = clean.match(rx);\n  score += decisions ? decisions.length : 0;\n  const bools = clean.match(/&&|\\|\\||\\?/g); // boolean ops + ternaries\n  score += bools ? bools.length : 0;\n  return score;\n}\n\nexport function halsteadMetrics(source, lang) {\n  const isHash = ['python', 'ruby', 'yaml', 'toml', 'shell'].includes(lang);\n  const clean = blankComments(String(source), { lineChar: isHash ? '#' : '//' });\n  \n  const ops = ['\\+', '-', '\\*', '/', '=', '==', '===', '!=', '!==', '<', '>', '<=', '>=', '&&', '\\|\\|', '!', '%', '\\*\\*', '\\+\\+', '--', '\\+=', '-=', '\\*=', '/=', '=>', '\\?\\?', '\\?\\.', '\\.\\.\\.'];\n  const opPattern = new RegExp(ops.map(o => o.replace(/[.*+?^$\\\\{}()|[\\]\\\\]/g, '\\\\$&')).join('|'), 'g');\n  \n  const operators = new Set();\n  let N1 = 0;\n  for (const m of clean.matchAll(opPattern)) {\n    operators.add(m[0]);\n    N1++;\n  }\n  const n1 = operators.size;\n\n  const operands = new Set();\n  let N2 = 0;\n  for (const m of clean.matchAll(/\\b[a-zA-Z_][a-zA-Z0-9_]*\\b|\\b\\d+\\b|['\"][^'\"]*['\"]/g)) {\n    const val = m[0];\n    if ([\"if\", \"else\", \"for\", \"while\", \"return\", \"function\", \"class\", \"import\", \"export\", \"var\", \"let\", \"const\", \"true\", \"false\", \"null\"].includes(val)) continue;\n    operands.add(val);\n    N2++;\n  }\n  const n2 = operands.size;\n\n  const vocabulary = n1 + n2;\n  const length = N1 + N2;\n  const volume = vocabulary === 0 ? 0 : length * Math.log2(vocabulary);\n  const difficulty = (n2 === 0 || n1 === 0) ? 0 : (n1 / 2) * (N2 / n2);\n  const effort = difficulty * volume;\n\n  return { n1, n2, N1, N2, vocabulary, length, volume, difficulty, effort };\n}\n\nexport function cognitiveComplexity(source, lang) {\n  const isHash = ['python', 'ruby', 'yaml', 'toml', 'shell'].includes(lang);\n  const clean = blankComments(String(source), { lineChar: isHash ? '#' : '//' });\n  \n  let score = 0;\n  let nesting = 0;\n  let inSwitch = false;\n\n  const lines = clean.split('\\n');\n  for (const line of lines) {\n    const l = line.trim();\n    if (l.includes('{')) {\n      if (/\\b(if|for|while|do|switch|catch)\\b/.test(l)) {\n        if (/\\bswitch\\b/.test(l)) {\n          inSwitch = true;\n          score += (1 + nesting);\n          nesting++;\n        } else {\n          score += (1 + nesting);\n          nesting++;\n        }\n      } else {\n        nesting++;\n      }\n    }\n    if (l.includes('}')) {\n      nesting = Math.max(0, nesting - 1);\n    }\n    if (!l.includes('{') && /\\b(if|else if|for|while|do|catch)\\b/.test(l)) {\n        score += (1 + nesting);\n    }\n    if (/\\belse\\b(?!\\s+if)/.test(l)) {\n       score += 1;\n    }\n    const ops = l.match(/&&|\\|\\||\\?/g);\n    if (ops) score += ops.length;\n  }\n  return score;\n}\n\nexport function maintainabilityIndex(halstead, complexity, loc) {\n  if (halstead.volume === 0 || loc === 0) return 100;\n  let MI = (171 - 5.2 * Math.log(halstead.volume) - 0.23 * complexity - 16.2 * Math.log(loc)) * 100 / 171;\n  return Math.max(0, Math.min(100, MI));\n}\n"]}

package/shared/analyzer/pathUtil.d.ts

@@ -0,0 +1,10 @@
+export declare function normalize(path: any): string;
+export declare function joinPath(...parts: any[]): string;
+export declare function dirOf(path: any): any;
+export declare function baseName(path: any): any;
+export declare function extOf(path: any): any;
+export declare function depthOf(path: any): any;
+export declare function topFolderOf(path: any): any;
+export declare const TEST_PATH_RE: RegExp;
+export declare function isTestPath(path: any): boolean;
+export declare function pathFilter({ text, showTests }?: Record<string, any>): (p: any) => any;

package/shared/analyzer/pathUtil.js

@@ -1,50 +1,44 @@
 // Repo-relative path helpers. Everything here is POSIX-style with forward
 // slashes, no leading slash, no trailing slash. Both file source adapters
 // normalize to this convention before the analyzer sees a path.
-
 export function normalize(path) {
-  const out = [];
-  for (const part of String(path).split('/')) {
-    if (!part || part === '.') continue;
-    if (part === '..') {
-      out.pop();
-      continue;
+    const out = [];
+    for (const part of String(path).split('/')) {
+        if (!part || part === '.')
+            continue;
+        if (part === '..') {
+            out.pop();
+            continue;
+        }
+        out.push(part);
     }
-    out.push(part);
-  }
-  return out.join('/');
+    return out.join('/');
 }
-
 export function joinPath(...parts) {
-  return normalize(parts.filter(Boolean).join('/'));
+    return normalize(parts.filter(Boolean).join('/'));
 }
-
 export function dirOf(path) {
-  const i = path.lastIndexOf('/');
-  return i === -1 ? '' : path.slice(0, i);
+    const i = path.lastIndexOf('/');
+    return i === -1 ? '' : path.slice(0, i);
 }
-
 export function baseName(path) {
-  const i = path.lastIndexOf('/');
-  return path.slice(i + 1);
+    const i = path.lastIndexOf('/');
+    return path.slice(i + 1);
 }
-
 export function extOf(path) {
-  const base = baseName(path);
-  const i = base.lastIndexOf('.');
-  return i <= 0 ? '' : base.slice(i).toLowerCase();
+    const base = baseName(path);
+    const i = base.lastIndexOf('.');
+    return i <= 0 ? '' : base.slice(i).toLowerCase();
 }
-
 export function depthOf(path) {
-  if (!path) return 0;
-  return path.split('/').length;
+    if (!path)
+        return 0;
+    return path.split('/').length;
 }
-
 export function topFolderOf(path) {
-  const i = path.indexOf('/');
-  return i === -1 ? '(root)' : path.slice(0, i);
+    const i = path.indexOf('/');
+    return i === -1 ? '(root)' : path.slice(0, i);
 }
-
 // Does this path look like a test? Naming, not content — there is no reliable
 // way to tell from a path alone, and every repo names them differently. The
 // alternatives are bounded by the separators: `foo.test.js`, `foo_spec.rb`,
@@ -52,18 +46,18 @@ export function topFolderOf(path) {
 // (`contest.js`, `latest.md`, `protester.go`) must not match, which is what the
 // separator groups on either side are for.
 export const TEST_PATH_RE = /(^|[._\-/])(test|tests|spec|specs|__tests__|__test__)([._\-/]|$)/i;
-
 export function isTestPath(path) {
-  return TEST_PATH_RE.test(path);
+    return TEST_PATH_RE.test(path);
 }
-
 // The stage filters, as a predicate over paths — or null when nothing is being
 // filtered at all. Null rather than `() => true` on purpose: every diagram
 // builder takes an `include` option and skips the whole filtering pass when it is
 // absent, so the common case costs nothing. Callers must keep treating a missing
 // filter as "everything", not as "nothing".
 export function pathFilter({ text = '', showTests = true } = {}) {
-  const needle = text.trim().toLowerCase();
-  if (!needle && showTests) return null;
-  return (p) => (showTests || !isTestPath(p)) && (!needle || p.toLowerCase().includes(needle));
+    const needle = text.trim().toLowerCase();
+    if (!needle && showTests)
+        return null;
+    return (p) => (showTests || !isTestPath(p)) && (!needle || p.toLowerCase().includes(needle));
 }
+//# sourceMappingURL=pathUtil.js.map

package/shared/analyzer/pathUtil.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pathUtil.js","sourceRoot":"","sources":["../../src/shared/analyzer/pathUtil.ts"],"names":[],"mappings":"AAAA,0EAA0E;AAC1E,0EAA0E;AAC1E,gEAAgE;AAEhE,MAAM,UAAU,SAAS,CAAC,IAAI;IAC5B,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,IAAI,IAAI,IAAI,KAAK,GAAG;YAAE,SAAS;QACpC,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,GAAG,CAAC,GAAG,EAAE,CAAC;YACV,SAAS;QACX,CAAC;QACD,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjB,CAAC;IACD,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACvB,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,GAAG,KAAK;IAC/B,OAAO,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;AACpD,CAAC;AAED,MAAM,UAAU,KAAK,CAAC,IAAI;IACxB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAChC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1C,CAAC;AAED,MAAM,UAAU,QAAQ,CAAC,IAAI;IAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAChC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AAC3B,CAAC;AAED,MAAM,UAAU,KAAK,CAAC,IAAI;IACxB,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;IAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAChC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;AACnD,CAAC;AAED,MAAM,UAAU,OAAO,CAAC,IAAI;IAC1B,IAAI,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC;IACpB,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;AAChC,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,IAAI;IAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC5B,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AAChD,CAAC;AAED,8EAA8E;AAC9E,4EAA4E;AAC5E,4EAA4E;AAC5E,yEAAyE;AACzE,gFAAgF;AAChF,2CAA2C;AAC3C,MAAM,CAAC,MAAM,YAAY,GAAG,mEAAmE,CAAC;AAEhG,MAAM,UAAU,UAAU,CAAC,IAAI;IAC7B,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACjC,CAAC;AAED,+EAA+E;AAC/E,2EAA2E;AAC3E,kFAAkF;AAClF,iFAAiF;AACjF,4CAA4C;AAC5C,MAAM,UAAU,UAAU,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,SAAS,GAAG,IAAI,EAAE,GAAwB,EAAE;IAClF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACzC,IAAI,CAAC,MAAM,IAAI,SAAS;QAAE,OAAO,IAAI,CAAC;IACtC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,SAAS,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;AAC/F,CAAC","sourcesContent":["// Repo-relative path helpers. Everything here is POSIX-style with forward\n// slashes, no leading slash, no trailing slash. Both file source adapters\n// normalize to this convention before the analyzer sees a path.\n\nexport function normalize(path) {\n  const out = [];\n  for (const part of String(path).split('/')) {\n    if (!part || part === '.') continue;\n    if (part === '..') {\n      out.pop();\n      continue;\n    }\n    out.push(part);\n  }\n  return out.join('/');\n}\n\nexport function joinPath(...parts) {\n  return normalize(parts.filter(Boolean).join('/'));\n}\n\nexport function dirOf(path) {\n  const i = path.lastIndexOf('/');\n  return i === -1 ? '' : path.slice(0, i);\n}\n\nexport function baseName(path) {\n  const i = path.lastIndexOf('/');\n  return path.slice(i + 1);\n}\n\nexport function extOf(path) {\n  const base = baseName(path);\n  const i = base.lastIndexOf('.');\n  return i <= 0 ? '' : base.slice(i).toLowerCase();\n}\n\nexport function depthOf(path) {\n  if (!path) return 0;\n  return path.split('/').length;\n}\n\nexport function topFolderOf(path) {\n  const i = path.indexOf('/');\n  return i === -1 ? '(root)' : path.slice(0, i);\n}\n\n// Does this path look like a test? Naming, not content — there is no reliable\n// way to tell from a path alone, and every repo names them differently. The\n// alternatives are bounded by the separators: `foo.test.js`, `foo_spec.rb`,\n// `tests/foo.py`, `__tests__/foo.jsx`. A word merely *containing* \"test\"\n// (`contest.js`, `latest.md`, `protester.go`) must not match, which is what the\n// separator groups on either side are for.\nexport const TEST_PATH_RE = /(^|[._\\-/])(test|tests|spec|specs|__tests__|__test__)([._\\-/]|$)/i;\n\nexport function isTestPath(path) {\n  return TEST_PATH_RE.test(path);\n}\n\n// The stage filters, as a predicate over paths — or null when nothing is being\n// filtered at all. Null rather than `() => true` on purpose: every diagram\n// builder takes an `include` option and skips the whole filtering pass when it is\n// absent, so the common case costs nothing. Callers must keep treating a missing\n// filter as \"everything\", not as \"nothing\".\nexport function pathFilter({ text = '', showTests = true }: Record<string, any> = {}) {\n  const needle = text.trim().toLowerCase();\n  if (!needle && showTests) return null;\n  return (p) => (showTests || !isTestPath(p)) && (!needle || p.toLowerCase().includes(needle));\n}\n"]}

package/shared/analyzer/patterns.d.ts

@@ -0,0 +1,11 @@
+export declare function computeLayers(scan: any, facts: any): {
+    layers: any[];
+    unreachable: any;
+    seeds: any;
+};
+export declare function detectPatterns(scan: any, facts: any, manifest: any, layersInfo: any): any[];
+export declare function couplingMatrix(scan: any, facts: any, maxFolders?: number): {
+    folders: any[];
+    counts: Map<any, any>;
+    max: number;
+};