{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX5","name":"Architecture \u0026 structure","shortDescription":{"text":"Architecture \u0026 structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AX5"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"allPagesAssembler.doCreatePages (cyclomatic 147): allPagesAssembler.doCreatePages has cyclomatic complexity 147 (threshold 15). Most of this is not in the body itself: 6 of the 147 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 226, 463, 762, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"69c950d9fcdc267a159b9d7c6a5414043baeec98942c41c7ec0020141fa08406"}},{"ruleId":"D1","level":"warning","message":{"text":"hugoBuilder.handleEvents (cyclomatic 89): hugoBuilder.handleEvents has cyclomatic complexity 89 (threshold 15). Of this number, 78 points are the body\u0027s own statements and 11 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6c8fc9449da2fdae9bcb2a11378da5d9b3ae9232a0530bb8c02708f5708b6c6"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.checkCondition (cyclomatic 81): Namespace.checkCondition has cyclomatic complexity 81 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfcb093d50cd3380d47da061c21940712ae86e36a5248d51e62e2c0b37251d3"}},{"ruleId":"D1","level":"warning","message":{"text":"HugoSites.processPartialFileEvents (cyclomatic 76): HugoSites.processPartialFileEvents has cyclomatic complexity 76 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 38 belong to 7 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c1b91de6fc8f7e184085805403d93f5f119bd8b7f46a7fb6359aa998a36ffab"}},{"ruleId":"D1","level":"warning","message":{"text":"pageState.setMetaPostParams (cyclomatic 70): pageState.setMetaPostParams has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"101eb1335882bbbd884f4774fd2b9d25b360721054ecfcfae8d7477f39c08c80"}},{"ruleId":"D1","level":"warning","message":{"text":"page.CreateTargetPaths (cyclomatic 58): page.CreateTargetPaths has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_paths.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a43ae7b132e23ea5c2a0b720840526501c6ee2de07f556c667053b3fd44ea4d"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStore.insertTemplates (cyclomatic 57): TemplateStore.insertTemplates has cyclomatic complexity 57 (threshold 15). Most of this is not in the body itself: 9 of the 57 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1393, 1640). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faacb3ad51b7c1b56dbfa776a682c3320359d2d5a4c116bb1ca8cfbe9806379"}},{"ruleId":"D1","level":"warning","message":{"text":"Config.CompileConfig (cyclomatic 55): Config.CompileConfig has cyclomatic complexity 55 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd0240fa55300fa269be8e6d7811ff50ba32ca9dff39b74080fc13da38d3d2b"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateDescriptor.doCompare (cyclomatic 48): TemplateDescriptor.doCompare has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatedescriptor.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"62194c47258d5f33636fd73c26a4771241b45682727ceaae901bfdba2043e070"}},{"ruleId":"D1","level":"warning","message":{"text":"componentFsDir.ReadDirWithContext (cyclomatic 46): componentFsDir.ReadDirWithContext has cyclomatic complexity 46 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 13 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/component_fs.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f6004611a79c4b18dc90eb90fec7f10f3299fef8a5ebf1d9512c8b4d43c0282"}},{"ruleId":"D1","level":"warning","message":{"text":"Options.compile (cyclomatic 46): Options.compile has cyclomatic complexity 46 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/options.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea8d893582d1aaa2d715f2dcccb5657cff4d59a6ec3c56542ae713fec5a05fc"}},{"ruleId":"D1","level":"warning","message":{"text":"Deployer.Deploy (cyclomatic 44): Deployer.Deploy has cyclomatic complexity 44 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"db575368971ce3ff578adcd1a889bc02654ef5cfd9401ac4b2c567d70bc3f3e6"}},{"ruleId":"D1","level":"warning","message":{"text":"resourceAdapter.transform (cyclomatic 41): resourceAdapter.transform has cyclomatic complexity 41 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/transform.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fceaec5af4337894b19438c6d9695a6f1e6aba1dd3dd54cbac4a00602481f3"}},{"ruleId":"D1","level":"warning","message":{"text":"PathParser.doParse (cyclomatic 40): PathParser.doParse has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"0625fde6f4564279eb3958566ed35d2dfa186de01e1d7e7927eaf40799c11704"}},{"ruleId":"D1","level":"warning","message":{"text":"PathParser.parseIdentifier (cyclomatic 39): PathParser.parseIdentifier has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cfc7110033c69811814e1698281e98c16116a5f6fd84925a2c6cfca011bc406"}},{"ruleId":"D1","level":"warning","message":{"text":"images.DecodeImageConfig (cyclomatic 39): images.DecodeImageConfig has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/config.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"da653f927819e919b2a3d640b2abf4443f32afce070a1df6a723ab4916677f07"}},{"ruleId":"D1","level":"warning","message":{"text":"pageContentOutput.initRenderHooks (cyclomatic 38): pageContentOutput.initRenderHooks has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 2 of the 38 points are its own statements and the rest belongs to one function literal inside it that branches (line 245). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__per_output.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfaa6dfc55e4e02ef491febc3a5830d264878354ce226e8a603997a8673b450d"}},{"ruleId":"D1","level":"warning","message":{"text":"HugoSites.Build (cyclomatic 37): HugoSites.Build has cyclomatic complexity 37 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 10 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"67de7f2a536ae4783b1eb5af690751a387c617e5273f03645d4220b6d858f569"}},{"ruleId":"D1","level":"warning","message":{"text":"BuildClient.Build (cyclomatic 37): BuildClient.Build has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 15 of the 37 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 107, 208, 193). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/build.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fa8617fd4a57b927a8867bf2891c3982275623dd007e9a18404e499fe31a86e"}},{"ruleId":"D1","level":"warning","message":{"text":"npm.Pack (cyclomatic 37): npm.Pack has cyclomatic complexity 37 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/npm/package_builder.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"f316254e503b2a73346a426f936a8ddcacea474e339e2e4cf59d94bf272e7bad"}},{"ruleId":"D1","level":"warning","message":{"text":"shortcodeParseInfo.extractShortcode (cyclomatic 36): shortcodeParseInfo.extractShortcode has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/shortcode.go"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa201860380ded94a6add9ae68ece33352d5ffe3153bc2e8f8b97cbe94ba917"}},{"ruleId":"D1","level":"warning","message":{"text":"batcher.doBuild (cyclomatic 36): batcher.doBuild has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 15 of the 36 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 534, 588, 656, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/batch.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"3000c7f8e55878439a6640008c94a671aa9dc46e73ce4ebab544163638703ffa"}},{"ruleId":"D1","level":"warning","message":{"text":"hugolib.pageRenderer (cyclomatic 35): hugolib.pageRenderer has cyclomatic complexity 35 (threshold 15). Of this number, 33 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site_render.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27da84a6f2c3152f988e5b7e3d7db58679943ef747d1a6d72628000cf3569d1"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.FromRemote (cyclomatic 35): Client.FromRemote has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 5 of the 35 points are its own statements and the rest belongs to one function literal inside it that branches (line 229). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_factories/create/remote.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd4519a2078c6a278aa3b28a5943e27957a81f27e3a3b5f73ac4f256a2f79a6"}},{"ruleId":"D1","level":"warning","message":{"text":"math.DoArithmetic (cyclomatic 34): math.DoArithmetic has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/math/math.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f90d7819cfb97eda37cbbdc27011351e517891032feacf32183ba6900b28f68"}},{"ruleId":"D1","level":"warning","message":{"text":"hugolib.NewHugoSites (cyclomatic 33): hugolib.NewHugoSites has cyclomatic complexity 33 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca2099f252a82221ded7051b278c104605c0469700cc0f2c5e803aa02ec36187"}},{"ruleId":"D1","level":"warning","message":{"text":"esbuild.createBuildPlugins (cyclomatic 33): esbuild.createBuildPlugins has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 3 of the 33 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 192, 306, 370). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/resolve.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52a49f57844392ec792ac128214f0fae1f11bbb9eef018111d3decf29c25e9c"}},{"ruleId":"D1","level":"warning","message":{"text":"fileServer.createEndpoint (cyclomatic 32): fileServer.createEndpoint has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 9 of the 32 points are its own statements and the rest belongs to one function literal inside it that branches (line 271). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"514787f78136e02e5c02bf2d9d74b1ea7673dcb62dbf4b7ed2eb19f41e66529a"}},{"ruleId":"D1","level":"warning","message":{"text":"warpc.newDispatcher (cyclomatic 32): warpc.newDispatcher has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 15 of the 32 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 854, 768, 733, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/warpc.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d46927124a3f0d668bacf30aead0f6cd2ebaa9779101656a4c9d6b2014c4c01"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.compareGetWithCollator (cyclomatic 32): Namespace.compareGetWithCollator has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/compare/compare.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"0490ae326c282968bcd7e501c72cae529cbd3bfe8a372eb3f06bc33fc13f71ff"}},{"ruleId":"D1","level":"warning","message":{"text":"state.evalCall (cyclomatic 32): state.evalCall has cyclomatic complexity 32 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/hugo_template.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fcdb39f56f1257ec93371721e15f3da14aa0287a9d9596990bc079798a7beb1"}},{"ruleId":"D1","level":"warning","message":{"text":"Walkway.walk (cyclomatic 31): Walkway.walk has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/walk.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"8771580bf26bc1413848b189d1d041912e6e2f9f3ffc9cfc4cae47ad1728f3a2"}},{"ruleId":"D1","level":"warning","message":{"text":"cachedContentScope.RenderString (cyclomatic 31): cachedContentScope.RenderString has cyclomatic complexity 31 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f2bbf80b12aeafb2477057100ca3890c7d5c635fe947cfe8ae73fb15894f87"}},{"ruleId":"D1","level":"warning","message":{"text":"InvertedIndex.searchDate (cyclomatic 31): InvertedIndex.searchDate has cyclomatic complexity 31 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"related/inverted_index.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6bd46bc55686ed82e5bfe33ca0411a60c87648ca8893879859c6faeae58303b"}},{"ruleId":"D1","level":"warning","message":{"text":"serverCommand.serve (cyclomatic 30): serverCommand.serve has cyclomatic complexity 30 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 13 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e9e6e8e183fdd7aa78a9461d130bb3e2e10278f9a06e39b493f7752a05d9e6"}},{"ruleId":"D1","level":"warning","message":{"text":"allconfig.fromLoadConfigResult (cyclomatic 30): allconfig.fromLoadConfigResult has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a882da6d8bc794f20af80ff73bf2df2f2a7fbed2f596e68edb25d4c87e8186e"}},{"ruleId":"D1","level":"warning","message":{"text":"LanguagesInternal.init (cyclomatic 30): LanguagesInternal.init has cyclomatic complexity 30 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"langs/config.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5a87fb68fd5393ccedbd53ce5f6811b871f49ebd4df67f00ba3c4a0651c261"}},{"ruleId":"D1","level":"warning","message":{"text":"collector.getAndCreateModule (cyclomatic 30): collector.getAndCreateModule has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8f5beac110c87ceda6d0ce1af6134e210ba083491c977709663acbc66a29f4"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.Sort (cyclomatic 30): Namespace.Sort has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/sort.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3732bd1a33d082b31359c4b8bb444230576c2d77fd9f63177dcdae8eacc1e7"}},{"ruleId":"D1","level":"warning","message":{"text":"state.evalField (cyclomatic 30): state.evalField has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/hugo_template.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"efcad93c0e4aa80d162b9b4649046962a151bc19a18b2bc059ac62991567e586"}},{"ruleId":"D1","level":"warning","message":{"text":"hugolib.doRenderShortcode (cyclomatic 29): hugolib.doRenderShortcode has cyclomatic complexity 29 (threshold 15). Of this number, 28 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/shortcode.go"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a79976242473d2d6ebca7f1215d32dfece692323ef053f1a2e958dd74b891e"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStore.insertTemplate2 (cyclomatic 29): TemplateStore.insertTemplate2 has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"616c06ec5d88ae6d8220f37af08da7581e28281d683511a6eb350c0ed48edd42"}},{"ruleId":"D1","level":"warning","message":{"text":"sourceFilesystemsBuilder.createOverlayFs (cyclomatic 28): sourceFilesystemsBuilder.createOverlayFs has cyclomatic complexity 28 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 3 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/filesystems/basefs.go"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b14f170119f25b737e3156d7c1b8813605c0ebba761b526fca4d4a6f9212f40"}},{"ruleId":"D1","level":"warning","message":{"text":"HugoSites.resolveAndClearStateForIdentities (cyclomatic 28): HugoSites.resolveAndClearStateForIdentities has cyclomatic complexity 28 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"1872d51f6b6dfddd914cdeac743221ef5c1e20cf4bca9a1ce2c4bd5f64f5f368"}},{"ruleId":"D1","level":"warning","message":{"text":"AvifCodec.Encode (cyclomatic 28): AvifCodec.Encode has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/avif.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda28818a2783c451472fe575d80d51c2e4e2859fef9d1fd3e85b2c804c31df2"}},{"ruleId":"D1","level":"warning","message":{"text":"hugoBuilder.newWatcher (cyclomatic 27): hugoBuilder.newWatcher has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 10 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 385). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"53441d0d62d9aad7917c0e726803f5597d9a34a2e6139e2a49b38e5bcb403fd8"}},{"ruleId":"D1","level":"warning","message":{"text":"Deps.Init (cyclomatic 27): Deps.Init has cyclomatic complexity 27 (threshold 15). Of this number, 25 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deps/deps.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b6c1eeaf8fd8c48bb429afbbde1a84420a9e6c024d298d464438c83aeb3641"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeShiftTreeWalker.Walk (cyclomatic 27): NodeShiftTreeWalker.Walk has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to one function literal inside it that branches (line 538). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/doctree/nodeshifttree.go"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"a295fd97da5e369e52e95797e37336c4ae7bbb01eeeb658606b80f9e92dec3b0"}},{"ruleId":"D1","level":"warning","message":{"text":"IntegrationTestBuilder.initBuilder (cyclomatic 27): IntegrationTestBuilder.initBuilder has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to one function literal inside it that branches (line 889). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"27fb775cc2e8644f65a88110da3551318cccd65fc6b20e5bd540766ca902860b"}},{"ruleId":"D1","level":"warning","message":{"text":"Scanner.Next (cyclomatic 26): Scanner.Next has cyclomatic complexity 26 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hhtml/scanner.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ab9191d85dfc9cd60c6097425fb8647306560bbc0964a77e9b942fb5b88073a"}},{"ruleId":"D1","level":"warning","message":{"text":"sitePagesAssembler.applyAggregates (cyclomatic 26): sitePagesAssembler.applyAggregates has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 7 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 945). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"1126368f5d2f89c555ab1794babc9b92eb926557953bfc4e8e82caa3fc1e0ac6"}},{"ruleId":"D1","level":"warning","message":{"text":"goldmark.newMarkdown (cyclomatic 26): goldmark.newMarkdown has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/convert.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f1c2ffabe941c40d8551271848830579782d907ea31b7214350d2fe0708fe6"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.Vendor (cyclomatic 26): Client.Vendor has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9fb3ea605f9e8bd036f699c09bee81df1b66167eb91b99ef92ea65d6625bfe"}},{"ruleId":"D1","level":"warning","message":{"text":"meta.init (cyclomatic 26): meta.init has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 2 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 395). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/meta/meta.go"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"60516cf1f3f56c9c4466bfe8f34a3c1c5f780a4829aef6cbbe7f5ec2bbb98965"}},{"ruleId":"D1","level":"warning","message":{"text":"configLoader.loadConfigMain (cyclomatic 25): configLoader.loadConfigMain has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/load.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"15f76d6b887a6e195c1750b60bfa30694f4a508d5315b7f620a7b5d3e27baa2e"}},{"ruleId":"D1","level":"warning","message":{"text":"pageFinder.getContentNodeForRef (cyclomatic 25): pageFinder.getContentNodeForRef has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/pagecollections.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aea9b6b8a1934752f8ddb73e46c5f23d3a0529cf839d8363a9e7d4fd3ecc7a8"}},{"ruleId":"D1","level":"warning","message":{"text":"Cache.Prune (cyclomatic 24): Cache.Prune has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 8 of the 24 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 86, 74). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache_pruner.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a034b6960dbb74494afb50e0e42dd37a4e656b9d2a19a7b1bc1d2f6c556694e"}},{"ruleId":"D1","level":"warning","message":{"text":"commands.newModCommands (cyclomatic 24): commands.newModCommands has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to 8 function literals inside it that branch (lines 249, 103, 67, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/mod.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae195f12d53a51af496f8b7d18110bcdf9db1c98c63dbc9a87a17d8145d3e52"}},{"ruleId":"D1","level":"warning","message":{"text":"pagesCollector.Collect (cyclomatic 24): pagesCollector.Collect has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 10 of the 24 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 189, 97, 122, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/pages_capture.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d306c865fe4735bd8c8c6319b578437684bde9e7d369bf8855742149469460"}},{"ruleId":"D1","level":"warning","message":{"text":"AsciiDocConverter.ParseArgs (cyclomatic 24): AsciiDocConverter.ParseArgs has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/asciidocext/internal/converter.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"518ca53ab2777dbdfc24ea33e6aba1ee1184b412f41b439a4ea5df03749e0c0b"}},{"ruleId":"D1","level":"warning","message":{"text":"npm.ensureWorkspaceRef (cyclomatic 24): npm.ensureWorkspaceRef has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/npm/package_builder.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d5a9a291e6afa2c8d17b7d374a011df2c299a400df423ea57979c46ae4fffac"}},{"ruleId":"D1","level":"warning","message":{"text":"collections.evaluateSubElem (cyclomatic 24): collections.evaluateSubElem has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"fad2864b0a3979813a72267a82009843213e41c9e9b372ffa70c95860fdb2dcb"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.Unmarshal (cyclomatic 24): Namespace.Unmarshal has cyclomatic complexity 24 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/transform/unmarshal.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"edcfa94b895f0a4e3965c8318a3a050818194821cd0de1312b2b12e3326dcfdc"}},{"ruleId":"D1","level":"warning","message":{"text":"collector.mountCommonJSConfig (cyclomatic 23): collector.mountCommonJSConfig has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"c295e38429a36575e57e0e6e8df59e3d94f12a16adbb3b97076f511ddee992f9"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.Seq (cyclomatic 23): Namespace.Seq has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"11af29e6fecf138df567330202d72af670ab63532eaffde1e230f36b1023121e"}},{"ruleId":"D1","level":"warning","message":{"text":"Configs.Init (cyclomatic 22): Configs.Init has cyclomatic complexity 22 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"6651431384996fee6a647dbc5610ffe5fe798d67adae3a71d8a40809e856eeec"}},{"ruleId":"D1","level":"warning","message":{"text":"RootMappingFs.collectDirEntries (cyclomatic 22): RootMappingFs.collectDirEntries has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 548, 603). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/rootmapping_fs.go"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8065adeeacfd4ce5dddd0793f1a11690e1d67ed01f8bd5f4048a271c80d49a2"}},{"ruleId":"D1","level":"warning","message":{"text":"modules.ApplyProjectConfigDefaults (cyclomatic 22): modules.ApplyProjectConfigDefaults has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/config.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"8180e08b30c6b2d2dad405ebbdd9812282cbf171be8624d33929768976cc8b61"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.listGoMods (cyclomatic 22): Client.listGoMods has cyclomatic complexity 22 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0c065e9890ae47fe3980fecb18c061a73d68364f096d97fa8634777fea330de"}},{"ruleId":"D1","level":"warning","message":{"text":"InvertedIndex.Search (cyclomatic 22): InvertedIndex.Search has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"related/inverted_index.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"5be05f8a8de564fd359b83460238762994bb6d09abb00c3232d5f99840061826"}},{"ruleId":"D1","level":"warning","message":{"text":"Pages.GroupBy (cyclomatic 22): Pages.GroupBy has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pagegroup.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0cd76171720c8bebe04aaabb3e4f891f8248f28f17ffa0c18c5c6ba3ee55f26"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.Union (cyclomatic 22): Namespace.Union has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8a417c3a4798651b128873a0b15525132feefdf8bcd26c8e078f3d4fdd2f89"}},{"ruleId":"D1","level":"warning","message":{"text":"PathParser.applyPrefixIdentifier (cyclomatic 21): PathParser.applyPrefixIdentifier has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ede95f54d56f132d389947e0f2c3bc4ff8540e98142db9e658ca88d53a38048"}},{"ruleId":"D1","level":"warning","message":{"text":"version.CompareVersions (cyclomatic 21): version.CompareVersions has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/version/version.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"89ac7d874da38d1dbe668f5d268e61511ace2e3d4a7399b85434b9ea5bae67aa"}},{"ruleId":"D1","level":"warning","message":{"text":"config.LoadConfigFromDir (cyclomatic 21): config.LoadConfigFromDir has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 152). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/configLoader.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"534b79bc1aba34f98efc62f259c54872099a6a88657f4670b24c03339bb90f1d"}},{"ruleId":"D1","level":"warning","message":{"text":"Site.assembleMenus (cyclomatic 21): Site.assembleMenus has cyclomatic complexity 21 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"0341a2ab26d8136bf395b01ac94d75ac39dc0a543165f5edeec710787cd7d823"}},{"ruleId":"D1","level":"warning","message":{"text":"modules.decodeConfig (cyclomatic 21): modules.decodeConfig has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/config.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ff902bbdd9302874c31fd28dcb683ebf0327c712fae5d22db67a958d2377423"}},{"ruleId":"D1","level":"warning","message":{"text":"collector.applyThemeConfig (cyclomatic 21): collector.applyThemeConfig has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d9fa534d9fe6fd4604511826fac5ef3de3c21040f9ff514e826473980e40fb"}},{"ruleId":"D1","level":"warning","message":{"text":"Filters.Text (cyclomatic 21): Filters.Text has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/filters.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"71232e54ff29bebd8e1727d3a49c725e65ab53361c0b0e1740a5984f0011e862"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.Eq (cyclomatic 21): Namespace.Eq has cyclomatic complexity 21 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/compare/compare.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"1175c74e84afc11113a0b4d3e5fd8187f2dad1d3f96d74b032c5ea85a74d837c"}},{"ruleId":"D1","level":"warning","message":{"text":"descriptorHandler.compareDescriptors (cyclomatic 21): descriptorHandler.compareDescriptors has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatedescriptor.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0fd970b0df5527a9aa9f093c76437b23521fbb85586f29113988abcde6aebe"}},{"ruleId":"D1","level":"warning","message":{"text":"compare.compareFold (cyclomatic 20): compare.compareFold has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compare/compare_strings.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8649a2cda114f1ecbca88fbe90154b632af250f91bcf66e378787db3de68181"}},{"ruleId":"D1","level":"warning","message":{"text":"pageMap.addPagesFromGoTmplFi (cyclomatic 20): pageMap.addPagesFromGoTmplFi has cyclomatic complexity 20 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"f809abc3de73e06d0b433e9181287a8f910c717353a581f46d49d72f6b8f0ecc"}},{"ruleId":"D1","level":"warning","message":{"text":"HugoSites.postProcess (cyclomatic 20): HugoSites.postProcess has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 706, 657). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab34c3b71966bf5f14c092d359a82bce230f967e47817f701d8d9466af3062ec"}},{"ruleId":"D1","level":"warning","message":{"text":"contentParseInfo.parseSource (cyclomatic 20): contentParseInfo.parseSource has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"589768a0b3d072b644b6cfa311db5b8272581e61d15f7f05f161e9c3f06499ea"}},{"ruleId":"D1","level":"warning","message":{"text":"segmentsBuilder.buildOne (cyclomatic 20): segmentsBuilder.buildOne has cyclomatic complexity 20 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/segments/segments.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5981671037893b91fde233f23ced3c4f334e1d90ea1795a0eb819d9504d9e64"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.transform (cyclomatic 20): Client.transform has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/js/build.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ab8c9e6f40fc082867793d8c69579e1144ea68e25972f6d3904cfd79bdea68"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.newElemResolver (cyclomatic 20): Namespace.newElemResolver has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ba6586281688080df78714fb0b9a064c92f61d897374d9ae58fabc591846349"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.checkWhereArray (cyclomatic 20): Namespace.checkWhereArray has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b9fe04cfc51367967bd35f4e5533dc4cffe55c042474a8487a5fcead42eef7"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.FormatNumberCustom (cyclomatic 20): Namespace.FormatNumberCustom has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/lang/lang.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee1c5df1f93b5b79b177f60c239707378edbf7ebd2865317c13a6c7b51a1d222"}},{"ruleId":"D1","level":"warning","message":{"text":"bestMatch.isBetter (cyclomatic 20): bestMatch.isBetter has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"307c90c2447aa4f62b1385b939d593753d35222c9e1dbdb4b484a5e8bd2370bb"}},{"ruleId":"D1","level":"warning","message":{"text":"filecache.DecodeConfig (cyclomatic 19): filecache.DecodeConfig has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache_config.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2dbef5714bf5c088fbe9e209ad98c0ed5d3c4efa0d32286bf30825eb5597302"}},{"ruleId":"D1","level":"warning","message":{"text":"aliasHandler.targetPathAlias (cyclomatic 19): aliasHandler.targetPathAlias has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/alias.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ddde2bfc15ab1267dc35f8cf9beb324240b9ae78fd72b8195f0d171ba281d65"}},{"ruleId":"D1","level":"warning","message":{"text":"hugolib.createTargetPathDescriptor (cyclomatic 19): hugolib.createTargetPathDescriptor has cyclomatic complexity 19 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__paths.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"b026dc0814f7355205f32b14023a85dfb1ef5554d2ed975588df2c7c107c0d13"}},{"ruleId":"D1","level":"warning","message":{"text":"HugoSites.assemble (cyclomatic 19): HugoSites.assemble has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"090888daf36d1f43fd63b0dc7d7c7c103df16d66064d7f53835ef0784c311b09"}},{"ruleId":"D1","level":"warning","message":{"text":"cachedContentScope.contentRendered (cyclomatic 19): cachedContentScope.contentRendered has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 498). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"122c630bd2d0d3bbdbebd6ce074e8eebc792ce6917d95ba6cdf787ced7baee8b"}},{"ruleId":"D1","level":"warning","message":{"text":"collector.normalizeMounts (cyclomatic 19): collector.normalizeMounts has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"75de92b6fb0a08d29f546705700ccead90ec7507c35009e4a9342c220d088a22"}},{"ruleId":"D1","level":"warning","message":{"text":"pageparser.lexShortcodeParam (cyclomatic 19): pageparser.lexShortcodeParam has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/pagelexer_shortcode.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c2a3ea1043d6b05bba5ff07244f22ac3322b07bc7ff16d733d28905e0d34b70"}},{"ruleId":"D1","level":"warning","message":{"text":"Codec.EncodeTo (cyclomatic 19): Codec.EncodeTo has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/codec.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"dceb46774ea20a25fbf4276575ae0824fea75943408c7a14a6a4f3ce266dc49e"}},{"ruleId":"D1","level":"warning","message":{"text":"textFilter.Draw (cyclomatic 19): textFilter.Draw has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/text.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94fbf78c6bf561750a34d4ac2d275e7b107457e761e9cac0552cd6224a77a4b"}},{"ruleId":"D1","level":"warning","message":{"text":"babelTransformation.Transform (cyclomatic 19): babelTransformation.Transform has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/babel/babel.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"358beece506ff59385ffc9082c4ac02b93a1b838a335d18b2349d69ff543e662"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.newMethodResolver (cyclomatic 19): Namespace.newMethodResolver has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":444}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6773f7f8a84fdff6c6f500f4f0a75471d554ec75e3355be6de8af332314a725"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.Truncate (cyclomatic 19): Namespace.Truncate has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/truncate.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f963eaece923c1b6e72fc5598a37e9a6c2ccca4217e1b637d8e03d4ba6e6ab9"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStore.parseTemplates (cyclomatic 19): TemplateStore.parseTemplates has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 7 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 1688). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"17229149ee2d688786469ace562b6146ec1c34b85979c69bb9334f0ddd477da8"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStore.toKeyCategoryAndDescriptor (cyclomatic 19): TemplateStore.toKeyCategoryAndDescriptor has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f5e863beb4893b858e258b029bea6e4f50f123df4c092cf03f53826531c264"}},{"ruleId":"D1","level":"warning","message":{"text":"templateTransformContext.applyTransformations (cyclomatic 19): templateTransformContext.applyTransformations has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatetransform.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eba8217845712feab126ec309ab36ed50800990daedc85044a7e157c35d56d2"}},{"ruleId":"D1","level":"warning","message":{"text":"Inspector.MethodsFromTypes (cyclomatic 18): Inspector.MethodsFromTypes has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/methods.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"894f89b867c70a4296dc6141829ace73c22d597df310864e2ff186b3b7fd070f"}},{"ruleId":"D1","level":"warning","message":{"text":"hugofs.NewRootMappingFs (cyclomatic 18): hugofs.NewRootMappingFs has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/rootmapping_fs.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7265277f9656e98ee21421b12fd7ddac3a93afb4105ad90a1a94dd3111ea5f6a"}},{"ruleId":"D1","level":"warning","message":{"text":"componentFs.applyMeta (cyclomatic 18): componentFs.applyMeta has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/component_fs.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd4c20b1349676c80bc2b2ba8243a75bdb3d681b037f5fb35298ae1eafb21be7"}},{"ruleId":"D1","level":"warning","message":{"text":"hugolib.newHugoSites (cyclomatic 18): hugolib.newHugoSites has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f624c65a92bd7c8fcd13405241f0c815696ebc07a1a3b01d0cea141e3341523"}},{"ruleId":"D1","level":"warning","message":{"text":"sitePagesAssembler.assembleResourcesAndSetHome (cyclomatic 18): sitePagesAssembler.assembleResourcesAndSetHome has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to one function literal inside it that branches (line 1231). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c41f50b07b66898a3dbdf5dfbb9c2a85ceb7fafe9ba54a163cb4fcd886ae9e8"}},{"ruleId":"D1","level":"warning","message":{"text":"HugoSites.resolveAndResetDependententPageOutputs (cyclomatic 18): HugoSites.resolveAndResetDependententPageOutputs has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1106, 1086, 1144, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c896ce7318e8032842affe22489e9aea025688c07c5d15dd95b43106ebc13b"}},{"ruleId":"D1","level":"warning","message":{"text":"pageMeta.applyDefaultValues (cyclomatic 18): pageMeta.applyDefaultValues has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8fe591fdc8f4b91abd07f65df61b4506374cb733b02105f3d4ae4dc8a4ffd4"}},{"ruleId":"D1","level":"warning","message":{"text":"pagesCollector.collectDirDir (cyclomatic 18): pagesCollector.collectDirDir has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 1 of the 18 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 270, 263). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/pages_capture.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c79d0c3233251016937967b851b7e5375ab6cdcef2556ecc022753987b58af0"}},{"ruleId":"D1","level":"warning","message":{"text":"siteRefLinker.refLink (cyclomatic 18): siteRefLinker.refLink has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcd10e3645245f92be907c48729b440d83388067e9eed5ad7d5ac310da9b408"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.Get (cyclomatic 18): Client.Get has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab3aba3e1e37aaf6b72e3782df04b96bb8647e2fc0f9014be9d8efc09afbd20"}},{"ruleId":"D1","level":"warning","message":{"text":"Client.writeHugoDirectSum (cyclomatic 18): Client.writeHugoDirectSum has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a39e0ff63f1f140062dd22c1825431c0d10285993aaf63dca4805eadcf09c49"}},{"ruleId":"D1","level":"warning","message":{"text":"pageparser.lexInsideShortcode (cyclomatic 18): pageparser.lexInsideShortcode has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/pagelexer_shortcode.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"b74bec43713cb7a42515582645641e76eaa6147c15146f6ebecc1ccfc4082ac0"}},{"ruleId":"D1","level":"warning","message":{"text":"PermalinkExpander.toSliceFunc (cyclomatic 18): PermalinkExpander.toSliceFunc has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 446, 487, 505). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/permalinks.go"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3bcf94f15b54376cc24d0dc595b3cc134beeef251cb3b86fa77fa3f5dc6700"}},{"ruleId":"D1","level":"warning","message":{"text":"ResourceSourceDescriptor.init (cyclomatic 18): ResourceSourceDescriptor.init has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b9e4535902693f4e3762cfcbf63da54af29ce6d2fc9a02daae68218b5a0104"}},{"ruleId":"D1","level":"warning","message":{"text":"postcssTransformation.Transform (cyclomatic 18): postcssTransformation.Transform has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/cssjs/postcss.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec906cfdb3801e0f8d6a81bd14eea25dd12785fb7a82d9fa43d2d006052ebbc3"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.doIndex (cyclomatic 18): Namespace.doIndex has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/index.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"7064f70eed48d125c9d262f7f53a6f97d49edb66c6bdfcbdb47eb105cb98be7e"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.Substr (cyclomatic 18): Namespace.Substr has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/strings.go"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca8c00c4751a792f1b08a9e3e0932901b1c38fe3db8ff3fb3ffe77b835cbebbc"}},{"ruleId":"D1","level":"warning","message":{"text":"Deployer.walkLocal (cyclomatic 18): Deployer.walkLocal has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 3 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 497). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"6296bb1fff972e9da88c24450281320ed21efbf551edffc118c445f20aab571a"}},{"ruleId":"D1","level":"warning","message":{"text":"Methods.ToMarshalJSON (cyclomatic 17): Methods.ToMarshalJSON has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/methods.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e0d04de06d9d9846204616f8b002a1311b3c2b0c4cac665ed6e34f44abe66ce"}},{"ruleId":"D1","level":"warning","message":{"text":"importCommand.copyJekyllFilesAndFolders (cyclomatic 17): importCommand.copyJekyllFilesAndFolders has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/import.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"e52928bf2a8a9420e818bf1bbf8541f8862653b65878707519b6cf32e019f87c"}},{"ruleId":"D1","level":"warning","message":{"text":"defaultConfigProvider.determineMergeStrategy (cyclomatic 17): defaultConfigProvider.determineMergeStrategy has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/defaultConfigProvider.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26119bd090a6add8db8249bebe32a987f0175191685f70bc9f69a75e6dd621a"}},{"ruleId":"D1","level":"warning","message":{"text":"contentBuilder.buildDir (cyclomatic 17): contentBuilder.buildDir has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"create/content.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bee4e5cadeb784db775bb12c720d779ae563cbcadfda80a89f910006bd578f2"}},{"ruleId":"D1","level":"warning","message":{"text":"PathSpec.RelURL (cyclomatic 17): PathSpec.RelURL has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers/url.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"05862c07f8a2bdf423b9efaccdd6d047785151c78c2baba5a98a936d535f613c"}},{"ruleId":"D1","level":"warning","message":{"text":"FilenameFilter.doMatch (cyclomatic 17): FilenameFilter.doMatch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/hglob/filename_filter.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d3d05e734494ad32c282b0c5774666c813cca467fe6119fe2a94cad123aeed"}},{"ruleId":"D1","level":"warning","message":{"text":"pageMap.getOrCreateResourcesForPage (cyclomatic 17): pageMap.getOrCreateResourcesForPage has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 3 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 592). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"8412b6da5f4acf473126b3ed924193832ef2cdc7d30330d8d5ef13b2fafb4007"}},{"ruleId":"D1","level":"warning","message":{"text":"HugoSites.render (cyclomatic 17): HugoSites.render has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 437, 406). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bde65d10d6722d6c89f535d0c2a5f2ce84919be23465cc3d03380587dbe3fbe"}},{"ruleId":"D1","level":"warning","message":{"text":"HugoSites.fileEventsContentPaths (cyclomatic 17): HugoSites.fileEventsContentPaths has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3549e8cc8450963a9e906167a6ea29ca0193bf4baa178ab92fa6091120913f"}},{"ruleId":"D1","level":"warning","message":{"text":"pageState.shiftToOutputFormat (cyclomatic 17): pageState.shiftToOutputFormat has cyclomatic complexity 17 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page.go"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"47f4381c77ed6e7305aab96985b5c5e98e8327db3e901180613ce0440e53536a"}},{"ruleId":"D1","level":"warning","message":{"text":"Site.renderDefaultSiteRedirect (cyclomatic 17): Site.renderDefaultSiteRedirect has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site_render.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4fcb936ec0cf521593686820ddfad4be746db7890fb497a53b59b7adefedcf3"}},{"ruleId":"D1","level":"warning","message":{"text":"Finder.doCheckOne (cyclomatic 17): Finder.doCheckOne has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"identity/finder.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc6f6369ad4f2437199beed338e34168d62e92494f2d438326e668ee8222f840"}},{"ruleId":"D1","level":"warning","message":{"text":"tocTransformer.Transform (cyclomatic 17): tocTransformer.Transform has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 4 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 65). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/toc.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a085ca04efcbde8dde8b72d2030bfa3260289f7ca062f8f2a627dc17c11bf3"}},{"ruleId":"D1","level":"warning","message":{"text":"highlight.highlight (cyclomatic 17): highlight.highlight has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/highlight/highlight.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"3602d9f0b07a71d7cf721013f34a166276685e2ebe86ba15bd6323fdc96a3b20"}},{"ruleId":"D1","level":"warning","message":{"text":"npm.PackageFilesSum (cyclomatic 17): npm.PackageFilesSum has cyclomatic complexity 17 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/npm/package_builder.go"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eb4dae6bfb2b83cd8ec54fbffe42d63aab7148e9df63e95186d681647f2cd45"}},{"ruleId":"D1","level":"warning","message":{"text":"metadecoders.validateAliasLimitForCollections (cyclomatic 17): metadecoders.validateAliasLimitForCollections has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 238, 223). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/metadecoders/decoder.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d15dca4d198512f28e4bb955103bd3e798e925c16e81dcbccde0d2a3a021900"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageProcessor.doFilter (cyclomatic 17): ImageProcessor.doFilter has cyclomatic complexity 17 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function taking that case\u0027s concrete type, so the dispatch reads one line per case. These arms are selected by TYPE rather than by value, so there is no key a lookup table could be built on; where you own the matched types, giving them one shared interface method and calling that is the form a table would have taken, and where you do not, keep the cases \u2014 they stay explicit and reviewable."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/image.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c76f0bbb85e75a60e5176581f3fb3f559fc1a6308884b7a8d0e28e283fca1c6b"}},{"ruleId":"D1","level":"warning","message":{"text":"FrontMatterHandler.createContentAdapterDatesHandler (cyclomatic 17): FrontMatterHandler.createContentAdapterDatesHandler has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 939, 912, 925). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pagemeta/page_frontmatter.go"},"region":{"startLine":911}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7f43048f44cfc4ab30e487f19d27c407af53960e1cafb9a8845c35a3720ec9"}},{"ruleId":"D1","level":"warning","message":{"text":"transport.RoundTrip (cyclomatic 17): transport.RoundTrip has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_factories/create/remote.go"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"561fd9948ae90ac0e256356c7262484028db18389d4b6c54fbbffdeb3443ecfc"}},{"ruleId":"D1","level":"warning","message":{"text":"state.validateType (cyclomatic 17): state.validateType has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file\u0027s highest cyclomatic complexity: template.safeCall (cyclomatic 20) is higher and carries no row of its own \u2014 it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded function is counted neither in this dimension\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/hugo_template.go"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"527718bc8a9113872aa9c05c3468e175e4934b2b6fc6be3ab6ff3e4abfcb3848"}},{"ruleId":"D1","level":"warning","message":{"text":"Namespace.Unmarshal (cyclomatic 17): Namespace.Unmarshal has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to one function literal inside it that branches (line 94). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/openapi/openapi3/openapi3.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"64fe55311d8b22fd730485fe55c38eb6898eab3589d4f64986b60f95a1abcc07"}},{"ruleId":"D1","level":"warning","message":{"text":"templateNamespace.doParseTemplate (cyclomatic 17): templateNamespace.doParseTemplate has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templates.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c323e074f8232e1f319b7d1ac522ae34a3770dbcbe2b7eb2046d59f04f0592"}},{"ruleId":"D1","level":"warning","message":{"text":"TemplateStore.insertEmbedded (cyclomatic 17): TemplateStore.insertEmbedded has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 1122). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff33f948e56a1d5f8b81ff9d40edfe9e330857b1f307af4d7a9ffb20799d0bfc"}},{"ruleId":"D1","level":"warning","message":{"text":"Inspector.parseSource (cyclomatic 16): Inspector.parseSource has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to one function literal inside it that branches (line 172). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/methods.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"654bf842e25dab7e515feba300e788544bbef98b1c01201811eb99e45746b5a2"}},{"ruleId":"D1","level":"warning","message":{"text":"hreflect.convertToFloatIfPossible (cyclomatic 16): hreflect.convertToFloatIfPossible has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hreflect/convert.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"90207db331d10323e920bfe25be0ee56ecb1e1a13f04bbff280aa5c82eae10fd"}},{"ruleId":"D1","level":"warning","message":{"text":"allconfig.LoadConfig (cyclomatic 16): allconfig.LoadConfig has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/load.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50af2793b8cde421fe31b2f806437ebab3b6ffea8afae21c3f9cabf0bf6d96b"}},{"ruleId":"D1","level":"warning","message":{"text":"pageMap.getPagesInSection (cyclomatic 16): pageMap.getPagesInSection has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 346). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"e852af2a794bfcec81d2f89302bd978f04fa07e5ba993f9d5bc167e71cbdb684"}},{"ruleId":"D1","level":"warning","message":{"text":"allPagesAssembler.createMissingStandalonePages (cyclomatic 16): allPagesAssembler.createMissingStandalonePages has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a241eb89d9094ee9a171873fd79e19638ff220c9e55d7ef0e7fd4652a71cda5"}},{"ruleId":"D1","level":"warning","message":{"text":"pageState.setMetaPost (cyclomatic 16): pageState.setMetaPost has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7911dbaed50515f11595767e9601b6f3c880be2e1550289f368f064760418e9"}},{"ruleId":"D1","level":"warning","message":{"text":"cachedContentScope.RenderShortcodes (cyclomatic 16): cachedContentScope.RenderShortcodes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7aa3829b8f13a6466539709ff3da1b32ecdd3dcf238e15d61b534296fa30581"}},{"ruleId":"D1","level":"warning","message":{"text":"pageMetaSource.doInitEarly (cyclomatic 16): pageMetaSource.doInitEarly has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f22d1cce437987c25db58b39bd0ac4dccae8011862cf5528c0c8194695b273"}},{"ruleId":"D1","level":"warning","message":{"text":"Site.prepareInits (cyclomatic 16): Site.prepareInits has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 900, 870, 947, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"acee1b5d3506ba85973b5e28a02b6d9033bcff06d6a90d29e479c57a601fdefc"}},{"ruleId":"D1","level":"warning","message":{"text":"AvifCodec.Decode (cyclomatic 16): AvifCodec.Decode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/avif.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8456d85c462b5eba0d329faef2d1a2abb250b4926951eed11972d1a4954b4d"}},{"ruleId":"D1","level":"warning","message":{"text":"WebpCodec.Encode (cyclomatic 16): WebpCodec.Encode has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/webp.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1494d3a7cc02b2b0f58bca03d16d42ca6ec69757bf691934a085032e875a7b"}},{"ruleId":"D1","level":"warning","message":{"text":"transformer.Transform (cyclomatic 16): transformer.Transform has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/internal/extensions/attributes/attributes.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"bef07f843a70e3696b52a7ef04a15829fe548659ce96e46d3ff9881ff3df8328"}},{"ruleId":"D1","level":"warning","message":{"text":"highlight.ChromaStylesCSS (cyclomatic 16): highlight.ChromaStylesCSS has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/highlight/chromastyles.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf001572d1a6d0895abf565193f0f30f5623ead56326e3b8616a3fa72d439709"}},{"ruleId":"D1","level":"warning","message":{"text":"minifiers.DecodeConfig (cyclomatic 16): minifiers.DecodeConfig has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"minifiers/config.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"a388602a7e157d12384616b7b2828c990169ee28615931f759c26d56637fca04"}},{"ruleId":"D1","level":"warning","message":{"text":"pageparser.lexShortcodeQuotedParamVal (cyclomatic 16): pageparser.lexShortcodeQuotedParamVal has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/pagelexer_shortcode.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"e208ab4dcdebb90efe5cada0f7dc801d8b8428776203a72ea3aa0a55b9b4544a"}},{"ruleId":"D1","level":"warning","message":{"text":"InvertedIndex.Add (cyclomatic 16): InvertedIndex.Add has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"related/inverted_index.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd28b3974e6737acef4e33d83a4c1c633b6f0c39cf9dcac7cde2103b7ebdbfe"}},{"ruleId":"D1","level":"warning","message":{"text":"resources.assignMetadata (cyclomatic 16): resources.assignMetadata has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_metadata.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f0b7cbd629a052ada0f330edfcd7488cffa90985a708f5f61b220aa1060fd08"}},{"ruleId":"D1","level":"warning","message":{"text":"imageResource.Filter (cyclomatic 16): imageResource.Filter has cyclomatic complexity 16 (threshold 15). Of this number, 9 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/image.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"361483018964de6436cd95eb11d900403a29b79c53c23412a8dcf915060db284"}},{"ruleId":"D1","level":"warning","message":{"text":"imageResource.doWithImageConfig (cyclomatic 16): imageResource.doWithImageConfig has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 428). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/image.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c65305649c5e1bbf70a2f40b7bf2391779e56a5effaadfe944a1072ff4bfc47"}},{"ruleId":"D1","level":"warning","message":{"text":"Codec.DecodeFormat (cyclomatic 16): Codec.DecodeFormat has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/codec.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bd869655ebc427fae1210ceec709b5e2b890d2652c14a7cd3cda132499e1e5"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageConfig.init (cyclomatic 16): ImageConfig.init has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/config.go"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"766fb6a27a7432747bc501196713ac271ec1d5844918eed7238f1ba5971d8eac"}},{"ruleId":"D1","level":"warning","message":{"text":"PageConfigEarly.CompileEarly (cyclomatic 16): PageConfigEarly.CompileEarly has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pagemeta/page_frontmatter.go"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc18b09bf8c0ef6220a845a6571fb81ca2855b278c5890b29b47c5986bdb9123"}},{"ruleId":"D2","level":"warning","message":{"text":"allPagesAssembler.doCreatePages (cognitive 243): allPagesAssembler.doCreatePages has cognitive complexity 243 (threshold 15). Drivers by points: if/else 104 (196 pts), loops 11 (20 pts), boolean chains 14, match/switch 7 (13 pts) (nesting depth added 107). Most of this is not in the body itself: 8 of the 243 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 226, 463, 762, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed100c9d09b4d7c242896053be94cae3e0e6c8ae9cbd06626097bb833ecbcf56"}},{"ruleId":"D2","level":"warning","message":{"text":"hugoBuilder.handleEvents (cognitive 175): hugoBuilder.handleEvents has cognitive complexity 175 (threshold 15). Drivers by points: if/else 59 (140 pts), loops 9 (21 pts), boolean chains 14 (nesting depth added 93). Of this number, 145 points are the body\u0027s own statements and 30 belong to 5 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b015ad24571dd2ad3300453040333e3d54eab26d58a72c529089804f8d48f65"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.processPartialFileEvents (cognitive 137): HugoSites.processPartialFileEvents has cognitive complexity 137 (threshold 15). Drivers by points: if/else 49 (102 pts), loops 19 (28 pts), boolean chains 6, match/switch 1 (nesting depth added 62). Of this number, 61 points are the body\u0027s own statements and 76 belong to 7 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"68aee135248856b28b9a0eacceec789e5403df5899d9bf0b5125de201aceaa55"}},{"ruleId":"D2","level":"warning","message":{"text":"pageState.setMetaPostParams (cognitive 115): pageState.setMetaPostParams has cognitive complexity 115 (threshold 15). Drivers by points: if/else 37 (71 pts), loops 8 (27 pts), match/switch 4 (13 pts), boolean chains 4 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"e308ce9429769c3aad72bd37992823c5d46cf5b19c023bd4d57e27dd9916e8b8"}},{"ruleId":"D2","level":"warning","message":{"text":"Config.CompileConfig (cognitive 100): Config.CompileConfig has cognitive complexity 100 (threshold 15). Drivers by points: if/else 44 (83 pts), loops 11 (15 pts), boolean chains 1, match/switch 1 (nesting depth added 43). Of this number, 94 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"560a652e04dcd2ce984168b10717597c0fe76c354362231ff75ec2c0c6e3a453"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.checkCondition (cognitive 99): Namespace.checkCondition has cognitive complexity 99 (threshold 15). Drivers by points: if/else 24 (51 pts), match/switch 13 (24 pts), boolean chains 18, loops 2 (6 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"8808833a5b6b8ad9b145ad25d2a791b460a9236b2005c5217501e5ff4fb8e0ca"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStore.insertTemplates (cognitive 98): TemplateStore.insertTemplates has cognitive complexity 98 (threshold 15). Drivers by points: if/else 39 (75 pts), loops 5 (11 pts), boolean chains 8, match/switch 3 (4 pts) (nesting depth added 43). Most of this is not in the body itself: 12 of the 98 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1393, 1640). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec17aaa79a70643e2323055311d57b9e0153a91e5d5a585abbaf272f8bcfec2c"}},{"ruleId":"D2","level":"warning","message":{"text":"componentFsDir.ReadDirWithContext (cognitive 96): componentFsDir.ReadDirWithContext has cognitive complexity 96 (threshold 15). Drivers by points: if/else 31 (74 pts), boolean chains 8, loops 5 (8 pts), match/switch 2 (6 pts) (nesting depth added 50). Of this number, 75 points are the body\u0027s own statements and 21 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/component_fs.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fe3fc098dbb1d391591945b4b61648f7261f58b7fe65bc1d010171947ad327"}},{"ruleId":"D2","level":"warning","message":{"text":"shortcodeParseInfo.extractShortcode (cognitive 94): shortcodeParseInfo.extractShortcode has cognitive complexity 94 (threshold 15). Drivers by points: if/else 32 (88 pts), boolean chains 2, match/switch 1 (2 pts), jumps 1, loops 1 (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/shortcode.go"},"region":{"startLine":572}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ded4ba606f4068f054199067cc6d2864dfeeb98468ccf1109d50ae79b544ccd"}},{"ruleId":"D2","level":"warning","message":{"text":"Deployer.Deploy (cognitive 91): Deployer.Deploy has cognitive complexity 91 (threshold 15). Drivers by points: if/else 38 (79 pts), loops 5 (9 pts), boolean chains 3 (nesting depth added 45). Of this number, 80 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"78e7eeb296251f2f29da26c3751d24c46af548e077b2dc05681cbdde9537ecc2"}},{"ruleId":"D2","level":"warning","message":{"text":"InvertedIndex.searchDate (cognitive 90): InvertedIndex.searchDate has cognitive complexity 90 (threshold 15). Drivers by points: if/else 20 (71 pts), loops 7 (15 pts), boolean chains 4 (nesting depth added 59). Of this number, 64 points are the body\u0027s own statements and 26 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"related/inverted_index.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0271f0f6a19699e125ef366482fc8c55c9315fa4953cf4cf874c3f870f12fe"}},{"ruleId":"D2","level":"warning","message":{"text":"page.CreateTargetPaths (cognitive 83): page.CreateTargetPaths has cognitive complexity 83 (threshold 15). Drivers by points: if/else 42 (65 pts), boolean chains 18 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_paths.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d3938e6468f94ad153540af13fd6e1d327c645823d4f7fb7a9db77f694b24c0"}},{"ruleId":"D2","level":"warning","message":{"text":"BuildClient.Build (cognitive 79): BuildClient.Build has cognitive complexity 79 (threshold 15). Drivers by points: if/else 32 (68 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 41). Of this number, 24 points are the body\u0027s own statements and 55 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/build.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"941d2fde7521776070c708e69b8cc4840c6828e77a71013611cf8cf517db552a"}},{"ruleId":"D2","level":"warning","message":{"text":"InvertedIndex.Search (cognitive 78): InvertedIndex.Search has cognitive complexity 78 (threshold 15). Drivers by points: if/else 16 (59 pts), loops 6 (19 pts) (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"related/inverted_index.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82f1af02d48baab52db46c694f898e352043f0954bca1fda01b84d01a8f7526"}},{"ruleId":"D2","level":"warning","message":{"text":"fileServer.createEndpoint (cognitive 77): fileServer.createEndpoint has cognitive complexity 77 (threshold 15). Drivers by points: if/else 29 (69 pts), match/switch 1 (4 pts), boolean chains 3, loops 1 (nesting depth added 43). Most of this is not in the body itself: 12 of the 77 points are its own statements and the rest belongs to one function literal inside it that branches (line 271). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5872fb0e94e49a2059133d1ec801c954bc8ae8afa53b91e92325e797157732a"}},{"ruleId":"D2","level":"warning","message":{"text":"hugolib.pageRenderer (cognitive 76): hugolib.pageRenderer has cognitive complexity 76 (threshold 15). Drivers by points: if/else 27 (66 pts), boolean chains 6, match/switch 2 (3 pts), loops 1 (nesting depth added 40). Of this number, 75 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site_render.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"a76dfa4574fde99cdfa50fd3aa6225bf7166cd669c0adea09a6c31987ac04946"}},{"ruleId":"D2","level":"warning","message":{"text":"resourceAdapter.transform (cognitive 76): resourceAdapter.transform has cognitive complexity 76 (threshold 15). Drivers by points: if/else 31 (63 pts), boolean chains 5, loops 3 (5 pts), match/switch 1 (3 pts) (nesting depth added 36). Of this number, 71 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/transform.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"d812a8419e8df2af6b0a096b3dde07e2635104522bc28f290c759f75e3e9bdfa"}},{"ruleId":"D2","level":"warning","message":{"text":"allconfig.fromLoadConfigResult (cognitive 75): allconfig.fromLoadConfigResult has cognitive complexity 75 (threshold 15). Drivers by points: if/else 19 (55 pts), match/switch 3 (13 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":1046}}}],"partialFingerprints":{"codehealthFindingId/v1":"8885b2fab38866512061ce7ebd95135b67d495e249ccb6911b014a436d0b1bde"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.getAndCreateModule (cognitive 72): collector.getAndCreateModule has cognitive complexity 72 (threshold 15). Drivers by points: if/else 28 (71 pts), boolean chains 1 (nesting depth added 43). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff126fc74751ed42c31670a9a6a084ba80d5c3a41d3d6a5848d0ef4b42fa6e39"}},{"ruleId":"D2","level":"warning","message":{"text":"images.DecodeImageConfig (cognitive 72): images.DecodeImageConfig has cognitive complexity 72 (threshold 15). Drivers by points: if/else 30 (64 pts), boolean chains 5, loops 2, match/switch 1 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/config.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"645076fd050cf2e8de6aa668eb84dc4dfeb334a77db3f034abd3944e33e8c87d"}},{"ruleId":"D2","level":"warning","message":{"text":"PathParser.parseIdentifier (cognitive 69): PathParser.parseIdentifier has cognitive complexity 69 (threshold 15). Drivers by points: if/else 30 (57 pts), boolean chains 12 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc2664d3c7b15720da5643b05db90c05c0c410da00604338fd8135ff5e82147"}},{"ruleId":"D2","level":"warning","message":{"text":"InvertedIndex.Add (cognitive 67): InvertedIndex.Add has cognitive complexity 67 (threshold 15). Drivers by points: if/else 10 (48 pts), loops 5 (19 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"related/inverted_index.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cd950a5822da7a278dda571ea6519e10f8b6e4e8ceb9089e770c67e73a5a92"}},{"ruleId":"D2","level":"warning","message":{"text":"sourceFilesystemsBuilder.createOverlayFs (cognitive 64): sourceFilesystemsBuilder.createOverlayFs has cognitive complexity 64 (threshold 15). Drivers by points: if/else 25 (57 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 35). Of this number, 58 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/filesystems/basefs.go"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bc23cc2dda54310cd6dccc25e57eb7333cff43da4e2b3285399baaa21e25467"}},{"ruleId":"D2","level":"warning","message":{"text":"PathParser.doParse (cognitive 63): PathParser.doParse has cognitive complexity 63 (threshold 15). Drivers by points: if/else 27 (47 pts), boolean chains 9, match/switch 2 (6 pts), loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":459}}}],"partialFingerprints":{"codehealthFindingId/v1":"a492b1c1f64ac12b7535e91f04b538e8d844a6088ac7415e496a5d1413073d80"}},{"ruleId":"D2","level":"warning","message":{"text":"hugolib.doRenderShortcode (cognitive 62): hugolib.doRenderShortcode has cognitive complexity 62 (threshold 15). Drivers by points: if/else 21 (48 pts), boolean chains 6, match/switch 2 (6 pts), loops 1 (2 pts) (nesting depth added 32). Of this number, 60 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/shortcode.go"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed3cd33d3f68ae55c346e56619bfa6451fda877a2c82f0813d5cd98df6f4cd7b"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Sort (cognitive 62): Namespace.Sort has cognitive complexity 62 (threshold 15). Drivers by points: if/else 13 (41 pts), loops 5 (13 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/sort.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8c32a4519593a3ed91d9b8ad8fd70c57ec0a698a8b813649d8fa85cb34e9055"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateDescriptor.doCompare (cognitive 61): TemplateDescriptor.doCompare has cognitive complexity 61 (threshold 15). Drivers by points: if/else 28 (41 pts), boolean chains 20 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatedescriptor.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"290d597b966a82a409d4f726c38469f9513154a744bcae1e3abc53288ab14cd2"}},{"ruleId":"D2","level":"warning","message":{"text":"pagesCollector.Collect (cognitive 60): pagesCollector.Collect has cognitive complexity 60 (threshold 15). Drivers by points: if/else 19 (51 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 35). Of this number, 20 points are the body\u0027s own statements and 40 belong to 5 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/pages_capture.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b161108b181a619f82dfaa0d947af586a532b3bce5085bac0f216a02a62d9db"}},{"ruleId":"D2","level":"warning","message":{"text":"batcher.doBuild (cognitive 60): batcher.doBuild has cognitive complexity 60 (threshold 15). Drivers by points: if/else 31 (47 pts), loops 6 (13 pts) (nesting depth added 23). Of this number, 29 points are the body\u0027s own statements and 31 belong to 9 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/batch.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afeb33c9a1b485c7802975dfcf5cf868ca4ebaaba7341998bcf9c3bca38a85e"}},{"ruleId":"D2","level":"warning","message":{"text":"cachedContentScope.RenderString (cognitive 59): cachedContentScope.RenderString has cognitive complexity 59 (threshold 15). Drivers by points: if/else 29 (56 pts), boolean chains 3 (nesting depth added 27). Of this number, 44 points are the body\u0027s own statements and 15 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":877}}}],"partialFingerprints":{"codehealthFindingId/v1":"52667d4cbd1723e9333eb8753a7638b7cea9e2122e400ab357ef2b5d9c909be6"}},{"ruleId":"D2","level":"warning","message":{"text":"Walkway.walk (cognitive 58): Walkway.walk has cognitive complexity 58 (threshold 15). Drivers by points: if/else 24 (50 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/walk.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b47fdfbfe232f733c9977320e500cb8f9c812a4e9fd422448fa47823181ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.Vendor (cognitive 57): Client.Vendor has cognitive complexity 57 (threshold 15). Drivers by points: if/else 21 (50 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebcaac2861a01c5bfcc21831012f0fa59b1d9319dbfb2b195f262f2c49e1c83"}},{"ruleId":"D2","level":"warning","message":{"text":"hugolib.NewHugoSites (cognitive 56): hugolib.NewHugoSites has cognitive complexity 56 (threshold 15). Drivers by points: if/else 25 (42 pts), loops 6 (10 pts), boolean chains 4 (nesting depth added 21). Of this number, 55 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"d921cc27e074240a6aa4e532ad3863e0a10760d78f8d2b7fb72d111f73a6d5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.resolveAndClearStateForIdentities (cognitive 55): HugoSites.resolveAndClearStateForIdentities has cognitive complexity 55 (threshold 15). Drivers by points: if/else 18 (38 pts), loops 8 (15 pts), boolean chains 2 (nesting depth added 27). Of this number, 39 points are the body\u0027s own statements and 16 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf6d754dc19b0e2b33d5456a7611861b96528cd2f8f8cb051daa36a461e11792"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.Build (cognitive 53): HugoSites.Build has cognitive complexity 53 (threshold 15). Drivers by points: if/else 28 (44 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 17). Of this number, 33 points are the body\u0027s own statements and 20 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5416a0b85c170d237bba18b0b8208c9618c2a3a044651f2a40236b50200716d"}},{"ruleId":"D2","level":"warning","message":{"text":"esbuild.createBuildPlugins (cognitive 53): esbuild.createBuildPlugins has cognitive complexity 53 (threshold 15). Drivers by points: if/else 32 (47 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). Most of this is not in the body itself: 2 of the 53 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 192, 306, 370). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/resolve.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d5ee0d0d649920d1bdd5547a54b5ce38fda18c91d7834ee5761565c6ba4941e"}},{"ruleId":"D2","level":"warning","message":{"text":"AvifCodec.Encode (cognitive 51): AvifCodec.Encode has cognitive complexity 51 (threshold 15). Drivers by points: if/else 15 (36 pts), loops 4 (11 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/avif.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"28dd2b993f9f4cb67adef256d0bf6fef4a70fba0833b657a6d13a228c6363b92"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStore.parseTemplates (cognitive 51): TemplateStore.parseTemplates has cognitive complexity 51 (threshold 15). Drivers by points: if/else 10 (35 pts), loops 8 (16 pts) (nesting depth added 33). Most of this is not in the body itself: 15 of the 51 points are its own statements and the rest belongs to one function literal inside it that branches (line 1688). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1687}}}],"partialFingerprints":{"codehealthFindingId/v1":"02f4bb0ac4c5313a2ae193475d9be6501b4b24977c65820da17781af57c876a5"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.render (cognitive 50): HugoSites.render has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (40 pts), loops 3 (7 pts), match/switch 1 (3 pts) (nesting depth added 33). Most of this is not in the body itself: 11 of the 50 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 437, 406). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab657c45f14364ed9157308d074b2968b3a28d829b6b3692f09960cc54246f1"}},{"ruleId":"D2","level":"warning","message":{"text":"npm.Pack (cognitive 50): npm.Pack has cognitive complexity 50 (threshold 15). Drivers by points: if/else 26 (41 pts), boolean chains 5, loops 4 (nesting depth added 15). Of this number, 43 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/npm/package_builder.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"e763810f004e4976e71600399a31086518bf915007cc58633cd5b871996713e0"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Union (cognitive 50): Namespace.Union has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (36 pts), loops 2 (6 pts), boolean chains 5, match/switch 2 (3 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"cceb4dd73f5e0268ca82a21abc0137d3161116a34046e18e1a96498819e57cbe"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.FromRemote (cognitive 49): Client.FromRemote has cognitive complexity 49 (threshold 15). Drivers by points: if/else 29 (41 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 14). Most of this is not in the body itself: 5 of the 49 points are its own statements and the rest belongs to one function literal inside it that branches (line 229). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_factories/create/remote.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b086b0227115832a206f08efaf76b0f30c3f30b824f05e77f4ffe06eb828b0f"}},{"ruleId":"D2","level":"warning","message":{"text":"state.evalField (cognitive 49): state.evalField has cognitive complexity 49 (threshold 15). Drivers by points: if/else 21 (41 pts), match/switch 2 (5 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/hugo_template.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe9c295200b874478bc31dd83e1e9e553c497464d4474a5ec4304205a54684b"}},{"ruleId":"D2","level":"warning","message":{"text":"state.evalCall (cognitive 49): state.evalCall has cognitive complexity 49 (threshold 15). Drivers by points: if/else 26 (39 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 15). Of this number, 39 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/hugo_template.go"},"region":{"startLine":398}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95a9a6d3c5aa56957cdaeb8858f529de8f30b3577d0d4f1e484b0ae444212d4"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStore.insertTemplate2 (cognitive 49): TemplateStore.insertTemplate2 has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (40 pts), boolean chains 7, loops 1 (2 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1265}}}],"partialFingerprints":{"codehealthFindingId/v1":"e865f002c30478621f3b80ca07a4b2fe5efa4f665b20fec580e692b6728d6553"}},{"ruleId":"D2","level":"warning","message":{"text":"RootMappingFs.collectDirEntries (cognitive 48): RootMappingFs.collectDirEntries has cognitive complexity 48 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 5 (6 pts) (nesting depth added 27). Of this number, 28 points are the body\u0027s own statements and 20 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/rootmapping_fs.go"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"29e2056b5eab76e86f8e21d884ce6ab1036d45b5588268a7b17056203a3e4bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"warpc.newDispatcher (cognitive 48): warpc.newDispatcher has cognitive complexity 48 (threshold 15). Drivers by points: if/else 26 (42 pts), loops 5, boolean chains 1 (nesting depth added 16). Of this number, 19 points are the body\u0027s own statements and 29 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/warpc.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b27d3a8109ef737b6e6fe67a827e09e8830496573724d75eb66c5b9359911ae"}},{"ruleId":"D2","level":"warning","message":{"text":"AsciiDocConverter.ParseArgs (cognitive 48): AsciiDocConverter.ParseArgs has cognitive complexity 48 (threshold 15). Drivers by points: if/else 25 (46 pts), loops 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/asciidocext/internal/converter.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"c814fcf1e37075bd6912206ebefc40ed860cb5ec6980904061b61252abb6b97c"}},{"ruleId":"D2","level":"warning","message":{"text":"modules.decodeConfig (cognitive 47): modules.decodeConfig has cognitive complexity 47 (threshold 15). Drivers by points: if/else 14 (33 pts), loops 5 (13 pts), boolean chains 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/config.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"f253d8a9b9866a12f4f44786c5eb13ba80d19ed9ee8683e517d1a2cc706377e9"}},{"ruleId":"D2","level":"warning","message":{"text":"minifiers.DecodeConfig (cognitive 46): minifiers.DecodeConfig has cognitive complexity 46 (threshold 15). Drivers by points: if/else 14 (44 pts), loops 1 (2 pts) (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"minifiers/config.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"23040f5c0779e783574542977be216bc7e5263fe869296a37afd1778c7aa4557"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.normalizeMounts (cognitive 46): collector.normalizeMounts has cognitive complexity 46 (threshold 15). Drivers by points: if/else 18 (43 pts), boolean chains 2, loops 1 (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9dbd10a967830cb397161016099e336fae28abe1a2e64092ff6df9e4643d088"}},{"ruleId":"D2","level":"warning","message":{"text":"resources.assignMetadata (cognitive 46): resources.assignMetadata has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (43 pts), boolean chains 2, loops 1 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_metadata.go"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a96d6b6d88476e8fa52701fd1ce90f53fd2c02d3095a4925f7e803fb762fd6"}},{"ruleId":"D2","level":"warning","message":{"text":"sitePagesAssembler.applyAggregates (cognitive 45): sitePagesAssembler.applyAggregates has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (38 pts), boolean chains 3, loops 1 (2 pts), match/switch 2 (nesting depth added 20). Most of this is not in the body itself: 9 of the 45 points are its own statements and the rest belongs to one function literal inside it that branches (line 945). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e76f9d8f5d01f22bf587c7b0c379fc0d8ba512926c709dcb6743adaaefd8d8f"}},{"ruleId":"D2","level":"warning","message":{"text":"hugoBuilder.newWatcher (cognitive 44): hugoBuilder.newWatcher has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (33 pts), boolean chains 6, loops 3, match/switch 1 (2 pts) (nesting depth added 20). Most of this is not in the body itself: 13 of the 44 points are its own statements and the rest belongs to one function literal inside it that branches (line 385). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":335}}}],"partialFingerprints":{"codehealthFindingId/v1":"705bc5398e97447f3e2744035daa27fca9bf849e42dfd3aebad74815fe98af4a"}},{"ruleId":"D2","level":"warning","message":{"text":"configLoader.loadConfigMain (cognitive 44): configLoader.loadConfigMain has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (40 pts), loops 2 (4 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/load.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4379936e11f23cec051a6eca1d391390e34def7a77329045109077871101572"}},{"ruleId":"D2","level":"warning","message":{"text":"pageMetaSource.initPathInfo (cognitive 44): pageMetaSource.initPathInfo has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (43 pts), boolean chains 1 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"19336e8f344103ba45d37a4ccb82673d4b5cbe5171c3db79e7844387c8dfe627"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.checkWhereArray (cognitive 44): Namespace.checkWhereArray has cognitive complexity 44 (threshold 15). Drivers by points: if/else 14 (35 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 24). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b0db095568be0731dcfad270372c8ef4372364bf7585e28ca83c5d3941a602"}},{"ruleId":"D2","level":"warning","message":{"text":"serverCommand.serve (cognitive 43): serverCommand.serve has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (31 pts), loops 5 (7 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 13). Of this number, 26 points are the body\u0027s own statements and 17 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7661c67c78ae2ce9775461df78adc26d0f983270e3b25cc229c575e89dddc13"}},{"ruleId":"D2","level":"warning","message":{"text":"hugofs.NewRootMappingFs (cognitive 43): hugofs.NewRootMappingFs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 1 (nesting depth added 26). Of this number, 33 points are the body\u0027s own statements and 10 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/rootmapping_fs.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"88573297181a27a339a3f44928d9da6244060adc6c8c9e6151b14aa8207695c9"}},{"ruleId":"D2","level":"warning","message":{"text":"LanguagesInternal.init (cognitive 43): LanguagesInternal.init has cognitive complexity 43 (threshold 15). Drivers by points: if/else 21 (35 pts), boolean chains 4, loops 3 (4 pts) (nesting depth added 15). Of this number, 34 points are the body\u0027s own statements and 9 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"langs/config.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"10190d521cd5e30c9aea090ae99ffa982af71e7cf6d2ecb6e40bc3322fcbe291"}},{"ruleId":"D2","level":"warning","message":{"text":"compare.compareFold (cognitive 42): compare.compareFold has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (35 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"compare/compare_strings.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fc452942f46fd6d574018448fcb6abb9adc4205554a9f92892f273c9247a80"}},{"ruleId":"D2","level":"warning","message":{"text":"componentFs.applyMeta (cognitive 42): componentFs.applyMeta has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 2 (6 pts), match/switch 1 (2 pts) (nesting depth added 25). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/component_fs.go"},"region":{"startLine":328}}}],"partialFingerprints":{"codehealthFindingId/v1":"57c62beadee67dae8a27fd445bab968320810b4878d1b37a7926d47626ed3bc8"}},{"ruleId":"D2","level":"warning","message":{"text":"Options.compile (cognitive 42): Options.compile has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (26 pts), match/switch 7, loops 4 (6 pts), boolean chains 2, jumps 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/options.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"9746162b71843967c86f1e7f0dc7f2eb1a9d42cdd6487f050fc2af68650df1e8"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Eq (cognitive 42): Namespace.Eq has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (39 pts), boolean chains 2, loops 1 (nesting depth added 22). Of this number, 40 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/compare/compare.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd52dec2a176ad772c16b6781cd1d4b894f9b380556aa642ce7184fab74fc75c"}},{"ruleId":"D2","level":"warning","message":{"text":"config.LoadConfigFromDir (cognitive 41): config.LoadConfigFromDir has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (30 pts), loops 3 (5 pts), match/switch 1 (4 pts), boolean chains 2 (nesting depth added 21). Most of this is not in the body itself: 7 of the 41 points are its own statements and the rest belongs to one function literal inside it that branches (line 152). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/configLoader.go"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0316e39946b49ee2fa5aef6b08f1f5aae6b04ebc92fd9ad8725137b381eaacd5"}},{"ruleId":"D2","level":"warning","message":{"text":"pageMap.addPagesFromGoTmplFi (cognitive 41): pageMap.addPagesFromGoTmplFi has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (32 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 18). Most of this is not in the body itself: 15 of the 41 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 361, 405). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"1231d9cad6b3397e75fc2a4052548b15ae0018ff0565235c8f23aef863137eed"}},{"ruleId":"D2","level":"warning","message":{"text":"npm.ensureWorkspaceRef (cognitive 41): npm.ensureWorkspaceRef has cognitive complexity 41 (threshold 15). Drivers by points: if/else 18 (36 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/npm/package_builder.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dbb7b80a16bf1f9b700c0c3bf3a0faed771a8c0fda8f8994613226e3df4943"}},{"ruleId":"D2","level":"warning","message":{"text":"htmlElementsCollectorWriter.parseHTMLElement (cognitive 41): htmlElementsCollectorWriter.parseHTMLElement has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 3 (10 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 27). Most of this is not in the body itself: 2 of the 41 points are its own statements and the rest belongs to one function literal inside it that branches (line 394). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publisher/htmlElementsCollector.go"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cc71f0c8056577d8a6ef8ec93bb3a44b8bc4851de706da3103a20d0cdb6da4"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Unmarshal (cognitive 41): Namespace.Unmarshal has cognitive complexity 41 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 1 (nesting depth added 15). Of this number, 19 points are the body\u0027s own statements and 22 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/transform/unmarshal.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f843ebda56ce83acca29c41a90ff0cf5a7c1084b5564fd1ac66783a5fcd5e9e"}},{"ruleId":"D2","level":"warning","message":{"text":"filecache.DecodeConfig (cognitive 40): filecache.DecodeConfig has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache_config.go"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"2391e0fa702659e0c01bb963c74c53bbe09b14b32e3cc8dfe042457dbf73be16"}},{"ruleId":"D2","level":"warning","message":{"text":"Scanner.Next (cognitive 40): Scanner.Next has cognitive complexity 40 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 4 (9 pts), boolean chains 8, match/switch 3 (8 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hhtml/scanner.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"902f64858ab9df11bc7a9d7285d5e1cef7dd8062964afd0dc5638ca9fcf660e0"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.postProcess (cognitive 40): HugoSites.postProcess has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (34 pts), loops 5 (6 pts) (nesting depth added 19). Most of this is not in the body itself: 11 of the 40 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 706, 657). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2dec57f7f587f82604c7c7313b5f0d1bb375f01314090feb3ca7a2622bf0753"}},{"ruleId":"D2","level":"warning","message":{"text":"IntegrationTestBuilder.initBuilder (cognitive 40): IntegrationTestBuilder.initBuilder has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (27 pts), loops 5 (10 pts), boolean chains 3 (nesting depth added 10). None of this is in the body itself: all 40 points belong to one function literal inside it that branches (line 889). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4b8f886581a85eca3a4a771a9fdd0f9bbe1626346737c0dc5fd489e3cb0a46"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.mountCommonJSConfig (cognitive 40): collector.mountCommonJSConfig has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 5 (10 pts), boolean chains 5 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63af262d2935fffbc7a494f8c9d923de0c981b3955d9c43dfc12dfa712160dc"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.applyThemeConfig (cognitive 39): collector.applyThemeConfig has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (33 pts), loops 3 (5 pts), jumps 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"982bb8768d6fc3b19e2fe23c9459df41ed54f3cbcf477267cd0fb3bb7c88abe8"}},{"ruleId":"D2","level":"warning","message":{"text":"internal.getGetTplPackagesGoDoc (cognitive 39): internal.getGetTplPackagesGoDoc has cognitive complexity 39 (threshold 15). Drivers by points: loops 5 (22 pts), if/else 9 (17 pts) (nesting depth added 25). None of this is in the body itself: all 39 points belong to one function literal inside it that branches (line 265). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/templatefuncsRegistry.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"833472d5748932fdbdac98fec44117df06de601e83fc892bd62ddfdaca31d9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"defaultConfigProvider.Merge (cognitive 38): defaultConfigProvider.Merge has cognitive complexity 38 (threshold 15). Drivers by points: if/else 13 (30 pts), loops 2 (6 pts), boolean chains 1, match/switch 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/defaultConfigProvider.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"30c8d2fd2152b04b42bcb2ed8c27177a99278803387e1916b47cf573f4adbfd4"}},{"ruleId":"D2","level":"warning","message":{"text":"segmentsBuilder.buildOne (cognitive 38): segmentsBuilder.buildOne has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 2 (nesting depth added 16). Of this number, 24 points are the body\u0027s own statements and 14 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/segments/segments.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"4623f7ae1671502dacb15b45d33fab287cea14a218efcc812483178fce897b1d"}},{"ruleId":"D2","level":"warning","message":{"text":"importResolver.importRecursive (cognitive 38): importResolver.importRecursive has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 2 (5 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/cssjs/inline_imports.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a1dcd467c6d854c4f38184a128e5f2bd36505bcfe915bd94d0b10ae39f34661"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector.MethodsFromTypes (cognitive 37): Inspector.MethodsFromTypes has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 5 (12 pts), boolean chains 1 (nesting depth added 20). Of this number, 32 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/methods.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"3642ef14bfba11769a0b0fd42dc0cea2556f6d4367cb963304ade2b30023d171"}},{"ruleId":"D2","level":"warning","message":{"text":"hugolib.newHugoSites (cognitive 37): hugolib.newHugoSites has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 9 (15 pts) (nesting depth added 19). Of this number, 35 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac7e27da51ff012caebb56af182bb7365593eb976a4660967fa5f004be5c6036"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeShiftTreeWalker.Walk (cognitive 37): NodeShiftTreeWalker.Walk has cognitive complexity 37 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 5, match/switch 1 (2 pts), loops 1 (nesting depth added 10). None of this is in the body itself: all 37 points belong to one function literal inside it that branches (line 538). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/doctree/nodeshifttree.go"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"77876be53564c197570214d3a3e0cf74150ed409ffc07dbff2026112766133cb"}},{"ruleId":"D2","level":"warning","message":{"text":"Cache.Prune (cognitive 36): Cache.Prune has cognitive complexity 36 (threshold 15). Drivers by points: if/else 20 (31 pts), boolean chains 3, loops 2 (nesting depth added 11). Most of this is not in the body itself: 10 of the 36 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 86, 74). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache_pruner.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbe5dba3b93e69a31e5ec68cd872d3fd843b2d1be50994dda16b2bf46f73c3bc"}},{"ruleId":"D2","level":"warning","message":{"text":"importCommand.copyJekyllFilesAndFolders (cognitive 36): importCommand.copyJekyllFilesAndFolders has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/import.go"},"region":{"startLine":342}}}],"partialFingerprints":{"codehealthFindingId/v1":"663959add9c576617e5f18f7656f5345ac8c3a5d644071d7fbd289c3ebb93b01"}},{"ruleId":"D2","level":"warning","message":{"text":"Site.assembleMenus (cognitive 36): Site.assembleMenus has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 6 (7 pts), boolean chains 1 (nesting depth added 15). Of this number, 26 points are the body\u0027s own statements and 10 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09d78cfe71a9fe38b655820c0598f48b98b39381df7275f06375f55d0879804"}},{"ruleId":"D2","level":"warning","message":{"text":"modules.ApplyProjectConfigDefaults (cognitive 36): modules.ApplyProjectConfigDefaults has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 4 (8 pts), match/switch 2 (6 pts), boolean chains 2 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/config.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae5958574e37a41e1843f621944a4626ddefe202407083478761c1a1e4d7c0c0"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.Get (cognitive 36): Client.Get has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 3 (8 pts), boolean chains 6 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"82c13fb4e5e003f2a70fca410fa07cd9b273d7b277c1978d391f928d66ad4919"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.listGoMods (cognitive 36): Client.listGoMods has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (32 pts), boolean chains 2, loops 2 (nesting depth added 14). Of this number, 22 points are the body\u0027s own statements and 14 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"674c49bd19e287a140742261ead59434a262bdf4d98f57f0e05982f069d1fafa"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.newElemResolver (cognitive 36): Namespace.newElemResolver has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (34 pts), boolean chains 1, match/switch 1 (nesting depth added 18). Of this number, 17 points are the body\u0027s own statements and 19 belong to 3 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cf2940d187ce99ce389b12d5840354e05ca782cc63d84afffc01ef7c0a49a0a"}},{"ruleId":"D2","level":"warning","message":{"text":"math.DoArithmetic (cognitive 35): math.DoArithmetic has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (23 pts), match/switch 5 (8 pts), boolean chains 4 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/math/math.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e51ab4454ddcaa4c75d4681535dc5ae0ea9fb425778f80a80198a9236d9940"}},{"ruleId":"D2","level":"warning","message":{"text":"Configs.Init (cognitive 35): Configs.Init has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 7 (9 pts), boolean chains 1 (nesting depth added 14). Of this number, 30 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"751e6927794920946fbdd9469a35b0f48d0c9c46195dad72c287113a4e89be25"}},{"ruleId":"D2","level":"warning","message":{"text":"helperContentNode.findContentNodeForSiteVector (cognitive 35): helperContentNode.findContentNodeForSiteVector has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_contentnode.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"26c9bb232c323ef5adacbc85f635fae572faf5b491a28006b71e221117a1e966"}},{"ruleId":"D2","level":"warning","message":{"text":"contentParseInfo.parseSource (cognitive 35): contentParseInfo.parseSource has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (30 pts), match/switch 1 (2 pts), boolean chains 1, jumps 1, loops 1 (nesting depth added 20). Of this number, 27 points are the body\u0027s own statements and 8 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":270}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a673d2b28cc1f32f40e31105f9c8966d756fa7bd19e387c6242cab1cfb2b5e"}},{"ruleId":"D2","level":"warning","message":{"text":"siteRefLinker.refLink (cognitive 35): siteRefLinker.refLink has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":1052}}}],"partialFingerprints":{"codehealthFindingId/v1":"774ff0c170b6e1a43bac7d174d977159d58e7eb383178c6cab837433c4f27106"}},{"ruleId":"D2","level":"warning","message":{"text":"configLoader.applyOsEnvOverrides (cognitive 34): configLoader.applyOsEnvOverrides has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 2, boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/load.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0750a17f08691a18415b0eba8f12a51089fdd8c8e32a5ac014eee1a6da2edb"}},{"ruleId":"D2","level":"warning","message":{"text":"pageMap.getOrCreateResourcesForPage (cognitive 34): pageMap.getOrCreateResourcesForPage has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 4 (11 pts) (nesting depth added 18). Most of this is not in the body itself: 2 of the 34 points are its own statements and the rest belongs to one function literal inside it that branches (line 592). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":585}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0180c0abfc746d80dcacb2799acca45e91c32115ad5fff06d40ea04f614c99"}},{"ruleId":"D2","level":"warning","message":{"text":"transport.RoundTrip (cognitive 34): transport.RoundTrip has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 3, loops 1 (nesting depth added 19). Of this number, 23 points are the body\u0027s own statements and 11 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_factories/create/remote.go"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9989258718a71d4f4d74a2abb7481de28fe976f9b00889c902d33f5b69df96"}},{"ruleId":"D2","level":"warning","message":{"text":"templateNamespace.doParseTemplate (cognitive 34): templateNamespace.doParseTemplate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 2 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templates.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"e731ac01ab362b38f3a95c3a07e7f2bf5ed06a0ca7db2ee7a994f6d23d7ab056"}},{"ruleId":"D2","level":"warning","message":{"text":"bestMatch.isBetter (cognitive 34): bestMatch.isBetter has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (31 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5ca1074a86b625da6a28232fcbb14e32bf1e302d30383202ed94b90a9a22005"}},{"ruleId":"D2","level":"warning","message":{"text":"Inspector.parseSource (cognitive 33): Inspector.parseSource has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (13 pts), match/switch 2 (6 pts), boolean chains 1 (nesting depth added 18). None of this is in the body itself: all 33 points belong to one function literal inside it that branches (line 172). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/methods.go"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"454632e0fe1be4349caac58d4f69756cc032170467219d4dfdec64158108df1a"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.removeStale (cognitive 33): commands.removeStale has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (32 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"73da716cbab511b821442ebe7bd2ebe995bf8adf958f1143a3102d37feecc181"}},{"ruleId":"D2","level":"warning","message":{"text":"PathParser.applyPrefixIdentifier (cognitive 33): PathParser.applyPrefixIdentifier has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 2, match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"53432ad865790ac1f9f25f48c8a50c50cd62777e42a3195d3d55e891634c3624"}},{"ruleId":"D2","level":"warning","message":{"text":"pageContentOutput.initRenderHooks (cognitive 33): pageContentOutput.initRenderHooks has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 7, match/switch 2 (nesting depth added 4). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to one function literal inside it that branches (line 245). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__per_output.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"699682e21ef78daed7920fd1d8085a4dede7c99443e55a1e1cfb39e6ff440b70"}},{"ruleId":"D2","level":"warning","message":{"text":"attributes.New (cognitive 33): attributes.New has cognitive complexity 33 (threshold 15). Drivers by points: if/else 8 (26 pts), loops 2 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/internal/attributes/attributes.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4624808da01b16ceda649f1d0d446816240427a9462eb5c00124ea2ae809315"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.transform (cognitive 33): Client.transform has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (30 pts), boolean chains 2, loops 1 (nesting depth added 11). Of this number, 31 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/js/build.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f1e08fe61d6d97598c2bb77cb9464cfaee90b5441701a446eb88bbcfa6d950"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.FormatNumberCustom (cognitive 33): Namespace.FormatNumberCustom has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 5 (11 pts), match/switch 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/lang/lang.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f535d68237f6352cd4b925e3d931f2ac35ce90c158cbb70b4d88da829835731"}},{"ruleId":"D2","level":"warning","message":{"text":"Deployer.walkRemote (cognitive 33): Deployer.walkRemote has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (30 pts), boolean chains 2, loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"304ecfa83f21fefc5bc14e640c736ddc95f8c1c1cd5d87a3a9fc856395808f68"}},{"ruleId":"D2","level":"warning","message":{"text":"commands.newModCommands (cognitive 32): commands.newModCommands has cognitive complexity 32 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 2 (nesting depth added 8). None of this is in the body itself: all 32 points belong to 8 function literals inside it that branch (lines 249, 103, 67, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/mod.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"77529cc58ed20539722eab9c40cfbced3c30ab7827277143021a6f0f57c62e53"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.fileEventsContentPaths (cognitive 32): HugoSites.fileEventsContentPaths has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 6 (10 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":1322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a562a8a09f5653fc0d96d32b8195499708a7e4f5ad67af608991f2b3953cbe5b"}},{"ruleId":"D2","level":"warning","message":{"text":"pageState.shiftToOutputFormat (cognitive 32): pageState.shiftToOutputFormat has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 15). Of this number, 29 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page.go"},"region":{"startLine":873}}}],"partialFingerprints":{"codehealthFindingId/v1":"48b48083f13c52e4dde85f4ceaa195aa7d3ff841c7015d9db9a5ca249e64897e"}},{"ruleId":"D2","level":"warning","message":{"text":"pageFinder.getContentNodeForRef (cognitive 32): pageFinder.getContentNodeForRef has cognitive complexity 32 (threshold 15). Drivers by points: if/else 14 (22 pts), boolean chains 10 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/pagecollections.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"124478cfde8bf821bcf14443dcad2ea484774cad0bdb5699fdf9048a97393d86"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.checkWhereMap (cognitive 32): Namespace.checkWhereMap has cognitive complexity 32 (threshold 15). Drivers by points: if/else 5 (19 pts), match/switch 4 (12 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"1829c17656cb837557e3b0e3886c11fbedbdbfd819e0f7021b5c9b15d38a8f6a"}},{"ruleId":"D2","level":"warning","message":{"text":"descriptorHandler.compareDescriptors (cognitive 32): descriptorHandler.compareDescriptors has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 8 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatedescriptor.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"22dcef47ae23a757a508dd66dbc092500261b917a64728c1cad8f0931ac03bf5"}},{"ruleId":"D2","level":"warning","message":{"text":"Deps.Init (cognitive 31): Deps.Init has cognitive complexity 31 (threshold 15). Drivers by points: if/else 24 (28 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deps/deps.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"d165f2703512fff9bd9128a8f4ab4379396422eb83520f56d8f1aef40fc67d89"}},{"ruleId":"D2","level":"warning","message":{"text":"pageState.setMetaPost (cognitive 31): pageState.setMetaPost has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (25 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"7934af304ede25e84fc40c45f9efad95d5eb4c8ad05a70dff1b8925edc44aa6c"}},{"ruleId":"D2","level":"warning","message":{"text":"pageparser.lexShortcodeParam (cognitive 31): pageparser.lexShortcodeParam has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 6, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/pagelexer_shortcode.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"6058325157dec3701f5bd28c42c2ed29698864d935bd767f995a45bbd7bce3d8"}},{"ruleId":"D2","level":"warning","message":{"text":"pageparser.lexShortcodeQuotedParamVal (cognitive 31): pageparser.lexShortcodeQuotedParamVal has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (25 pts), jumps 2, match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/pagelexer_shortcode.go"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6099f421d9ddc9f38a42b528d5c29e8c795b5a5acdcf4662764b5c2da91442"}},{"ruleId":"D2","level":"warning","message":{"text":"paths.findWrapperDotPositions (cognitive 30): paths.findWrapperDotPositions has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (8 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e0347e5bd872e8aec87d5d0646d01794ecf248c9d9338391a70e7c3d5127c6e"}},{"ruleId":"D2","level":"warning","message":{"text":"pageMeta.applyDefaultValues (cognitive 30): pageMeta.applyDefaultValues has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (27 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":954}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4bd5dd284f754e420f4acd58b40e0c809e953d8e9c090bf3abda0298b26cdb"}},{"ruleId":"D2","level":"warning","message":{"text":"goldmark.newMarkdown (cognitive 30): goldmark.newMarkdown has cognitive complexity 30 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/convert.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"6344d08228083368b54047a8f52caed875c69e2469a730ef6bdcd47f9536bcd3"}},{"ruleId":"D2","level":"warning","message":{"text":"babelTransformation.Transform (cognitive 30): babelTransformation.Transform has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/babel/babel.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddc7bd7d9a91c02000be0a50bbdd998f8c4647bd97028edafb2194393e18402"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Seq (cognitive 30): Namespace.Seq has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 8, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc7ea9128d886be11048ce3ff7e91aa33596d5a4126c093af722ce808c7e67e"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStore.templates (cognitive 30): TemplateStore.templates has cognitive complexity 30 (threshold 15). Drivers by points: if/else 5 (17 pts), loops 6 (13 pts) (nesting depth added 19). None of this is in the body itself: all 30 points belong to one function literal inside it that branches (line 1812). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1811}}}],"partialFingerprints":{"codehealthFindingId/v1":"6683e443e9066551fb716b5f49e6ddcca4585206c583156b4a687806e1559e6a"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.MatchRedirect (cognitive 29): Server.MatchRedirect has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 2 (6 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/commonConfig.go"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a1650bb48c8831b85c789e323a1812aa103f45aeddc51c8b7f69d33904ade59"}},{"ruleId":"D2","level":"warning","message":{"text":"Filters.Text (cognitive 29): Filters.Text has cognitive complexity 29 (threshold 15). Drivers by points: if/else 6 (21 pts), boolean chains 3, match/switch 1 (3 pts), loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/filters.go"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a9bec83589c946339dcf6fb4c3da929e77e927b968ff0c89a0c9c7fe24e6b7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.doIndex (cognitive 29): Namespace.doIndex has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (19 pts), match/switch 2 (5 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/index.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4158f327a52612ec546f29d3b66dbb75b19237d243703c378aa94c13749fa47"}},{"ruleId":"D2","level":"warning","message":{"text":"FilenameFilter.doMatch (cognitive 28): FilenameFilter.doMatch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/hglob/filename_filter.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"b55e316d1e4e04d9668bef761cbfe2cb3e35b28ff6e27b8a42e5be969b02256e"}},{"ruleId":"D2","level":"warning","message":{"text":"hugolib.createTargetPathDescriptor (cognitive 28): hugolib.createTargetPathDescriptor has cognitive complexity 28 (threshold 15). Drivers by points: if/else 20 (25 pts), boolean chains 3 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__paths.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d297db8bbc04a2c7fd2661704c7d2e6e271299aedac8973b17aebedbb17ce1b"}},{"ruleId":"D2","level":"warning","message":{"text":"allPagesAssembler.createAllPages (cognitive 28): allPagesAssembler.createAllPages has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 16). Most of this is not in the body itself: 3 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 113, 103). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"b294497b940212b5973ecb44cb9f6df87b0a5d01c87dd4736704f2e9b2ffa0e6"}},{"ruleId":"D2","level":"warning","message":{"text":"Codec.EncodeTo (cognitive 28): Codec.EncodeTo has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 1 (3 pts), match/switch 1 (nesting depth added 16). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/codec.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"9636fd520173d239003918c7bd69ac8b8ec405fd3f60a5ab5d1dd8810ac109dc"}},{"ruleId":"D2","level":"warning","message":{"text":"collections._d (cognitive 28): collections._d has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (9 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/vitter.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"715310558c3dc6c6e30b75c47d85136f397944344ee9bb4f745bac51a2691897"}},{"ruleId":"D2","level":"warning","message":{"text":"Methods.ToMarshalJSON (cognitive 27): Methods.ToMarshalJSON has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 7 (9 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/methods.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"c401a27797b54bf299eb8edbf6ce170853ee97582483c4d69d026fe524b2c111"}},{"ruleId":"D2","level":"warning","message":{"text":"aliasHandler.targetPathAlias (cognitive 27): aliasHandler.targetPathAlias has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 5 (9 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/alias.go"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"38df1215ee5638daf0eb5b2d2300917574d80d1886eb839c085e777716162053"}},{"ruleId":"D2","level":"warning","message":{"text":"pagesCollector.collectDirDir (cognitive 27): pagesCollector.collectDirDir has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 4 (nesting depth added 9). None of this is in the body itself: all 27 points belong to 2 function literals inside it that branch (lines 270, 263). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/pages_capture.go"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"17655956c13d94e769408916ca574d43de757f9e9266b023d95b2fc742827f0b"}},{"ruleId":"D2","level":"warning","message":{"text":"imageResource.Filter (cognitive 27): imageResource.Filter has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4, match/switch 1 (2 pts) (nesting depth added 11). Most of this is not in the body itself: 10 of the 27 points are its own statements and the rest belongs to one function literal inside it that branches (line 343). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/image.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab2913d5dd78f0345c00bb683e22e861ec9f9bc96ddef6b05817533239cb501"}},{"ruleId":"D2","level":"warning","message":{"text":"postcssTransformation.Transform (cognitive 27): postcssTransformation.Transform has cognitive complexity 27 (threshold 15). Drivers by points: if/else 16 (24 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/cssjs/postcss.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f4e31eaa1c223fc732140c96d4fe3f9fc0768aaa1c1edf0eb5c6de4dcf57c7"}},{"ruleId":"D2","level":"warning","message":{"text":"collections.mergeMap (cognitive 27): collections.mergeMap has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (24 pts), loops 2, boolean chains 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/merge.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"00276f987eeb8f50555d8af9a1db8c7ae75ba2eb4c23472ef9a42d89336b9eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"contentBuilder.buildDir (cognitive 26): contentBuilder.buildDir has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 10). Of this number, 21 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"create/content.go"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"16bbd3264c3472320b46d350b56a6ff3604204bc682ecab0f2b4a4370edabe8a"}},{"ruleId":"D2","level":"warning","message":{"text":"PathSpec.RelURL (cognitive 26): PathSpec.RelURL has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers/url.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"69ddb19de52f4a8de0a8fb3f7e3d7fc6fe596cdd01b8ebd8a325b615f0492ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseFs.WatchFilenames (cognitive 26): BaseFs.WatchFilenames has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (19 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 17). Of this number, 17 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/filesystems/basefs.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"67f2aa3ce29119265a3181d74e06d7b77f023f7885d136ac321e95b2bea3ad07"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.resolveAndResetDependententPageOutputs (cognitive 26): HugoSites.resolveAndResetDependententPageOutputs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 6 (9 pts), boolean chains 2, jumps 1 (nesting depth added 8). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 1106, 1086, 1144, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":1064}}}],"partialFingerprints":{"codehealthFindingId/v1":"809b208caa94bc467f5b9018eec2e74c6fe68c1fe3c1ead7cadf4eef8ced3a0d"}},{"ruleId":"D2","level":"warning","message":{"text":"scriptGroup.removeNotSet (cognitive 26): scriptGroup.removeNotSet has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 4 (9 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/batch.go"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72ef517a12c24e5eb207a1e610b542e79f63e9e1280c52ec12ae4d12b1584cf"}},{"ruleId":"D2","level":"warning","message":{"text":"Translator.initFuncs (cognitive 26): Translator.initFuncs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 2, loops 1 (nesting depth added 13). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to one function literal inside it that branches (line 78). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"langs/i18n/i18n.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8defd77fb8df612ec8e536e67a6b7bb0ff7cc0923620086f7958e2af1e2e6f98"}},{"ruleId":"D2","level":"warning","message":{"text":"Pages.GroupBy (cognitive 26): Pages.GroupBy has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, match/switch 2 (3 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pagegroup.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"da18b5a391a0385b2d521051058610b9eaed654072038ff3994e6be90da9a638"}},{"ruleId":"D2","level":"warning","message":{"text":"state.validateType (cognitive 26): state.validateType has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/hugo_template.go"},"region":{"startLine":542}}}],"partialFingerprints":{"codehealthFindingId/v1":"143b3665fdf67c254805ecdc4e97e7d14762c0ef232c84038af8426da6eacd4c"}},{"ruleId":"D2","level":"warning","message":{"text":"predicate.NewIndexStringPredicateFromGlobsAndRanges (cognitive 25): predicate.NewIndexStringPredicateFromGlobsAndRanges has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (20 pts), match/switch 1 (4 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/predicate/predicate.go"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2916df91044b406ca04245e013ab313d9fff3a19d4aaa22d5169e6b125fe813"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.assemble (cognitive 25): HugoSites.assemble has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 6 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e79d6add55130a00f8fb80993aeac5cba7791c76767087406f185f9cb0589a"}},{"ruleId":"D2","level":"warning","message":{"text":"hugoContextRenderer.renderHTMLBlock (cognitive 25): hugoContextRenderer.renderHTMLBlock has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 1 (3 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/hugocontext/hugocontext.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"6289822e0f3413406b41d40c974788f52ed3de24f448f510bc8867ec1360913e"}},{"ruleId":"D2","level":"warning","message":{"text":"metadecoders.validateAliasLimitForCollections (cognitive 25): metadecoders.validateAliasLimitForCollections has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 3 (6 pts), match/switch 1 (nesting depth added 12). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 238, 223). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/metadecoders/decoder.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab32261c9f0a8606b3da39dbb9417bf0b1f101819dc73e990c81d1b1f18f269d"}},{"ruleId":"D2","level":"warning","message":{"text":"PageConfigEarly.CompileEarly (cognitive 25): PageConfigEarly.CompileEarly has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pagemeta/page_frontmatter.go"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0decf9d444a788d34f4813ba03946bd6a00c3a99930a749793db627d4b9dade6"}},{"ruleId":"D2","level":"warning","message":{"text":"common.readInput (cognitive 25): common.readInput has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 3 (10 pts), loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/js/common.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"1449293f11ebe5f60e867965036418e99259d2301ed4b687b0365cebd3a08e59"}},{"ruleId":"D2","level":"warning","message":{"text":"Params.merge (cognitive 24): Params.merge has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 4, loops 1 (nesting depth added 11). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hmaps/params.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b1b0350af5f6a2948d261f6bf8ee4259dafe5996b0dfc64f2a8269953ac4ad"}},{"ruleId":"D2","level":"warning","message":{"text":"hreflect.convertToFloatIfPossible (cognitive 24): hreflect.convertToFloatIfPossible has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hreflect/convert.go"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f234ed0e9a372dd82be43fdcec1c82869d56285cd06a45e79b0921289d12c81"}},{"ruleId":"D2","level":"warning","message":{"text":"cachedContentScope.contentRendered (cognitive 24): cachedContentScope.contentRendered has cognitive complexity 24 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 2 (nesting depth added 4). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to one function literal inside it that branches (line 498). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb935b9531b1a7c9ed3f821e1b483c74e790d3a456b7bf23f8c85067ea112323"}},{"ruleId":"D2","level":"warning","message":{"text":"Site.prepareInits (cognitive 24): Site.prepareInits has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (21 pts), loops 3 (nesting depth added 9). None of this is in the body itself: all 24 points belong to 4 function literals inside it that branch (lines 900, 870, 947, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a36e598371e19373e3ef46e25f5cd0cfa7da442d88b2acad54e7de0d40a66e"}},{"ruleId":"D2","level":"warning","message":{"text":"transformer.Transform (cognitive 24): transformer.Transform has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 8). Of this number, 13 points are the body\u0027s own statements and 11 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/internal/extensions/attributes/attributes.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"326dad240c165f56969a563ae765f03b588c624a0950c9a1989a6de772922321"}},{"ruleId":"D2","level":"warning","message":{"text":"output.DecodeConfig (cognitive 24): output.DecodeConfig has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 3 (6 pts) (nesting depth added 15). None of this is in the body itself: all 24 points belong to one function literal inside it that branches (line 41). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"output/config.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd6f7c9ceffb006cc1c1779cf763d88c257fe04ccf27c3e7631acc0b11fb579"}},{"ruleId":"D2","level":"warning","message":{"text":"collections.evaluateSubElem (cognitive 24): collections.evaluateSubElem has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, match/switch 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba0b758c523e6b8118595d02921721b9a36f40721e97d735c2ecdf8cc4be76be"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.compareGetWithCollator (cognitive 24): Namespace.compareGetWithCollator has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, match/switch 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/compare/compare.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ec04270b81d9333989ca46e1e38b232c0acc354df05b7229d8953d146c8d72"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStore.insertEmbedded (cognitive 24): TemplateStore.insertEmbedded has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (19 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). None of this is in the body itself: all 24 points belong to one function literal inside it that branches (line 1122). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b927be98837836cd3cba48825d32cf89892cd7cc9d2a97e18e5147878b9b8192"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStore.toKeyCategoryAndDescriptor (cognitive 24): TemplateStore.toKeyCategoryAndDescriptor has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (20 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1840}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2ad8911d208803a6cecbbfa83dd0601a2a30e1c9e517fa832cb7e8858684ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Server.CompileConfig (cognitive 23): Server.CompileConfig has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/commonConfig.go"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"70c28f3bd616752744358a8520a81b87b2275f6da642a75d3546f1d2a132d930"}},{"ruleId":"D2","level":"warning","message":{"text":"pageMap.getPagesInSection (cognitive 23): pageMap.getPagesInSection has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 4 (nesting depth added 8). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to one function literal inside it that branches (line 346). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1cd765ba4995c131e567dd60d888b6f48e8a3dccce784c1226f5f044688b1f"}},{"ruleId":"D2","level":"warning","message":{"text":"BaseFs.AbsProjectContentDir (cognitive 23): BaseFs.AbsProjectContentDir has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/filesystems/basefs.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"26dbcf453dd69bb631d7a67d1e3b07e0303867a41f603d9dec6170950af19f55"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.handleDataFile (cognitive 23): HugoSites.handleDataFile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (4 pts), match/switch 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites.go"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"222031fbbbcc41297f00f24b35603793024f01174cc47d9b9f83f2ca9d7adcab"}},{"ruleId":"D2","level":"warning","message":{"text":"cachedContentScope.contentToC (cognitive 23): cachedContentScope.contentToC has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 1 (2 pts) (nesting depth added 7). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to one function literal inside it that branches (line 650). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b56f10ea90531a3efcaeb35a1edc5d009e69a20c4503712e2df25e619a43df4"}},{"ruleId":"D2","level":"warning","message":{"text":"cachedContentScope.RenderShortcodes (cognitive 23): cachedContentScope.RenderShortcodes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, match/switch 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4c8769241c16636d1afb35f138b2627f4c0aaa9be06e64fea87d61ab9d9c36f"}},{"ruleId":"D2","level":"warning","message":{"text":"pageMetaSource.doInitEarly (cognitive 23): pageMetaSource.doInitEarly has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b458aa3e678b070dc84800fee6746457054128687cc717af543cf6fef693cfd"}},{"ruleId":"D2","level":"warning","message":{"text":"codeblocks.getAttributes (cognitive 23): codeblocks.getAttributes has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/codeblocks/render.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d13793ce1b9faa5e822f297370db4a8490fe4b930f1c946ded4710fd62a158f"}},{"ruleId":"D2","level":"warning","message":{"text":"npm.PackageFilesSum (cognitive 23): npm.PackageFilesSum has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 3, boolean chains 2 (nesting depth added 6). Of this number, 21 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/npm/package_builder.go"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1dce231aac5f285917b050dd35608a98e816d87cd2b83fc440478a5df3c27b9"}},{"ruleId":"D2","level":"warning","message":{"text":"publisher.isClosedByTag (cognitive 23): publisher.isClosedByTag has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (18 pts), match/switch 1 (2 pts), boolean chains 1, jumps 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"publisher/htmlElementsCollector.go"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"e954ca3ff01f52f4ef57455b7a33fafe33bc7328afb06e96c24c6cd99b2c38d6"}},{"ruleId":"D2","level":"warning","message":{"text":"page.ExtractSummaryFromHTML (cognitive 23): page.ExtractSummaryFromHTML has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). Of this number, 17 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_markup.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"f65dd12f18a570a4081baa717c5cd7e0fe1b0bc3a18e5e99e532a09bbba72a9c"}},{"ruleId":"D2","level":"warning","message":{"text":"PermalinkExpander.toSliceFunc (cognitive 23): PermalinkExpander.toSliceFunc has cognitive complexity 23 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 3 (nesting depth added 5). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 446, 487, 505). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/permalinks.go"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"3746206281ed63f554a2e39899c69d80577dc7c044a5e8080a138097f62e7cb4"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.Concat (cognitive 23): Client.Concat has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (8 pts), boolean chains 2 (nesting depth added 9). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 85). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_factories/bundler/bundler.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"af687826bd0bb36b47de8caec39faed47ffdca0cd1db0fd1eae04b7fb7cf6e46"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Truncate (cognitive 23): Namespace.Truncate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 1, loops 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/truncate.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"6278d6caaabed8c15484204e47e05211e46c3107a033ad0126aeff15617c0aec"}},{"ruleId":"D2","level":"warning","message":{"text":"templateTransformContext.applyTransformations (cognitive 23): templateTransformContext.applyTransformations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (4 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 12). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatetransform.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"e469cd159a524a4aa075813b95e0dc345a825aebc15ee2d4d4b04e7ebf1ed16f"}},{"ruleId":"D2","level":"warning","message":{"text":"hugio.CopyDir (cognitive 22): hugio.CopyDir has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hugio/copy.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"06fafed72a6a96492c580aff02c2bbd3e66f44f5a14f56cf2929c3aec3b10a61"}},{"ruleId":"D2","level":"warning","message":{"text":"pageMap.CreateSiteTaxonomies (cognitive 22): pageMap.CreateSiteTaxonomies has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (4 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 11). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 1179). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":1165}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c811396d84e061a7f4cd7aeca6eea4a701b572d0d797c5e6bc48c05c9481baa"}},{"ruleId":"D2","level":"warning","message":{"text":"allPagesAssembler.createMissingStandalonePages (cognitive 22): allPagesAssembler.createMissingStandalonePages has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, match/switch 1 (2 pts), loops 1 (nesting depth added 7). Of this number, 17 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":1416}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b7f2bccac541bb6ce7b466b33a0d14f23f591bd0b2323afb5b7e3f7c64f441"}},{"ruleId":"D2","level":"warning","message":{"text":"sitePagesAssembler.assembleResourcesAndSetHome (cognitive 22): sitePagesAssembler.assembleResourcesAndSetHome has cognitive complexity 22 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 1 (nesting depth added 5). None of this is in the body itself: all 22 points belong to one function literal inside it that branches (line 1231). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b319ba49aa2a81b6ab24cb2455688cbc34b156fd6da379e680535e1a9225044"}},{"ruleId":"D2","level":"warning","message":{"text":"Site.executeDeferredTemplates (cognitive 22): Site.executeDeferredTemplates has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 1 (nesting depth added 11). None of this is in the body itself: all 22 points belong to one function literal inside it that branches (line 518). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":517}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca1af3f641342b32dc3f2c47d5600735ffa09ceb2c201a72159d32e6b4825de9"}},{"ruleId":"D2","level":"warning","message":{"text":"Site.handleContentAdapterChanges (cognitive 22): Site.handleContentAdapterChanges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (20 pts), boolean chains 1, loops 1 (nesting depth added 11). Most of this is not in the body itself: 10 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 1290). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b5c94cad270a600b5db9f886b0bf4960e41d1122988a43df3ec92e753ebaaac"}},{"ruleId":"D2","level":"warning","message":{"text":"scriptGroup.removeTouchedButNotSet (cognitive 22): scriptGroup.removeTouchedButNotSet has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/batch.go"},"region":{"startLine":1180}}}],"partialFingerprints":{"codehealthFindingId/v1":"818c002d9316c58640aae9aefd98b8992dcd4140026516dbaba822ed47bd9abc"}},{"ruleId":"D2","level":"warning","message":{"text":"WebpCodec.Encode (cognitive 22): WebpCodec.Encode has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 2 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/webp.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f2db681b09059ae05754ab31141556a5af8b759fd28a37e8e1525fd99c48f32"}},{"ruleId":"D2","level":"warning","message":{"text":"Client.writeHugoDirectSum (cognitive 22): Client.writeHugoDirectSum has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, loops 3 (nesting depth added 5). Of this number, 20 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":606}}}],"partialFingerprints":{"codehealthFindingId/v1":"9920e231f32e7ad9f0504f0ecf60485b621785e4ffd29586a94448242da6906a"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.addAndRecurse (cognitive 22): collector.addAndRecurse has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"68fb3b08929c99e77a597480707854ad4a9082be96b753b3064aa3af73871eac"}},{"ruleId":"D2","level":"warning","message":{"text":"ResourceSourceDescriptor.init (cognitive 22): ResourceSourceDescriptor.init has cognitive complexity 22 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bbcfc19e73104f532359c5c3c9be04356a62c5df341c870c1e05c470e66b3f"}},{"ruleId":"D2","level":"warning","message":{"text":"toc.toc (cognitive 22): toc.toc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 12). Most of this is not in the body itself: 1 of the 22 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 28, 25, 19). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/assets/js/alpinejs/data/toc.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf989c7729dcb7f5a0debe38d040048f12ca42b482fff3544b41339d9cd99e9b"}},{"ruleId":"D2","level":"warning","message":{"text":"importCommand.convertJekyllMetaData (cognitive 21): importCommand.convertJekyllMetaData has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/import.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d110ba75106916073a3fa5016a2a7d5b8b579c7f08912a7a052ec8d56cc1aaef"}},{"ruleId":"D2","level":"warning","message":{"text":"version.CompareVersions (cognitive 21): version.CompareVersions has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/version/version.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd10c55bd7601020cf9d80909318d8a46b7a9966b4671549815d6ac7a37d63b3"}},{"ruleId":"D2","level":"warning","message":{"text":"defaultConfigProvider.determineMergeStrategy (cognitive 21): defaultConfigProvider.determineMergeStrategy has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, match/switch 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/defaultConfigProvider.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bccb5235aba443d5921a3689a8780bfb17ffec07acb32414268d0df09e3ec2f"}},{"ruleId":"D2","level":"warning","message":{"text":"PathSpec.AbsURL (cognitive 21): PathSpec.AbsURL has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers/url.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"1751ac461efa42cd7a1b5320dda73d1b52048e4d07a23e8736500d7313de9565"}},{"ruleId":"D2","level":"warning","message":{"text":"pageMap.forEachResourceInPage (cognitive 21): pageMap.forEachResourceInPage has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 2, loops 1 (nesting depth added 7). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 500, 543, 535). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":477}}}],"partialFingerprints":{"codehealthFindingId/v1":"b37df4cb5e5aca798179d074ec925da6e785eab667343380f581106254ccbd3e"}},{"ruleId":"D2","level":"warning","message":{"text":"Site.renderDefaultSiteRedirect (cognitive 21): Site.renderDefaultSiteRedirect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (5 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site_render.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"e04908391437e469ab666b40a37bb910f2a8b809c37a0984a30b334cde0a59b9"}},{"ruleId":"D2","level":"warning","message":{"text":"IntSetsBuilder.WithConfig (cognitive 21): IntSetsBuilder.WithConfig has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 8). Most of this is not in the body itself: 3 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 782). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/sitesmatrix/vectorstores.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5572b6111749e25328a2082693c5834798cadb0c804914a771daecd9cecfbc"}},{"ruleId":"D2","level":"warning","message":{"text":"AvifCodec.Decode (cognitive 21): AvifCodec.Decode has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/avif.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f576ce681fdbb09b63aad0ab3cfc0eeefbcaa477ee22ca0ae409f0c1ad27c0"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight.highlight (cognitive 21): highlight.highlight has cognitive complexity 21 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 1 (nesting depth added 4). Of this number, 17 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/highlight/highlight.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ece12c03d519de5018b2608db228550bdf001e33aa2414e96c05df8a23f7d8ba"}},{"ruleId":"D2","level":"warning","message":{"text":"Decoder.unmarshalCSV (cognitive 21): Decoder.unmarshalCSV has cognitive complexity 21 (threshold 15). Drivers by points: loops 3 (10 pts), if/else 3 (8 pts), match/switch 2 (3 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/metadecoders/decoder.go"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fd583a57b780048c785898440beb3036a1836de97aa785c4b7293943f65adf"}},{"ruleId":"D2","level":"warning","message":{"text":"Codec.DecodeFormat (cognitive 21): Codec.DecodeFormat has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (20 pts), match/switch 1 (nesting depth added 11). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/codec.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"541cecba9ff2e7d2daf53586d51734af75bca06de2138101ecbaca41e2ef6518"}},{"ruleId":"D2","level":"warning","message":{"text":"page.expandSummaryDivider (cognitive 21): page.expandSummaryDivider has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_markup.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9af7db63b51c34b9fd9c559237ecb64cbd16efb21ae1d2f24b53b0dc612c150"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Intersect (cognitive 21): Namespace.Intersect has cognitive complexity 21 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 2 (7 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"167cd44b1ab32a31104288a252660e2e1c60f0c22e19b93a3530c94049f5616c"}},{"ruleId":"D2","level":"warning","message":{"text":"Deployer.walkLocal (cognitive 21): Deployer.walkLocal has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 3, loops 1 (nesting depth added 4). Most of this is not in the body itself: 2 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 497). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"f503a53b479c79979cad22dd83677b7dcb55be3ebfeb22a0044c5fcadfa0417b"}},{"ruleId":"D2","level":"warning","message":{"text":"staticSyncer.syncsStaticEvents (cognitive 20): staticSyncer.syncsStaticEvents has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, loops 1 (nesting depth added 8). None of this is in the body itself: all 20 points belong to one function literal inside it that branches (line 1073). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":1070}}}],"partialFingerprints":{"codehealthFindingId/v1":"075eea9f72a517dd11507522cf097c23e04729bc8cb4faf5fb5bb94a59f560a7"}},{"ruleId":"D2","level":"warning","message":{"text":"skeletons.CreateProject (cognitive 20): skeletons.CreateProject has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (3 pts), match/switch 1 (2 pts) (nesting depth added 9). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"create/skeletons/skeletons.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fea2b8f042106079a8b97e4ce57fa2be3d54230a99dd9257ce1bc158cea65e5"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.fileEventsApplyInfo (cognitive 20): HugoSites.fileEventsApplyInfo has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea24e4df94fdfdb458f64e5ff0349c1b5168c15395d68795f3c3f611ed25867b"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatcher.inputJSON (cognitive 20): dispatcher.inputJSON has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 2, loops 2 (nesting depth added 7). Of this number, 15 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/warpc.go"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f6ca5e566e515053bcc4e48ee4ab11284bfac00ecc68ea3c7f2a91d9342a954"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight.normalizeHighlightOptions (cognitive 20): highlight.normalizeHighlightOptions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/highlight/config.go"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"25869a98d4817e30947187fe443afdb327a1165c9e5c3c12908ac8628dcceee8"}},{"ruleId":"D2","level":"warning","message":{"text":"navigation.PageMenusFromPage (cognitive 20): navigation.PageMenusFromPage has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"navigation/pagemenus.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"beb232e3c3eee673b9611893bfac7ef9c79c7aed5993466befc5cccf47c10abc"}},{"ruleId":"D2","level":"warning","message":{"text":"pageMenus.HasMenuCurrent (cognitive 20): pageMenus.HasMenuCurrent has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"navigation/pagemenus.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c23c774272196855a947e739a2906bc09fb26826aedf3648358eea37d886f04"}},{"ruleId":"D2","level":"warning","message":{"text":"output.decode (cognitive 20): output.decode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 1 (4 pts), loops 1 (2 pts) (nesting depth added 12). Most of this is not in the body itself: 2 of the 20 points are its own statements and the rest belongs to one function literal inside it that branches (line 99). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"output/config.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bd72ae7e06e561f89a1c3d3dd3b5e32501b4e5a1cd225b31a6cf532139e8cc1"}},{"ruleId":"D2","level":"warning","message":{"text":"Decoder.Decode (cognitive 20): Decoder.Decode has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 1 (nesting depth added 8). Most of this is not in the body itself: 6 of the 20 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 229, 217). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/meta/meta.go"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0d0e82ab9e281064a596aa0e203ec23a2eee555cce70fd9d1042ad7df8d2b5a"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.SymDiff (cognitive 20): Namespace.SymDiff has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/symdiff.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b04315d010b7e018fde2b84ed8a6bb29bec032141ad6fef678c50983ca7f44a5"}},{"ruleId":"D2","level":"warning","message":{"text":"tplimpl.needsBaseTemplate (cognitive 20): tplimpl.needsBaseTemplate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templates.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"52204b066011b91fac13f1c5efb4073a85479110cb0ef8042fb1e30216435ecc"}},{"ruleId":"D2","level":"warning","message":{"text":"serverCommand.fixURL (cognitive 19): serverCommand.fixURL has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"445a869a97e182aef440bc8e6c53791e87e2089ba3d1af27d577fbf6b4904573"}},{"ruleId":"D2","level":"warning","message":{"text":"sitePagesAssembler.assembleTerms (cognitive 19): sitePagesAssembler.assembleTerms has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts) (nesting depth added 9). Most of this is not in the body itself: 2 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 1156). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":1141}}}],"partialFingerprints":{"codehealthFindingId/v1":"03eddbcf9d42aeb1e483c9031bf6fde9d287b2a5342e108fb02de0540a457538"}},{"ruleId":"D2","level":"warning","message":{"text":"BatcherClient.New (cognitive 19): BatcherClient.New has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts) (nesting depth added 10). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 242, 205). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/batch.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b546da81b2684ef260f93664b7067a1589266defd5d88137b55fc084ba3cc02"}},{"ruleId":"D2","level":"warning","message":{"text":"hugoContextTransformer.Transform (cognitive 19): hugoContextTransformer.Transform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 1 (nesting depth added 10). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 285). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/hugocontext/hugocontext.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea703c28002696719dd46b7e919944ba52c435c6e9567aff5f2e2fb31acda662"}},{"ruleId":"D2","level":"warning","message":{"text":"tocTransformer.Transform (cognitive 19): tocTransformer.Transform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, match/switch 1 (nesting depth added 5). Most of this is not in the body itself: 3 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 65). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/toc.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2969310199d0509660b6e8344171c148424f8cbb63886b3fb72cb2845324272"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight.ChromaStylesCSS (cognitive 19): highlight.ChromaStylesCSS has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), match/switch 2 (4 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/highlight/chromastyles.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"828201a75502fd1f629af650b991d56b1dc59d5d811b3350c06fe52b4b46a86c"}},{"ruleId":"D2","level":"warning","message":{"text":"pageparser.lexIdentifierInShortcode (cognitive 19): pageparser.lexIdentifierInShortcode has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 1 (2 pts), jumps 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/pagelexer_shortcode.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"652ef6c101af2dfb6aa3d8a80ab3c49726960481f141bc0319bc11bb36486774"}},{"ruleId":"D2","level":"warning","message":{"text":"imageResource.doWithImageConfig (cognitive 19): imageResource.doWithImageConfig has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 6 (nesting depth added 4). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to one function literal inside it that branches (line 428). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/image.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ae1b555c953545e2b31cb92d54557f1c98f4a0d06ce54acbc9074973538939c"}},{"ruleId":"D2","level":"warning","message":{"text":"RelatedDocsHandler.getOrCreateIndex (cognitive 19): RelatedDocsHandler.getOrCreateIndex has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pages_related.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8446eb55a4140dd01d32789a4e2d662e8343d982e4d50a51da959964da96f15"}},{"ruleId":"D2","level":"warning","message":{"text":"tailwindcssTransformation.Transform (cognitive 19): tailwindcssTransformation.Transform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/cssjs/tailwindcss.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e29552aead092796e46007857515625d517d6639343be86506ebb72cc2a97e7"}},{"ruleId":"D2","level":"warning","message":{"text":"resourceAdapter.getOrTransform (cognitive 19): resourceAdapter.getOrTransform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3 (nesting depth added 8). Of this number, 15 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/transform.go"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5229d51d9c76236ba40e2fa128b0af0cb4aae453565eae928bec95a2044b4fc"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Unmarshal (cognitive 19): Namespace.Unmarshal has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 1, match/switch 1 (nesting depth added 3). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 94). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/openapi/openapi3/openapi3.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b833ade4a0d22462d0c8e8fc9abaa081bc2cba4db75050f2c0a5204b338b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"stripHTMLWriter.writeText (cognitive 19): stripHTMLWriter.writeText has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/template.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"c85eedb6d6a20d9d710887d81bb11092835d972d39739530eee2465e3372ffc1"}},{"ruleId":"D2","level":"warning","message":{"text":"templateTransformContext.hasBreakOrContinueOutsideRange (cognitive 19): templateTransformContext.hasBreakOrContinueOutsideRange has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatetransform.go"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f0b1da08bc8a2e446bb4030c3e0f460401d09267b908a790dcfd3feb4464f2d"}},{"ruleId":"D2","level":"warning","message":{"text":"convertCommand.convertContents (cognitive 18): convertCommand.convertContents has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2, boolean chains 1 (nesting depth added 4). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/convert.go"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"4504eac7e823530721e3ddc6ede65a777cc1a4cea985a28a87c30506cff6c884"}},{"ruleId":"D2","level":"warning","message":{"text":"hugoBuilder.fullBuild (cognitive 18): hugoBuilder.fullBuild has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (3 pts) (nesting depth added 5). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"0df4fb0279b17bb1ddb4d2db0f050549edf619054567f7c2467c40b01285b39e"}},{"ruleId":"D2","level":"warning","message":{"text":"hmaps.ConvertFloat64WithNoDecimalsToInt (cognitive 18): hmaps.ConvertFloat64WithNoDecimalsToInt has cognitive complexity 18 (threshold 15). Drivers by points: if/else 2 (8 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hmaps/maps.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f8d9154d7388c808ef738b1f0053edd2e3f2fca6cacbd6a2f4d2c4504cff98"}},{"ruleId":"D2","level":"warning","message":{"text":"dispatcher.inputBlobs (cognitive 18): dispatcher.inputBlobs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 1 (nesting depth added 8). Of this number, 14 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/warpc.go"},"region":{"startLine":377}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc6590c8dbbb2a21b315c8ff16e318767e118aac91420c5fc52f56022c44664e"}},{"ruleId":"D2","level":"warning","message":{"text":"i18n.getPluralCount (cognitive 18): i18n.getPluralCount has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts), boolean chains 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"langs/i18n/i18n.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed97e941e32839beaef62af012e4197ca3972221ab427d5dcbf401b7f6bffdda"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageProcessor.doFilter (cognitive 18): ImageProcessor.doFilter has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 3 (8 pts), if/else 3 (4 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/image.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffd7f19f15fae4a4435e286e6adc7dd1db4b9e53d7331c3282be390ad0b88f7"}},{"ruleId":"D2","level":"warning","message":{"text":"textFilter.Draw (cognitive 18): textFilter.Draw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (4 pts), match/switch 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/text.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4ffd7587591c0a825089a1c59bf62e7b4de3826f15ff211740cb1e05b9b13ad"}},{"ruleId":"D2","level":"warning","message":{"text":"page.DecodeCascadeConfig (cognitive 18): page.DecodeCascadeConfig has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). Most of this is not in the body itself: 2 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 134). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_matcher.go"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"c081df946c77beafb8c9d75fa68f6722d8c5f2fc3e219ddd999b7dc876c16a19"}},{"ruleId":"D2","level":"warning","message":{"text":"cascadeConfigDecoder.mapToPageMatcherParamsConfig (cognitive 18): cascadeConfigDecoder.mapToPageMatcherParamsConfig has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_matcher.go"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"8780e60a004c37e6c3d5cd85c9082d7342aa445a86fed6db6f420f0be4e456a1"}},{"ruleId":"D2","level":"warning","message":{"text":"Pages.GroupByParam (cognitive 18): Pages.GroupByParam has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pagegroup.go"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd943620c876e1e1424b47a868d967f92ee5a774acbacd5a7a492f241b0e359c"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Delimit (cognitive 18): Namespace.Delimit has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fb3e71ece6c16026a568c6f1c0ac9ce59cbac2cd985fadc35bf75884363f81"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.IncludeCached (cognitive 18): Namespace.IncludeCached has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/partials/partials.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff19089e80ce692af1f291379c7ca3620f458d526eb93508c25d5a00258bacfa"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStore.allRawTemplates (cognitive 18): TemplateStore.allRawTemplates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 6 (8 pts) (nesting depth added 8). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 1092). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1090}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4e842e49c5cee8b2bfb34475ae6260137674e94cac082d2501dc2b6ac710ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStore.transformTemplates (cognitive 18): TemplateStore.transformTemplates has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts) (nesting depth added 8). Of this number, 12 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"75df49a98c770c3f03d6d18ec888b0a1cf573c7a014a834eacc4c6b17d006824"}},{"ruleId":"D2","level":"warning","message":{"text":"rootCommand.ConfigFromProvider (cognitive 17): rootCommand.ConfigFromProvider has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (17 pts) (nesting depth added 2). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 245). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/commandeer.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"325fc98bedccbd30fccf0330b0200d3c6dd136417b80afaf1b22409d6b7fa17b"}},{"ruleId":"D2","level":"warning","message":{"text":"allconfig.LoadConfig (cognitive 17): allconfig.LoadConfig has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3 (nesting depth added 2). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/load.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"08a6ca7199bf159f66e8b381e90c12ec091af13c1b6a9c2e1d3b4bd1f98f0ded"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers.ExtractAndGroupRootPaths (cognitive 17): helpers.ExtractAndGroupRootPaths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, jumps 1, loops 1 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers/path.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"73a0379628a526147d3b80402e07d28a783e6ccae41d53f0e7a31515324fb5b6"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers.GetCacheDir (cognitive 17): helpers.GetCacheDir has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers/path.go"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b311039eaf73ad3286a8289c4e30b356f5a4a40ab6f5ea1095717160f1ba119"}},{"ruleId":"D2","level":"warning","message":{"text":"resourceSource.lookupContentNodes (cognitive 17): resourceSource.lookupContentNodes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 2 (nesting depth added 4). Of this number, 16 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"5666ed6f070c1301918b2a20310fbee12551396f38cd8eafbee39ff395224110"}},{"ruleId":"D2","level":"warning","message":{"text":"HugoSites.allSiteLanguages (cognitive 17): HugoSites.allSiteLanguages has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (8 pts), loops 3 (6 pts), jumps 2, boolean chains 1 (nesting depth added 9). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 214). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites.go"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bb5c0604d62da6b43d752a5c23dac41a5e8f02cc758ef8fe7bdeb2ffbebd0d"}},{"ruleId":"D2","level":"warning","message":{"text":"pageFinder.getContentNode (cognitive 17): pageFinder.getContentNode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/pagecollections.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef57f515295d62617cf8ec78903b39e7a70a27528d41d8a8b40070b205e4f1f"}},{"ruleId":"D2","level":"warning","message":{"text":"RolesInternal.init (cognitive 17): RolesInternal.init has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 1 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/roles/roles.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"24bb6e1f8073cf9b2d4a7e1826b68b7f7130a50f35ea8ce02f0aae6275de0178"}},{"ruleId":"D2","level":"warning","message":{"text":"Site.initRenderFormats (cognitive 17): Site.initRenderFormats has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (6 pts) (nesting depth added 9). Of this number, 11 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":969}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e8e9cab089c1e8ae5873600864017069f037116162efae733a6a7c140486cae"}},{"ruleId":"D2","level":"warning","message":{"text":"VersionsInternal.init (cognitive 17): VersionsInternal.init has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 1 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/versions/versions.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"551f76434d786bf42ba7d7831dd4a7f4c8c7599b9cbb372c0ee3e02d331447ab"}},{"ruleId":"D2","level":"warning","message":{"text":"Finder.doCheckOne (cognitive 17): Finder.doCheckOne has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"identity/finder.go"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"02d0efe54700013d69630a2145c5abc77718c162d4c3c9c129d16de60c74cb2a"}},{"ruleId":"D2","level":"warning","message":{"text":"collector.collectModulesTXT (cognitive 17): collector.collectModulesTXT has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"50aedc0b92d2e531cdfa7b4c039e26f9cf027dbf48ea943f1e45d3a9bb508a9c"}},{"ruleId":"D2","level":"warning","message":{"text":"navigation.DecodeConfig (cognitive 17): navigation.DecodeConfig has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts) (nesting depth added 9). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 275). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"navigation/menu.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"81b9d7dad7679d3bf5b8aaaca74c1cdbe718c1750b728ed86a7efef41064f75c"}},{"ruleId":"D2","level":"warning","message":{"text":"imagetesting.RunGolden (cognitive 17): imagetesting.RunGolden has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (3 pts) (nesting depth added 5). Most of this is not in the body itself: 8 of the 17 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 122, 133, 157). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/imagetesting/testing.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"a747593856ff179e7774fdfac26b4c65313797302a409509888510b19ea0c496"}},{"ruleId":"D2","level":"warning","message":{"text":"importResolver.CanonicalizeURL (cognitive 17): importResolver.CanonicalizeURL has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/tocss/dartsass/transform.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"d74f4be728d356245c08c536b46ddd1a4ab1b33c66f9339c13b64a09c4bbde7c"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.ReplacePairs (cognitive 17): Namespace.ReplacePairs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/strings.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e513c23465d8f18263788e2eabbc072738458cf92f6cc5983e0a105b746968c"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.SliceString (cognitive 17): Namespace.SliceString has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/strings.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3b95861149b84d9e8b4c56f6894d88cea29e549e31fbb8ccbad8d9245f5298"}},{"ruleId":"D2","level":"warning","message":{"text":"templateTransformContext.isWithPartial (cognitive 17): templateTransformContext.isWithPartial has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatetransform.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c042ffe77d483074d9f8dfa5487d3c357cb2dddf1143fd7645032bcca5ced55f"}},{"ruleId":"D2","level":"warning","message":{"text":"tplimplinit.CreateFuncMap (cognitive 17): tplimplinit.CreateFuncMap has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimplinit/tplimplinit.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55302986be1b01f9db3f7a1d9d482aa8a94b76801ef9f8905c60fccc9a8dc74"}},{"ruleId":"D2","level":"warning","message":{"text":"urlreplacers.checkCandidateSrcset (cognitive 17): urlreplacers.checkCandidateSrcset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"transform/urlreplacers/absurlreplacer.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d68cc911caa1d068130b52c66fc3e99a79cc9fa8c249d396d9a620ca35e495"}},{"ruleId":"D2","level":"warning","message":{"text":"Deployer.findDiffs (cognitive 17): Deployer.findDiffs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"24852d7153f7fad5b34812794120d7531d69501cfe93134af736108506ab2bce"}},{"ruleId":"D2","level":"warning","message":{"text":"convertCommand.convertAndSavePage (cognitive 16): convertCommand.convertAndSavePage has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/convert.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0a8153c903485b0ceaadb259d4acd74cd7652492c322eef2dffc4403052a39"}},{"ruleId":"D2","level":"warning","message":{"text":"convertCommand.copyContentDirsForOutput (cognitive 16): convertCommand.copyContentDirsForOutput has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/convert.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44ec096ee56f0ee457cb9b3e69c3af5e54554449ec0625af1d642e8c8463c14"}},{"ruleId":"D2","level":"warning","message":{"text":"serverCommand.PreRun (cognitive 16): serverCommand.PreRun has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6 (nesting depth added 2). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 573). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"84c4044b7ab4a2ddfd77088f480dd7609ff0a703d8d3742b7303df5b91b9b0cc"}},{"ruleId":"D2","level":"warning","message":{"text":"hreflect.convertToUintIfPossible (cognitive 16): hreflect.convertToUintIfPossible has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hreflect/convert.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"44776ac792078205526a643ab98858038b4c564b87d7193f49612199a26f4f0b"}},{"ruleId":"D2","level":"warning","message":{"text":"hreflect.convertToIntIfPossible (cognitive 16): hreflect.convertToIntIfPossible has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hreflect/convert.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c68c731a63155024518701b5ad83bc4b40dd2daa9474ab3c0f32059d022960"}},{"ruleId":"D2","level":"warning","message":{"text":"paths.Sanitize (cognitive 16): paths.Sanitize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/path.go"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3bb656ac0d1109a451afdd42007b35d2fe0b940e6a032b75616b75b032c128a"}},{"ruleId":"D2","level":"warning","message":{"text":"PathParser.SitesMatrixFromPath (cognitive 16): PathParser.SitesMatrixFromPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (4 pts), match/switch 1 (nesting depth added 6). None of this is in the body itself: all 16 points belong to one function literal inside it that branches (line 232). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"d170759744eba5a18f782d80d59d0717cf146f614508f57628e895596dd160a7"}},{"ruleId":"D2","level":"warning","message":{"text":"rungroup.Run (cognitive 16): rungroup.Run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 9). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 55). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/rungroup/rungroup.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d790903c44e84a73801deb16bf52efe24cefbc497337220b7df3c99617f6ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"deployconfig.DecodeConfig (cognitive 16): deployconfig.DecodeConfig has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deployconfig/deployConfig.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"69f10baa418ff499f80bda402300dff200d28507d491d473b11b33d22481695d"}},{"ruleId":"D2","level":"warning","message":{"text":"hugofs.AddFileInfoToError (cognitive 16): hugofs.AddFileInfoToError has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/fileinfo.go"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"793c1ca432a60e0a7b6bd6248f4e364a06ce222ed8147be736d32ead39dd58b6"}},{"ruleId":"D2","level":"warning","message":{"text":"hugofs.WalkFilesystems (cognitive 16): hugofs.WalkFilesystems has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/fs.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dbcc97dd197c1854d7df45490ac7bb4350e8119d0e94d5d4b3fdab0896598ba"}},{"ruleId":"D2","level":"warning","message":{"text":"hglob.NewFilenameFilterV2 (cognitive 16): hglob.NewFilenameFilterV2 has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/hglob/filename_filter.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1b82950c83feb42bf384cbff9f5f969824e6e3daf3e1c91c87d9f1bf132fadd"}},{"ruleId":"D2","level":"warning","message":{"text":"RootMappingFs.newUnionFile (cognitive 16): RootMappingFs.newUnionFile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts) (nesting depth added 7). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 504, 494). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/rootmapping_fs.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b64cec2c211a8e31f6f6bbda8b6868bf0525261c84f056788ca8d46f857004"}},{"ruleId":"D2","level":"warning","message":{"text":"pageState.renderResources (cognitive 16): pageState.renderResources has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page.go"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a83dd422041993b615cfac5f421181bb5d463e5c658557d9b7e4a64212a72b2"}},{"ruleId":"D2","level":"warning","message":{"text":"contentParseInfo.contentToRender (cognitive 16): contentParseInfo.contentToRender has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (12 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"814acbeb998d1635cf6153e4c26aca3b97082a14f533766ed920c26c8a3ba8de"}},{"ruleId":"D2","level":"warning","message":{"text":"optsHolder.isStaleOpts (cognitive 16): optsHolder.isStaleOpts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, loops 1 (nesting depth added 6). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 1388). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/batch.go"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e2c22d218133d22d6922bff7cb29692bedd9c0f32c1ee03f66d1f6f7103d222"}},{"ruleId":"D2","level":"warning","message":{"text":"related.DecodeConfig (cognitive 16): related.DecodeConfig has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"related/inverted_index.go"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecfce8de164df927c89a10bb3ad7ac28a7feb3cf0e461c23793e32bd75b4173a"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageConfig.init (cognitive 16): ImageConfig.init has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 4 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/config.go"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0c54252fb390abaa56c6660aef7dff435df958cffea6639879c79b082727546"}},{"ruleId":"D2","level":"warning","message":{"text":"ImagingConfig.init (cognitive 16): ImagingConfig.init has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/config.go"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"620506376013bf49e4179ab35784f434a5e495848433f37a7cc97da5bb6ccb51"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageProcessor.FiltersFromConfig (cognitive 16): ImageProcessor.FiltersFromConfig has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/image.go"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"303559d94cdf6db68ef6ff40c13a1f4c3accdfa4215ded940b1ee16c0c84c9e7"}},{"ruleId":"D2","level":"warning","message":{"text":"page.isPagesProbablySorted (cognitive 16): page.isPagesProbablySorted has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (nesting depth added 6). Most of this is not in the body itself: 6 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 82, 97). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pages_sort_search.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"7915dd99005d604d4f601451199a2defbefbeb373478f07d774f39ee33a26324"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Join (cognitive 16): Namespace.Join has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (7 pts), match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/path/path.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"13988a401b52eeff656fa04232d4f603e7a1b5d62d084fa61f309347b27fd41c"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Substr (cognitive 16): Namespace.Substr has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), match/switch 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/strings.go"},"region":{"startLine":383}}}],"partialFingerprints":{"codehealthFindingId/v1":"387120fdae6de161163fab8c87adc3b88f949c75ff743229946e26b5c99e87a5"}},{"ruleId":"D2","level":"warning","message":{"text":"TemplateStore.extractInlinePartials (cognitive 16): TemplateStore.extractInlinePartials has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 3, loops 1 (nesting depth added 6). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a3ce8d3547e648e9718efe476b6f4e425d9f6ac333971d124796d3d520e4dc"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.Highlight (cognitive 16): Namespace.Highlight has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/transform/transform.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"487ac6597308cf4736e56b61d26b0f79f1aedf64f23ae8ef042b0fd7b6046b21"}},{"ruleId":"D2","level":"warning","message":{"text":"Namespace.JoinPath (cognitive 16): Namespace.JoinPath has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/urls/urls.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef20e64ce0bac99bd857f7ac9d340f676e89d30f18feb8320578ee9fd0e0587"}},{"ruleId":"D2","level":"warning","message":{"text":"absurllexer.replace (cognitive 16): absurllexer.replace has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"transform/urlreplacers/absurlreplacer.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fe5997e5f83e8f677fce2075cc231a009a81866c136ac23200507c81129096e"}},{"ruleId":"D2","level":"warning","message":{"text":"recording.record (cognitive 16): recording.record has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"watcher/filenotify/poller.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5816c2b278e95079d3fac538f4a99620fccbc059baab432d125708a77e254f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: allPagesAssembler.doCreatePages: MethodTooLong \u2014 doCreatePages runs 469 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 369 over it, 4.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c2903799254e337f724016dbe15215478b44604545fe7bd694ddd98f50847ab"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: nopPage: TooManyMethods \u2014 116 methods. The bar is 30 methods; this is 86 over it, 3.87\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_nop.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d615d7eae1856ec645e6111576c4da2d9f97d990ce13093319c0fa182b0e58"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: tplimpl/templatestore.go: FileTooLong \u2014 1320 significant lines (blank, comment-only and punctuation-only lines excluded), about 72% of them inside a single declaration: TemplateStore (51 blocks, 445-2059). The bar is 500 significant lines; this is 820 over it, 2.64\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f78e2b9c4893f0cc23fce9398c0bfbc34b56b72a4c7f8eaf5ab733942368fe05"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HugoSites.processPartialFileEvents: MethodTooLong \u2014 processPartialFileEvents runs 241 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 141 over it, 2.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":863}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae88f9f66b9e6f621c62f820d2c9908920688fe2bf0b68f6ebc292a436c480c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TemplateStore: ClassTooLong \u2014 952 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods, 51 blocks, lines 445-2059. The bar is 400 significant lines; this is 552 over it, 2.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"17132a18dfbb2f387a72e2505ee3d419ea54ee6b7bae9fdbc99f2b86ef353f29"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Site: TooManyMethods \u2014 71 methods, declared across 8 files: hugolib/site.go (55), hugolib/site_render.go (5), hugolib/alias.go (2), hugolib/hugo_sites_build.go (2), \u002B4 more file(s). The bar is 30 methods; this is 41 over it, 2.37\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"e380c8c192598516c308f980f28459f0c5b47e920c8d4631c731db872614a3e3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: RootConfig: TooManyFields \u2014 70 stored fields beside 1 method. The bar is 30 stored fields; this is 40 over it, 2.33\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"e120856d31ecf37b92d6c605afd8022fcc7c5e488ef23f073a8becbdc0e0d72e"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: pageState: TooManyMethods \u2014 66 methods, declared across 3 files: hugolib/page.go (60), hugolib/page__meta.go (4), hugolib/collections.go (2). The bar is 30 methods; this is 36 over it, 2.20\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"581b3f27963303c3ad7d568127b286f6761998f07fa43164710e5b319eaad6e2"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: hugoBuilder.handleEvents: MethodTooLong \u2014 handleEvents runs 207 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 107 over it, 2.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"3244ada738474577f37a768235af5c1f735a4decd2283006c69aed6978dc96a0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hugolib/site.go: FileTooLong \u2014 1013 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 513 over it, 2.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ebbb40c0bc33bced2a95db5042ee70422206bcabb3e67038effd4d4ba56aaad"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: pageState.setMetaPostParams: MethodTooLong \u2014 setMetaPostParams runs 200 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"0651711768d6efe285fb7441b3d4771a581714f2638ddc8d9f237d9779dd271b"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: HugoSites: TooManyMethods \u2014 58 methods, declared across 6 files: hugolib/hugo_sites.go (30), hugolib/hugo_sites_build.go (17), hugolib/content_map_page.go (4), hugolib/site.go (4), \u002B2 more file(s). The bar is 30 methods; this is 28 over it, 1.93\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d156032910945ac2d825d023db320e75154c3fb00f863979bd2e0075c7574e"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: batcher.doBuild: MethodTooLong \u2014 doBuild runs 193 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 93 over it, 1.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/batch.go"},"region":{"startLine":427}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9ebd4acdd1b6586fb6cfc0f2e4fdae91173249cf5e65e818f2c2db1c212deb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ConfigLanguage: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\u00D7 the bar. Most of these members implement config.AllProvider (56 of 57 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/configlanguage.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f62dbbf92a372ce37e35ccc4fa5c334fb9604699ca15dad4fa4f08e4dc316d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: strings.init: FunctionTooLong \u2014 init runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/init.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"86245db8621be97b6675756b90c0b13293d24c22c76fe5732533e35a371698c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hugolib/content_map_page_assembler.go: FileTooLong \u2014 889 significant lines (blank, comment-only and punctuation-only lines excluded), about 65% of them inside a single declaration: allPagesAssembler (6 blocks, 43-1498). The bar is 500 significant lines; this is 389 over it, 1.78\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33549f9c96ed2c849b0970e71d6eccd72a3dff372d39c7cb75dbfdbc5caae36"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hugolib.NewHugoSites: FunctionTooLong \u2014 NewHugoSites runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e966a5f0530912aa0838ccaf2b934851942484ed2ab7a59d62a2a98269e14dea"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: TemplateStore: TooManyMethods \u2014 51 methods, declared across 2 files: tplimpl/templatestore.go (50), tplimpl/templates.go (1). The bar is 30 methods; this is 21 over it, 1.70\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aac141ee56218357614be52908c6ed9b9df1ca9f52842d794a2b727fac768d"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Config.CompileConfig: MethodTooLong \u2014 CompileConfig runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a75294f27b02715f6239f43b049a5f6bdfec8c7205f2caec87ab17341c97149"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: hugoBuilder: ClassTooLong \u2014 674 significant lines (blank, comment-only and punctuation-only lines excluded), 33 methods, 34 blocks, lines 58-1285. The bar is 400 significant lines; this is 274 over it, 1.69\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d19aa126a54e20a7e0f876ccf8785314db9bb8a762d6781e6ab7d5c517c44d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: esbuild/batch.go: FileTooLong \u2014 839 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 339 over it, 1.68\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/batch.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"188770e96d11faadf8b13b0094631b88515d85f6ca63a6fdb8bdbb6c1296cfe4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: TemplateStore.insertTemplates: MethodTooLong \u2014 insertTemplates runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c9e9ddd52b991cfcca06444af694103bd6ce812a5a3dd32af1d163d3873b77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: commands.newModCommands: FunctionTooLong \u2014 newModCommands runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/mod.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ef268cd595d8be96398eb519460be0d048574fc996ce46d079c14c6812ac0e0"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Path: TooManyMethods \u2014 49 methods. The bar is 30 methods; this is 19 over it, 1.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"52142b49654b1053cee623e739e83d6c4720a0344e78df2120512dac140ff6ae"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Options.compile: MethodTooLong \u2014 compile runs 161 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 61 over it, 1.61\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/options.go"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6348bd666e0baae41c148594fa35267f98f93ce9048df115ae516a65259afcb5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: IntegrationTestBuilder: TooManyMethods \u2014 48 methods. The bar is 30 methods; this is 18 over it, 1.60\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"24278ae965c2fd18bfc41c5215885b8f3744fa55923bbccda6aa030699c52cb1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hugolib/hugo_sites_build.go: FileTooLong \u2014 789 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: HugoSites (17 blocks, 64-1359). The bar is 500 significant lines; this is 289 over it, 1.58\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"193b75bbfcbcaa46b710f0e144bc0a4ea561ddfca08d932df4a0415f582ead8b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hugolib/integrationtest_builder.go: FileTooLong \u2014 788 significant lines (blank, comment-only and punctuation-only lines excluded), about 68% of them inside a single declaration: IntegrationTestBuilder (49 blocks, 230-1205). The bar is 500 significant lines; this is 288 over it, 1.58\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"605556fbb13303ccb0e579734278efe8f51cf666d3cadb6e5db761df06c1e8df"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/hugobuilder.go: FileTooLong \u2014 785 significant lines (blank, comment-only and punctuation-only lines excluded), about 86% of them inside a single declaration: hugoBuilder (34 blocks, 58-1285). The bar is 500 significant lines; this is 285 over it, 1.57\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c06022dc0875aeb9a2f5f09349b405b9dd67ec55cd4b2c05a3cc6f249e67bb7d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: resourceAdapter: TooManyMethods \u2014 47 methods. The bar is 30 methods; this is 17 over it, 1.57\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/transform.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7346732ee9b1900fa1bd463ac3d48a33fb1aaa34187092a05ec8c2749f6695d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: BuiltinTypes: TooManyFields \u2014 47 stored fields. The bar is 30 stored fields; this is 17 over it, 1.57\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"media/builtin.go"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"b15b62ca5f53429aaec1a539ecce342bbb85a744773917676dc4d7db71209fbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: commands.newGenCommand: FunctionTooLong \u2014 newGenCommand runs 155 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 55 over it, 1.55\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/gen.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3454025a793ae865cc158b324184633a8761a18e8c0af8f1c271fa6646a0d0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Namespace.checkCondition: MethodTooLong \u2014 checkCondition runs 153 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 53 over it, 1.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8ad5e95be97c270ae4b47a7f14fd54d24e42cd10689bcd9961e260ccae9b36"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: commands/server.go: FileTooLong \u2014 762 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 262 over it, 1.52\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecc54d9711eb4e81af4322d8c7a9c53c1ce4a5c5ce9d5e835380189c79bf15b0"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: AvifCodec.Encode: MethodTooLong \u2014 Encode runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/avif.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7d1a3eb38e02ef5d2d743492aaf9b1eeb0ea0310e69b21d6eb268ec3d206e49"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hugolib/content_map_page.go: FileTooLong \u2014 741 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 241 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ab683bc57719c34ad7ffaa452f6dc684ee1970df37815d6f9a3023b9de34bb"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: allPagesAssembler: ClassTooLong \u2014 578 significant lines (blank, comment-only and punctuation-only lines excluded), 5 methods, 6 blocks, lines 43-1498. The bar is 400 significant lines; this is 178 over it, 1.45\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcd1dc6b4349038b9a4ec8e52f28c1bd050b40a03d829a8ba93a8feeb812104d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: esbuild.createBuildPlugins: FunctionTooLong \u2014 createBuildPlugins runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/resolve.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec166df241bd55dc8fb4928eea719901199a910a0013058ae58d74fb7dfeda7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: warpc.newDispatcher: FunctionTooLong \u2014 newDispatcher runs 142 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 42 over it, 1.42\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/warpc.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"d899cf1901d0cab6753027d91b2294d895bec6ae7fe48d6e755e5499e533a7ba"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hugolib/page__content.go: FileTooLong \u2014 697 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 197 over it, 1.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"257237c403a8d84ac3df85b75acab06cfe281e3a41f606870157df81310c43fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: allconfig/allconfig.go: FileTooLong \u2014 681 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 181 over it, 1.36\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb16251d126475565a477c94e6a6856b236d41ca8078e956724c6a547ae2ce1"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IntegrationTestBuilder: ClassTooLong \u2014 537 significant lines (blank, comment-only and punctuation-only lines excluded), 48 methods, 49 blocks, lines 230-1205. The bar is 400 significant lines; this is 137 over it, 1.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2018ac5d5d33685ce99cbf2f617fc619f0bc2de1a69cb9218805aa9df0257c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hugolib/page__meta.go: FileTooLong \u2014 666 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 166 over it, 1.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"afd0d4c0411d810527131c10fa0f039f1498c732bf3e494a069fdc1b412df4c5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: resourceAdapter.transform: MethodTooLong \u2014 transform runs 133 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 33 over it, 1.33\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/transform.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a78dba01e812356c24ad00a84cdaf58f266ebfdeb716725187f008e5c7a898"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: pageMeta: TooManyMethods \u2014 39 methods, declared across 2 files: hugolib/page__meta.go (38), hugolib/page__content.go (1). The bar is 30 methods; this is 9 over it, 1.30\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcfa3c313c69c05c38f052a191a60654c6e209228ef71efba48b4962b2b1f686"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: math.init: FunctionTooLong \u2014 init runs 130 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 30 over it, 1.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/math/init.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3db525f76e4470a12144522fee31db476e34fe21af9f48c7b06c32473554511"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: sourceFilesystemsBuilder.createOverlayFs: MethodTooLong \u2014 createOverlayFs runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/filesystems/basefs.go"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae3b8f31ec10db0ca8e8fc783acb0bb24fcec53bd6d7b22d23f38511e0478dc4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: paths/pathparser.go: FileTooLong \u2014 624 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 124 over it, 1.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae9fe6d77eedb2d589a2a534d6fb5bcf27c2a06123fc6897acc7fd368ec58f3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pagemeta/page_frontmatter.go: FileTooLong \u2014 619 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 119 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pagemeta/page_frontmatter.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12ff62d7755d1f7929a744b4b23d97d52ba5c8684f2a9d890149abfc080f0f8f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sitesmatrix/vectorstores.go: FileTooLong \u2014 617 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 117 over it, 1.23\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/sitesmatrix/vectorstores.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fffc4e5a980a009ab87ccd93a7acb21c78a3cec20c652fb3492991b073ad66a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Pages: TooManyMethods \u2014 37 methods, declared across 7 files: page/pages_sort.go (12), page/pagegroup.go (8), page/pages.go (7), page/pages_related.go (5), \u002B3 more file(s). The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pages.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc6e1b32346d5e2cf92e0a2a861d5cd8b2c9f9bf8047a50bd347bbf157130ef5"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: genericResource: TooManyMethods \u2014 37 methods. The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource.go"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"15421f7d2c9651dccae34f3e489f5e19515f0d75a43fb7606260a55a21e10caf"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Namespace: TooManyMethods \u2014 37 methods, declared across 10 files: collections/collections.go (18), collections/where.go (8), collections/apply.go (2), collections/index.go (2), \u002B6 more file(s). The bar is 30 methods; this is 7 over it, 1.23\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c156d3608a625759a19ed8a5e0c451fbc0e72da535397c7b122c3d9f2c04620"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Config: TooManyFields \u2014 37 stored fields beside 4 methods. The bar is 30 stored fields; this is 7 over it, 1.23\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0352b1e211515506059e5fffa11f556c398acc52a05437b02efcdf27b681c74"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/client.go: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded), about 68% of them inside a single declaration: Client (22 blocks, 107-891). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b42fff76e3311553246a97666505a305138cf7c58320959969f86ca5db2a4b9"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: serverCommand.serve: MethodTooLong \u2014 serve runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a2a2c5cf588dc138eced594b3f558a237080205da5726c34745480bc8c97aee"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: siteWrapper: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\u00D7 the bar. Most of these members implement page.Site (32 of 35 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/site.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f8c1f5cf00f4d65f28a58173b7fc7c56219bc099f3ea1a684603104aa48805"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: warpc/warpc.go: FileTooLong \u2014 576 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 76 over it, 1.15\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/warpc.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7515ebb0ecda4927aba11bd72e6386c863594dde49db45572c203b842f41fa"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: Deployer.Deploy: MethodTooLong \u2014 Deploy runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6e126559305594de9c9dd575ff6d0d478da584bf1360ac2f815be14d74f1f4"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: BuildClient.Build: MethodTooLong \u2014 Build runs 115 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/build.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1c3c14d642797d4edde0d418e10016f0402d23372e25c2c4babc493e225569c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: componentFsDir.ReadDirWithContext: MethodTooLong \u2014 ReadDirWithContext runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/component_fs.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"18ac1f826ba4880eb8e0037cea252182ee4b1da3be6f063f139a88c50df2b2b5"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: IntegrationTestBuilder.initBuilder: MethodTooLong \u2014 initBuilder runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"31302e53697cc4737bd0f7e5d9d16b52408ae1934203aa582cd1188767599cdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hugolib.doRenderShortcode: FunctionTooLong \u2014 doRenderShortcode runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/shortcode.go"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9e710840356497d3c0f1ba496c6054f6a70e502a725faec936abcd5bdb064a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: npm.Pack: FunctionTooLong \u2014 Pack runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/npm/package_builder.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"810b0e62ec472ced4c6960202d50846b43f74558a3ed0ea9d092d3bdcc69e337"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: pageState: ClassTooLong \u2014 448 significant lines (blank, comment-only and punctuation-only lines excluded), 66 methods, 61 blocks, lines 95-946. The bar is 400 significant lines; this is 48 over it, 1.12\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e5adc94b901a092293986646a59a8d4cc7b8f73fc660d68d13aaa41b4d9862"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: collections.init: FunctionTooLong \u2014 init runs 111 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/init.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"34bb2372f365a21af0707d4020a868def4774edccafd06bed451d8412e7972c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hugolib/page.go: FileTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded), about 81% of them inside a single declaration: pageState (61 blocks, 95-946). The bar is 500 significant lines; this is 53 over it, 1.11\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"826c94990a47ff57463f24f5e91e1cbc4a149fc299828fc7585f91380df994b3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: hugoBuilder: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c8e67d792bce53ddd1dd1ffda5a6b588c9c25221679fc234671d14fcb853ea8"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: testSite: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. Most of these members implement page.Site (32 of 33 members), so moving them onto a smaller type would remove them from that contract rather than reduce it. To reduce it, split the contract instead: give each cohesive group of operations its own smaller interface and its own implementing type. Where the contract has to stay whole, move the work behind these members into collaborator types, so what is left here is a forward per member rather than a responsibility per member."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/site.go"},"region":{"startLine":319}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8095bc9c49381b08e91147df2529dde20a5984561f3666bf8cdf8ace2481bda"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Namespace: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/math/math.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"631d10dbfff255515ecfeed966c94a4b15384d3e1214ba87612320a8ae7c6489"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: fileServer.createEndpoint: MethodTooLong \u2014 createEndpoint runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"167bb5e71f60741ed8e279c503a4cd23214201983b8801da507bd0864fd56bbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: hugolib.newHugoSites: FunctionTooLong \u2014 newHugoSites runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea39a90c468d9acd716768da33c48b01c221ca817efeb6b65c51114476961fa6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/collect.go: FileTooLong \u2014 539 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: collector (17 blocks, 186-943). The bar is 500 significant lines; this is 39 over it, 1.08\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0eeef33f67300d0c95bd5b2eb61b848affc104a6da5e969343cf6207ff265395"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: pageContentOutput.initRenderHooks: MethodTooLong \u2014 initRenderHooks runs 107 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__per_output.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"2397e64711bbf55c3c29d8556be364e4cf7ac156b037ea96c3cd9232379f0c00"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: NodeShiftTree: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/doctree/nodeshifttree.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e1ff75baaadcb9b9217f90bfe2ec6ad0f94964697225f66003f7c4970782723"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Namespace: TooManyMethods \u2014 32 methods, declared across 3 files: strings/strings.go (28), strings/regexp.go (3), strings/truncate.go (1). The bar is 30 methods; this is 2 over it, 1.07\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/strings.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"21c3bb7b0ae7adee2f9724b9a0fe3d3b5c6ac017ed7e4005cbf4107ba640e393"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: commands.newListCommand: FunctionTooLong \u2014 newListCommand runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/list.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fa9707f750783043299a6578747a764dc63309c1dc796d2e306982f65af561a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: filesystems/basefs.go: FileTooLong \u2014 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/filesystems/basefs.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ccd5371d7b51aa266f0d118577505cd1b1b3b157842115fc5a66a2a99b33611"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: HugoSites: TooManyFields \u2014 31 stored fields beside 58 methods. The bar is 30 stored fields; this is 1 over it, 1.03\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e40f32c247ca9b50d48f1e28e8eca8f2a6e327f0ce1c1c32ee16e73f730f1a"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: logAdapter: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/loggers/logger.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"f914c25832d49df3b873c720ef86026bdf09bfd014454d9edf018d7a4f82e096"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Site: ClassTooLong \u2014 413 significant lines (blank, comment-only and punctuation-only lines excluded), 71 methods, 56 blocks, lines 103-1800. The bar is 400 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"802669ddae6a695a4b304d7fe36c0b62ab9486c7e40b49d3f65e624c3b112d28"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HugoSites.Build: MethodTooLong \u2014 Build runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites_build.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cf99c02c6db5ffde725474e39eda4035ce059f1a2add45f0f691915c55a7e8c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: cachedContentScope: ClassTooLong \u2014 410 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods, 23 blocks, lines 487-1176. The bar is 400 significant lines; this is 10 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":831}}}],"partialFingerprints":{"codehealthFindingId/v1":"923276c5f74296fdeb3b533495e7e6f68220c592a07e91b47f51b04a343cf307"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: hugofs/rootmapping_fs.go: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded), about 63% of them inside a single declaration: RootMappingFs (23 blocks, 242-810). The bar is 500 significant lines; this is 12 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/rootmapping_fs.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5099e51ca676904cbe00b63679c100b4bba4cba8d85c55f7bfaa27b6e291349"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: resources/transform.go: FileTooLong \u2014 511 significant lines (blank, comment-only and punctuation-only lines excluded), about 67% of them inside a single declaration: resourceAdapter (48 blocks, 186-781). The bar is 500 significant lines; this is 11 over it, 1.02\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/transform.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c31afeb0f874d0b5e95d0c6752af2681128015a054a72620d88dafe2b584e4de"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: collector: ClassTooLong \u2014 408 significant lines (blank, comment-only and punctuation-only lines excluded), 16 methods, 17 blocks, lines 186-943. The bar is 400 significant lines; this is 8 over it, 1.02\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"86dfcbed4925f86cd993c53c55cc4418559010420e66db5d43de1b4c8e027d0a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Client: ClassTooLong \u2014 405 significant lines (blank, comment-only and punctuation-only lines excluded), 23 methods, 22 blocks, lines 107-891. The bar is 400 significant lines; this is 5 over it, 1.01\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"b06cddb4d3fe59242dffbf59eac4a019baf98974a7e4e08786fdcc4b7bcf181c"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: HugoSites.resolveAndClearStateForIdentities: MethodTooLong \u2014 resolveAndClearStateForIdentities runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"43270718db122fa71c686755a3fe63145c1be6b2f312f0f1314f5f796e29d5dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (10 members, 50\u002B identical tokens): tpl/collections/init.go:25-219 | tpl/debug/init.go:25-75 | tpl/fmt/init.go:25-99 | tpl/images/init.go:25-53 | tpl/math/init.go:26-250 | tpl/os/init.go:25-69 | tpl/path/init.go:27-86 | tpl/strings/init.go:25-317 | tpl/transform/init.go:25-154 | tpl/urls/init.go:25-103 \u2014 These 10 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 10 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 10 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/init.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a03799388aa69e1ef7c2862042fa15f840dcebb66d1c75cfbd576345970e054"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (7 members, 50\u002B identical tokens): tpl/cast/init.go:25-59 | tpl/crypto/init.go:25-77 | tpl/encoding/init.go:25-75 | tpl/hash/hash.go:58-85 | tpl/inflect/init.go:25-62 | tpl/reflect/init.go:26-53 | tpl/safe/init.go:25-84 \u2014 These 7 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 7 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/cast/init.go"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"135877144123bc9dc8cb316478de9d984f2d33743d67e83c6f9405e9974bf8cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): tpl/collections/collections.go:65-97 | tpl/collections/collections.go:197-229 | tpl/collections/collections.go:357-389 | tpl/collections/collections.go:496-523 \u2014 These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below \u2014 it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members\u0027 grain \u2014 factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab89f3bb693837f7c23c94c854e3df9753c1fc27a6b1475235768f8d333f5e82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (61 corresponding lines): hugolib/roles/roles.go:134-194 | hugolib/versions/versions.go:149-210 \u2014 These two members are one piece of code written twice and then edited apart: 61 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/roles/roles.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e49896772cca845800a7b9c8f4d8694ac8aa5ebc5594d7b963d4b719a96e14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): resources/image.go:82-123 | resources/image.go:125-165 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/image.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"09a1dc54e3510eb1322cb5c53c0dfa164ac1014c4d3351c77bb9dbe5229f9e8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (37 corresponding lines): resources/images/config.go:716-754 | resources/images/config.go:780-816 \u2014 These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/config.go"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ee35b9638a00bd1cf050c11e508fabd338a17094886cb3129c3e96f28bdfcbd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 41\u002B corresponding lines): markup/goldmark/render_hooks.go:124-181 | markup/goldmark/render_hooks.go:225-265 | markup/goldmark/render_hooks.go:448-493 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 41 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/render_hooks.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a30554854f983ab6ec4556c51fa09b61df9926c67833e4f8fadff6e53cdcf29"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): common/hreflect/convert.go:125-158 | common/hreflect/convert.go:202-234 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hreflect/convert.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2bf4c92007ff35c8c0d0161e67dc8de12a491a125494a7d8856a34f95d46fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (39 corresponding lines): common/loggers/handlerdefault.go:68-106 | common/loggers/handlerterminal.go:49-93 \u2014 These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/loggers/handlerdefault.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"23680d8532506c17fa642e2be0079416280e90f13a6d8d04cd3b274496ac1c33"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): internal/warpc/avif.go:69-101 | internal/warpc/webp.go:207-243 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/avif.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a0087c3ff0694371c1910fb64efd755c3f8fa021840e248e10d7d75c8a6ded"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): common/hmaps/params.go:384-419 | common/hmaps/params.go:445-481 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hmaps/params.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"8515214e036c6c7afe88a66403e508b9381ec889f23da66b196b77177f0c7658"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): internal/js/esbuild/batch.go:1126-1178 | internal/js/esbuild/batch.go:1180-1219 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/batch.go"},"region":{"startLine":1126}}}],"partialFingerprints":{"codehealthFindingId/v1":"998a4fe0e07ac445068f6a78c275b63f0fab4f8a5d83300a186071b380a8d00c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): navigation/menu_cache.go:60-87 | resources/page/pages_cache.go:71-110 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"navigation/menu_cache.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cde56dab3f90e9715e42794e91ccd9d63fbdd367e626996423a390ed63242a4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): hugolib/content_map_page.go:284-304 | hugolib/content_map_page.go:306-331 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c9d6f52edd088296f8cdb0ac3227579fefabf4d6e52b7404443cd3e93f2ea6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): cache/filecache/filecache.go:201-235 | cache/filecache/filecache.go:288-324 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4e95bbd38124291d5433dfd93607665b1936630bff24cbcd2d07d5d436cb68"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): common/hsync/oncemore.go:77-109 | common/hsync/oncemore.go:124-156 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hsync/oncemore.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"734606bf975eeb1f840a22ea6b0784417536aeacdc87e34656976ed72a9b8d1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): resources/resource/resources.go:166-193 | resources/resource/resources.go:204-232 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource/resources.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5f7b0179ac18876d26d80896efb7b8a3083b8b4a31c4b2b466477d2f82dd391"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): hugolib/page.go:356-377 | hugolib/page.go:379-411 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eb43379ca883d7654ce36dcae6550cafff61c78a6a9c284af126d54f1152e04"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 24\u002B corresponding lines): internal/js/esbuild/batch.go:980-1005 | internal/js/esbuild/batch.go:1019-1046 | internal/js/esbuild/batch.go:1048-1071 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 24 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/batch.go"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2e67bb76e15fefc97e1ee3675bd8cffd0aaa02c139e6376da70908cc718f86"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): commands/new.go:114-122 | commands/new.go:154-161 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/new.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"556ffa3ffd56e423e2ea17fffda71c095e526e1ea1c63aebde86b7d9898fa957"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): hugolib/pagesfromdata/pagesfromgotmpl.go:81-111 | hugolib/pagesfromdata/pagesfromgotmpl.go:113-137 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/pagesfromdata/pagesfromgotmpl.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"6814ab24f8232abde520aba5da5223012c9fda696d3464c6e2988290edf93893"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): hugolib/gitinfo.go:224-242 | hugolib/gitinfo.go:244-261 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/gitinfo.go"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f68ed7eef208fda8b82e22b8b58eecf2cc4137648af48b8d4157da5dd73ea0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): hugolib/sitesmatrix/vectorstores.go:125-156 | hugolib/sitesmatrix/vectorstores.go:423-457 \u2014 These two members are one piece of code written twice and then edited apart: 32 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/sitesmatrix/vectorstores.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d624397d2cfc006cc334403a5eda1fede38da3a5de502458d4f2d5dc1e4d6b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): hugolib/roles/roles.go:201-217 | hugolib/versions/versions.go:217-230 | langs/config.go:247-263 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/roles/roles.go"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"56185882dc44f2a7a4b17cf85e589f01910faf3c5db2616d6b4c800d8ad4c970"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): resources/page/pagegroup.go:397-414 | resources/page/weighted.go:68-85 | resources/resource.go:283-302 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pagegroup.go"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"86fc6d3eac6380a634ff6fe2e1047ba8bf8f1d69ab3689336dbb45ca99af4b32"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): hugolib/page__per_output.go:433-450 | hugolib/page__per_output.go:452-470 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__per_output.go"},"region":{"startLine":433}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dfea5f1b191c64c8b077a2a72ee14cc52e565f2b30b2f4ca11a8258481467db"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (22 corresponding lines): tpl/strings/regexp.go:23-44 | tpl/strings/strings.go:232-258 \u2014 These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/regexp.go"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4978ad3032154947a95157807c8ca3de8f92a24a60334bd443003cf764ee35ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): hugofs/component_fs.go:311-326 | hugofs/decorators.go:109-123 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/component_fs.go"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f561e6062efada8242c5d827a9d5dea8396bf3bbf474a403f526924d55bea88"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): hugolib/doctree/simpletree.go:108-118 | hugolib/doctree/simpletree.go:208-220 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/doctree/simpletree.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"593129e62aa65dec65230600123d6665e63f0a5cfc6ffe86d853fac7d54b3c9d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): commands/hugobuilder.go:193-210 | commands/hugobuilder.go:314-332 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c8faf98de8fd00f312e7f416e1075ae10a6b662a00ccfd7ec21a1678063a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): resources/image.go:198-209 | resources/image.go:524-536 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/image.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"71178b707fb1663de9fbf95d0cf1ee754cbae65059e6e750ad3edab106b2fb90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): common/hreflect/compare.go:71-84 | common/hreflect/compare.go:86-99 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hreflect/compare.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"52f4853dc745f85934f10688a7d15c5e09a845ed98ff4d8e328a514d9b9cf3eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): hugolib/page__ref.go:76-91 | hugolib/page__ref.go:93-108 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__ref.go"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"6adc10fe146845fbdf3cc92d9a27e192603a50729cb3bde10febb296d518f052"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): navigation/menu.go:256-266 | resources/page/pages_sort.go:385-397 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"navigation/menu.go"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda5cecc622b6ea992ada71ec5fc94885f60a5284828562cd7efd3ab2a2e4aca"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 10\u002B corresponding lines): hugolib/doctree/simpletree.go:71-81 | hugolib/doctree/simpletree.go:83-92 | hugolib/doctree/simpletree.go:177-189 | hugolib/doctree/simpletree.go:191-206 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/doctree/simpletree.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"6803aa2088129d28f2b26eea5cb1c46fdb4d3e419767d37610fb0af2e9ae7e92"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): markup/internal/attributes/attributes.go:178-194 | markup/internal/attributes/attributes.go:199-213 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/internal/attributes/attributes.go"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"f39c9c9e4328738beb029d0392eadb38282b406d8df119d662556b80bd552ac9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): tpl/tplimpl/templatestore.go:862-885 | tpl/tplimpl/templatestore.go:925-942 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"467c4eb83df418d4a2ba1783f22057031c4aaca376a7853e2cb440521a071fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): common/predicate/predicate.go:84-100 | common/predicate/predicate.go:103-125 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/predicate/predicate.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"69dff8f8f9823f16f18e39a03b70b80177913ebc2211bea343a4d2e02e3f5d1f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): hugofs/rootmapping_fs.go:454-463 | hugofs/rootmapping_fs.go:465-479 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/rootmapping_fs.go"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be1f1aa1a7b30fefc35306e70b51d87857eb56381df120f426aa38c73bd992f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): hugolib/sitesmatrix/vectorstores.go:196-209 | hugolib/sitesmatrix/vectorstores.go:509-526 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/sitesmatrix/vectorstores.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"3177eec947b41d91542427051725648014c8252c6b1c6258a7ea9439b4931aae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): hugolib/hugo_sites.go:350-364 | hugolib/hugo_sites.go:367-382 | hugolib/page.go:569-584 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites.go"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"900cf38c9f965b463906c4a9826c7c96f767265e58ec681c2b7cd0a4144d7ca6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): hugolib/integrationtest_builder.go:803-811 | hugolib/integrationtest_builder.go:813-821 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f5281ad761c49e75cb94eeac18e43a5c5e5cd4d99e448efb2d1fe51e3dc2c9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): tpl/hugo/init.go:26-44 | tpl/site/init.go:28-42 | tpl/testinginternal/init.go:25-38 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/hugo/init.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ce03375157a1987a489736993a4a7bce5d68b7a89ca892b22cc24d1af0509e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): cache/filecache/filecache.go:246-269 | cache/filecache/filecache.go:351-369 | cache/filecache/filecache.go:372-386 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62ec438499498bd33fcf22a09d10b222f4d444f3db3dae714e971b787d1fd12"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): hugofs/hglob/glob.go:55-68 | hugofs/hglob/glob.go:70-87 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/hglob/glob.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf4fdc0bb4f1bd9d3e7d64af7d4ac495e1e8d85e4219182471855fd08e9db90e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): commands/commandeer.go:356-366 | commands/commandeer.go:372-383 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/commandeer.go"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"a52365e3b1770d219f60ee7f3e381e02cef3fad7f396f2617575d35365bcdd08"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): hugolib/filesystems/basefs.go:437-449 | hugolib/filesystems/basefs.go:452-461 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/filesystems/basefs.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc91f015352408e75317b959275e7f48d07c4713b0ad3a64f25ec7512f6e13d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): hugolib/sitesmatrix/vectorstores.go:225-236 | hugolib/sitesmatrix/vectorstores.go:238-249 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/sitesmatrix/vectorstores.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"4885a1fc8d97d98575fb04b40109634d95729c07da4c82e6ee43ce720ab6472e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 9\u002B corresponding lines): hugolib/integrationtest_builder.go:773-781 | hugolib/integrationtest_builder.go:783-791 | hugolib/integrationtest_builder.go:793-801 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"a189d407761901b5e93544321d43f62e7e53371604ef84ca5deb162f9c9b37b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): codegen/methods.go:300-310 | codegen/methods.go:312-322 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"codegen/methods.go"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"505cf7564fed68049ef496a0fd57da90df5dbd0a63ab98d30ad9bc774b6db86d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 18\u002B corresponding lines): hugolib/hugo_sites.go:165-185 | hugolib/hugo_sites.go:189-210 | hugolib/hugo_sites.go:213-230 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 18 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfc96c0a58491690c136aaa396ab19fb677b46e0ecaf925755f05cc43c90cb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): resources/resource_transformers/integrity/integrity.go:83-96 | tpl/crypto/crypto.go:110-125 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/integrity/integrity.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c34fe7318acea52a52a17eb90ae5017daeddad9904b626732e569bb347ca28"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): tpl/urls/urls.go:93-104 | tpl/urls/urls.go:107-119 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/urls/urls.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"e66d8c45afc9748a8b15c70df8549ca5980a825b74273d37f2311ca6dfefd366"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): hugofs/component_fs.go:400-411 | hugofs/filename_filter_fs.go:117-128 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/component_fs.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eeaae12c8378ba6a4bf5ca9797958851ff046e0c0eab33507ba92680c6b7c3b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): hugolib/page__tree.go:34-45 | hugolib/page__tree.go:47-58 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__tree.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"024c7f1fee21b10d4085162ea04ca2f3531ca3a2ba2177700c01579925d0b29c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): tpl/os/os.go:115-130 | tpl/os/os.go:152-171 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/os/os.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa4934b5c85e09958af98e79a8615dd57fe3f2db31e353aeb2c4ea68b79ef308"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): tpl/transform/transform.go:90-103 | tpl/strings/strings.go:123-136 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/transform/transform.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d4678f2bd42800c564e591785390fb9d209495883fffa3e061da4bcdb2c7174"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): cache/dynacache/dynacache.go:467-481 | cache/dynacache/dynacache.go:557-572 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/dynacache/dynacache.go"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e9cd1e3765633bf0e277dbc445d145e7ec6df1a4852717c99a6a2af0bdbeb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): common/herrors/file_error.go:212-223 | common/herrors/file_error.go:226-238 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/herrors/file_error.go"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"00b2dffe7715833cd41b0557326120c46707ee8675d3c1ae74b03d3b75c547e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): hugolib/sitesmatrix/vectorstores.go:158-172 | hugolib/sitesmatrix/vectorstores.go:459-476 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/sitesmatrix/vectorstores.go"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"f66d83e6aacf1759a96ecad0cac897edc70322848a42efbc6d49279b0c345c85"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): markup/highlight/highlight.go:36-47 | markup/internal/attributes/attributes.go:29-41 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/highlight/highlight.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7db78e8c2ebef5f7fbb563e5d69d5603f0dc98c9758b3f2861498084d4ad44"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): common/hreflect/helpers.go:345-354 | common/types/types.go:85-97 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hreflect/helpers.go"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"448e67a58064a0808b9321abd980f0780d73667bf0e18fc1716f7543c7caba3f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): navigation/menu_cache.go:26-37 | resources/page/pages_cache.go:26-37 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"navigation/menu_cache.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"93765e3fcc8e972a134374d6309172834c76b4bea54ac8b379d256ef8b97cf35"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): resources/page/pages_related.go:83-100 | hugolib/page__meta.go:378-389 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pages_related.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9cf15f2047a1acf3c970032bd8ba5343fbb4fe2e8550dc2bb0f927c6d1c4a78"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 6\u002B corresponding lines): hugolib/roles/roles.go:92-97 | hugolib/versions/versions.go:98-103 | langs/config.go:88-93 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 6 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/roles/roles.go"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"47229d3327aefe975a85304bcd623d6e1a6c359a2069360dbfebe7bf3be32b79"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): resources/page/pages_language_merge.go:54-63 | resources/resource/resources.go:261-267 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pages_language_merge.go"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"949554112ddf50276a5599ffa38d95a78180fa5fa0c8db6f0b0667916d3ed7d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): common/paths/pathparser.go:999-1008 | helpers/general.go:133-144 | hugofs/rootmapping_fs.go:875-881 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/paths/pathparser.go"},"region":{"startLine":999}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b67fcd32bfd076336582960f33af717570a5ea7e32b2eac88c8430806ebab99"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): markup/internal/external.go:65-72 | markup/rst/convert.go:115-122 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/internal/external.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"80fb29de425c8098d7c36cae7556986b5bf6145932ba96dd19151015a6cfedd5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): tpl/strings/strings.go:458-464 | tpl/urls/urls.go:42-49 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/strings.go"},"region":{"startLine":458}}}],"partialFingerprints":{"codehealthFindingId/v1":"67744fa11a366bd7fb958fbf80b1b2536925b5903aebbf577623527c98494468"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): common/types/types.go:70-76 | resources/page/weighted.go:88-94 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/types/types.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"6747fd3c07edc5fe03d82fc5ec558ef3026775d1ad7b7ac25319997be8a268f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): common/collections/slice.go:70-76 | resources/page/pages.go:44-50 | resources/resource_factories/bundler/bundler.go:45-51 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/collections/slice.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7d120acf2302f4178ff531ef172236cc300138d4103904bd45ed52eff907b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): hugofs/hasbytes_fs.go:87-93 | hugofs/hashing_fs.go:84-90 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/hasbytes_fs.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75965b912d740a65ec199908af82ad2c65d81aa7b4276988a8b06fc2c8c5e2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): tpl/collections/collections.go:198-226 | tpl/collections/collections.go:358-386 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"340dc39c891d8b6a306f2833694ab013d8d8213b4e84c26dbe433036b023c0d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): resources/images/config.go:717-739 | resources/images/config.go:781-803 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/images/config.go:717\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/config.go"},"region":{"startLine":717}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc11a0d3f34a0f369bf99a5f4b67a5c2c2cc0954986dc5637852a868d733ea6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): tpl/compare/compare.go:299-325 | tpl/compare/compare.go:327-353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/compare/compare.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"35ccc860908389e1fafdb36c917c19e77516795b3a915c5e5e3e6e6fa600a4c1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): tpl/css/css.go:185-207 | tpl/js/js.go:56-78 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/css/css.go"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fe0d13c657b05fab19fec095c0cdba28ae5f1c9df4eec896db25a90ed54e8d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): common/loggers/handlerdefault.go:72-92 | common/loggers/handlerterminal.go:53-73 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/loggers/handlerdefault.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8d531cfb00f9fa84327832cdac2d40ee69611fca458510b0de6dbfbbe212e7f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): hugolib/sitesmatrix/vectorstores.go:137-156 | hugolib/sitesmatrix/vectorstores.go:438-457 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hugolib/sitesmatrix/vectorstores.go:137\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/sitesmatrix/vectorstores.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1efd733e67639e4ecadb1a863ba09e77b14b085a6f22ff32961bcf5f02a3fa3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): internal/warpc/webp.go:277-296 | internal/warpc/webp.go:304-323 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/webp.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab79c9ad4697c9b7e3ef06223fa6c26aa30fffbdfcaf5ab85a73e9332791cfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): resources/images/meta/meta.go:244-263 | resources/images/meta/meta.go:318-332 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/images/meta/meta.go:244\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members\u0027 bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s own documentation with it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/meta/meta.go"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"439152b5df2285b54603f427c6a2bc58cdd916b9850895c91ff99bcb919599f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): tpl/collections/sort.go:80-99 | tpl/collections/sort.go:113-132 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tpl/collections/sort.go:80\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/sort.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd31c27960b37d2566f72466dd343d9206909f10d9aea4571053d0f5537a50c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): navigation/menu_cache.go:61-77 | resources/page/pages_cache.go:83-100 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"navigation/menu_cache.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd226f795e739ee4bdd68cd056ddc28a9afe6ecaccf0e781e71c3e044b2b12ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): resources/resource_transformers/cssjs/postcss.go:229-246 | resources/resource_transformers/cssjs/tailwindcss.go:148-165 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/resource_transformers/cssjs/postcss.go:229\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/cssjs/postcss.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2176f04258763c64678c0e6581b65e6f430dc03e9afa52f389354ca6a43efa1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): config/defaultConfigProvider.go:129-145 | config/defaultConfigProvider.go:211-227 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060config/defaultConfigProvider.go:129\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060c *defaultConfigProvider) Set(k\u0060 in one and \u0060c *defaultConfigProvider) Merge(k\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/defaultConfigProvider.go"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"39043a1f33e12113fa0ab7b45c135d35cd8e33a049ec7d78a4cd941543730c63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): hugolib/content_map_page_assembler.go:404-420 | hugolib/content_map_page_assembler.go:422-438 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fd68db8c784050ad0c920e13acc77ca87fa69cd742c6d0b6a9641cb3ca35ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): hugolib/page__meta.go:1073-1089 | resources/resource/resource_helpers.go:43-59 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hugolib/page__meta.go:1073\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":1073}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f060d4bf607772eb6a7f6c0977ec3616e1198a40b0c127d94079d770f6e39a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): resources/image.go:93-109 | resources/image.go:135-151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/image.go:93\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/image.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"5afda37365a737bae8be4adbeaba032e6303d5ff0bc77dfefc64280c82d2392c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): resources/resource_transformers/cssjs/postcss.go:209-225 | resources/resource_transformers/cssjs/tailwindcss.go:129-145 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/resource_transformers/cssjs/postcss.go:209\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/cssjs/postcss.go"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"904012ad7b871f10480dd4eb56fa3937ff8f9c079c795d3c73628f7badcae81e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3): tpl/css/css.go:138-153 | tpl/css/css.go:185-200 | tpl/js/js.go:56-71 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/css/css.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"e911918eedfdf4f99290847a909b188636e0b26aa7518ff7a3b5974ea5d2bf63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): helpers/url.go:59-74 | helpers/url.go:128-143 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060helpers/url.go:59\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers/url.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d37c2932e15fdb9d8eade5ba1de576d23b2306ca020ca00109d8841b315eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): create/skeletons/skeletons.go:75-89 | create/skeletons/skeletons.go:130-144 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"create/skeletons/skeletons.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a5acbfb690471912c5fa9924d8d34d33ce3daea8e7df1dd996ccae21bed7d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): hugolib/gitinfo.go:228-242 | hugolib/gitinfo.go:247-261 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hugolib/gitinfo.go:228\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/gitinfo.go"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"d685d386d219f91cf1c4a30119d705a083588a07f901c92c207cfc39ba3a9f62"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): cache/filecache/filecache.go:290-303 | cache/filecache/filecache.go:353-366 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cache/filecache/filecache.go:290\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache.go"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aa21db57dcb5a9022b6f851dc9e98e88e5c75acf47732f73a92f99fd52e212e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): transform/urlreplacers/absurlreplacer.go:108-121 | transform/urlreplacers/absurlreplacer.go:153-166 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"transform/urlreplacers/absurlreplacer.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd39c1912a163f1a509a8102fc975ea6c86fdaf516539da3c36e4ed22646cb8c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): hugolib/doctree/simpletree.go:95-106 | hugolib/doctree/simpletree.go:194-206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hugolib/doctree/simpletree.go:194\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/doctree/simpletree.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"886eeb0c9c796379fb245d4a906ab9702c88a40441f2abbeb3b1c6f4e5f141d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): hugolib/roles/roles.go:167-179 | langs/config.go:178-190 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/roles/roles.go"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64fb2a9052e834d8df11c3a6cba01b307a95795d97b51c6fe1e018a0ff32c46"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): internal/warpc/avif.go:89-101 | internal/warpc/webp.go:231-243 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060internal/warpc/avif.go:89\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/avif.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d62e1b95bb0a01c56a328619e08f27e9ddc292e24b3cc02fe438b4fb092a005"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): resources/resource_transformers/babel/babel.go:172-186 | resources/resource_transformers/cssjs/postcss.go:201-215 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/babel/babel.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb8613ff37924afbbd057e3e2919873ebdd0c7c24709157da5614f83b1cb46a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): tpl/collections/where.go:618-630 | tpl/collections/where.go:637-649 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tpl/collections/where.go:618\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":618}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b36963efae09342eb2051afc66c453b9f5c6a2c2ba93b0c9dd9c9caaea9bb5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 4): tpl/collections/collections.go:79-90 | tpl/collections/collections.go:211-222 | tpl/collections/collections.go:371-382 | tpl/collections/collections.go:501-512 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"507253a51d322073f6f40a0243dfead73f2fb6e8da9ddefd7ca253067323e64f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): cache/filecache/filecache_config.go:229-240 | cache/httpcache/httpcache.go:209-220 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cache/filecache/filecache_config.go:229\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache_config.go"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6154083a8c96e750e24736d77e457a5f10955a325bb7b3cf3d8f6512c420a14"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): common/predicate/predicate.go:189-200 | common/predicate/predicate.go:224-235 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060common/predicate/predicate.go:189\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/predicate/predicate.go"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"433eb54ca4b02d9b7415b74ca00f0686b5518c2ed39a401326c3196322628bb9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): hugolib/page__content.go:250-261 | hugolib/page__content.go:1083-1094 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hugolib/page__content.go:250\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"e90ccc2c23c81a85b27665e4186074642587af5c5ca44fcde64a50e53a17cf51"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): hugolib/page__ref.go:77-88 | hugolib/page__ref.go:94-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__ref.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb4d51170c5fa9cb99fb6d73543fc4b09afe256647a31d1e3a5f5a9f2c402b0c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): markup/goldmark/render_hooks.go:227-238 | markup/goldmark/render_hooks.go:369-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060markup/goldmark/render_hooks.go:227\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060markup/goldmark/render_hooks.go:225\u0060 calls \u0060renderLink\u0060 and \u0060markup/goldmark/render_hooks.go:366\u0060 does not \u2014 after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/render_hooks.go"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"591ac25889cc772dda869415b01daae11c961cbd20496bdf45098ca7aebf5c5d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): resources/resource_transformers/babel/babel.go:134-145 | resources/resource_transformers/cssjs/postcss.go:165-176 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/resource_transformers/babel/babel.go:134\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/babel/babel.go"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6acefb1538cf01b3c81b8a2a9d6c86b30297b5d36b6582f10b51d9e45aca745"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): tpl/transform/unmarshal.go:70-81 | tpl/transform/unmarshal.go:130-141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tpl/transform/unmarshal.go:70\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/transform/unmarshal.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ccfdfafee51f9499df11ab09e1a7edb6a50bd9ed0f1b512c25268c4bb661a02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): cache/filecache/filecache.go:202-212 | cache/filecache/filecache.go:289-299 | cache/filecache/filecache.go:352-362 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060cache/filecache/filecache.go:202\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache.go"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"95404b65cc28a49af9a4959a191224b628001cc43c39d3538bbfb3df79648767"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): hugolib/content_map_page.go:292-304 | hugolib/content_map_page.go:319-331 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hugolib/content_map_page.go:292\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b83502fcfdf6cdd89e83f3472e16d9d36a3e2c410d148275256635453c9c5e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201311 lines \u00D7 2): resources/images/image.go:265-275 | resources/images/image.go:283-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/images/image.go:265\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/image.go"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"bed170921afc19341d383fada40eec2249db58b08f31822e447bcfeb839b7399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): tpl/js/init.go:26-35 | tpl/resources/init.go:26-36 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tpl/js/init.go:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/js/init.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2dc0d5b43fdf095ee1a1d6ae7ec66d9c75babd3764acd542b9d1e4ebb9b59857"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 4): internal/warpc/avif.go:273-285 | internal/warpc/avif.go:307-319 | internal/warpc/avif.go:340-352 | internal/warpc/avif.go:358-370 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/avif.go"},"region":{"startLine":273}}}],"partialFingerprints":{"codehealthFindingId/v1":"06e051dbb6b99f8c45252e15210164da6ee9ebb97256059c65e189d4701a36b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): common/hmaps/params.go:385-394 | common/hmaps/params.go:447-456 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060common/hmaps/params.go:385\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hmaps/params.go"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1e4273af9e4f3eb18432373717dff0daf6d78c4ccb93f2b8460a576f7b764f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): hugolib/page__paginator.go:46-55 | hugolib/page__paginator.go:73-82 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hugolib/page__paginator.go:46\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__paginator.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3be7a7cce0fa0167787ef49503af9d1640e64340b272ab2df369677c82c3684"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): tpl/tplimpl/templates.go:142-151 | tpl/tplimpl/templates.go:155-164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templates.go"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b8db7a4c3a853a71070699988e2d8943c931d96df19197ed3fa3b1933f7cd5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20139 lines \u00D7 10): tpl/collections/init.go:26-32 | tpl/debug/init.go:26-32 | tpl/fmt/init.go:26-32 | tpl/images/init.go:26-32 | tpl/math/init.go:34-40 | tpl/os/init.go:26-32 | tpl/path/init.go:28-34 | tpl/strings/init.go:26-34 | tpl/transform/init.go:26-32 | tpl/urls/init.go:26-32 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 10 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 10 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tpl/collections/init.go:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/init.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0e9ffac973cbd955747d583454b5106a043c3f92cb8996c27c1ca662837eb3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 5): internal/warpc/avif.go:292-300 | internal/warpc/avif.go:325-333 | internal/warpc/avif.go:374-382 | internal/warpc/avif.go:385-393 | internal/warpc/avif.go:397-405 \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/avif.go"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"fed28e952239768aaea30dd0008cb340202624cf6792b8e4707db31497187d96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): commands/gen.go:130-138 | commands/gen.go:179-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/gen.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"0720e9fd69379a85cfad8a3fdd5ba32400ab8f90b58018551c52a3aa504f5daf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hugolib/content_map_page.go:820-828 | hugolib/content_map_page_assembler.go:1020-1028 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hugolib/content_map_page.go:820\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":820}}}],"partialFingerprints":{"codehealthFindingId/v1":"e33aadddd45cc5ca3d1b4c0822c1286fbf1658f5ed8d7afdea1203318cf9eb42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): hugolib/doctree/simpletree.go:110-118 | hugolib/doctree/simpletree.go:212-220 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060hugolib/doctree/simpletree.go:110\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/doctree/simpletree.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb215dd2a447945df24ac747bf88abac774c563b7f6e8a1346c32fa5d98fe103"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): resources/page/pagegroup.go:115-123 | resources/page/pagegroup.go:185-193 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pagegroup.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4039479b581fc72bea379a125d9aee92f8c9c68897f6999ed3e27e9168d6a546"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): hugolib/doctree/simpletree.go:72-79 | hugolib/doctree/simpletree.go:180-187 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/doctree/simpletree.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d12b94eba58da88c5c2f91a751eb25cd55c10849ac5dfd13fb49718800ec75b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): resources/images/image.go:206-213 | resources/images/image.go:221-228 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/images/image.go:206\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/image.go"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c978130e50fe476041d8460ecb9a34eaef083ff85d00fcbc11e807791b0911a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): tpl/collections/collections.go:301-308 | tpl/collections/collections.go:700-707 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tpl/collections/collections.go:301\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d196eb88c0758eaa82656ce0529c17ee1a57eab3d80a6fb495cdc0e05f91880"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20138 lines \u00D7 2): tpl/collections/merge.go:97-104 | tpl/collections/where.go:612-617 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tpl/collections/merge.go:97\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/merge.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5cf820579d733455dcc2a42c04f97442d2accfd5f886179ba8b59fdc234160"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 7): tpl/cast/init.go:26-32 | tpl/crypto/init.go:26-32 | tpl/encoding/init.go:26-32 | tpl/hash/hash.go:59-65 | tpl/inflect/init.go:26-32 | tpl/reflect/init.go:27-33 | tpl/safe/init.go:26-32 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tpl/cast/init.go:26\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/cast/init.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c1c1873011d5249a8c08ef1e09124d9eded8cd0d4bfd850fd8756dee2abe319"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): related/inverted_index.go:237-243 | related/inverted_index.go:407-413 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060related/inverted_index.go:237\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"related/inverted_index.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e205caaf4be28dcf283252db25e275dd2e471ca47af770dc2b90dce7a619087a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): resources/image.go:200-206 | resources/image.go:527-533 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/image.go"},"region":{"startLine":200}}}],"partialFingerprints":{"codehealthFindingId/v1":"1014f3ad3173d878c5801583eb9dfc4d50b6dcc3549a92d03f2df5488e6042ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tpl/openapi/openapi3/init.go:27-33 | tpl/templates/init.go:27-33 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tpl/openapi/openapi3/init.go:27\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/openapi/openapi3/init.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"0972eda69c72ab02fc2bf0eb10db74741d4bbb28b27d5735fe8ae3c2149dc079"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): modules/collect.go:748-754 | modules/collect.go:772-778 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060modules/collect.go:748\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":748}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2778329645f767341c40c766a47041b5d01ee7e276a77a9c58b11e619f2e53b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): commands/new.go:65-70 | commands/new.go:114-119 | commands/new.go:154-159 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060commands/new.go:120\u0060 calls \u0060Flags\u0060, \u0060BoolVarP\u0060 and \u0060commands/new.go:160\u0060 does not \u2014 after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/new.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"66a6837405d0af7127a95d8ca75f625659be148f50da71be94fb6335f8f84c63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): hugolib/integrationtest_builder.go:774-778 | hugolib/integrationtest_builder.go:794-798 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e97ce723a2941898340c71afb956fd4489ac98ca9940cfdbf84b67934341ba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hugofs/createcounting_fs.go:91-97 | hugofs/stacktracer_fs.go:63-69 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/createcounting_fs.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ff978da8ec8e4b051c315ad6b668a1ee8f8bd5b5268cfcc66274eb16ebf328"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hugofs/createcounting_fs.go:99-105 | hugofs/stacktracer_fs.go:71-77 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060fs *createCountingFs) OpenFile(name\u0060 in one and \u0060fs *stacktracerFs) OpenFile(name\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/createcounting_fs.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa16d2883da2b100050c84c17c00c1e8c5a62e1eae9ca23f85768fee465471c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hugofs/hasbytes_fs.go:43-49 | hugofs/hashing_fs.go:54-60 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/hasbytes_fs.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"2049f7fbd6dd344add2938597ba8969f24ea9e9e1ee8495a9cf9f7eb945e8b94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): hugofs/hasbytes_fs.go:51-57 | hugofs/hashing_fs.go:62-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060fs *hasBytesFs) OpenFile(name\u0060 in one and \u0060fs *hashingFs) OpenFile(name\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/hasbytes_fs.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f86a4c2860fd61c6384f626664798feb65ef732678e1971bf05ac8d832b9fb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3): hugolib/roles/roles.go:109-119 | hugolib/versions/versions.go:124-134 | langs/config.go:109-119 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/roles/roles.go"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c8629a1dc5f99d10175de3fa014081399a6a7b0cd969a95ba692e2136fc27c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): hugolib/roles/roles.go:122-130 | hugolib/versions/versions.go:137-145 | langs/config.go:122-130 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/roles/roles.go"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c7212a8385726c228df7a5bf3e066a253e36cbb0ff43b83b49d9f513d4b63a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): parser/pageparser/pagelexer.go:107-118 | publisher/htmlElementsCollector.go:277-288 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/pagelexer.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7a8545d96731ac2bba2247ee4ac0fac10843012d507ca26b427d3eb80c97814"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): resources/page/pagegroup.go:98-104 | resources/page/taxonomy.go:139-145 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/pagegroup.go"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ae13332df330fabfd48c3e5c0ce49803031b97dcac3f1bf0184ad4760a339a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tpl/collections/where.go:675-681 | tpl/compare/compare.go:375-381 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"23a90250e7ce1997e6071e20342e517e5614604d0d3de11b8c9e2d0c600267d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): markup/pandoc/convert.go:53-59 | markup/rst/convert.go:51-57 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/pandoc/convert.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"999607ce03fc14899ae24a679506482274ff45d48fb7fd415f5df39039c31900"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): navigation/menu_cache.go:51-57 | resources/page/pages_cache.go:63-69 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060string\u0060 to \u0060c *menuCache) get(key\u0060 in one and \u0060c *pageCache) get(key\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"navigation/menu_cache.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa233f5dc0a8696d8d9b3f1e209516c84a31e8263394c354bbe6bbde14f47940"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): resources/images/meta/meta.go:219-230 | resources/images/meta/meta.go:305-317 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/images/meta/meta.go:219\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/meta/meta.go"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd6b287dcb3fc0f63528ac0dc58eaef1d8b5bf843d881a931142bec6e47f47e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): resources/image.go:113-123 | resources/image.go:155-165 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/image.go:113\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/image.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"a902ba54cb048e7c989f1ec901f4db179bfbeacc9a7189212c912a9a4417033a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): resources/images/resampling.go:95-103 | resources/images/resampling.go:107-115 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060resources/images/resampling.go:95\u0060 it runs out through the closing brace of the declaration holding it \u2014 the window is that declaration\u0027s tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/resampling.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff989a13d688cf63444801c7f9b29875f56c9de50b9765c4a9e2949957732e16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): tpl/openapi/openapi3/openapi3.go:177-183 | tpl/openapi/openapi3/openapi3.go:196-202 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060tpl/openapi/openapi3/openapi3.go:177\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/openapi/openapi3/openapi3.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5891bcb590ce6f70a36ba254569d7d97f32dfacf640180b349db425b4bf976"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): commands/import.go:146-150 | commands/import.go:613-617 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060commands/import.go:146\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/import.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"24194bc20527cc9712a5e1e3ed5684e0781bab4a33bd3f64b7d83da7d8adb035"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 31): Namespace\u0027s methods fall into 31 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 31 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/strings/strings.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8787b7a4841e8433d9ef977ee64c682d37f6b8e277fc999e79a0efe202d66d1a"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 19): Namespace\u0027s methods fall into 19 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 19 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/math/math.go"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"b577661fe728e10ac4125135c5c8e745e4e61a5faa8e1c780f2a35e661ed1790"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: pageState (LCOM4 13): pageState\u0027s methods fall into 13 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 13 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2a86d7670f410745f81373548368e66c8225562b10142f23088e008df91564d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 10): Namespace\u0027s methods fall into 10 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 10 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/transform/transform.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c50d3a1a247d009a97794e119f66a659d26617a0811cea5e5a215d91b6cd181"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 8): Namespace\u0027s methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"80523c03385264a4c9f79caa7d9c7e47503f621eafad12087b1bdb8a5ee46e8f"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: FileMeta (LCOM4 6): FileMeta\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/fileinfo.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"714fe9e4c703654c5b69a40f57c054f9faeb58f0120429b10851d82a3f1f2780"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: pageMap (LCOM4 6): pageMap\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e824d3bb0ae431361017f30e917dfe9d24c24c0aca610d3387e425b5ef6a24c1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: contentNodeShifter (LCOM4 6): contentNodeShifter\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_contentnodeshifter.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ad4919cdde46522b3e00b30f5da91316a2e6a3795f62d2f6f0ce41b4381edbc"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: HugoSites (LCOM4 6): HugoSites\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites.go"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3f609556a486e80f9f13273bb050b908a0c3c625439fa1f104af675b4076eb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 6): Namespace\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/css/css.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ecaa4ef523bbfab8c42348b6928df538534bc3f9085922bfa002a5b0baa062"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 6): Namespace\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/debug/debug.go"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"956e9cd5abb30bdb8adf67bf97a3ae43627b33be322719a693bcf1c24ca59dc8"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 6): Namespace\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/resources/resources.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d50e90ebb0237c39331cc299e817fa2bdb17ae07317f99d8223232a6bc24b1"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 6): Namespace\u0027s methods fall into 6 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 6 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/urls/urls.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"1252e0f20144b336a60704bf1bb8c9fc74df922270fac87441361569209f6f19"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Site (LCOM4 5): Site\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/site.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee4209fadc23220215a75ed639f91f14e6608fba26afc3eaae089d8640581f7b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: hookedRenderer (LCOM4 5): hookedRenderer\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/render_hooks.go"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"995ee524a1a0767efbd910f6c473331a2c3e286336da29bff225a42e641b8b5e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 5): Namespace\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/path/path.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2105085c99ea58d81c21f791adfe4196faaf0062972227b6fd5225a3c577329d"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: importCommand (LCOM4 4): importCommand\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/import.go"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c88902db6e38c58b7701d48ea0a0b56caa9e981162c82a7297a2cace407ef3b"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: ShortcodeWithPage (LCOM4 4): ShortcodeWithPage\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/shortcode.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b1aa1f38eba0ae53a1df1a257d0da6b7ef7684ae2e9645ab70258730e22b64c"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Context (LCOM4 4): Context\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/internal/render/context.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dbd84d864fa8bada6509fdbf6a249da87fe6db85bf528e7b38fbba9236081bb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: pageLexer (LCOM4 4): pageLexer\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/pagelexer.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"844fe800c978ec56a7021c2a59a9752612537c2aa27ef4bd5a274a03e7c48500"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 4): Namespace\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/templates/templates.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cb760e4e6c89c71903c7b550ec492fa6889ed2e665da4f4469f5a9521a41c35"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Namespace (LCOM4 4): Namespace\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/time/time.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"5286c97207156f27267a3eedeb12279d6a0df3f8d4a72a185bfbedd074460e0e"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: templateExecHelper (LCOM4 4): templateExecHelper\u0027s methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/template_funcs.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c0b35ea3cfa9f1c7999f1bcfbab7b85f0d243c8702acf8269fbf60d54d45f5"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: TestPruneImages: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022skip flaky test on CI server\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache_integration_test.go"},"region":{"startLine":53}}}],"partialFingerprints":{"codehealthFindingId/v1":"a22115e57d0ac3d452e7a831dcdcdd25f3d260199ece04a873e98419e7b626e6"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: TestPruneImages: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022skip flaky test\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache_integration_test.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"2aab2bf6b4334518a055fa6b57aeadc10372f2a2c098e5744a81a737f9c04c3c"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: TestPollerEvent: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022flaky test\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"watcher/filenotify/poller_test.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d18c23e66aede94c45bdee0dbdc4dfdcd8e2e6429fb02323dbe27402d554b6f"}},{"ruleId":"D12","level":"warning","message":{"text":"Dependency pinned to a stale untagged commit: github.com/BurntSushi/locker: Direct dependency \u0060github.com/BurntSushi/locker\u0060 is required at \u0060v0.0.0-20171006230638-a6e239ea1c69\u0060 in go.mod \u2014 a pseudo-version, which pins an UNTAGGED commit from 2017-10-06, 9.1 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of \u0060github.com/BurntSushi/locker\u0060 and has not moved this requirement in 9.1 years: every fix the module has published since that commit \u2014 including any security fix \u2014 is absent from this build, whether the module went quiet or moved on without you. Check whether \u0060github.com/BurntSushi/locker\u0060 now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"81eed22431c76bc2d31d2979001c60deb4c6797bb3d550d7e06d138bb5c00b70"}},{"ruleId":"D12","level":"warning","message":{"text":"Dependency pinned to a stale untagged commit: github.com/pbnjay/memory: Direct dependency \u0060github.com/pbnjay/memory\u0060 is required at \u0060v0.0.0-20210728143218-7b4eea64cf58\u0060 in go.mod \u2014 a pseudo-version, which pins an UNTAGGED commit from 2021-07-28, 5.3 years ago. The pin itself is exact, so this is not a reproducibility defect, and it is not a claim that the module is unmaintained. What it says is that this repository tracks no RELEASE of \u0060github.com/pbnjay/memory\u0060 and has not moved this requirement in 5.3 years: every fix the module has published since that commit \u2014 including any security fix \u2014 is absent from this build, whether the module went quiet or moved on without you. Check whether \u0060github.com/pbnjay/memory\u0060 now publishes tagged releases and move the requirement to one; if it publishes none, re-pin to a current commit."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b39f6b1c6b35d517611df5e69785f31a07316a5c39e1ce4c9ea1b8e072c39c8b"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"736e77eca072e2e75e3a36092553e0c4b0ede76677bcb4457ef4e4533b62dbff"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: commands/hugobuilder.go: commands/hugobuilder.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 89 in hugoBuilder.handleEvents at line 773. 1 of those changes was a fix/bug commit, and the other 7 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- commands/hugobuilder.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":773}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5c8ab1ca7357881bd2b99f2f0d42308a903155fbf3dfa07952cc8d63e5118b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: config/allconfig/allconfig.go: config/allconfig/allconfig.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 55 in Config.CompileConfig at line 279. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- config/allconfig/allconfig.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/allconfig/allconfig.go"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8e15b9e919c2fa9141ea0b5181bbf8d28574f3257a122665ead4699fd4aead"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tpl/collections/where.go: tpl/collections/where.go changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in Namespace.checkCondition at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- tpl/collections/where.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/where.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"7824f0e1e13de1ab7a00f5ecdabd3ccd15ab7f393be1ae867b5888a7d1140ca8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: resources/images/config.go: resources/images/config.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in images.DecodeImageConfig at line 246. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- resources/images/config.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/config.go"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"57fdd120b86807fc83a9c3d810ad6f3e85b752e1afd97b9046216c235079bc62"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/warpc/warpc.go: internal/warpc/warpc.go changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in warpc.newDispatcher at line 659. 2 of those changes were fix/bug commits, and the other 4 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- internal/warpc/warpc.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/warpc.go"},"region":{"startLine":659}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1b58b70556abac731240021c17ad4a3e59e49d4c4ee0340e5d9977be94d3a85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hugolib/integrationtest_builder.go: hugolib/integrationtest_builder.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in IntegrationTestBuilder.initBuilder at line 887. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- hugolib/integrationtest_builder.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":887}}}],"partialFingerprints":{"codehealthFindingId/v1":"271a96dd767313b7d6a2a391ffb517099d891358d384c066ed12b970647e45f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: hugofs/rootmapping_fs.go: hugofs/rootmapping_fs.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in RootMappingFs.collectDirEntries at line 540. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- hugofs/rootmapping_fs.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/rootmapping_fs.go"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc1bf1ddde57aba48ee7488db4105da60a3e73eb5114d37ed18ed9901e89942"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: resources/image.go: resources/image.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in imageResource.Filter at line 301. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- resources/image.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/image.go"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e1552088cffbd56f6fbf38e6db497d41a42ca57ca8b5ca64cdbf23963e2ccee"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tpl/tplimpl/templatestore.go: tpl/tplimpl/templatestore.go changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in bestMatch.isBetter at line 2101. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- tpl/tplimpl/templatestore.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatestore.go"},"region":{"startLine":2101}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfb033f35c42331f67c8e96cc99ecbec89bcee8fb378c2f3e4d7f7c668575173"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: related/inverted_index.go: related/inverted_index.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in InvertedIndex.searchDate at line 521. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- related/inverted_index.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"related/inverted_index.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"3883a1dda78ca37f70cc985a84ddfb977cbc2f0bf434c884fcdda19df6fbf725"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tpl/collections/collections.go: tpl/collections/collections.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in Namespace.Union at line 638. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- tpl/collections/collections.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":638}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cf63ccf672807b26c3fd06c9d47902acdc6e414c2411737f23f772f6abafedd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tpl/compare/compare.go: tpl/compare/compare.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in Namespace.Eq at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- tpl/compare/compare.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/compare/compare.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"de51ec4fbb2ed5f105a28b5ced580b36989ddfa6af9f4f66bece951f494f2f60"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: tpl/tplimpl/templatedescriptor.go: tpl/tplimpl/templatedescriptor.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in descriptorHandler.compareDescriptors at line 70. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 11:28:59 \u002B01:00\u0027 --until=\u00272026-11-13 11:28:59 \u002B01:00\u0027 --full-history --no-merges -- tpl/tplimpl/templatedescriptor.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/templatedescriptor.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"d62518d6b1f4d6abc513c4e6d9a7f2c5e68a2b6374689f0ebdcc119d928b14b0"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 106 significant file(s) lose their only recent owner: tpl/internal/go_templates/texttemplate/exec.go, tpl/internal/go_templates/htmltemplate/escape.go, modules/client.go, hugolib/filesystems/basefs.go, hugolib/page.go, hugolib/sitesmatrix/vectorstores.go, tpl/internal/go_templates/texttemplate/hugo_template.go, hugolib/hugo_sites.go (\u002B98 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"34dfcdc21a9f0f5f364e0f8c0a61bd19fc19edc50401b73a635f2a7c005af780"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #2: If anonymized user #2 becomes unavailable, 4 significant file(s) lose their only recent owner: tpl/strings/strings.go, markup/asciidocext/internal/converter.go, tpl/strings/init.go, markup/pandoc/convert.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"c1f3a0d58e1cead38dc4cb388df0491e6154c41726351a2a25232914cb58e193"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 3 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (114 single-owned of 342 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 342 of the 500 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (1 file(s)), anonymized user #5 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: metrics/metrics.go, resources/page/pages.go, hugofs/glob.go, tpl/strings/regexp.go."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) check: stat ./resources/page/*autogen*: no such file or directory \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"magefile.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ef3b7bb722fe459277f4de4e2f28c5673067112c0148cce3af032c3ca6c6733"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"watcher/filenotify/poller_test.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9940466f4a3dd2357f90f30ea3fc27844c6c136cf88a5f32cbc563efde25367"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/metadecoders/decoder.go"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"172435d0fe2598d567aa8ae81406a11ebc9d4af08b9f71113e83951a9377eb32"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"navigation/menu.go"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81d803b5d5ea627a436c02c389e51f9151e3be02829682cb803f0682b3a90e2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/org/convert.go"},"region":{"startLine":50}}}],"partialFingerprints":{"codehealthFindingId/v1":"3832dbbd77dd2814a89fa6243ff02dae4dfbd8b8d732880302cd0f15c25d9335"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache_integration_test.go"},"region":{"startLine":52}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f2b1c78dc4451985ac1f06f65b987578c18207951d122450aca80dfe0e3f57"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) check if we can void this conversion every time -- and if that matters. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/template_funcs.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdc1996665ae5302915b71e0dcccebe1af5fff5e5bde72e224313c20a940238"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) no panic. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/resources/init.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a31142fac4396fc7aba456912905d5805cc80e82b1aed7f8510a07dce921b5d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: It would be nice if ExecError was more broken down, but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/exec.go"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ef8454ab3876651c8683c8a3e53903cfbb1cc424910e323de73b0394ab33a5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: revert this back to a global map once golang.org/issue/2559 is fixed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/funcs.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dbf8c296d6160323b416dcebb795c0d78e009f44eae7cd9da59b585faf48943"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Perhaps allow comparison between signed and unsigned integers. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/funcs.go"},"region":{"startLine":399}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c6c9b84a621b59d5b1654b61e5ceb610d26ee3a3d5add7b2a702251ae50602"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/parse/lex_test.go"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"500873e4ac47307aeb4433084c50e4a1e3f81ba1261d61d9e9572baa00649f18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/multi_test.go"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"acd204576f4905e9ebb0cff5b3bcc63f324dfcfd933b6a668395495fa91c2517"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix one day? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/parse/node.go"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"82271b2a0d4cc50d125698a147062bea009d0aba398e2cc7b5730672861ad402"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: fix one day? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/parse/node.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1329cd65a3a8a906df23dfe8aad96e1d1d86e16e7fa300a0faec543fc735297"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not really a problem; could change API without effect but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/parse/node.go"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4e2952dc7f5d0b8b7a122485323cd0ce073e5cb45a24c318ee8e0bbcf84506"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Not really a problem; could change API without effect but \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/parse/node.go"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"72dc8b79cf45981832bcd4fac5e13461569208d5844f41790b938fab3d6d8010"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: SetTree. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/escape.go"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"79359df77a7bd2c18cf22f45392c24f546eff48393b1410c94a0374d6ab0f139"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // new(Template).Templates() // TODO: crashes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/exec_test.go"},"region":{"startLine":1033}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05d2ac39f5c0412098ca2779f0a40dc80cb74eadb4ec8f8ade412c0f678f0d3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // new(Template).Parse(\u0022\u0022) // TODO: crashes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/exec_test.go"},"region":{"startLine":1034}}}],"partialFingerprints":{"codehealthFindingId/v1":"c273cee85d2a4d2acde660ed611866d286199435ddf9133a2deb9045d3992acf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // new(Template).New(\u0022abc\u0022).Parse(\u0022\u0022) // TODO: crashes \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/exec_test.go"},"region":{"startLine":1035}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30a489d96e1440b106d2bbb8cc9a7d803bba0077ea421d6bfd6788e7e2af155"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // new(Template).Execute(nil, nil)                // TODO: crashes; returns an error (but does not crash) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/exec_test.go"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"139c4a15c7f5a3c3e6a67ec5cc243ad3058946c476045f4d72820e98f79bb200"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // new(Template).ExecuteTemplate(nil, \u0022XXX\u0022, nil) // TODO: crashes; returns an error (but does not crash) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/exec_test.go"},"region":{"startLine":1037}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a4de45099e1c861a39047df00e820ece48bfce3f07d7d5935c967ccfc21dade"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Split attr and element name part filters so we can recognize known attributes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/html.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6397a7b9260527de28979426f9be4b74f5f4dde2c47a21dff09d1b46121f3bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: normalize quotes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/js.go"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"922d11455ebef3b4df2727cf8aad619cc30e3d41d35b197252fb96bcb95038fc"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: detect cycles before calling Marshal which loops infinitely on \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/js.go"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bfaba22e75e8b368f5bb0150cb00dde0f43ba0715b803384a0b85bb1f916cd0"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: maybe post-process output to prevent it from containing \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/js.go"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f49b3f62717076b491fc4d94803ff17711222228141ea2486c3a66471bf4b8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should want \u0022\u0022 not \u0022twice\u0022 \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/multi_test.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"df61e63b03e9798bde625cbe3fd19ebd8e50f96e799de73d249d0fe21e002b1f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) I fixed the failing site, but I don\u0027t really understand why it failed. But now it\u0027s Christmas. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/images/images_integration_test.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"01d853968e5ab5cf89b33749f67b6691e97b5761150d7bde8bf8d7954bce36b5"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) see #1098 - also see template_tests.go"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/apply.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"0002276ea513e3fe86fc98ad79fa1d9c4a7994b01a5b978f32571a567636e8df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(moorereason): merge upstream changes. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/index.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"396a19b6388474072f6eed9ac94e1b7f9685d14afa29e9fea365847ba4718e2b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: count rng calls? \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/vitter_test.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d424e814539ae9a7caa634ef2d103db2e32fe65b52c2a5c5ba86869b8c0f981"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) rename to Spec \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"source/sourceSpec.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d45e5f882e15f64a572eec6c65775952356376b065ec44bb1ccba9ef9fd65b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) we need to handle these ambiguous types better, but in this context \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource.go"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"dad2f816e9d357ebd491c514a10af709f8aaa0e6ced909dbd1158fc2843f7d19"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) it\u0027s a little fragile having these constants redefined here. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/transform.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"210715f8da2a9921476a5d6a3e8e5d1656cd611f53a259816cb7ac4f20cecc68"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) this is not very efficient. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/cssjs/inline_imports.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab86378c5afc0dfc9ce1d33d7cecfe3fd91101d5124e56ba39b8641c088ab435"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) This has started to fail on Windows with Go 1.19 on GitHub Actions for some mysterious reason. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/cssjs/postcss_integration_test.go"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0dc72f392d34af30b439063b162614af168f3664b68e1d7182e002e4793ec0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) figure out a ways to remove unused tasks. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_factories/create/remote.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"32211302e632b40541c0db5eec452ae7a7ec1fc478dd969b17fdd6c729fc7dd1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) Path() vs filepath vs leading slash. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_matcher.go"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"9381ff425d469a5cc2bbefdf453997a6d369c8d76425dff4f79fd47082287ef9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) move this type. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_paths.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f254e7cb077abe2b3000e06ae64c64c4698a9271257af2def02e5de694cbe8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) fix tests \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/weighted.go"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9875ca087336569d7c9374cfc0c377eb2b12144994ace4e2f4ab2100901655"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // For now. TODO(bep) \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/meta/meta.go"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae62a7c415fb6948c70ffda948e568313117e3a68e1b67db35f2be22b3e003df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) figure out why this fails on arm64. I have inspected the images, and they look identical. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/imagetesting/testing.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9dc5aa421f1f77b2401aeb977c2c68a83a6f3f29109043cb9f1eafa22f8a9f1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) a way to toggle ORG mode vs the rest. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/pageparser_intro_test.go"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"d86012f598ebfac6e600e21e4559562dadbf6374abbf82d535bdd4e0f51dcd99"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep), maybe revisit this later, but I hope this isn\u0027t needed. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"output/docshelper.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddcf2face3add38d89b48c9b3ddc077d650a3f8f4b6c9e50efd6a75de9da3529"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) add path to mod clean \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"09e445472cd364c8063fa25f776b3b76fa9621bc600529e7b1b9f3e29a3ebd9e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) minify config etc \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"minifiers/minifiers.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"7232a8c425bd132b64062343ec5cb897a4404b00b7e759eb19c2f52355c97f22"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) get rid of this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"media/config.go"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdd9514eb5fef7ec03f579571c2bace50575990d1e2e650ad0c71b042a5c7c31"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) get rid of this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__common.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ef5f74e752f80354ac6cc434907f47c1205fa1496d15e8f0bdd58108a7d195"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) improve \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"media/mediaType.go"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c33523bc366ae5bb0611e7e192c63eb5a586a2fb2870726955297567c3de094"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) check if rst2html has a body only option. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/rst/convert.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"96184ea1e616ace0ab73dbaf82b4617081507d16f3adc6a1127c914624ae2909"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) upstream option for this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/highlight/chromastyles.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a869bfded0c523f015fbeb48700042c4418998e363ff9160b073a1cc2a485e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep): replace with an upstream option, see issue 15161. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/highlight/chromastyles.go"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7886b93aa12f91c991f5bde71b3cbb4cbc1f0cca285bbb35e46de12649bfa09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) make it more efficient. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/autoid.go"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"72bc5ad41451ddd4d934f263f1c5c676998839b8bf61d871b3282468bfa2ff70"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) create upstream issue. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/convert.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36a06bf6157d0ff8151c542cf5d8ee85dc1bdcf6f1d6c9f0ebee857bd6430cf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) this needs an upstream fix, see https://github.com/yuin/goldmark/issues/195"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/convert_test.go"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4843b4132c18c8899605a343aa94796b7108cd918154aad69c6f7b720faad54e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) there is a whitespace mismatch (\\n) between this and the highlight template func. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/convert_test.go"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"c021caf0eb6f551b329b1413c8e6643ad64358ae5c3fdaca9752700c2d171851"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) we use these methods a fallback to default rendering when no image/link hooks are defined. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/render_hooks.go"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"f360c22db0e56432f82d77b15d901797b8a21f6023502c1191703ba4c01da4eb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) Remove this for now as it created a little too much noise. Need to think about this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"langs/language.go"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c90e69a5898c638c32281996eacad3fabdf504f2ae1decd6caa26544ffdcca2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) this needs to be improved/fixed upstream, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"langs/i18n/i18n.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b2ef351dd870969eeaa6ee9f1224bfcfe739248993b01f8a035ea6ed9f22ad"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) remove. See https://github.com/evanw/esbuild/commit/869e8117b499ca1dbfc5b3021938a53ffe934dba"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/options.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bb10c1e3fe7822cab22be7f0a1bdcc688cec90755e674f20d461d4904d75a0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) make this a method. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_factory.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27ae75123fdf7d98cae349a1e4b10563f6ae274ec3e86bf9ee38d2360e458d2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) we don\u0027t need this as a slice anymore. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page_assembler.go"},"region":{"startLine":1276}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ec4347434f580f097573df64ee38fd0e4334bd2613fc9e24d95f77a259898ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) I\u0027m not sure if this will ever be true. Needs some investigation, \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/gitinfo.go"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"4965f70acee673dae86384d0991b4ce532a845caaa883e187817a674349fb7a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) consolidate \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites.go"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d4a436d5a9f8ab37b495a04ab7f4faa0ffdcdd6042e4c2751016e5e951b2bd9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) Double-check this; I\u0027m pretty sure there is only one logger. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites.go"},"region":{"startLine":615}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b20606ed5fc28aa34b7f2d817a28e3ffe7bed539b6cff29e45b8be4f24a5e4"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) figure out a way to detect 2) above and make that a WARN \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/hugo_sites.go"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"92896010853cd326da453a3de5c19f637f349e59e3bcea4e5955eeecef75ee34"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) is set in a test. Fix that. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__content.go"},"region":{"startLine":807}}}],"partialFingerprints":{"codehealthFindingId/v1":"466a6285b1222f0a0ab370ec30547fc3cf4e6c172381cc564fa510a36bd27d2d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) we need to \u0022do more\u0022 in this area so this can be split up and \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__meta.go"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b9aa9c016c7b5b8e6ee502fde9676397dfcb02811a74393317b34f27acb72a2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) we may have plain text inner templates. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/shortcode.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4020e3d0d4ec1b666124c0d7d41aeed99a6425330bbc59c9144e86196ea578a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) I think this is superfluous. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/filesystems/basefs.go"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"80c09d1a8fff5d0dfbafbc17e38a25a96c0f7e87462ec311eef1d893061eca0e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) move this to a more suitable place. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/fs.go"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a8f5d03d3cab3eccae79b76a543ff4ab82efc58d14293a681da61e6e8602f98"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) make this more robust. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/fs.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9089b2aea3c8a7220e387f08d5fdb22cb04cfc5a841ee9b459fbdb3e153fc13"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // todo see comment in AbsPathify \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers/path_test.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ea43fd4f924fb50f7af2f24c64ba608a38e04f747566f36c9893adccd5c8f6a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // true reduces STDOUT // TODO(bep) remove, this is a global feature. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce7befcba933bcb496a22f41cc8a647d8400bde083848eadf434877e765b0de"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We don\u0027t register a diff if the metadata (e.g., Content-Type \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"92e536af28217f4fa913c7060ccd90565eb5b4a3334ae9d66bcef3d2f5660b54"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) clean this up. Export the test site builder in Hugolib or something. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"create/content_test.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"27e25a30616556a48720532410e9deb57b5ddc2403a301a93092291b0a94f4df"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) extract common testing package with this and some others \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"create/content_test.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee85b3f7fee8b7035ad6ca1af1ead35172c3eb85e3461cdac7a617088c226a58"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) find a better place for this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hugo/hugo.go"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4b3df3a03d7673c03f7ee397bf206ebd2616787f5aaf0ea7966dc32b116c4bf"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) find a better place for this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/commandeer.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8a9ad17b80f072ac201f1ee96ee206efe1846a722821dcc1393a6531e160d83"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) find a better place for this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/commandeer.go"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"74cc02c9a8642fd9df0e80f37eac9abda618a38cae2f441e33bb3e147d405015"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) we eventually want to remove this, but keep it for a while to throw an informative error. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hugo/hugo.go"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f4e6334baa8ab70defa8c3d315bc06c7694ba04f9803fdd9832879d71890070"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) replace the private versions in /tpl with these. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hreflect/helpers.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fe86afdeb31b599ed1cb8ea66946cb722904a9fdbb1299203010388fe7151b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) replace with iter.Seq2 when we bump go Go 1.24. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hmaps/ordered.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"06cc1f3e84117736247e2bc4bbe6fa943288bc105a5ce84e8c44c118f4c36aaa"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // Set later. TODO(bep) this needs to be cleanded up. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache.go"},"region":{"startLine":527}}}],"partialFingerprints":{"codehealthFindingId/v1":"e31ecc1a9f812743b8bedc60639cfaa71457372a86cbca4fd98c633b45953764"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //  resources/_gen will get its own composite filesystem that also checks any theme. TODO(bep) unexport this. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache_config.go"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"721234cb36e1a8a46312b4a1ff51ac7eb0e11267ae4bc965ea63d2e5dcc27949"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(bep) we need a way to test full rebuilds. \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache_integration_test.go"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9df46aaa1074fad6f2ca7dda638a6ecbfed01211210e51be636a4146976d7d4e"}},{"ruleId":"D20","level":"note","message":{"text":"No ADRs found: No ADRs found. No recognised ADR directory (\u0060docs/adr/\u0060, \u0060docs/decisions/\u0060, \u0060adr/\u0060, \u0060docs/rfcs/\u0060, an \u0060ADR0001/\u0060 folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (\u0060docs/adr/use-postgres.md\u0060, \u0060docs/adr/2024/0001-x.md\u0060); or a file anywhere whose name is ADR-shaped (\u00600001-use-postgres.md\u0060, \u0060adr-012-caching.md\u0060); or, when neither turned anything up, a document carrying the decision-record signature (an \u0022Architecture Decision Record\u0022 heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these \u2014 unnumbered files outside any recognised directory, without those headings \u2014 is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in \u0060docs/adr/\u0060. ADRs are expected here because \u0060magefile.go\u0060 makes this repository a deployable product (line 3)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"magefile.go"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"88dc4d4f66f91bc6d0ffaf7e0e2021cf3ff2f6c02620fd759d2b29ff43dbfade"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 1 of 3 project(s) overshoot their size bounds, lowering Project Cohesion to 3.3/10. The most over is \u0060(repository root)\u0060 (113088 LoC, 968 module-visible types across 187 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ae12fa03a3c1db534c3a2f877ab8ff671095df55a1ab5514a48f2515ead5b88b"},"properties":{"commitSha":"a024bc7d76fcc5e49e8210f9b0896db9ef21861a"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5f6f9ab0bf8341ab3f65954da94f2da4417fb88f1690a17e63f1cafaaac8980e"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fbd4b407b70a20d59e9a6482fd591681b28c417cf07f06eb9248990895663c23"},"properties":{"commitSha":"ec5962278f394654fd17df35bbfceb19702553dd"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e46e3ef992e777ff36600bb1a99e0c1d6e66cd44e24f876137cad37332bd4fc2"},"properties":{"commitSha":"b17a61a6056a516949dd9aa11034c39c9ad8e37e"}},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b5ccdbb4f94bf4ccf0ca287f2ad270f88200f7b47357057f8b4aaca0872fd8fb"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7e6b1482510f5c173ed53861c802355f55c6f5e3542a34bb4de7924626b55cfc"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c88cf0cda8624dec36233fd1ec15430e795ca9f0d84abc68af9171c861dd78ea"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c2116666973e71c6ed7bb03bea9a8e8de217955e9859c1243542d09f286382d"},"taxa":[{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"107089f3006b49e4d2479441d0b9b2dcb231588d39ec299f2efeb9d918e1027b"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1fb3e7f29b34bd3891f553e677b71f6bc17b4ada2493bd10d903ca4a8eb4f5b5"},"taxa":[{"id":"CWE-22","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e3b1fc69b10c15a124495796de7097073abf25cb3470bc230a17c8ab96bf60bb"},"taxa":[{"id":"CWE-400","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e7c4633b3263da0b49d19ecab1e17107fa8fd59524eaa098a7fc740e80ab07f"},"taxa":[{"id":"CWE-319","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ecff2cec7cfef188954b2414f1f106e5c870b0ebc563c3dbfeae4a8b4d22e876"},"taxa":[{"id":"CWE-400","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"61fd60356774e834d2e8aac7475b185f679d8f982ca58d99ac741b748f0c49bc"},"taxa":[{"id":"CWE-400","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ffb7a8df328b2c2a4e899378e9e4864bdc72a8533ddf1e6006f87c8f439ed758"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6544a30530fe3ed530186058bfeefea4d3a155d94e8d1e6a16ac5c20c7070ec5"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5e2beb48c98c7008f090be923cb1475cf32f33837abd2f262fc987dd3d606444"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbd31227ec2c3494dd9831f177f080507c77c425ab8ce4deb01c76d55019f9d9"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"000d77708520a7f576fe61312a351619f294f7dd2d48449d8dd28374633d2138"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"159b13f17d3fb8de5b012e925fb368f5cbcf667ac38ad44a743ab7cb5432f5c2"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a1150700c5015ee962b93356ffdc52eaa3295b350c8dbfdaac4bce12c86b77d4"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f45b9f937ffee43d636dad09522b91994795666c7ab2e943517a534aa8196b49"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c6ecd5965fc94c6cc67ba282b566c2094a11a3eef7de8e688734c063a6b6c773"},"taxa":[{"id":"CWE-200","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4924ed4776e393bcb2d7bfe46d3cc862d3c2b759efdece1528b5b7533602924"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"061152b265f3fc851debe92a9c9d4e2497ec3288c94fc03cfd185f1448382998"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7d4d098a3dcb26230c91119669471edbc6e35c2413348c41e221fd21ab803da0"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"beebb044cf0c386ad841d94fe419f6f789ad53c8079fa730bab0668fd00e0fa7"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b6ba8aeb47ba0d14421150569957a6231000b768929b6979e3e358c33c90f9a7"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"7184aaee59c5409192cc87a37b250c3d2c57ac95f8de5e6deb5fdf2cdf4a6284"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2115fcfd25ab800dbeaa728b9580fa6f90c711328277e059709a6ecb5a08f748"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"48c3efee2688cdac17302592058d32f4a95fdd95dee980c52b9adc1b6247698e"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a84f94ae30349a0c5a3b1dff8356d7e003f0f242bcdd5451851131e02e042321"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a4c8faebba0eeed38e838374f84c53b7d358eec87133a7fb3531472cd62be833"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-703","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"aa00f8e5ae452664a8642cb1548103edeba8327fadcd175346de6db9e7cb0525"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"dbdb39e193c87c69e0fd424f9a7891f8a8164aa0e430360d5bd784187bdabd20"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3ff15d7dd83afa6fae29c28f0cd64b368adc60efbd4191e90e20f192b323ae1"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"695d223cd7085f61ba972e9edba6989a27cafbbf8b57bb2de169a7e678349ff8"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d8a85df612ec6945b542bd960d7979e2e0680dbbf93db6896c69836f4a47fb6"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b2518230394dd3528ea84b03b1669b43e4150600be9e5d8f0059ccd57ecb05da"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f516a726129356cc6c55e155d6b307fd786b5182f90a410d4944ac86b4df0da9"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1deb7c85e067005664e4f04e35d56ff9f33ec2c064b19acc8725988031d37224"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"453652678e783c79a4a4731ce6593f2aac9e41cc1ecc1e98fa4caed089a48419"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"15f7a37cb35db162f4799ae0d8d74fcf6e532a8ea64a1a1d1b157db0942cdc86"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"346c70d819499b8f69a7214494c96b5d837ab6e849498a170ba1e58423482c7b"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f4cc0471158b7a61ea9bca586af07f3e683450b12d5bca814604f8e9be55944f"},"taxa":[{"id":"CWE-248","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-704","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"13c5cdd0d40136ff13f0406bc95b20ea8741f3080300f951e4c1f8060f805f03"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0509c54188ad2a27c0e23e1b808111213a93720133cf7c61d7c2370f4c4be9d9"},"taxa":[{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"69675b56130b40a55301e1cda1e97b42d6bda15bef7906e3f5380cf4809358a6"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c70568678ddc011469b25189ff516c380cf36ccc775947c5fecb9c480c170311"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4d7f73196c81fcf60f1d3ee135fd097ea1ed37318b6454499b9410a3c375d787"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d476e685950e628a81394b567cfe0a84cfd8d216149eddb5ef4e348fdf9001d3"},"taxa":[{"id":"CWE-328","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c4c24114980c1602f26d879ef8d8f7ef00573aaab3890e02375d40c0e0eaf47"},"taxa":[{"id":"CWE-338","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"a46191eff66e781d7252879987aac2f29f3e15d177b96727728bc1480e24878e"},"taxa":[{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e5120d5ee7e3c9bc878907b9333e6dbedba750015cd7d1fa77676e2010051c3c"},"taxa":[{"id":"CWE-252","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-391","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A10:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"84f901cf8a5dbba707d822151a3e0f09049c39f3d5e05f3f1a4b871cfdf12a01"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"176baf7cbcdcdb4b7d8f763bb176cff4ae1647da83cfec8eefd8856f0632746e"},"properties":{"dependency":{"package":"stdlib","version":"1.27.0","advisory":"GO-2026-6599","aliases":["BIT-golang-2026-111943","BIT-golang-2026-56857","BIT-golang-2026-56866","BIT-golang-2026-78659","BIT-golang-2026-78660","BIT-golang-2026-78663","BIT-golang-2026-78667","BIT-golang-2026-78669","BIT-golang-2026-94439","BIT-golang-2026-94440","BIT-golang-2026-94448","BIT-golang-2026-97030","BIT-golang-2026-97031","BIT-golang-2026-97032","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","GO-2026-6600","GO-2026-6603","GO-2026-6604","GO-2026-6605","GO-2026-6607","GO-2026-6608","GO-2026-6609","GO-2026-6610","GO-2026-6611","GO-2026-6612","GO-2026-6613","GO-2026-6617","GO-2026-6809","GO-2026-6859","RUSTSEC-2026-0381","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"reachability":{"kind":"production","file":"commands/server.go","line":364,"symbol":"http.Redirect"}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1c9c7154a9d80981a2f1da0fd0aa2e12a4e104a4411624a7aabc5ce2dd45d848"},"properties":{"dependency":{"package":"golang.org/x/crypto","version":"0.58.0","advisory":"GO-2026-5932","reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b3d72354492fc97c51df57c0ef6728e86fddf70b9847ca592ba6f8e0902704af"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6e0ac38b0a54676aaa57424a707ed5df0ea555994c7fddf730ba7ac12fa654dd"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"650ebd35e6e8e8faca00d9fc5aae9f508c0ef619a2a9edd6dd7eb58c8d4aa03d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8b07f7579076628bd79d209a9a37ee15b3727086be16ddfbcf8b1646dd9b10be"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c622bab8f3dace0cacee804422dc55592a6dcb7fd3b196d5086cd478627fe00f"}},{"ruleId":"D31","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1f51a163f26d94ce6b6f473117dde579d091c8cbf9e59810475c94d9fc921120"}},{"ruleId":"D34","level":"error","message":{"text":"Orphaned knowledge: No living knowledge remains for this large file \u2014 its last meaningful change has decayed away; if it breaks, no one currently understands it. Schedule a read-through / add characterisation tests before it bites."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"544254ef3bdaa75560f4da53a38aeb9f455991cfbcbe869024f14b835ba312b7"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 1 smaller file(s) also have no living knowledge \u2014 folded into the freshness score and metrics rather than raised one row each \u2014 most significant first: resources/images/text.go (2 orphaned of 343 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 343 of the 500 production source files in this repository met that bar). Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ce861fd78f6935114d3a342cb90ad25870f984e1042954fcbbe27c0e23be3658"}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned file: No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/images/text.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff6f2750717f977d08f78bb57a7be33f3a38bcba54a7a75aa1823183a8cd1fc"}},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"2e0de378b0f4d2b77dae75ababef87fad4f176e0397e217cbe845b2581311fee"},"taxa":[{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"4f1e7684f8281bd255ddef97105c7055c2ebae06964c8745716b83e174debe83"}},{"ruleId":"AC3","level":"error","message":{"text":"\u003Chtml\u003E without a lang: The page declares no language, so assistive tech can\u0027t pick the right pronunciation. Add lang (e.g. lang=\u0022en\u0022)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/embedded/templates/_server/error.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"971c39056a40fa3f211ae6e741828591f0b3f6bd06033539de43ed39edd5bcd3"}},{"ruleId":"AX2","level":"warning","message":{"text":"Stateful handler: fileServer: \u0060fileServer\u0060 serves requests (request-handler function literals run on a goroutine per request, and every one shares the single \u0060fileServer\u0060 value the router holds) but writes its fields outside any lock (port; e.g. \u0060port\u0060 in \u0060createEndpoint\u0060 at line 284). Unsynchronised concurrent writes are a data race in Go: an update is lost or a value tears, and a concurrent map write aborts the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/server.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd825cca3189b518db864af849ffcb461e3f895936aefed841b29b7c2ce1bc41"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P3","level":"note","message":{"text":"Dependabot does not watch github-actions/npm/gitsubmodule: \u0060.github/dependabot.yml\u0060 schedules updates, but no \u0060package-ecosystem\u0060 entry covers \u0060github-actions\u0060, \u0060npm\u0060, \u0060gitsubmodule\u0060, which this tree depends on \u2014 so those dependencies get no update pull requests and no advisory pressure, however complete the dep-scan credit looks. Add the missing entries to the \u0060updates:\u0060 list."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/dependabot.yml"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"23899c6559d55da4a8cf0a25c7b32e7cc73da0a8d1cc540f36675a54d2fce209"}},{"ruleId":"P4","level":"note","message":{"text":"No release approval gate: The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY\u0027S PIPELINE FILES. What was read: every file under \u0060.github/workflows/\u0060, \u0060.forgejo/workflows/\u0060, \u0060.gitea/workflows/\u0060, \u0060.azuredevops/\u0060 and \u0060.azure-pipelines/\u0060, plus \u0060.gitlab-ci*\u0060 and \u0060azure-pipelines*\u0060 \u2014 with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab\u0027s \u0060when: manual\u0060, CircleCI\u0027s \u0060type: approval\u0060, an Azure \u0060ManualValidation@\u0060 task or an \u0060approvals:\u0060 block, a Jenkins \u0060input\u0060 step, a \u0060uses:\u0060 step naming an approval action, an \u0060environment:\u0060 paired with \u0060reviewers\u0060 / \u0060required_reviewers\u0060 / \u0060protection\u0060 / \u0060wait-timer\u0060 / \u0060deployment_branch_policy\u0060, a draft-release step, a \u0060workflow_dispatch\u0060 promotion, or a release-event gate. \u2605 What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy \u2014 all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060http.Get(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"livereload/gen/main.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5c8209bdad8ef21e917e2975f27b32358e0eda400773d8f3b5f5638f56296cb"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 0 typed \u00B7 6 plain JS \u2014 the untyped files are common/hexec/esmloader.mjs, create/skeletons/theme/assets/js/main.js, internal/warpc/js/common.js, internal/warpc/js/greet.js, internal/warpc/js/renderkatex.js, livereload/gen/livereload-hugo-plugin.js."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readInput (cyclomatic 11, cognitive 25): readInput has cyclomatic complexity 11 and cognitive complexity 25; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/js/common.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"11cd7fba23a5fa767a8a1c6397c562771c81b85055168b0808c285c579e6ec4f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/js/common.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6207941fce2226521f69f0089ef2e1d750e024f9e2b7fa6678c9f7542dc08bb7"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"livereload/gen/livereload-hugo-plugin.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9c7c2d8c6e85d5c3c017a4c368286aa0424215845f08f438769090987a4f406"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/js/renderkatex.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea0e4f065102a12fe58a0e0c42caa1bab8c7df86988b653b1606215ef3ab6d10"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/js/greet.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5e2c2133472a6c46451e683d6dc42a641d4d22099f4acd0ac8ca88e496e8efc"}},{"ruleId":"R6","level":"warning","message":{"text":"No test or typecheck script: test \u2717 \u00B7 lint \u2713 \u00B7 typecheck \u2717 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"53484d7d02bbf1aa1fb3d1163371a5b52fa0aa7301d11eed5ec2dc836c72924b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~61 LoC): no import path from any entry point (3 application, 0 tooling, 1 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hexec/esmloader.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8174ddb8f69b45019226c79e7dd682b8b32de8ff2ab6b314c6d61ba849630abe"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~44 LoC): no import path from any entry point (3 application, 0 tooling, 1 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"livereload/gen/livereload-hugo-plugin.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0334e0632e63955e48af0d3085cbadf71a4ced4bdf5ed3b867830143d14eb3d"}},{"ruleId":"S1","level":"warning","message":{"text":"Third-party script without Subresource Integrity: \u0060https://www.instagram.com/embed.js\u0060 is executed by this page with no Subresource Integrity. Whoever can answer that request \u2014 the CDN, anyone who compromises it, anyone on the network path \u2014 runs arbitrary script in this page\u0027s origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time \u2014 the executed bytes can change with nobody touching this repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/tplimpl/embedded/templates/_shortcodes/instagram.html"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb7f8631a6443329534721b52cc4bca5f8f378e0b2afc7c22ddd28a36178d01"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is configured \u2014 defense in depth, even when a reverse proxy could set them. This is reported because \u0060netlify.toml\u0060 configures this repository\u0027s static hosting, including its response headers, so the configuration that would carry these headers is in this repository and was read in full. (\u22122.0 on this card.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/netlify.toml"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83db17c9b9715bfc3a4f8670dfa589c0cb924540b3703df3918f59374b0d1678"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: docs/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8ccefe7ef56cdfe2723e5baf7ca014aa61a3b85714535942eab2b17f13f8cd9"}},{"ruleId":"SC1","level":"warning","message":{"text":"JavaScript dependencies are not locked: internal/warpc/js/package.json declares dependencies that no committed lockfile resolves \u2014 there is no package-lock.json / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it \u2014 so its installs aren\u0027t reproducible (SSDF PW.4.4). Commit its package manager\u0027s lockfile (or add it to the locked workspace) and install from it (\u0060npm ci\u0060, \u0060yarn --immutable\u0060, \u0060pnpm i --frozen-lockfile\u0060 or \u0060bun i --frozen-lockfile\u0060). Advisory \u2014 never scored."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/warpc/js/package.json"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1dbfceafd0ec082c66db8432d69358d5e56755187ad1c87f623c27e47961920"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!unicode.IsLetter(r) \u0026\u0026 !unicode.IsDigit(r)\u0060 appears character-identically in 2 files \u2014 related/inverted_index.go, tpl/internal/go_templates/texttemplate/funcs.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"related/inverted_index.go"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e8ed5f1560d2f083e32585843570e943bd3b024e442b26d817934038a53a5f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.state == stateText || c.state == stateRCDATA\u0060 appears character-identically in 2 files \u2014 tpl/internal/go_templates/htmltemplate/escape.go, tpl/internal/go_templates/htmltemplate/html.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/htmltemplate/escape.go"},"region":{"startLine":756}}}],"partialFingerprints":{"codehealthFindingId/v1":"3554bb624eabf3ae2f1851a3abd291ef1e33c6a0e2d60e95e5015a629019e0e8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060errors.Is(err, fs.ErrPermission) || errors.Is(err, errors.ErrUnsupported)\u0060 appears character-identically in 2 files \u2014 tpl/internal/go_templates/testenv/testenv_notunix.go, tpl/internal/go_templates/testenv/testenv_unix.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/testenv/testenv_notunix.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff857d07083a332931a2f6a9a6678854c9f14c418e485b696362de389150620"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isBuiltin \u0026\u0026 (name == \u0022and\u0022 || name == \u0022or\u0022)\u0060 appears character-identically in 2 files \u2014 tpl/internal/go_templates/texttemplate/exec.go, tpl/internal/go_templates/texttemplate/hugo_template.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/exec.go"},"region":{"startLine":802}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a25bc3c6d784aae6663c7d797aac8fa337776255fee3b0e5b0e7ec72184e22"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ptr.Kind() != reflect.Interface \u0026\u0026 ptr.Kind() != reflect.Pointer \u0026\u0026 ptr.CanAddr()\u0060 appears character-identically in 2 files \u2014 tpl/internal/go_templates/texttemplate/exec.go, tpl/internal/go_templates/texttemplate/hugo_template.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/exec.go"},"region":{"startLine":701}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5006ae7fecd510e38385b239d7d1e4231903dbdd5988ac736032bc21b8b3a4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060r == \u0027_\u0027 || unicode.IsLetter(r) || unicode.IsDigit(r)\u0060 appears character-identically in 3 files \u2014 markup/goldmark/autoid.go, parser/pageparser/pagelexer.go, tpl/internal/go_templates/texttemplate/parse/lex.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/autoid.go"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"f919d414eab85ef331fb39d0710c6fd3f0405c73e7d7fd4e391b720364e3676a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060receiver.Kind() == reflect.Interface \u0026\u0026 isNil\u0060 appears character-identically in 2 files \u2014 tpl/internal/go_templates/texttemplate/exec.go, tpl/internal/go_templates/texttemplate/hugo_template.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/exec.go"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"18adbae79ef4996289dd4d71897a9bc0a2cbbf19906b97f3f4d5362737e560fb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060reflect.PointerTo(value.Type()).AssignableTo(typ) \u0026\u0026 value.CanAddr()\u0060 appears character-identically in 2 files \u2014 tpl/internal/go_templates/texttemplate/exec.go, tpl/internal/go_templates/texttemplate/hugo_template.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/exec.go"},"region":{"startLine":925}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9b4099a1b03622935707c6c79deb9b2907a967d16ed8bc6362486e0fe16e61a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s != ownerKey \u0026\u0026 strings.HasPrefix(s, ownerKey)\u0060 appears character-identically in 2 files \u2014 hugolib/content_map_page.go, hugolib/content_map_page_assembler.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/content_map_page.go"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"04c1aea67ee1dc09af2cd5139bf2cc348a31032ff4da77bc7ee0a070b000b223"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.conf.RelativeURLs || s.conf.CanonifyURLs\u0060 appears character-identically in 2 files \u2014 hugolib/alias.go, hugolib/site.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/alias.go"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ddee8c0cbd09b9507ca59c880d8abe22a8cac34bb16f9789f3eb2a933c2b453"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typ != nil \u0026\u0026 !value.Type().AssignableTo(typ)\u0060 appears character-identically in 2 files \u2014 tpl/internal/go_templates/texttemplate/exec.go, tpl/internal/go_templates/texttemplate/hugo_template.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/exec.go"},"region":{"startLine":907}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc7ff9a17f3cac828a45d26e8416e4751de63e56693596de5e46fd60daa2efa5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typ == reflectValueType \u0026\u0026 value.Type() != typ\u0060 appears character-identically in 2 files \u2014 tpl/internal/go_templates/texttemplate/exec.go, tpl/internal/go_templates/texttemplate/hugo_template.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/exec.go"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f58ec6ec54447b9729c5ff7277c76a011ebe4127e85a5cf9995af8aaa46c240"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.Kind() == reflect.Interface \u0026\u0026 !value.IsNil()\u0060 appears character-identically in 2 files \u2014 tpl/internal/go_templates/texttemplate/exec.go, tpl/internal/go_templates/texttemplate/hugo_template.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/exec.go"},"region":{"startLine":908}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d6eb2496e368d0d42b03e30577981dab7863d251d765f2e59c7c5cf713a4db"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060value.Kind() == reflect.Pointer \u0026\u0026 value.Type().Elem().AssignableTo(typ)\u0060 appears character-identically in 2 files \u2014 tpl/internal/go_templates/texttemplate/exec.go, tpl/internal/go_templates/texttemplate/hugo_template.go. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/texttemplate/exec.go"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b715013d1b8eb0e3e506abf1d09ebbcdf2b7d0eba51bf1bde4b0c64b9fe508"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := w.sendErr(err); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"watcher/filenotify/poller.go"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"86d520f214f2b23eb2f5a14d6db573a6cd5e1c62f70de5353408c34446342b9f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := w.sendEvent(ev); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"watcher/filenotify/poller.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e78004ca717d580422dafda0cf37c33fc35d90c416242e20ae31bd7afe5867"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/os/os.go"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e029ba7a9543102c3e8c4fde1420d3874da5a08a2f4a3cccc60ed0288785d4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/testenv/testenv.go"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d5788007b0cc8bdc2609615c0e49cdc04c8e19e0c4efec6e5333950648eec2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/testenv/testenv_notwin.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"80dc27c511bb20c4a7deef3fee362aa8efe8dd86a257aed7fba6fe14c927924a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := os.WriteFile(fpath, nil, 0644); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/internal/go_templates/testenv/testenv_notwin.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f2766c47e588faabe131fe3406f30aa522831294f0bb89c9552a9304617a2a5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err = mapstructure.WeakDecode(m, \u0026opts); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/encoding/encoding.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"e74fe50db200c161ea452683f81d9ec738e591cf733bd027748734fb93dcbdf6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"b13310c2346ae9030fca17fd1eedb7633188e70cf9027f555aa0eedd208e8a1b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"527e00a9470606b13f233f2f8f8b7aefcc7add45ddb07088b5401e4a3fa156d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee4c616c005fa1ac1a3ffd9226fbde4b893984e34b9045c55d5e5b6c47c80dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"tpl/collections/collections.go"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"0daae5f3434462a250e57e3cbeb7f0451779914575fc902fd71967bcf95bc807"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource.go"},"region":{"startLine":529}}}],"partialFingerprints":{"codehealthFindingId/v1":"2adeec35308f5d92b82621c72fb002909620e0f487b6d2f26199bf424a660ff1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource.go"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d6676eec601ec1da0dff0ff329a7c390802f4e9f38c1d93d61d6f002da37f2f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/tocss/sass/helpers.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3682a23c1b371211faca9f2234b6538c38b6911379264310a22c82170057b519"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/cssjs/inline_imports.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cedf57ed162d40743154013f042d43e383540e1622237288a7ced8b496c81f6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/resource_transformers/babel/babel.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"14434c8b32648aec810fe3bd21e9644f67c9b793761f36845823d476b3cf5ffb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/postpub/postpub.go"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d2c23950650cc40c61ea8ef9edc3bd3e49692138a11b76b271f465681710716"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_paths.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"3949336461bf975eacf1fcd8c6beb9d3547ad3d09013fe33ad89e37c4d81deab"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/permalinks.go"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"646c1cdbc91baf0c635eeb077acdda38653011d1e1dccaaaf52d2d1ff217587f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/item.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd89056d4d88ebc85224ed61daf3afab61e73efeb23c6bd45c8d2ad3dbd42406"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"parser/pageparser/item.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9b13b9f30952b56a121cd284c37c53616ecc379c52d0a61c1eba414a5bb9719"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd055a26eafc2afd6de33b2a6531a1b5e7712f8259a52ac49792f449b1ebf18f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := c.fs.Stat(vendorDir); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/client.go"},"region":{"startLine":753}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f2a102b142863a3ceed337afa75c3e8eb1f390fc5324b02085dd6e8698d99e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":795}}}],"partialFingerprints":{"codehealthFindingId/v1":"120472ea6c2f7b8030a39fc2b3094e110e32ccd452b41c52ac71e55789af8076"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/collect.go"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae8884a4484ba56d5f7bdaea692d23d5da594e3db89adbc6694beff0c777719d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/npm/package_builder.go"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d4c2a1e419a1ec7e9e8e7d7cb6af166c63b0841135d9b57d5bac9ccc58a5670"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"modules/npm/package_builder.go"},"region":{"startLine":578}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f441f4e52624ba5cedbc3b8aac92f902b3c0ec43a2fba17d519a63d359e75ee"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/internal/attributes/attributes.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9d5ab8f1183cd821dc9dfd2c32ba6b9110ccea12500ce1b48fd17c12a56231"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/internal/attributes/attributes.go"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e03fa8ab7e285502cd5d0b6f8b15f1c6bbca7ba22529c3b7c1519a60d792070"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/highlight/config.go"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf17b5b942d894790736cceaafa8fe4b7021c1ad39675a1ce00ed1257a5ec2b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"livereload/connection.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"40adb4fcd64ae47f8544d52da7f1eccc53807fe3ec544ef2dd69fe04c4dae264"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"livereload/connection.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"d978f2cc94ed15d41965cbdbd5ec64dc1f8424c2b9d5bf189016165d54dc919d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"livereload/livereload.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"03b91e8cfb8ac0397437ccf80912ef1f1584bed47323d83ad0ba570ed189c4a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"livereload/livereload.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"048af20636b5ed251a8caa50d4d43604f3c8d1b2e11fa00b37ce317260b13580"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"livereload/livereload.go"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4d0124e40abc103454d97fc72a1366497f4d12811967835070a2aca6b5d82c9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"livereload/livereload.go"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"a24198185bdbccbafbc9cc24da0c04f8e2fc8e6d0161cfa257092409bd53f725"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"langs/i18n/translationProvider.go"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba09a4c8d8695291c0c4223e61d9ca090b29f619309485b7ed8c638c95a676a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := json.Unmarshal([]byte(s), \u0026sm); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/js/esbuild/sourcemap.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c17bad6bbacd542f848a7366b3e68e1db60e3289c29bddb1250777c6c87527"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := afs.Stat(filepath.Join(s.Cfg.WorkingDir, \u0022 \u0022)); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/integrationtest_builder.go"},"region":{"startLine":927}}}],"partialFingerprints":{"codehealthFindingId/v1":"86da9d057adc48ecf2f590ebe3e6f7966bc69b21b88c35d3f77bb22d7ba0e2d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"96a2006550c20cc028f8f61cd4590b61ca7aa65e0d9bd957571e7d1c81bed616"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/page__ref.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f80f79adaafbfc9ba8ad1d26f751c85c621aadf0a9ae0ff24e2b959f33d8871"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/filesystems/basefs.go"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2980b45fdd4802ee6bbbe2fedbf908adc42774449c14ea00e42f1a2e9e6c24b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugolib/filesystems/basefs.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1ca886be71af4913606939e066e9bffe46c67294b35c547f206e818531a915"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/fs.go"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e37f9c75640df700cccd27719db37496d8cf37481c3507142418cf9d03c57791"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/glob.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d378d89b8769733ba888dc631660d31c113034d7a738e38a12875502f6c50d85"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/glob.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a574eae824cfcc78e7f66cab4c42be721cabdcf056064d2d6a61da46810fe12"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hugofs/rootmapping_fs.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"eceac9a82c1834fdc236a9bd4966fba1436530e5aec18aaa1b3809eacb4166b2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers/url.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"e877fd817aa8d3729c64a94ac496ce5b07bf89d9e2edd6aa79e1d79807860f37"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers/url.go"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19c4d0db200dfef282df79b6427e88e6cabe4ceccb19393cdc773b2306adc04"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa9352d7d4537baf5b1c651685848d1e8b120c2eda4bb4411389c58ffb33d9e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := io.Copy(h, r); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"deploy/deploy.go"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"771f1025972f2a8baada87c8b46bb2f243998cab175d1cb0a77012e462f0c532"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/commonConfig.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"2de7a9c9fea79cd3a898dbf2742739f5fee46ea13516f175c3325aa34e9a3089"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/security/securityConfig.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb54908b45dbdf460dd6cd22c4b322b007b7f22c10943447572aa30eba9fd4a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/security/securityConfig.go"},"region":{"startLine":309}}}],"partialFingerprints":{"codehealthFindingId/v1":"379a28d3c20c85ceb22ab409a01ac295ebfda3f083ba2f05ed65c2fed7fafdff"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"config/security/securityConfig.go"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae9b539ec645943ffa0bec5b32c5d812c5e9b57d7f1c0757cea1678b81b6c16"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/version/version.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcf27ac66d0c273176d2c27da5e3c02b75168aab823b5c6c7632274ba7eb9754"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/version/version.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ea2e0abdf86e0a6c7c2acf5b39c3a98cba8eaa538a77d6dd47f02d00a756f0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/version/version.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2bd964b3830c5c7ba14a02ae33b9dccd7f841c3d7c56d782c3ea890de56015d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hexec/exec.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"0befe89ae2b33374670a5e46a71e545ddf49bf7e94bcf7e74bfba9aa9823285e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := os.Stat(resolved); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hexec/exec.go"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb06e617f77a2acb05ba560d2a69c17b62f2a1a8ea8257e18e7c8dde737c6ecd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hexec/exec.go"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"95612ddc052b2d1a4ded2995cc044638c5cc2a462c9dccab1b1e2e3ebae63a07"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hexec/exec.go"},"region":{"startLine":576}}}],"partialFingerprints":{"codehealthFindingId/v1":"25d94524b33d788734549c4722c9c471b0a84004c5f1e947129d904e34b4079b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hexec/esmloader.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e9af1698c9a8b51305db92bd56ac6f59a5db6112f3959ebea05c5f6dae4144b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/herrors/error_locator.go"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"13aceb90fde3161f216745499428712c05c5d0703ef31a15786516307688d2ed"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err2 != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/herrors/file_error.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0b85838eb74f0ab0f0ce65e306d4aeb4a982d08214cc5640ba361fe5933c5cc"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hashing/hashing.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab5c6d74b813babcbf2dd4016787d97982671f699fcbd1c8b5d88e5573b9d5c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err := os.Stat(ev.Name); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/hugobuilder.go"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"3acc5c34ec51fe869439c5f5ba855802df19b094e8917295e0710df1d660d9dd"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/import.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"9334eb5629cf36fcde02d0308a2bede0c00c84f56981be3f4296c13495169d8d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/import.go"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"85646e6a031f2fcf9c72d765b153275d2b659ecb2855f77d83415e53bf47ab5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"commands/import.go"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5fa44ba7bc37b948c50008c5bbfee92f4f890dc2e52ed6b236eefc741d5f9d3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache.go"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"cac12a7446f3eeacc28a9dbba7af2e091f85e631be1ad7a9f20beaed0697c2c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache.go"},"region":{"startLine":428}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9b02f0f70eed6986e48cf4bc844c8fa23dfceef806a6e412119a15f8cfdf24"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache.go"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9314bffd2ad1ed0dad9e61207a10147b88880686fb1ee507a920a778ea8df1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache.go"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"245c7f11adc09f53261a42bd51f4eab51ca2d9dd321835b54a104758a0100659"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cache/filecache/filecache.go"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"91eb970d6527ddc7801271cc1d3c97b78521ad92d3a164780374cb30222ae5c5"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_markup.go"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"754801127689ef1711f9ae2f25d6b4bb50b80b666381fd481cdfbb4408696508"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_markup.go"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"385e03b9c84af829680dcf3ebf9a09296c1d88b895c19f3c7c3a20753f845857"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 as a string) silently mis-parses instead of failing validation. This Go code already uses a real parser in the same package; use it here too."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"markup/goldmark/blockquotes/blockquotes.go"},"region":{"startLine":173}}}],"partialFingerprints":{"codehealthFindingId/v1":"602a4459667e5a5df8b4fded30a84b16d82ed9c3f5080513356fc96991ce8402"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060MD5FromReaderHexEncoded\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hashing/hashing.go"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1856dc9052af0de00fa01439f2a0b904ad137f3bdd951346b2c7e4ed242dbe1d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060extractNodeEntryPoint\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/hexec/exec.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"b164928cd9f188bf52504db37612960db7c8a38b1ac6432a8024f36c552ebc86"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060goMinorVersion\u0060 turns a non-nil \u0060err\u0060 into \u0060return 0\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"common/version/version.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"b021463266d2c2946ec72cb3a51e1c578c479062af2bc4f74fb6459816a7079f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060extractMinorVersionFromGoTag\u0060 turns a non-nil \u0060err\u0060 into \u0060return -1\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"htesting/test_helpers.go"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b8d41e3567415840f93ac16dfda592de17b7846294a502d835849ba2142df02"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060PermalinkForOutputFormat\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/page_paths.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"8448be2cf118b9b257d57ec1bd9f7ff8734612bba449ba97f8b95673a4ebc562"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on error: \u0060pageToPermalinkSlugOrContentBaseName\u0060 turns a non-nil \u0060err\u0060 into \u0060return \u0022\u0022, nil\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or return it. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the \u0060if\u0060 or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"resources/page/permalinks.go"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66a1468f3c350961b1fb80aab8391f58f3f317769c62eb517f81bc74eba39f6"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-200","guid":"b0ce3b1d-7a29-fe50-8aab-9aba899d2988","name":"Exposure of Sensitive Information to an Unauthorized Actor","shortDescription":{"text":"Exposure of Sensitive Information to an Unauthorized Actor"},"helpUri":"https://cwe.mitre.org/data/definitions/200.html"},{"id":"CWE-22","guid":"b68d9ca7-bdde-d057-a6cc-9f8b1e739552","name":"Improper Limitation of a Pathname to a Restricted Directory (\u0027Path Traversal\u0027)","shortDescription":{"text":"Improper Limitation of a Pathname to a Restricted Directory (\u0027Path Traversal\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/22.html"},{"id":"CWE-242","guid":"5c147e5c-be37-b051-9928-764ef5a8f3d3","name":"CWE-242","shortDescription":{"text":"CWE-242"},"helpUri":"https://cwe.mitre.org/data/definitions/242.html"},{"id":"CWE-248","guid":"64b58946-d244-a556-a48a-f82fcd4f4186","name":"Uncaught Exception","shortDescription":{"text":"Uncaught Exception"},"helpUri":"https://cwe.mitre.org/data/definitions/248.html"},{"id":"CWE-252","guid":"78915dc5-e486-f858-bc3c-aa570ad9010d","name":"Unchecked Return Value","shortDescription":{"text":"Unchecked Return Value"},"helpUri":"https://cwe.mitre.org/data/definitions/252.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-319","guid":"7af97476-9f0d-4458-9163-3d2043918a1a","name":"Cleartext Transmission of Sensitive Information","shortDescription":{"text":"Cleartext Transmission of Sensitive Information"},"helpUri":"https://cwe.mitre.org/data/definitions/319.html"},{"id":"CWE-328","guid":"f0ffc869-97c3-dc5c-8825-be1159f1fc5f","name":"Reversible One-Way Hash","shortDescription":{"text":"Reversible One-Way Hash"},"helpUri":"https://cwe.mitre.org/data/definitions/328.html"},{"id":"CWE-338","guid":"e89b7604-c3f7-8b53-bc8c-4d4718c28617","name":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)","shortDescription":{"text":"Use of Cryptographically Weak Pseudo-Random Number Generator(PRNG)"},"helpUri":"https://cwe.mitre.org/data/definitions/338.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-391","guid":"d9ef5687-8d79-9b51-b509-b83411fbcdc3","name":"Unchecked Error Condition","shortDescription":{"text":"Unchecked Error Condition"},"helpUri":"https://cwe.mitre.org/data/definitions/391.html"},{"id":"CWE-400","guid":"ca529a89-676d-8857-aac1-84359c77bb6c","name":"CWE-400","shortDescription":{"text":"CWE-400"},"helpUri":"https://cwe.mitre.org/data/definitions/400.html"},{"id":"CWE-494","guid":"b8a65e0d-e459-4a55-a931-fc1136482375","name":"Download of Code Without Integrity Check","shortDescription":{"text":"Download of Code Without Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/494.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-703","guid":"fa730aa9-95e4-845e-83fa-8169f2cf339e","name":"Improper Check or Handling of Exceptional Conditions","shortDescription":{"text":"Improper Check or Handling of Exceptional Conditions"},"helpUri":"https://cwe.mitre.org/data/definitions/703.html"},{"id":"CWE-704","guid":"50bd74b4-a921-5159-8671-99fd7e78c810","name":"CWE-704","shortDescription":{"text":"CWE-704"},"helpUri":"https://cwe.mitre.org/data/definitions/704.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"},{"id":"A10:2025","guid":"9ca3ab55-ca61-fd5e-b9ab-3dad2efa59d0","name":"Mishandling of Exceptional Conditions","shortDescription":{"text":"Mishandling of Exceptional Conditions"},"helpUri":"https://top10.owasp.org/2025/A10_2025-Mishandling_of_Exceptional_Conditions/"}]},{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35","organization":"OWASP Foundation","informationUri":"https://owasp.org/www-project-top-10-ci-cd-security-risks/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10 CI/CD Security Risks."},"taxa":[{"id":"CICD-SEC-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":69,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}