tina4-nodejs 3.13.90 → 3.13.91

package/CLAUDE.md

@@ -1,10 +1,10 @@
-# CLAUDE.md - AI Developer Guide for tina4-nodejs (v3.13.90)
+# CLAUDE.md - AI Developer Guide for tina4-nodejs (v3.13.91)
 
 > This file helps AI assistants (Claude, Copilot, Cursor, etc.) understand and work on this codebase effectively.
 
 ## What This Project Is
 
-Tina4 for Node.js/TypeScript v3.13.90 - The Intelligent Native Application 4ramework. A convention-over-configuration structural paradigm. The developer writes TypeScript; Tina4 is invisible infrastructure.
+Tina4 for Node.js/TypeScript v3.13.91 - The Intelligent Native Application 4ramework. A convention-over-configuration structural paradigm. The developer writes TypeScript; Tina4 is invisible infrastructure.
 
 The philosophy: zero ceremony, batteries included, file system as source of truth.
 
@@ -1244,7 +1244,7 @@ When adding new features, add a corresponding `test/<feature>.test.ts` file.
 ## v3 Features Summary
 
 - **98 built-in features**, zero third-party dependencies
-- **5,923 tests** passing across 189 files (build + typecheck green)
+- **5,932 tests** passing across 190 files (build + typecheck green)
 - **Race-safe `getNextId()`** with atomic sequence table (`tina4_sequences`) for SQLite/MySQL/MSSQL; PostgreSQL auto-creates sequences
 - **Frond template engine optimizations**: pre-compiled regexes, lazy loop context (copy-on-write), filter chain caching, path split caching, inline common filters (11-15% speedup)
 - **Production server auto-detect**: `npx tina4nodejs serve --production` auto-uses cluster mode

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "tina4-nodejs",
-  "version": "3.13.90",
+  "version": "3.13.91",
   "type": "module",
   "description": "Tina4 for Node.js/TypeScript - 54 built-in features, zero dependencies",
   "keywords": [

package/packages/cli/dist/bin.js

@@ -17938,7 +17938,7 @@ function extractFunctions(source, filePath, root = ".") {
     if (funcName !== null && !NON_FUNCTION_WORDS.has(funcName)) {
       const displayName = funcName === "constructor" && currentClass ? `${currentClass}.constructor` : currentClass !== null && !isTopLevelDecl ? `${currentClass}.${funcName}` : funcName;
       const funcBody = extractFunctionBody(lines, i);
-      const funcLoc = funcBody.split("\n").length;
+      const funcLoc = Math.max(1, countLines(funcBody).loc);
       const complexity = cycloMaticComplexity(funcBody);
       const args = argsStr.split(",").map((a) => a.trim().split(":")[0].split("=")[0].replace("?", "").trim()).filter((a) => a && a !== "this");
       functions.push({
@@ -17954,6 +17954,24 @@ function extractFunctions(source, filePath, root = ".") {
       currentClass = null;
     }
   }
+  return chargeNestedComplexityToTheNestedFunction(functions);
+}
+function chargeNestedComplexityToTheNestedFunction(functions) {
+  if (functions.length < 2) return functions;
+  const lastLine = (f) => f.line + Math.max(1, f.loc) - 1;
+  const contains = (outer, inner) => inner.line > outer.line && lastLine(inner) <= lastLine(outer);
+  const raw = functions.map((f) => f.complexity);
+  functions.forEach((outer, i) => {
+    let subtract = 0;
+    functions.forEach((inner, j) => {
+      if (i === j || !contains(outer, inner)) return;
+      const nestedDeeper = functions.some(
+        (mid, k) => k !== i && k !== j && contains(outer, mid) && contains(mid, inner)
+      );
+      if (!nestedDeeper) subtract += raw[j] - 1;
+    });
+    outer.complexity = Math.max(1, raw[i] - subtract);
+  });
   return functions;
 }
 function extractFunctionBody(lines, startLine) {

package/packages/core/dist/index.js

@@ -17937,7 +17937,7 @@ function extractFunctions(source, filePath, root = ".") {
     if (funcName !== null && !NON_FUNCTION_WORDS.has(funcName)) {
       const displayName = funcName === "constructor" && currentClass ? `${currentClass}.constructor` : currentClass !== null && !isTopLevelDecl ? `${currentClass}.${funcName}` : funcName;
       const funcBody = extractFunctionBody(lines, i);
-      const funcLoc = funcBody.split("\n").length;
+      const funcLoc = Math.max(1, countLines(funcBody).loc);
       const complexity = cycloMaticComplexity(funcBody);
       const args = argsStr.split(",").map((a) => a.trim().split(":")[0].split("=")[0].replace("?", "").trim()).filter((a) => a && a !== "this");
       functions.push({
@@ -17953,6 +17953,24 @@ function extractFunctions(source, filePath, root = ".") {
       currentClass = null;
     }
   }
+  return chargeNestedComplexityToTheNestedFunction(functions);
+}
+function chargeNestedComplexityToTheNestedFunction(functions) {
+  if (functions.length < 2) return functions;
+  const lastLine = (f) => f.line + Math.max(1, f.loc) - 1;
+  const contains = (outer, inner) => inner.line > outer.line && lastLine(inner) <= lastLine(outer);
+  const raw = functions.map((f) => f.complexity);
+  functions.forEach((outer, i) => {
+    let subtract = 0;
+    functions.forEach((inner, j) => {
+      if (i === j || !contains(outer, inner)) return;
+      const nestedDeeper = functions.some(
+        (mid, k) => k !== i && k !== j && contains(outer, mid) && contains(mid, inner)
+      );
+      if (!nestedDeeper) subtract += raw[j] - 1;
+    });
+    outer.complexity = Math.max(1, raw[i] - subtract);
+  });
   return functions;
 }
 function extractFunctionBody(lines, startLine) {