[{"_1":2,"_176":-5,"_177":-5},"loaderData",{"_3":4,"_93":94},"root",{"_5":6,"_36":37,"_66":67},"ctx",{"_7":8,"_23":-5,"_24":25,"_26":27,"_28":20,"_29":20,"_30":20,"_31":-5,"_32":33,"_34":20,"_35":20},"auth",{"_9":-5,"_10":-5,"_11":-5,"_12":-5,"_13":-5,"_14":-5,"_15":-5,"_16":-5,"_17":-5,"_18":-5,"_19":20,"_21":22},"sessionClaims","sessionId","sessionStatus","userId","actor","orgId","orgRole","orgSlug","orgPermissions","factorVerificationAge","isAuthenticated",false,"tokenType","session_token","user","preferencesKeybindings","default","preferencesTheme","light","preferencesFixers","preferencesCopilot","preferencesSelectionAi","preferencesChatPanelState","notificationCount",0,"flagDenols","isTeamOrgMember","ENV",{"_38":39,"_40":41,"_42":43,"_44":45,"_46":47,"_48":49,"_50":51,"_52":53,"_54":55,"_56":57,"_58":59,"_60":61,"_62":63,"_64":65},"REACT_APP_SENTRY_DSN","https://586020d86f05489db63a554690acf1e9@o1398359.ingest.sentry.io/6724499","VAL_RUNTIME_NAME","prod","RENDER_GIT_COMMIT","6050acf0705e6826bb1b68e27572c5b8979c5bd9","RENDER_GIT_BRANCH","main","CLERK_PUBLISHABLE_KEY","pk_live_Y2xlcmsudmFsLnRvd24k","POSTHOG_API_TOKEN","phc_nmoyuAkStEZuUp69rYlg1DZgrIt19Gx0Y4Hwf8tGgJP","POSTHOG_API_HOST","https://wart.val.town","WEB_API_TEMPLATE","https://{val}.web.val.run","APP_URL","https://www.val.town","MODULE_URL","https://esm.town","VANITY_WEB_API_TEMPLATE","https://{label}.val.run/","DENOLS_URL","https://lsp.val.town","NODE_ENV","production","API_URL","https://api.val.town","clerkState",{"_68":69},"__internal_clerk_state",{"_70":71,"_72":47,"_73":74,"_75":74,"_76":20,"_77":74,"_78":74,"_79":74,"_80":74,"_81":82,"_91":20,"_92":20},"__clerk_ssr_state",{"_21":22,"_9":-5,"_10":-5,"_11":-5,"_12":-5,"_13":-5,"_14":-5,"_15":-5,"_16":-5,"_17":-5,"_18":-5,"_19":20},"__publishableKey","__proxyUrl","","__domain","__isSatellite","__signInUrl","__signUpUrl","__afterSignInUrl","__afterSignUpUrl","__clerk_debug",{"_83":20,"_19":20,"_84":74,"_85":86,"_87":74,"_88":47,"_89":20,"_90":74},"isSignedIn","proxyUrl","reason","session-token-and-uat-missing","message","publishableKey","isSatellite","domain","__telemetryDisabled","__telemetryDebug","routes/embed.x.$handle.$name.$",{"_95":96,"_97":98,"_99":100,"_101":102,"_153":154,"_173":174,"_175":-5},"handle","ziggyware","name","CodeUtilities","path","CodeUtilities9.ts","project",{"_103":104,"_97":98,"_105":106,"_107":-5,"_108":20,"_109":110,"_111":-5,"_112":-5,"_12":113,"_114":-5,"_115":20,"_116":-5,"_117":-5,"_118":33,"_14":119,"_120":-5,"_121":-5,"_122":123,"_124":123,"_125":126,"_127":126,"_128":126,"_129":123,"_130":123,"_23":131,"_134":135,"_139":140,"_152":20},"id","06febd26-f8ea-11f0-a7ae-42dde27851f2","createdAt",["D",1769234447182],"deletedAt","legacyEnvVars","privacy","public","description","imageUrl","2c6d46b0-54dd-11f0-a86c-6fbc2b29331a","pinnedFileId","pinPreview","pinMigrated","screenshotVersion","likeCount","850db142-aa5e-4914-bceb-1e2e085ae4c5","tursoName","tursoHostname","userPerm","r","valPerm","blobPerm","rw","emailPerm","sqlitePerm","projectPerm","telemetryPerm",{"_95":96,"_132":133},"profileImageUrl","https://img.clerk.com/eyJ0eXBlIjoicHJveHkiLCJzcmMiOiJodHRwczovL2ltYWdlcy5jbGVyay5kZXYvb2F1dGhfZ2l0aHViL2ltZ18yekJHRDE5SGVoUHUzUENQaXY2MTRkT3h0cncifQ","org",{"_95":96,"_136":133,"_12":113,"_137":138},"avatar","tier","free","branch",{"_141":142,"_97":45,"_103":143,"_144":104,"_145":-5,"_146":-5,"_147":-5,"_148":-5,"_149":-5,"_150":98,"_151":96},"version",343,"06ffcbbc-f8ea-11f0-a7ae-42dde27851f2","projectId","forkedBranchId","forkedBranchVersion","forkedProjectPrivacy","forkedProjectId","forkedProjectOrgId","projectName","userHandle","isOwned","file",{"_103":155,"_97":100,"_156":157,"_158":-5,"_159":143,"_160":161,"_162":163,"_105":164,"_141":165,"_166":167,"_168":169,"_170":20,"_171":-5,"_99":172},"ec3ea852-fee3-11f0-ab1f-42dde27851f2","fileId","a5367582-fe36-11f0-9ebb-42dde27851f2","parentId","branchId","branchVersion",141,"latest",true,["D",1769891532291],26,"fileType","script","content","//\nimport { Enumerable, List, Dictionary, HashSet, KeyValuePair } from \"./System.Collections.Generic9.ts\";\n \n/** Represents a text coordinate in a source file */\nexport interface SourceLocation {\n Line: number;\n Char: number;\n Offset: number;\n}\n\n/** Represents a code definition (Class, Function, etc.) */\nexport interface Definition {\n Name: string;\n Kind: string;\n FileName: string;\n Modifiers: List;\n Start: SourceLocation;\n End: SourceLocation;\n}\n\n// --- Enriched data structure for advanced analysis ---\n// We extend the base Definition interface to include richer details.\nexport interface EnhancedDefinition extends Definition {\n parameters: List;\n metrics: {\n lineCount: number;\n complexity: number;\n };\n children: List;\n}\n\n\n\n/** Represents a lexical token (String, Comment, or Logic) */\nexport interface Token {\n Type: \"string\" | \"comment\" | \"logic\";\n Value: string;\n Raw?: string;\n Start: number;\n IsClosed: boolean;\n Quote?: string;\n}\n\n/** Represents a segment of a Markdown file */\nexport interface Segment {\n Type: \"prose\" | \"code\";\n Lang: string | null;\n Value: string;\n Start: number;\n IsClosed: boolean;\n SubTokens?: Enumerable;\n}\n\nexport class CodeValidator {\n /** List of supported languages for code block detection */\n private static readonly Langs = new HashSet([\n \"visualbasic\", \"javascript\", \"powershell\", \"processing\", \"purescript\",\n \"typescript\", \"dockerfile\", \"hscript\", \"makefile\", \"markdown\", \"protobuf\",\n \"smalltalk\", \"solidity\", \"terraform\", \"asciidoc\", \"arduino\", \"clojure\",\n \"crystal\", \"elixir\", \"erlang\", \"fsharp\", \"graphql\", \"haskell\", \"verilog\",\n \"wolfram\", \"csharp\", \"golang\", \"kotlin\", \"ocaml\", \"puppet\", \"scheme\",\n \"xquery\", \"batch\", \"bicep\", \"julia\", \"latex\", \"shell\", \"swift\", \"wasm\",\n \"adoc\", \"bash\", \"dart\", \"fish\", \"hcl\", \"html\", \"java\", \"json\", \"lisp\",\n \"nasm\", \"nix\", \"perl\", \"proto\", \"purs\", \"raku\", \"rust\", \"sass\", \"scss\",\n \"tsx\", \"vhdl\", \"yaml\", \"zig\", \"asm\", \"bat\", \"clj\", \"cmd\", \"cpp\", \"css\",\n \"csv\", \"cxx\", \"hpp\", \"ini\", \"mdx\", \"php\", \"pwn\", \"rst\", \"sql\", \"tsv\",\n \"vba\", \"vbs\", \"xml\", \"yml\", \"cs\", \"ex\", \"fs\", \"hs\", \"hy\", \"jl\", \"js\",\n \"kt\", \"md\", \"pl\", \"ps1\", \"rb\", \"rs\", \"sh\", \"st\", \"tf\", \"ts\", \"vb\", \"wl\", \"xq\",\n \"c\", \"d\", \"h\", \"r\", \"v\"\n ]);\n\n /** Analyzes document for structural integrity (unclosed blocks/tokens) */\n public static Analyze(text: string = \"\") {\n const segments = this.ParseMarkdown(text);\n\n const firstError = segments\n .Where(s => !s.IsClosed || (s.SubTokens && s.SubTokens.Any(t => !t.IsClosed)))\n .Select(s => {\n const type = !s.IsClosed ? \"markdown_block\" : \"js_syntax\";\n return { Type: type, Line: this.GetLineCount(text, s.Start) };\n })\n .FirstOrDefault();\n\n return {\n Segments: segments,\n IsSafe: firstError === null,\n Error: firstError\n };\n }\n\n /** Deep Lexer for JS/TS logic (including strings and comments) */\n public static LexJS(code: string): Enumerable {\n const tokens = new List();\n let cursor = 0;\n\n while (cursor < code.length) {\n const char = code[cursor];\n const next = code[cursor + 1];\n\n // 1. Strings (single quotes, double quotes, backticks with interpolation)\n if (char === \"'\" || char === '\"' || char === '`') {\n const str = this.ConsumeString(code, cursor);\n tokens.Add(str);\n cursor += str.Raw!.length;\n continue;\n }\n\n // 2. Comments (line // and block /* */)\n if (char === '/' && (next === '/' || next === '*')) {\n const isBlock = next === '*';\n const startIdx = cursor;\n let endIdx = -1;\n\n if (isBlock) {\n endIdx = code.indexOf('*/', startIdx + 2);\n if (endIdx !== -1) endIdx += 2; // Include '*/' in the value length\n } else { // Line comment //\n endIdx = code.indexOf('\\n', startIdx + 2);\n }\n\n // If comment is unclosed, set end index to end of code\n const isClosed = endIdx !== -1;\n if (!isClosed) endIdx = code.length;\n\n tokens.Add({\n Type: \"comment\",\n Value: code.slice(startIdx, endIdx),\n Start: startIdx,\n IsClosed: isClosed || !isBlock // Line comments are always closed by EOL/EOF\n });\n cursor = endIdx;\n continue;\n }\n\n // 3. Logic (everything else)\n const logicStart = cursor;\n while (cursor < code.length &&\n code[cursor] !== \"'\" && code[cursor] !== '\"' && code[cursor] !== '`' &&\n !(code[cursor] === '/' && (code[cursor+1] === '/' || code[cursor+1] === '*'))) {\n cursor++;\n }\n if (cursor > logicStart) {\n tokens.Add({\n Type: \"logic\",\n Value: code.slice(logicStart, cursor),\n Start: logicStart,\n IsClosed: true\n });\n }\n }\n return tokens;\n }\n\n /** Parses Markdown code blocks and prose segments */\n private static ParseMarkdown(text: string): Enumerable {\n const segments = new List();\n let cursor = 0;\n\n while (cursor < text.length) {\n const startIdx = text.indexOf('```', cursor);\n if (startIdx === -1) {\n segments.Add({ Type: \"prose\", Lang: null, Value: text.slice(cursor), Start: cursor, IsClosed: true });\n break;\n }\n\n if (startIdx > cursor) {\n segments.Add({ Type: \"prose\", Lang: null, Value: text.slice(cursor, startIdx), Start: cursor, IsClosed: true });\n }\n\n let contentStart = startIdx + 3;\n let lang: string | null = null;\n const lineEnd = text.indexOf('\\n', contentStart);\n const header = text.slice(contentStart, lineEnd !== -1 ? lineEnd : contentStart + 50);\n const firstWord = header.trim().split(/\\s+/)[0];\n\n // Detect language tag from code block header\n if (firstWord && this.Langs.Contains(firstWord.toLowerCase())) {\n lang = firstWord.toLowerCase();\n contentStart += firstWord.length;\n }\n\n const endIdx = text.indexOf('```', contentStart);\n const isClosed = endIdx !== -1;\n const content = isClosed ? text.slice(contentStart, endIdx) : text.slice(contentStart);\n\n segments.Add({\n Type: \"code\",\n Lang: lang,\n Value: content,\n Start: contentStart,\n IsClosed: isClosed,\n // Apply JS/TS lexer only if language matches\n SubTokens: (lang === 'js' || lang === 'javascript' || lang === 'ts' || lang === 'typescript')\n ? this.LexJS(content) : undefined\n });\n\n cursor = isClosed ? endIdx + 3 : text.length;\n }\n return segments;\n }\n\n /** Consumes a string literal from the code, including escape sequences and template literal interpolation */\n private static ConsumeString(code: string, start: number): Token {\n const quote = code[start];\n let cursor = start + 1;\n let escaped = false;\n\n while (cursor < code.length) {\n if (escaped) { escaped = false; cursor++; continue; }\n if (code[cursor] === '\\\\') { escaped = true; cursor++; continue; }\n if (code[cursor] === quote) { cursor++; break; }\n // Handle template literal interpolation ${...} recursively\n if (quote === '`' && code[cursor] === '$' && code[cursor + 1] === '{') {\n cursor += this.SkipInterpolation(code, cursor + 2) + 2;\n continue;\n }\n cursor++;\n }\n const raw = code.slice(start, cursor);\n const isClosed = raw.length > 1 && raw.endsWith(quote) && !escaped;\n return {\n Type: \"string\",\n Quote: quote,\n Value: raw.slice(1, raw.length - (isClosed ? 1 : 0)), // Value without quotes\n Raw: raw,\n Start: start,\n IsClosed: isClosed\n };\n }\n\n /** Skips content within template literal interpolation (recursively handling nested structures) */\n private static SkipInterpolation(code: string, start: number): number {\n let depth = 1; let cursor = start;\n while (cursor < code.length && depth > 0) {\n const char = code[cursor];\n if (char === \"'\" || char === '\"' || char === '`') {\n const consumedToken = this.ConsumeString(code, cursor);\n cursor += consumedToken.Raw!.length;\n continue;\n }\n if (char === '{') depth++; else if (char === '}') depth--;\n if (depth > 0) cursor++;\n }\n return cursor - start;\n }\n\n public static GetLineCount(text: string, index: number): number {\n return text.substring(0, index).split('\\n').length;\n }\n}\n\nexport class SourceInspector {\n private static readonly Keywords = new HashSet(['class', 'function', 'interface', 'struct', 'const', 'let', 'var']);\n private static readonly Modifiers = new HashSet(['public', 'private', 'protected', 'static', 'async', 'export', 'default', 'get', 'set']);\n\n\n /** Lists all definitions found in the code using Token Stream Scanning */\n public static ListDefinitions(code: string, fileName: string = \"unknown\"): Enumerable {\n const tokens = CodeValidator.LexJS(code);\n const definitions = new List();\n\n // Build a logic-only view with index mapping (omitted for brevity)\n let logicOnly = \"\";\n const offsetMap = new List();\n let lastPos = 0;\n\n tokens.ToArray().forEach(t => {\n while (lastPos < t.Start) { logicOnly += \" \"; offsetMap.Add(lastPos++); }\n const isLogic = t.Type === 'logic';\n const tokenLength = (t.Raw?.length || t.Value.length);\n for (let i = 0; i < tokenLength; i++) {\n logicOnly += isLogic ? (t.Raw || t.Value)[i] : \" \";\n offsetMap.Add(t.Start + i);\n }\n lastPos = t.Start + tokenLength;\n });\n\n let cursor = 0;\n const pendingModifiers = new List();\n\n while (cursor < logicOnly.length) {\n if (/\\s/.test(logicOnly[cursor])) { cursor++; continue; }\n\n const wordStart = cursor;\n while (cursor < logicOnly.length && /[a-zA-Z0-9_$]/.test(logicOnly[cursor])) cursor++;\n const word = logicOnly.slice(wordStart, cursor);\n\n if (this.Modifiers.Contains(word)) {\n pendingModifiers.Add(word);\n continue;\n }\n\n if (this.Keywords.Contains(word) || this.IsMethod(logicOnly, word, cursor)) {\n const kind = this.GetKind(word);\n const name = this.GetName(logicOnly, word, cursor);\n const startOffset = offsetMap.ToArray()[wordStart];\n\n // Calculate the end of the declaration block (fix 1a)\n const endOffset = this.FindBlockEnd(code, offsetMap.ToArray()[cursor]);\n\n if (name) {\n const startLoc = this.GetLocation(code, startOffset);\n const endLoc = this.GetLocation(code, endOffset);\n\n definitions.Add({\n Name: name,\n Kind: kind,\n FileName: fileName,\n Modifiers: new List(pendingModifiers),\n Start: startLoc,\n End: endLoc\n });\n }\n pendingModifiers.Clear();\n\n // FIX 1b: Advance cursor past the identified definition to prevent re-parsing.\n // This stops \"calculateArea\" from being detected twice (once for \"function\", once for \"method\").\n cursor = endOffset;\n\n } else {\n if (word.length > 0) pendingModifiers.Clear();\n cursor++;\n }\n }\n return definitions;\n }\n\n /** Determines the type (kind) of definition based on keywords. */\n public static GetKind(word: string): string {\n // FIX 2: Correctly classify const/let/var as 'variable', not 'function'.\n switch (word) {\n case 'const':\n case 'let':\n case 'var':\n return 'variable';\n case 'function':\n case 'class':\n case 'interface':\n case 'struct':\n return word; // Use the keyword itself for clarity\n default:\n return 'method'; // Default for other identifiers that look like function calls/properties\n }\n }\n\n private static IsMethod(logic: string, word: string, cursor: number): boolean {\n if (!word) return false;\n let temp = cursor;\n while (temp < logic.length && /\\s/.test(logic[temp])) temp++;\n return logic[temp] === '(';\n }\n\n private static GetName(logic: string, word: string, cursor: number): string \n {\n if (this.Keywords.Contains(word)) {\n let temp = cursor;\n while (temp < logic.length && /[\\s\\(]/.test(logic[temp])) temp++;\n const start = temp;\n while (temp < logic.length && /[a-zA-Z0-9_$]/.test(logic[temp])) temp++;\n return logic.slice(start, temp);\n }\n return word;\n }\n\n private static FindBlockEnd(code: string, start: number): number {\n let cursor = start; let depth = 0;\n while (cursor < code.length) {\n if (code[cursor] === '{') { depth = 1; cursor++; break; }\n if (code[cursor] === ';') return cursor;\n cursor++;\n }\n while (cursor < code.length && depth > 0) {\n const char = code[cursor];\n if (char === \"'\" || char === '\"' || char === '`') {\n const consumedToken = CodeValidator.LexJS(code.slice(cursor)).FirstOrDefault();\n cursor += consumedToken?.Raw?.length || 1;\n continue;\n }\n if (char === '{') depth++; else if (char === '}') depth--;\n cursor++;\n }\n return cursor;\n }\n\n private static GetLocation(code: string, index: number): SourceLocation {\n const lines = code.substring(0, index).split('\\n');\n return { Line: lines.length, Char: lines[lines.length - 1].length + 1, Offset: index };\n }\n\n // Complexity keywords for calculating cyclomatic complexity\n private static readonly ComplexityKeywords = new HashSet(['if', 'for', 'while', 'case', 'catch']);\n\n /** Lists all definitions found in the code, including nested definitions and metrics. */\n public static AnalyzeCode(code: string, fileName: string = \"unknown\"): Enumerable {\n const tokens = CodeValidator.LexJS(code);\n const definitions = new List();\n\n let logicOnly = \"\";\n const offsetMap = new List();\n let lastPos = 0;\n\n tokens.ToArray().forEach(t => {\n while (lastPos < t.Start) { logicOnly += \" \"; offsetMap.Add(lastPos++); }\n const isLogic = t.Type === 'logic';\n const tokenLength = (t.Raw?.length || t.Value.length);\n for (let i = 0; i < tokenLength; i++) {\n logicOnly += isLogic ? (t.Raw || t.Value)[i] : \" \";\n offsetMap.Add(t.Start + i);\n }\n lastPos = t.Start + tokenLength;\n });\n\n let cursor = 0;\n const pendingModifiers = new List();\n const scopeStack = new List(); // Tracks nesting (e.g., current class being parsed)\n // Refined scope management and traversal in SourceInspector.AnalyzeCode\n \n // ... existing code ...\n \n while (cursor < logicOnly.length) {\n // FIX 2a: Check if we've moved past the end of the current scope.\n if (scopeStack.Count > 0 && cursor >= scopeStack.Last().End.Offset) {\n scopeStack.RemoveAt(scopeStack.Count - 1); // Pop last element from stack (LIFO)\n }\n if (/\\s/.test(logicOnly[cursor])) { cursor++; continue; }\n const wordStart = cursor;\n while (cursor < logicOnly.length && /[a-zA-Z0-9_$]/.test(logicOnly[cursor])) cursor++;\n const word = logicOnly.slice(wordStart, cursor);\n\n if (this.Modifiers.Contains(word)) {\n pendingModifiers.Add(word);\n continue;\n }\n\n if (this.Keywords.Contains(word) || this.IsMethod(logicOnly, word, cursor)) {\n const kind = this.GetKind(word);\n let name = this.GetName(logicOnly, word, cursor);\n\n const startOffset = offsetMap.ToArray()[wordStart];\n const endOffset = this.FindBlockEnd(code, offsetMap.ToArray()[cursor]);\n // Corrected code in SourceInspector.AnalyzeCode\n \n // ...\n // --- NEW: Extract parameters from signature ---\n const definitionSignature = logicOnly.slice(wordStart, SourceInspector.FindBlockStart(logicOnly, wordStart));\n // FIX: Correct case sensitivity in method call\n const parameters = SourceInspector.ExtractParameters(definitionSignature);\n \n // --- NEW: Calculate metrics for code body ---\n const bodyCode = code.slice(startOffset, endOffset);\n // FIX: Correct case sensitivity in method call\n const metrics = SourceInspector.CalculateMetrics(bodyCode, SourceInspector.GetLocation(code, startOffset).Line, SourceInspector.GetLocation(code, endOffset).Line);\n // ...\n \n // --- NEW: Create enhanced definition object ---\n const newDefinition: EnhancedDefinition = {\n Name: name,\n Kind: kind,\n FileName: fileName,\n Modifiers: new List(pendingModifiers),\n Start: this.GetLocation(code, startOffset),\n End: this.GetLocation(code, endOffset),\n parameters: parameters,\n metrics: metrics,\n children: new List() // Initialize children list for hierarchy\n };\n // ... existing parsing logic ...\n \n if (this.Keywords.Contains(word) || SourceInspector.IsMethod(logicOnly, word, cursor)) {\n // ... definition creation logic ...\n \n // Add to hierarchy: Add definition to the last scope on the stack (immediate parent).\n if (scopeStack.Count > 0) {\n scopeStack.LastOrDefault().children.Add(newDefinition);\n } else {\n definitions.Add(newDefinition);\n }\n \n // --- FIX 2b: Manage scope stack for hierarchy ---\n // If it's a nesting structure, push to stack but DO NOT skip past the end offset.\n if (kind === 'class' || kind === 'interface' || kind === 'struct') {\n scopeStack.Add(newDefinition);\n // Removed: cursor = endOffset; - allow subsequent iterations to find nested definitions within this scope.\n } else if (kind === 'function' || kind === 'method' || kind === 'variable') {\n // Only non-nesting definitions (or function/method definitions that have no nested logic to parse) advance past their bodies.\n cursor = endOffset; \n }\n \n pendingModifiers.Clear();\n \n } else {\n if (word.length > 0) pendingModifiers.Clear();\n cursor++;\n }\n }\n }\n return definitions;\n }\n \n \n /** --- NEW: Extract parameters from a function signature string --- */\n public static ExtractParameters(signature: string): List {\n const paramsMatch = signature.match(/\\((.*?)\\)/s);\n if (paramsMatch && paramsMatch[1]) {\n const paramsList = paramsMatch[1].split(',').map(param => param.trim().split(':')[0].trim()).filter(p => p.length > 0);\n return new List(paramsList);\n }\n return new List();\n }\n\n /** --- NEW: Calculate code complexity and line count for a definition body --- */\n public static CalculateMetrics(bodyCode: string, startLine: number, endLine: number): { lineCount: number, complexity: number } {\n // Line count calculation\n const lineCount = endLine - startLine;\n\n // Simplified cyclomatic complexity calculation (count of branching statements)\n let complexity = 1; // Base complexity of 1 for any function/method\n const complexityMatches = bodyCode.matchAll(\n /\\b(if|for|while|case|catch)\\b|\\&\\&|\\|\\|/g\n );\n\n for (const match of complexityMatches) {\n complexity++;\n }\n\n return { lineCount, complexity };\n }\n\n /** --- CORRECTED: GetKind now handles more cases and avoids misclassification --- */\n public static GetKind(word: string): string {\n switch (word) {\n case 'const':\n case 'let':\n case 'var':\n return 'variable';\n case 'function':\n case 'class':\n case 'interface':\n case 'struct':\n return word;\n case 'get':\n case 'set':\n return 'propertyAccessor';\n default:\n return 'method'; // Default for other identifiers that look like function calls/properties\n }\n }\n\n /** --- Existing helper method (no change) --- */\n public static IsMethod(logic: string, word: string, cursor: number): boolean {\n if (!word) return false;\n let temp = cursor;\n while (temp < logic.length && /\\s/.test(logic[temp])) temp++;\n return logic[temp] === '(';\n }\n\n /** --- Existing helper method (no change) --- */\n public static GetName(logic: string, word: string, cursor: number): string {\n if (this.Keywords.Contains(word)) {\n let temp = cursor;\n while (temp < logic.length && /[\\s\\(]/.test(logic[temp])) temp++;\n const start = temp;\n while (temp < logic.length && /[a-zA-Z0-9_$]/.test(logic[temp])) temp++;\n return logic.slice(start, temp);\n }\n return word;\n }\n\n /** --- Existing helper method (no change) --- */\n public static FindBlockEnd(code: string, start: number): number {\n let cursor = start; let depth = 0;\n while (cursor < code.length) {\n if (code[cursor] === '{') { depth = 1; cursor++; break; }\n if (code[cursor] === ';') return cursor;\n cursor++;\n }\n while (cursor < code.length && depth > 0) {\n const char = code[cursor];\n if (char === \"'\" || char === '\"' || char === '`') {\n const consumedToken = CodeValidator.LexJS(code.slice(cursor)).FirstOrDefault();\n cursor += consumedToken?.Raw?.length || 1;\n continue;\n }\n if (char === '{') depth++; else if (char === '}') depth--;\n cursor++;\n }\n return cursor;\n }\n\n /** --- Existing helper method (no change) --- */\n public static GetLocation(code: string, index: number): SourceLocation {\n const lines = code.substring(0, index).split('\\n');\n return { Line: lines.length, Char: lines[lines.length - 1].length + 1, Offset: index };\n }\n\n /** --- NEW helper method: finds start of definition body for hierarchy management --- */\n public static FindBlockStart(code: string, start: number): number {\n let cursor = start;\n while (cursor < code.length) {\n if (code[cursor] === '{' || code[cursor] === '=') return cursor;\n cursor++;\n }\n return cursor;\n }\n}\n\n/** Unified API Entry point */\nexport const CodeSense = {\n Validate: (text: string) => CodeValidator.Analyze(text),\n Lex: (js: string) => CodeValidator.LexJS(js),\n Inspect: (code: string, fileName: string) => SourceInspector.ListDefinitions(code, fileName)\n};\n\n\nexport class CodeUtilities {\n\n public static GetLargestCodeBlock(text: string): string {\n const report = CodeValidator.Analyze(text);\n\n const blocks = report.Segments\n .OrderByDescending(s => s.Value.length)\n .ToList();\n\n const codeBlocks = blocks.Where(s => s.Type === \"code\").ToList();\n\n if (codeBlocks.Count > 0) {\n return codeBlocks.FirstOrDefault()!.Value;\n } else if (blocks.Count > 0) {\n // Fallback to largest segment if no code blocks found\n return blocks.FirstOrDefault()!.Value;\n } else {\n return text;\n }\n }\n\n /** Returns all segments from the analysis. */\n public static GetBlocks(text: string): Enumerable {\n const report = CodeValidator.Analyze(text);\n return report.Segments;\n }\n\n /** Returns only code segments. */\n public static GetCodeBlocks(text: string): Enumerable | null {\n const blocks = this.GetBlocks(text);\n const codeBlocks = blocks.Where(x => x.Type === \"code\").ToList();\n if (!codeBlocks.IsEmpty()){\n return codeBlocks;\n }\n return null;\n }\n\n /** Checks if any segments (prose or code) were found. */\n public static HasBlock(text: string): boolean {\n const report = this.GetBlocks(text);\n return !report.IsEmpty();\n }\n\n /** Checks if a code block was found. */\n public static HasCodeBlock(text: string): boolean {\n const report = this.GetCodeBlocks(text);\n return report !== null && !report.IsEmpty();\n }\n\n /** Concatenates all code blocks into a single string. */\n public static GetAllCodeJoined(text: string): string {\n const report = CodeValidator.Analyze(text);\n let codeSegments: Enumerable = report.Segments.Where(x => x.Type === \"code\");\n\n return codeSegments\n .Select(s => s.Value)\n .ToArray()\n .join('\\n');\n }\n\n /** Wraps a given string in a Markdown code block with optional language. */\n public static CreateCodeBlock(code: string, lang: string = \"plain\"): string {\n return `\\`\\`\\`${lang}\\n${code}\\n\\`\\`\\``;\n }\n\n /** Copies text to the clipboard using the modern Clipboard API. */\n public static async CopyToClipboard(text: string): Promise {\n if (!navigator.clipboard) {\n console.warn(\"Clipboard API not available. Please ensure secure context (HTTPS) or user interaction.\");\n return false;\n }\n try {\n await navigator.clipboard.writeText(text);\n return true;\n } catch (err) {\n console.error(\"Failed to copy text to clipboard:\", err);\n return false;\n }\n }\n\n /** Extracts code blocks from text and copies them to the clipboard. */\n public static async CopyCodeToClipboard(text: string): Promise {\n const code = this.GetAllCodeJoined(text);\n if (!code) {\n console.warn(\"No code blocks found to copy.\");\n return false;\n }\n return this.CopyToClipboard(code);\n }\n\n /** Reads text from the clipboard using the modern Clipboard API. */\n public static async ReadFromClipboard(): Promise {\n if (!navigator.clipboard) {\n console.warn(\"Clipboard API not available. Please ensure secure context (HTTPS) or user interaction.\");\n return null;\n }\n try {\n const text = await navigator.clipboard.readText();\n return text;\n } catch (err) {\n if (err instanceof DOMException && err.name === \"NotAllowedError\") {\n console.warn(\"Clipboard read permission denied by user. Requires user gesture.\");\n } else {\n console.error(\"Failed to read text from clipboard:\", err);\n }\n return null;\n }\n }\n\n /** Reads text from clipboard, extracts code blocks, and returns them joined. */\n public static async ReadCodeFromClipboard(): Promise {\n const clipboardText = await this.ReadFromClipboard();\n if (clipboardText) {\n return this.GetAllCodeJoined(clipboardText);\n }\n return null;\n }\n}","deleted","label",[100],"permalink","https://www.val.town/x/ziggyware/CodeUtilities/code/CodeUtilities9.ts","extension","actionData","errors"]