{"$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":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"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":"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":"D22","name":"Internal API Consistency","shortDescription":{"text":"Internal API Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D22"},{"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":"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":"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":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"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":"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":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"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":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"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":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"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":"Interpreter.cfg (cyclomatic 568): Interpreter.cfg has cyclomatic complexity 568 (threshold 15). Most of this is not in the body itself: 3 of the 568 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 655, 69). 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: interp/cfg.go holds 5 of the 42 functions over the threshold \u2014 including the worst \u2014 and 578 of the 1472 points over it (39%), 2.1\u00D7 the next-largest file (interp/type.go at 270). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/cfg.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"33796b4ec663251efae9036273dbef3558e012de6f1cec19d614116f948cc7fe"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.nodeType2 (cyclomatic 235): interp.nodeType2 has cyclomatic complexity 235 (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":"interp/type.go"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a78b70c32b5a4cb8816627ed82113f2300d9ee55fc6b688e4bac4b989da9c69"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.ast (cyclomatic 170): Interpreter.ast has cyclomatic complexity 170 (threshold 15). Most of this is not in the body itself: 1 of the 170 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 478, 438). 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":"interp/ast.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"1265d2b8f06a6656749b0ec343138ef3674bf0522428211612ee6ad4bcea87b9"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.gta (cyclomatic 89): Interpreter.gta has cyclomatic complexity 89 (threshold 15). Most of this is not in the body itself: 2 of the 89 points are its own statements and the rest belongs to one function literal inside it that branches (line 19). 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":"interp/gta.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"3798e17508cc1e8682c2628d23f76c93f8d3db475bfe2ff0dbfe4d3896a69693"}},{"ruleId":"D1","level":"warning","message":{"text":"typecheck.builtin (cyclomatic 65): typecheck.builtin has cyclomatic complexity 65 (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":"interp/typecheck.go"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2cb00f0b56f601f0ac5ab8433f834ca7fdb6057751306211d00d96ca7d9299e"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.typeAssert (cyclomatic 63): interp.typeAssert has cyclomatic complexity 63 (threshold 15). Most of this is not in the body itself: 12 of the 63 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 319, 391, 493, \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":"interp/run.go"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cd80a5091d0443c671c51ec6be52d43a8e704964a4b9e0af209d839c3d556d"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.call (cyclomatic 61): interp.call has cyclomatic complexity 61 (threshold 15). Of this number, 32 points are the body\u0027s own statements and 29 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":"interp/run.go"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a7353c578a94026e3d7e23d2b0900931b8cfaa58e1f55809a977699468b6bda"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.callBin (cyclomatic 59): interp.callBin has cyclomatic complexity 59 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 18 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":"interp/run.go"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"07e1f43c646908b479a60e731b61aab25544a96cdb053c2ee0653c2bf9ea7c31"}},{"ruleId":"D1","level":"warning","message":{"text":"interp._case (cyclomatic 58): interp._case has cyclomatic complexity 58 (threshold 15). Most of this is not in the body itself: 9 of the 58 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 3153, 3103, 3051, \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":"interp/run.go"},"region":{"startLine":3032}}}],"partialFingerprints":{"codehealthFindingId/v1":"561f7f11eac9b6a00768af670459f525352b4a810e4562a567190c652016aee4"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.genAST (cyclomatic 46): interp.genAST has cyclomatic complexity 46 (threshold 15). Most of this is not in the body itself: 9 of the 46 points are its own statements and the rest belongs to one function literal inside it that branches (line 32). 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":"interp/generic.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"0925c5bfe39f392db73ac50f68d2125889ce5bc830830293c2de251675973b5c"}},{"ruleId":"D1","level":"warning","message":{"text":"itype.refType (cyclomatic 46): itype.refType has cyclomatic complexity 46 (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":"interp/type.go"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"be110b9a2b248b166f436ca044348a5c6e0fadb4546ba908ad3e5b4000e2ae47"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.importSrc (cyclomatic 35): Interpreter.importSrc has cyclomatic complexity 35 (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":"interp/src.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8b9ee193fb7543c8874e2455f9e0a81f4e05b64f8d263054f6b0415de9ac43e"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.compDefineX (cyclomatic 30): interp.compDefineX 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: interp/cfg.go holds 5 of the 42 functions over the threshold \u2014 including the worst \u2014 and 578 of the 1472 points over it (39%), 2.1\u00D7 the next-largest file (interp/type.go at 270). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/cfg.go"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1e4054e87fa0d0ebe42f0e57f3decd7e7cee649c7afbedeeb6cf4b68fadf57"}},{"ruleId":"D1","level":"warning","message":{"text":"typecheck.sliceExpr (cyclomatic 29): typecheck.sliceExpr 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":"interp/typecheck.go"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffa6fc83478302081605596cb4254577cef3c4079686c7a8bfaeb20938b4b18"}},{"ruleId":"D1","level":"warning","message":{"text":"typecheck.convertUntyped (cyclomatic 28): typecheck.convertUntyped 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":"interp/typecheck.go"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ee2341da64c0f9901dfa9499e76360073ec69f21d45e52101b25ad495725d5"}},{"ruleId":"D1","level":"warning","message":{"text":"itype.assignableTo (cyclomatic 25): itype.assignableTo has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/type.go"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9cc027e8a1922b4d911d949453b7623a238b8474c6f8bc39a8cc2feb3db0b2"}},{"ruleId":"D1","level":"warning","message":{"text":"main.run (cyclomatic 24): main.run 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":"cmd/yaegi/run.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"714896087c510783349e8291a7ae1b0c7cc536aff0d90caa5b10f4295f7c83bb"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.inferTypesFromCall (cyclomatic 24): interp.inferTypesFromCall has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 7 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 226). 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":"interp/generic.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"188308acf75829ce106ecd13dd22c1da497c5a76745fe1ae3d2471b1b6372e25"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.matchSelectorMethod (cyclomatic 23): interp.matchSelectorMethod 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: interp/cfg.go holds 5 of the 42 functions over the threshold \u2014 including the worst \u2014 and 578 of the 1472 points over it (39%), 2.1\u00D7 the next-largest file (interp/type.go at 270). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/cfg.go"},"region":{"startLine":3049}}}],"partialFingerprints":{"codehealthFindingId/v1":"3377870dfff68fe50d978c00b37d64b17403c1a16d7f50bcb662fcd9adabaa93"}},{"ruleId":"D1","level":"warning","message":{"text":"interp._append (cyclomatic 23): interp._append has cyclomatic complexity 23 (threshold 15). Of this number, 22 points are the body\u0027s own statements and 1 belongs 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":"interp/run.go"},"region":{"startLine":3266}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e07cd8ce45beb53ad8daa68e12fa06c275f5cb1d24359ce59f9124ef54ea6eb"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.genInterfaceWrapper (cyclomatic 22): interp.genInterfaceWrapper has cyclomatic complexity 22 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 10 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":"interp/run.go"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c231ee6a7c395dcb960b84102565c8459d0d9bcbffb116024b07c81e1db68dd"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.genFunctionWrapper (cyclomatic 21): interp.genFunctionWrapper 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 996). 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":"interp/run.go"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"658fb0d34e9e648915977f62f71573b5c2abbbbd375efc2b9ea40f0419fb8f73"}},{"ruleId":"D1","level":"warning","message":{"text":"typecheck.typeAssertionExpr (cyclomatic 21): typecheck.typeAssertionExpr 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":"interp/typecheck.go"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d1d2ba1a49378f49beef22eeb0974f4331db0a5abf858694780165d77c05f79"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.assign (cyclomatic 20): interp.assign has cyclomatic complexity 20 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 7 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":"interp/run.go"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d9699acade5c4e99289c24b77b7575cdae6d67e283009b0db675e599d432564"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.isNotNil (cyclomatic 20): interp.isNotNil 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 4 function literals inside it that branch (lines 4143, 4102, 4115, \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":"interp/run.go"},"region":{"startLine":4076}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d5dc42d6a209e70e3aba198261111b9ae6b12995526fbecf149bc9fd0a75e8c"}},{"ruleId":"D1","level":"warning","message":{"text":"typecheck.comparison (cyclomatic 20): typecheck.comparison has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/typecheck.go"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"2162fa81361a61f4ae767edba7f39dd9b7ec12082d4a77e1e4cf369b9bccef07"}},{"ruleId":"D1","level":"warning","message":{"text":"interp._select (cyclomatic 19): interp._select has cyclomatic complexity 19 (threshold 15). Of this number, 11 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":"interp/run.go"},"region":{"startLine":3843}}}],"partialFingerprints":{"codehealthFindingId/v1":"870e3b7d6373f77952a959ae9c55fa59f7be3d0c13ba748a47612eba7e640b43"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.isComplete (cyclomatic 19): interp.isComplete 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":"interp/type.go"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d443a993b9a0bf8e3e05de7f75a3495bf1694accc8f5c2b2107fe95aca06da"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.representableConst (cyclomatic 19): interp.representableConst 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":"interp/typecheck.go"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb48e0957bb3fb89c8e419ffcb58df72f891aef6ec82c913c78853aac35f980e"}},{"ruleId":"D1","level":"warning","message":{"text":"itype.methods (cyclomatic 19): itype.methods has cyclomatic complexity 19 (threshold 15). 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 1580). 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":"interp/type.go"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2b3760644af4afacf28f41334288aca2ccb13f4a66fefbddd45bc536e5d328"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.skipFile (cyclomatic 18): interp.skipFile 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":"interp/build.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6f0df30293de0402b9154fafa62052b0194bbe6d12edf637835377addf25c8"}},{"ruleId":"D1","level":"warning","message":{"text":"interp._return (cyclomatic 18): interp._return has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"interp/run.go"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"22ae992ba32f8142f54ebd0de7e6d17bbcb0e65e7036f9a41f1242b797d7c7b3"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.isNilChild (cyclomatic 18): interp.isNilChild 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 3991). 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":"interp/run.go"},"region":{"startLine":3990}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a89fb6f921b3c92b2fe3e1aa1b8634b87da756585975e69634f57cf37c22352"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.Symbols (cyclomatic 18): Interpreter.Symbols 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":"interp/use.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ae853740d6bbb54fcb119a51e42eb0d35613f46978d161615281440a4b302e8"}},{"ruleId":"D1","level":"warning","message":{"text":"typecheck.binaryExpr (cyclomatic 17): typecheck.binaryExpr 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":"interp/typecheck.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"41fd561d947e3a7dfbf396df27debf914d4e84fb6d533b95af29a21478a5ec47"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.compositeGenerator (cyclomatic 16): interp.compositeGenerator 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: interp/cfg.go holds 5 of the 42 functions over the threshold \u2014 including the worst \u2014 and 578 of the 1472 points over it (39%), 2.1\u00D7 the next-largest file (interp/type.go at 270). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/cfg.go"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"af53984e04bdc91acd1fbcee07ab0dbac206a90399ec47f9bfcda5b28736a04d"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.runCfg (cyclomatic 16): interp.runCfg has cyclomatic complexity 16 (threshold 15). Of this number, 11 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":"interp/run.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2a0408ab59060b72a861138f95fbb6bb4c3f08aada2fd53ca648b7d94d1a14d"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.getMethodByName (cyclomatic 16): interp.getMethodByName 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 1980). 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":"interp/run.go"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c551ba1d24f4e9138e336bb2ef261490d593900827122775b571a18476c0f5b"}},{"ruleId":"D1","level":"warning","message":{"text":"interp.previousRoot (cyclomatic 16): interp.previousRoot 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":"interp/src.go"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e78a5cbe1ebe502277d6a220196f5523bc120d2d86cce9cc4cfcffdd8d7e82"}},{"ruleId":"D1","level":"warning","message":{"text":"node.isType (cyclomatic 16): node.isType 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. This file is where this pass\u0027s cyclomatic complexity CONCENTRATES: interp/cfg.go holds 5 of the 42 functions over the threshold \u2014 including the worst \u2014 and 578 of the 1472 points over it (39%), 2.1\u00D7 the next-largest file (interp/type.go at 270). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/cfg.go"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4b6e071c0405286c587370d26a2579d8796d4e32e6c3bf3c4260861cfb42282"}},{"ruleId":"D1","level":"warning","message":{"text":"Interpreter.CompileAST (cyclomatic 16): Interpreter.CompileAST 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":"interp/program.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a55c152bec4ce494a6b54e7a8a03edf5e057250f0e5bf55d7ad252675c3e8c3"}},{"ruleId":"D1","level":"warning","message":{"text":"itype.defaultType (cyclomatic 16): itype.defaultType has cyclomatic complexity 16 (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":"interp/type.go"},"region":{"startLine":2269}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4e76be098a419c9968af165104370e777509219dbc7c24b48ae56dfa45d1bca"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.cfg (cognitive 1157): Interpreter.cfg has cognitive complexity 1157 (threshold 15). Drivers by points: if/else 354 (921 pts), loops 30 (90 pts), match/switch 30 (82 pts), boolean chains 62, jumps 2 (nesting depth added 679). Most of this is not in the body itself: 2 of the 1157 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 655, 69). 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":"interp/cfg.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"8059f1b3ae6596995c650f3f3fd58d44c2a803791012953d6bfd3af0b6da5e7d"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.nodeType2 (cognitive 410): interp.nodeType2 has cognitive complexity 410 (threshold 15). Drivers by points: if/else 113 (292 pts), match/switch 17 (47 pts), boolean chains 41, loops 11 (30 pts) (nesting depth added 228). 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":"interp/type.go"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c50da0a4beb295f20a9347d748b5acc2abd5eabcf55826e85f72ba69be2962e"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.gta (cognitive 194): Interpreter.gta has cognitive complexity 194 (threshold 15). Drivers by points: if/else 57 (148 pts), match/switch 7 (20 pts), loops 6 (19 pts), boolean chains 7 (nesting depth added 117). Most of this is not in the body itself: 1 of the 194 points is its own statement and the rest belongs to one function literal inside it that branches (line 19). 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":"interp/gta.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e50c2cbc3830d45bf5fb5f372d77f5a00c41198bef68557251dd7fd13e5b0dc"}},{"ruleId":"D2","level":"warning","message":{"text":"interp._case (cognitive 179): interp._case has cognitive complexity 179 (threshold 15). Drivers by points: if/else 34 (140 pts), loops 8 (28 pts), boolean chains 8, match/switch 2 (3 pts) (nesting depth added 127). Most of this is not in the body itself: 13 of the 179 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 3153, 3103, 3051, \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":"interp/run.go"},"region":{"startLine":3032}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d4ab4c31c53812808f8022dbd9b9d48438a53dac4c22773f597249c4117f661"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.typeAssert (cognitive 132): interp.typeAssert has cognitive complexity 132 (threshold 15). Drivers by points: if/else 48 (118 pts), boolean chains 7, loops 2 (5 pts), match/switch 2 (nesting depth added 73). Most of this is not in the body itself: 6 of the 132 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 391, 319, 456, \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":"interp/run.go"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d22e800ba3dbe246fd9affadb83313edfca9f094134e1605d3141f46e49455"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.callBin (cognitive 128): interp.callBin has cognitive complexity 128 (threshold 15). Drivers by points: if/else 28 (76 pts), loops 14 (36 pts), boolean chains 8, match/switch 4 (8 pts) (nesting depth added 74). Of this number, 76 points are the body\u0027s own statements and 52 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":"interp/run.go"},"region":{"startLine":1452}}}],"partialFingerprints":{"codehealthFindingId/v1":"606aca6cb32eaf53ad404e4f603fc27abe6f3dffea23ea2ac5a76a9754cf7645"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.ast (cognitive 107): Interpreter.ast has cognitive complexity 107 (threshold 15). Drivers by points: if/else 30 (60 pts), match/switch 13 (26 pts), boolean chains 17, loops 1 (4 pts) (nesting depth added 46). None of this is in the body itself: all 107 points belong to 2 function literals inside it that branch (lines 478, 438). 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":"interp/ast.go"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8f8c074e1a540c291c58b2157ce33ff8709a8f1c7f2084f27b7be51a52047cc"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.call (cognitive 100): interp.call has cognitive complexity 100 (threshold 15). Drivers by points: if/else 24 (49 pts), loops 14 (27 pts), boolean chains 12, match/switch 5 (12 pts) (nesting depth added 45). Of this number, 44 points are the body\u0027s own statements and 56 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":"interp/run.go"},"region":{"startLine":1190}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b67f57b87ddc6c62392503d85a0b86544822ae193a2cf8bb0e490ff296e35bf"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.genAST (cognitive 92): interp.genAST has cognitive complexity 92 (threshold 15). Drivers by points: if/else 22 (63 pts), loops 8 (22 pts), boolean chains 6, match/switch 1 (nesting depth added 55). Most of this is not in the body itself: 10 of the 92 points are its own statements and the rest belongs to one function literal inside it that branches (line 32). 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":"interp/generic.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"847b9539d8ef0b84ff5f577cee98dacb4aeba382738747b2a8bdd2f1659bd91c"}},{"ruleId":"D2","level":"warning","message":{"text":"typecheck.builtin (cognitive 85): typecheck.builtin has cognitive complexity 85 (threshold 15). Drivers by points: if/else 28 (59 pts), boolean chains 10, match/switch 6 (10 pts), loops 3 (6 pts) (nesting depth added 38). 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":"interp/typecheck.go"},"region":{"startLine":747}}}],"partialFingerprints":{"codehealthFindingId/v1":"06460b0841c85f182b818ec6f7d0d49f5f84297800cf9828b010fc87302a001a"}},{"ruleId":"D2","level":"warning","message":{"text":"itype.refType (cognitive 78): itype.refType has cognitive complexity 78 (threshold 15). Drivers by points: if/else 18 (47 pts), loops 9 (25 pts), boolean chains 5, match/switch 1 (nesting depth added 45). 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":"interp/type.go"},"region":{"startLine":2052}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2903d0f55bf74b92d99630c0669ecdab8ba784c5c44adb609e0c3ed67899ff"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.importSrc (cognitive 51): Interpreter.importSrc has cognitive complexity 51 (threshold 15). Drivers by points: if/else 26 (44 pts), loops 5, boolean chains 2 (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":"interp/src.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dff5858aefdce265ef9ed4fcb52a92f74a406241e81ed7c0760667d776567ec"}},{"ruleId":"D2","level":"warning","message":{"text":"typecheck.sliceExpr (cognitive 42): typecheck.sliceExpr has cognitive complexity 42 (threshold 15). Drivers by points: if/else 17 (32 pts), loops 4 (5 pts), match/switch 2 (3 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":"interp/typecheck.go"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6d7dc9d03b04517b00afe6d4ef4976a68917418ffa81de79eae7f74b810ef7d"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.compDefineX (cognitive 41): interp.compDefineX has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (27 pts), loops 4 (7 pts), boolean chains 6, match/switch 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":"interp/cfg.go"},"region":{"startLine":2347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fdd0f066b87791dbca7a544de86412f09b791ab89559986b3ea632265b2069e"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.inferTypesFromCall (cognitive 38): interp.inferTypesFromCall has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 6 (10 pts), match/switch 1 (nesting depth added 20). Most of this is not in the body itself: 10 of the 38 points are its own statements and the rest belongs to one function literal inside it that branches (line 226). 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":"interp/generic.go"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea87d26a93bbd3a2bada7bd4629061b89ed7598cb0d0d1fc4d32d6bb78acae4"}},{"ruleId":"D2","level":"warning","message":{"text":"main.run (cognitive 35): main.run has cognitive complexity 35 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 2 (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":"cmd/yaegi/run.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a34538e68b88547775ed17af90b45d5fe7cff2a2cea3ead4acc6847c8527f71"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.matchSelectorMethod (cognitive 33): interp.matchSelectorMethod has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, match/switch 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":"interp/cfg.go"},"region":{"startLine":3049}}}],"partialFingerprints":{"codehealthFindingId/v1":"01e10abccad5c91a206f8cf3153dc92108ea026276f35041ad28609cdc3bb63a"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.assign (cognitive 33): interp.assign has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 5 (6 pts), match/switch 2 (4 pts) (nesting depth added 12). Of this number, 19 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":"interp/run.go"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c72555191b0f3f76a332eb30c808528efb9429c383b3c87c6c3d36c21e46b6"}},{"ruleId":"D2","level":"warning","message":{"text":"itype.methods (cognitive 32): itype.methods has cognitive complexity 32 (threshold 15). Drivers by points: loops 9 (21 pts), if/else 5 (10 pts), match/switch 1 (nesting depth added 17). None of this is in the body itself: all 32 points belong to one function literal inside it that branches (line 1580). 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":"interp/type.go"},"region":{"startLine":1576}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cdc58e0860131e73f9b39841f780e1eaf91bd7b36c3afc805551894d6c8cd88"}},{"ruleId":"D2","level":"warning","message":{"text":"typecheck.typeAssertionExpr (cognitive 32): typecheck.typeAssertionExpr has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, loops 3 (5 pts) (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":"interp/typecheck.go"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"9730ac5c5976b288e72f841884dbe1a6d5e425ef370a7127d65c4add67a974c8"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.arrayTypeLen (cognitive 30): interp.arrayTypeLen has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 1, loops 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":"interp/cfg.go"},"region":{"startLine":3168}}}],"partialFingerprints":{"codehealthFindingId/v1":"1407f4a09b9c9d17107456d9e6b27ba9b7adb69bcbff9088b00af6035588ae81"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.recv (cognitive 30): interp.recv has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (30 pts) (nesting depth added 17). Most of this is not in the body itself: 8 of the 30 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 3621, 3646, 3670). 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":"interp/run.go"},"region":{"startLine":3611}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd57c12b1b6423a76e060bed45dcdda8569290f9f188675a68b02ff84ee59409"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.isNotNil (cognitive 30): interp.isNotNil has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 8 (nesting depth added 9). Most of this is not in the body itself: 11 of the 30 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 4143, 4102, 4115, \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":"interp/run.go"},"region":{"startLine":4076}}}],"partialFingerprints":{"codehealthFindingId/v1":"b946780e994ff7bc8d0eeede60039ecf00ba68cccc274eb6b351f6db02c67c2b"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.genInterfaceWrapper (cognitive 29): interp.genInterfaceWrapper has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, loops 2, match/switch 1 (nesting depth added 10). Most of this is not in the body itself: 11 of the 29 points are its own statements and the rest belongs to one function literal inside it that branches (line 1098). 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":"interp/run.go"},"region":{"startLine":1062}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c8c3c9d5c42edb34d2d5dd40e58d248909ae4031dbc4a1f2df539809e6d888b"}},{"ruleId":"D2","level":"warning","message":{"text":"typecheck.structBinLitExpr (cognitive 29): typecheck.structBinLitExpr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (26 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":"interp/typecheck.go"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0d3b8ed40c6513c16240a0bc9db80eb7343276c5280bbfaca613690cfd7c3b1"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.isNilChild (cognitive 28): interp.isNilChild has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (22 pts), boolean chains 6 (nesting depth added 9). None of this is in the body itself: all 28 points belong to one function literal inside it that branches (line 3991). 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":"interp/run.go"},"region":{"startLine":3990}}}],"partialFingerprints":{"codehealthFindingId/v1":"f09109db0a83466ae54e3b56cd639bed4caee4c89f54a8dea4fcfa64c3adac83"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.previousRoot (cognitive 27): interp.previousRoot has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, loops 2 (3 pts) (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":"interp/src.go"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"280fb6cf5fd5fba04948bb582dcfcc3e8a4510d0d26f70cc4d4f0cbee85d692c"}},{"ruleId":"D2","level":"warning","message":{"text":"typecheck.structLitExpr (cognitive 27): typecheck.structLitExpr has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (3 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":"interp/typecheck.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04cc2c942df22230e7989230f429b6afa6ffb29fbbe6b49270d4c6b0a7194f6"}},{"ruleId":"D2","level":"warning","message":{"text":"node.isNatural (cognitive 26): node.isNatural has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (3 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":"interp/cfg.go"},"region":{"startLine":2743}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d730558664e45db4fa00c3133939ea147ba90ed931a9a9219baf4b16dfc696"}},{"ruleId":"D2","level":"warning","message":{"text":"typecheck.convertUntyped (cognitive 25): typecheck.convertUntyped has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, 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":"interp/typecheck.go"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f6cde2233d0deb3666af6282986f074e687322f2383ad65da47e8d48e440126"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.genFunctionWrapper (cognitive 24): interp.genFunctionWrapper has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 5, loops 3 (4 pts), match/switch 2 (4 pts) (nesting depth added 6). Most of this is not in the body itself: 4 of the 24 points are its own statements and the rest belongs to one function literal inside it that branches (line 996). 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":"interp/run.go"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ed3929bad8c4e0494229945263bb4afe92ced8a72034ac06d90840eee5f80a"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.getMethodByName (cognitive 24): interp.getMethodByName has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). None of this is in the body itself: all 24 points belong to one function literal inside it that branches (line 1980). 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":"interp/run.go"},"region":{"startLine":1973}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb5f47e620ff3b17b7aef8115ad0db46ca02f682b2d5a452aa32db018b3e1cc9"}},{"ruleId":"D2","level":"warning","message":{"text":"interp._select (cognitive 24): interp._select has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 10). Of this number, 16 points are the body\u0027s own statements and 8 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":"interp/run.go"},"region":{"startLine":3843}}}],"partialFingerprints":{"codehealthFindingId/v1":"0211a9d945e27eef52a9b803edf1aa7f327f0c112c1ace251839d8bc61f91913"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.Symbols (cognitive 24): Interpreter.Symbols has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts), boolean chains 3, match/switch 1 (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":"interp/use.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e76327eae72dee3d85101b824e8b77bbecb4d11fad0b771c8cab98a0359e630"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.genValue (cognitive 23): interp.genValue has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 1, 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":"interp/value.go"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"e38b204e23c9f6b4d73aeca6477d6d36cd82aedc12f2cca8fbb902ce62ac5155"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.Use (cognitive 23): Interpreter.Use has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (8 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":"interp/use.go"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c18d210ce5669a5ec6d3a9612639630795ee6cf0b2468484f8e3db3ded4b795"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.getIndexMap (cognitive 22): interp.getIndexMap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (16 pts), match/switch 2 (4 pts), boolean chains 2 (nesting depth added 10). Most of this is not in the body itself: 6 of the 22 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 1801, 1810, 1825, \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":"interp/run.go"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4037a6f7a5e2d7d78119cbcc5a5518423fc8e22e2dd986ef5361529e0c46d29"}},{"ruleId":"D2","level":"warning","message":{"text":"interp._append (cognitive 22): interp._append has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 9, match/switch 3 (6 pts), loops 2 (4 pts), if/else 2 (3 pts) (nesting depth added 6). 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":"interp/run.go"},"region":{"startLine":3266}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a3d20c21b2c2635ed176dc33d7312783c2f06bc72771b0b7634093c7edb507"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.fixStdlib (cognitive 22): interp.fixStdlib has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 1 (3 pts) (nesting depth added 10). Of this number, 19 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":"interp/use.go"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56be2449d29e2456816fce4ead391a2ec99105120df5bc301e95cbf0c3fb1c2"}},{"ruleId":"D2","level":"warning","message":{"text":"itype.assignableTo (cognitive 22): itype.assignableTo has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 11, if/else 11. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/type.go"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae719df403200367ebc2f332242be484c7c451db03944452fbc96a0fe5a6661"}},{"ruleId":"D2","level":"warning","message":{"text":"main.main (cognitive 21): main.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 1, 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":"internal/cmd/extract/extract.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"723e8876f9bb12d723716e262539024b263c1cb4e124fdeb5768a32662142983"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.definedType (cognitive 21): interp.definedType has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (6 pts), match/switch 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":"interp/gta.go"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"3aef77d585a33cc090c5971f64f2c1b72ca12ece1a165dc42f89f79135ad9809"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.runCfg (cognitive 21): interp.runCfg has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 7). Of this number, 14 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":"interp/run.go"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6374dfa5b72979d3a9fb557a2a08392bc5338f21d28ef072a9088801bc03d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.representableConst (cognitive 21): interp.representableConst has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 10). 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":"interp/typecheck.go"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"397fbf036fb7b322ea9610be661da73087cdac664a1a221f40a13bf56ef55282"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.CompileAST (cognitive 21): Interpreter.CompileAST has cognitive complexity 21 (threshold 15). Drivers by points: if/else 13 (19 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":"interp/program.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a46dd96b0a9931e47adab47022f91a328306346d625214dc8377d2028b1aee"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.getIndexMap2 (cognitive 20): interp.getIndexMap2 has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (15 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 10). 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 1869, 1890). 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":"interp/run.go"},"region":{"startLine":1847}}}],"partialFingerprints":{"codehealthFindingId/v1":"391ca2a8cfc2ef01f12501c79bdd7e63f90b17b18dbdeff53deff1ad2c19eff0"}},{"ruleId":"D2","level":"warning","message":{"text":"interp._return (cognitive 20): interp._return has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (11 pts), if/else 1 (4 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 10). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. 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":"interp/run.go"},"region":{"startLine":2446}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ca9b7586e2e262b388bc6988a0997ffb6b4806a52b6661ef00812d9c7ee6d9f"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.doCompositeBinStruct (cognitive 20): interp.doCompositeBinStruct has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2, boolean chains 1, match/switch 1 (nesting depth added 8). Of this number, 18 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":"interp/run.go"},"region":{"startLine":2670}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c554e0888f58f6710e5a78b01845ceaa292cbd7ba60b54632acc31ab14aa29"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.REPL (cognitive 20): Interpreter.REPL has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (9 pts), match/switch 3 (7 pts), loops 3, boolean chains 1 (nesting depth added 9). Of this number, 15 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":"interp/interp.go"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f88ea8276d019dce3ec85d828577147a02e50f9eb7f05779d1a7dbe2666582"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.compositeGenerator (cognitive 19): interp.compositeGenerator has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), match/switch 3 (5 pts) (nesting depth added 9). 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":"interp/cfg.go"},"region":{"startLine":2997}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f082bc8d4a0116ef35732e871d7a177e9529fafbdf3837dd72c8d9c391370f"}},{"ruleId":"D2","level":"warning","message":{"text":"typecheck.binaryExpr (cognitive 19): typecheck.binaryExpr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, match/switch 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":"interp/typecheck.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"febba17dcf8bf0dd12761bfaf06d9c88230f9e99f62faed49943007804b560bb"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.skipFile (cognitive 18): interp.skipFile has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, match/switch 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":"interp/build.go"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8fd91c29fb64a5ae912c5e088b3afb94485e94d4424bd8e5738eea7d0a2131"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.genGlobalVarDecl (cognitive 18): interp.genGlobalVarDecl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 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":"interp/cfg.go"},"region":{"startLine":2533}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9f44d72100b22fe228dc52cc277f20bd91569bc9308176fc8bec83bf9eda3a"}},{"ruleId":"D2","level":"warning","message":{"text":"interp._range (cognitive 18): interp._range has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 1 (nesting depth added 7). Of this number, 10 points are the body\u0027s own statements and 8 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":"interp/run.go"},"region":{"startLine":2818}}}],"partialFingerprints":{"codehealthFindingId/v1":"239ac86d2393bc81dea1e8d00b0132cc08ad1da0e2ef345c8e8fbc09a0612164"}},{"ruleId":"D2","level":"warning","message":{"text":"Interpreter.gtaRetry (cognitive 18): Interpreter.gtaRetry has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), match/switch 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":"interp/gta.go"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa1b508f610104fcfe3b64395434df2a3b42ae8024ccc6f34ffba31da7160dce"}},{"ruleId":"D2","level":"warning","message":{"text":"main.extractCmd (cognitive 17): main.extractCmd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12 (16 pts), 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":"cmd/yaegi/extract.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9aa42caa6a217b6b4ec903876e9e6e62b7ca6d841b6b9cbedf242e525c1e94e"}},{"ruleId":"D2","level":"warning","message":{"text":"interp.isComplete (cognitive 17): interp.isComplete has cognitive complexity 17 (threshold 15). Drivers by points: loops 3 (6 pts), boolean chains 5, if/else 4 (5 pts), match/switch 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":"interp/type.go"},"region":{"startLine":1411}}}],"partialFingerprints":{"codehealthFindingId/v1":"b18d67dfef344f99f2c2430b10e13278c7dc3bde3efd938d4a33a351f550b267"}},{"ruleId":"D2","level":"warning","message":{"text":"node.isType (cognitive 17): node.isType has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 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":"interp/cfg.go"},"region":{"startLine":2630}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e9fba5f6f9015846cf091a2571203d79286919d0e75291a948f58cacaf66dd"}},{"ruleId":"D2","level":"warning","message":{"text":"itype.lookupMethod2 (cognitive 17): itype.lookupMethod2 has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (2 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":"interp/type.go"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc1b2da00a10980160241e0c09064264687242be1f6d0c4a94691057fc7ab2b"}},{"ruleId":"D2","level":"warning","message":{"text":"Debugger.SetBreakpoints (cognitive 16): Debugger.SetBreakpoints has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, loops 2 (nesting depth added 6). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 501, 490). 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":"interp/debugger.go"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9afbf08dcf13dc9e9a4c06d988b6b94370fefb044a0a4f51632ebbcf56b5049"}},{"ruleId":"D2","level":"warning","message":{"text":"typecheck.assignment (cognitive 16): typecheck.assignment has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 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":"interp/typecheck.go"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a37fadd4c5db3f1b41dabf649ee29a78a0ecb504d4bed38eb0990e8659bd8e8"}},{"ruleId":"D2","level":"warning","message":{"text":"typecheck.conversion (cognitive 16): typecheck.conversion has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, match/switch 2 (3 pts) (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":"interp/typecheck.go"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc746baed34d64e82d1b9ded99ed73a89eb32d14705f8d58c5cbe7500884c67"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (33 shared lines): interp/run.go:3990-4074 | interp/run.go:4076-4160 \u2014 These two members are variants of one another: 33 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members\u0027 grain \u2014 factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/run.go"},"region":{"startLine":3990}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ed50a8e60fc6b6b7b067be737b03586f5e9cb1c084b1a60d73a58795c9ad3ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (56 corresponding lines): interp/run.go:1789-1844 | interp/run.go:1847-1902 \u2014 These two members are one piece of code written twice and then edited apart: 56 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":"interp/run.go"},"region":{"startLine":1789}}}],"partialFingerprints":{"codehealthFindingId/v1":"1eb01f8c6acbcbbb6041289fa68e7a3d090898550e4afeaf8176366e83b87f02"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (43 corresponding lines): interp/run.go:2522-2564 | interp/run.go:2623-2667 \u2014 These two members are one piece of code written twice and then edited apart: 43 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":"interp/run.go"},"region":{"startLine":2522}}}],"partialFingerprints":{"codehealthFindingId/v1":"746f901bd103e3961a404d9550e94fc533e9d1b8eb2ac6f87e953b856006b7ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): interp/typecheck.go:376-432 | interp/typecheck.go:435-492 \u2014 These two members are one piece of code written twice and then edited apart: 57 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":"interp/typecheck.go"},"region":{"startLine":376}}}],"partialFingerprints":{"codehealthFindingId/v1":"36dc3208f42e142c5a77dfb8c66916c12fddac0d7ab3320b0cb94e37ca7f3084"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): interp/value.go:457-473 | interp/value.go:475-491 | interp/value.go:493-509 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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":"interp/value.go"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ee2df4bc5e6bed32f87a2b8c15aefd2e6466b962bbe4b6d1eb50c0f94bd731"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): interp/run.go:3924-3956 | interp/run.go:3959-3988 \u2014 These two members are one piece of code written twice and then edited apart: 30 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":"interp/run.go"},"region":{"startLine":3924}}}],"partialFingerprints":{"codehealthFindingId/v1":"f914a89722683a1e32e4a2873319a55e3d5f43a8eafbb0d0961a0ba683529c0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (32 corresponding lines): interp/run.go:2359-2390 | interp/run.go:2392-2423 \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":"interp/run.go"},"region":{"startLine":2359}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e8c4ef4b150fa344c07f9aa6a65c8af3b7520c31c2b3857c25b6396666fdaf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 35\u002B corresponding lines): interp/run.go:2139-2180 | interp/run.go:2182-2216 | interp/run.go:2218-2252 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 35 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":"interp/run.go"},"region":{"startLine":2139}}}],"partialFingerprints":{"codehealthFindingId/v1":"215f08f97d7e7a1e8cf9a44cc8a56427bb92f7231a3b5e8924f1462d9efc7053"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): interp/run.go:2566-2589 | interp/run.go:2591-2621 \u2014 These two members are one piece of code written twice and then edited apart: 24 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":"interp/run.go"},"region":{"startLine":2566}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b716bb236267dd7d16985404484e9851bd9c2963f928771b3f41b0eb0a90072"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 17\u002B corresponding lines): interp/value.go:368-384 | interp/value.go:386-402 | interp/value.go:404-422 | interp/value.go:424-440 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 17 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":"interp/value.go"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73b7335451f7d3f87ea50b280169ce615a9913f3546e80fb2d0fc272e943c19"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 23\u002B corresponding lines): interp/run.go:840-862 | interp/run.go:2077-2112 | interp/run.go:2114-2137 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 23 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":"interp/run.go"},"region":{"startLine":840}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcf0ff70bb012d8066e035b984a18bc38dbf2a19a1850afd5434020ac9098a23"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): interp/type.go:1827-1854 | interp/type.go:1861-1887 \u2014 These two members are one piece of code written twice and then edited apart: 27 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":"interp/type.go"},"region":{"startLine":1827}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da7d9054d92139122c1c9495379cc1b8584ec511ad2fd65fd9a7381f612c821"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): interp/run.go:864-881 | interp/run.go:883-901 \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":"interp/run.go"},"region":{"startLine":864}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e20478f9a7b651d2ccfc522cd4710d4a2eb88f50651ada5d596f6c4b74531a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 17\u002B corresponding lines): interp/run.go:3332-3348 | interp/run.go:3400-3417 | interp/run.go:3419-3436 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 17 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":"interp/run.go"},"region":{"startLine":3332}}}],"partialFingerprints":{"codehealthFindingId/v1":"04bb08c3c87316367bad91b8df601bc5496ffeca469ad8de26cd9d5270d77131"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): interp/interp.go:519-538 | interp/program.go:190-209 \u2014 These two members are one piece of code written twice and then edited apart: 20 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":"interp/interp.go"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"976926e89fdddadc649894fbf4cc626417a72a4f1e6aeb3dfb545a40c2701821"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): interp/run.go:2922-2932 | interp/run.go:2934-2944 | interp/run.go:2946-2956 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 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":"interp/run.go"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"af3ec7c586e88c1c6cb3eeabf8a7218e99b8ea10d2b3fcb12155d79d9db5d5a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): interp/run.go:1695-1709 | interp/run.go:1711-1723 | interp/run.go:1725-1737 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 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":"interp/run.go"},"region":{"startLine":1695}}}],"partialFingerprints":{"codehealthFindingId/v1":"e286357e9c11ab261e6f3575ece1fd0c875f6c7ecc647e620cbadceb4f2f9264"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): interp/interp.go:502-514 | interp/program.go:38-50 \u2014 These two members are one piece of code written twice and then edited apart: 13 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":"interp/interp.go"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ff16ceffebb4602e5ad8e9a3bfdd123e4c9003fe6c6c3b4c9372b7984b6832"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): interp/type.go:339-356 | interp/type.go:359-374 \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":"interp/type.go"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"188bc908fcb5e2f95511828495bd68b5ada33b10e543322b77d1dd5c6fc37568"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): interp/run.go:2541-2564 | interp/run.go:2644-2667 \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 \u0060interp/run.go:2541\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":"interp/run.go"},"region":{"startLine":2541}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a8a5e358f2b3785f7609145d5a702995bebdf3301ddaae0aca3804c11df379"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): cmd/yaegi/run.go:49-70 | cmd/yaegi/test.go:119-140 \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 \u0060cmd/yaegi/run.go:49\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, \u0060cmd/yaegi/run.go:47\u0060 calls \u0060Args\u0060 and \u0060cmd/yaegi/test.go:117\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":"cmd/yaegi/run.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d582248e401e8074c7d6ae3dfa65ecff273790a732725118dd1107f4053a859"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): interp/cfg.go:1200-1213 | interp/cfg.go:1390-1403 \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 \u0060interp/cfg.go:1200\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":"interp/cfg.go"},"region":{"startLine":1200}}}],"partialFingerprints":{"codehealthFindingId/v1":"72fa091609ac5e37b57e6a6bf8adb4845f6e4d593007e95a6f8663c83c6d6b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): interp/cfg.go:1523-1536 | interp/cfg.go:1581-1594 \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":"interp/cfg.go"},"region":{"startLine":1523}}}],"partialFingerprints":{"codehealthFindingId/v1":"074580d33c676b65bd060f5219fb1c0e6fe9cb502dee8c979c48f0c9f3677a4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): interp/run.go:865-878 | interp/run.go:884-897 \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 \u0060interp/run.go:865\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 after the matched lines, \u0060interp/run.go:898\u0060 calls \u0060Fprintln\u0060 and \u0060interp/run.go:879\u0060 does not \u2014 after which the two agree again for 3 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":"interp/run.go"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"e80394a421822d85f186bb6882f0fe77117de4cd0050d0c9d83b3257336145c0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): interp/run.go:3120-3133 | interp/run.go:3164-3177 \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":"interp/run.go"},"region":{"startLine":3120}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f56c381cf61d822a49da0960615e67819de52a77b96fa7ee549c7a134be2213"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): interp/cfg.go:1915-1927 | interp/cfg.go:1954-1966 \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":"interp/cfg.go"},"region":{"startLine":1915}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d592a18e061f3a4b0aa3afaacc2ff8ada38ad7407eaa5f0fe84def805e6f73d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): interp/type.go:744-756 | interp/type.go:761-773 \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":"interp/type.go"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"234981037eb97963b5a48e6610a9f3d827a325d38405bca674fc059d501127e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): interp/cfg.go:1500-1511 | interp/cfg.go:1548-1559 \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 \u0060interp/cfg.go:1500\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":"interp/cfg.go"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"74af527952ff5dcc06e62e586c541491fa7ff3c5d203e67bf712fb70ccb7e9b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): interp/cfg.go:233-243 | interp/cfg.go:246-254 \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 \u0060interp/cfg.go:233\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":"interp/cfg.go"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddfd50ca884914b6410b2c6a19475a2f03a62484ee98c217a11469f14277849"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): interp/run.go:2183-2193 | interp/run.go:2219-2229 \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 \u0060interp/run.go:2183\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":"interp/run.go"},"region":{"startLine":2183}}}],"partialFingerprints":{"codehealthFindingId/v1":"10bf69131825184b832bf7752a9738d34fcac4cf364b038b0fd6a0c1afc88687"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): interp/cfg.go:1713-1722 | interp/cfg.go:1734-1742 \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 \u0060interp/cfg.go:1713\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":"interp/cfg.go"},"region":{"startLine":1713}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a8346290e33b0d99c41d0cb9b8dd18072ca30c8f96955b4148014be607ee04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): interp/run.go:1038-1047 | interp/run.go:1925-1934 \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 \u0060interp/run.go:1038\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":"interp/run.go"},"region":{"startLine":1038}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdffd24645f61ac558ca9325898ef29b82249a9d8a0762102817171d4dc8d94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): interp/run.go:2123-2132 | interp/run.go:2149-2158 \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 \u0060interp/run.go:2123\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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060interp/run.go:2148\u0060 calls \u0060TypeOf\u0060, \u0060Kind\u0060 and \u0060interp/run.go:2122\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":"interp/run.go"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"de329e603f798dc3c52802f439b9a836ca0758c2116e967e9397d1f2d22896e7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): interp/run.go:2360-2369 | interp/run.go:2393-2402 \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 \u0060interp/run.go:2360\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":"interp/run.go"},"region":{"startLine":2360}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4807a7faa839fcc18258a5a7bad27543905835d7dfa754dd33ab05cfd57c1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): interp/run.go:2371-2380 | interp/run.go:2404-2413 \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 \u0060interp/run.go:2371\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":"interp/run.go"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d1caa822aea3fe11a8263ce54106b5d98daf6b2c3c2a5a9e1b37a145399f4e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): interp/typecheck.go:384-393 | interp/typecheck.go:443-452 \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 \u0060interp/typecheck.go:384\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":"interp/typecheck.go"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea65d5f47c11d5883a01103704dbda65530991a641f9ef88f1be3832c026cc49"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): interp/run.go:2924-2932 | interp/run.go:2936-2944 | interp/run.go:2948-2956 \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 \u0060interp/run.go:2924\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":"interp/run.go"},"region":{"startLine":2924}}}],"partialFingerprints":{"codehealthFindingId/v1":"665d3b1cfbdc28b21408d947c025c6c05aa592554a42ee2d3d079a2f7449a985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): interp/run.go:2523-2531 | interp/run.go:2624-2632 \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":"interp/run.go"},"region":{"startLine":2523}}}],"partialFingerprints":{"codehealthFindingId/v1":"af4a005a4f45449657dbf9521a076b2e4f2f7cdd8867f72d1cc5295fbc5f4e54"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): interp/run.go:2567-2576 | interp/run.go:2592-2601 \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 \u0060interp/run.go:2567\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":"interp/run.go"},"region":{"startLine":2567}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27aa2faf29336055be2dd03a83317ef18f5e5f7d06b0d28ea48b8e978f279f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): interp/run.go:2581-2589 | interp/run.go:2613-2621 \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 \u0060interp/run.go:2581\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":"interp/run.go"},"region":{"startLine":2581}}}],"partialFingerprints":{"codehealthFindingId/v1":"030ce2f2ff0573703103a11b3a62ad275ded19883d694fadc2eeb67c16ff6027"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): interp/run.go:4010-4018 | interp/run.go:4096-4105 \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 \u0060interp/run.go:4010\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":"interp/run.go"},"region":{"startLine":4010}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2c20ca43b71f2c06cb22ccf1ecb6c6d5d5e1b81e5a2d10c8e42c4fd6b5491fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): interp/generic.go:69-76 | interp/generic.go:123-130 \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":"interp/generic.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"b53aaf02a84be19781d94281138edb0a45bfce9c5cfe33895b45eafac4b848e4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): interp/interp.go:520-527 | interp/program.go:191-198 \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 \u0060interp/interp.go:520\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":"interp/interp.go"},"region":{"startLine":520}}}],"partialFingerprints":{"codehealthFindingId/v1":"af7c7b3547a40665e3487c1d1a5253b083e6ea3a66ea077bc21ad1b2f95a0d58"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): interp/run.go:1752-1759 | interp/run.go:2125-2132 \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 \u0060interp/run.go:1752\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":"interp/run.go"},"region":{"startLine":1752}}}],"partialFingerprints":{"codehealthFindingId/v1":"31cdc9ab05aa7cd46c744d645fd94f9220d0b9841d6c073369e6ac91becc2236"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): interp/run.go:1803-1810 | interp/run.go:1827-1834 \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 \u0060interp/run.go:1803\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":"interp/run.go"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43d9b4f28920ecb99ff74dcf0a1788ef894c6ac3e2f2bbf23d1b090a9787f8a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): interp/run.go:2835-2842 | interp/run.go:2851-2858 \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 \u0060interp/run.go:2835\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 after the matched lines, \u0060interp/run.go:2844\u0060 calls \u0060Slice\u0060, \u0060Convert\u0060, \u0060Len\u0060 and \u0060interp/run.go:2859\u0060 does not \u2014 after which the two agree again for 3 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":"interp/run.go"},"region":{"startLine":2835}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c79c66ce81aef59775fb8701a698d18f5c91cf684236c6d41be85a7e2ddde6b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): interp/run.go:4024-4031 | interp/run.go:4111-4118 \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 \u0060interp/run.go:4024\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":"interp/run.go"},"region":{"startLine":4024}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f6974741ad9a09b9389bf5d5b006fa06d8827a226aba726c753e792f5e0366"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): interp/run.go:4051-4058 | interp/run.go:4138-4145 \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 \u0060interp/run.go:4051\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":"interp/run.go"},"region":{"startLine":4051}}}],"partialFingerprints":{"codehealthFindingId/v1":"770354e7fa9da8ff2d46f29d366a4ad7448166395f5ea57d9a1f185d8e06bf0e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): interp/run.go:4015-4022 | interp/run.go:4028-4035 | interp/run.go:4102-4109 | interp/run.go:4115-4122 \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. Read the line range as the matched WINDOW rather than a finished unit: at \u0060interp/run.go:4015\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":"interp/run.go"},"region":{"startLine":4015}}}],"partialFingerprints":{"codehealthFindingId/v1":"8aaaa5e9579c859d322e774a36970542ee38c0902b6753e43319633dbae3d9d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): interp/run.go:1697-1703 | interp/run.go:1712-1718 | interp/run.go:1726-1732 \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 \u0060interp/run.go:1697\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":"interp/run.go"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8e65dfa6ce561a98d1cb0981246975b7898023dfd6469bb49149723c45650d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): interp/cfg.go:956-964 | interp/cfg.go:2250-2256 \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 \u0060interp/cfg.go:956\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":"interp/cfg.go"},"region":{"startLine":956}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0fbc17c88d19ca9f5c8f9d699a8968fa98e7aebaeded5d38eedf538cdf2c3ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): interp/run.go:1627-1633 | interp/run.go:1655-1661 \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 \u0060interp/run.go:1627\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":"interp/run.go"},"region":{"startLine":1627}}}],"partialFingerprints":{"codehealthFindingId/v1":"868c865e68a846eefc2c9da5862a269eeb9b2995bc17dc15faa102156ba04558"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): interp/run.go:2192-2198 | interp/run.go:2240-2246 \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 \u0060interp/run.go:2192\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":"interp/run.go"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f3d5a3ffc2cf3af426a3580d842d7608e14bb9b9350dcc5c48cef877b968d98"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): interp/run.go:3401-3407 | interp/run.go:3420-3426 \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 \u0060interp/run.go:3401\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":"interp/run.go"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"35c930ef4f7194acd7952f6147c03fb2951f59452768ca7929caa061ebfa72c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): interp/run.go:3944-3951 | interp/run.go:3977-3983 \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 \u0060interp/run.go:3944\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":"interp/run.go"},"region":{"startLine":3944}}}],"partialFingerprints":{"codehealthFindingId/v1":"b95cfc563d14a25e142e038b9985c0a5d103cd20cea5fc079d15478b06b2ca9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): interp/run.go:1216-1221 | interp/run.go:1229-1234 \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 \u0060interp/run.go:1216\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":"interp/run.go"},"region":{"startLine":1216}}}],"partialFingerprints":{"codehealthFindingId/v1":"00acd5dfb541197e7a2eb9748cf5ca191bad610092e3ba56e80458a6e533e9b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): interp/run.go:1006-1010 | interp/run.go:1917-1921 \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":"interp/run.go"},"region":{"startLine":1006}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd62f64fa98960b7a04eb680ad7ecf4b57dc2c2b260cf9e8561f1b7ccde1db4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): interp/run.go:2272-2276 | interp/run.go:2342-2346 \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 \u0060interp/run.go:2272\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":"interp/run.go"},"region":{"startLine":2272}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d0a60f5a0c8966c5494f06e970d9d21e8dccfb58f0294654949bf8ce87c8fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): cmd/yaegi/run.go:75-86 | cmd/yaegi/test.go:137-147 \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 \u0060cmd/yaegi/run.go:75\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":"cmd/yaegi/run.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0b0597f736486ae4696c2c90f6cc57c282a6be1ca34fdf9d4346bec02a3c08"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): interp/cfg.go:1499-1506 | interp/cfg.go:1673-1680 \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 \u0060interp/cfg.go:1499\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":"interp/cfg.go"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c8fe8339400eb6a4158f509bb04010fde818e44c35d5bd98a55f84069c6923"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): interp/cfg.go:1548-1554 | interp/cfg.go:1692-1698 \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 \u0060interp/cfg.go:1548\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":"interp/cfg.go"},"region":{"startLine":1548}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2d69de83db0a957e58a78ef40b29a1fa5af7dabbfa52116520802f47a3e5be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): interp/cfg.go:1518-1522 | interp/cfg.go:1712-1716 \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":"interp/cfg.go"},"region":{"startLine":1518}}}],"partialFingerprints":{"codehealthFindingId/v1":"474496a616dc40a3acfee004d27e97d646746c1aeb8830a9ca8d1bca3014e285"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): interp/cfg.go:1575-1579 | interp/cfg.go:1733-1737 \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":"interp/cfg.go"},"region":{"startLine":1575}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aad83b7753b34c200195db1aa09594326c0c421eb509729ae727e29e2acafeb"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: typecheck (LCOM4 4): typecheck\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":"interp/typecheck.go"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"000d1d6d089f748a03d2c7f3e952541e82b666a0b507c127ca5613d899d47e09"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: cmd/yaegi/extract.go: 0.0% line coverage (0/89)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/yaegi/extract.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7aeee3293a95e3aeb369cfabcb3e0a7c9008aa475da14b3f391dd0292f6c7fb5"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: cmd/yaegi/help.go: 0.0% line coverage (0/13)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/yaegi/help.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c2f87e85eaa689a0983499c06374759d254c6f0f01f9dd9aa05c49be666c4d"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: cmd/yaegi/run.go: 0.0% line coverage (0/117)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/yaegi/run.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1680e3138b888f8a8bb403bb30eaec9e4f04bf04056e4147ca02557f37c889c1"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: cmd/yaegi/test.go: 0.0% line coverage (0/137)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/yaegi/test.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab460454e88b841e19a28790967a21e2b6d07b955ab48fe980090b9b3adb573"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: cmd/yaegi/yaegi.go: 0.0% line coverage (0/24)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"cmd/yaegi/yaegi.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"981d65c5fede204f34af399610963ea1a56dd67579aa60f64bf672a4fa790c55"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/cmd/extract/extract.go: 0.0% line coverage (0/55)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cmd/extract/extract.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03312818cd73cd70bf8bcb9f450c54a6f228c245364d16bd79f0a476e8b7b7ed"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: internal/cmd/genop/genop.go: 0.0% line coverage (0/57)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cmd/genop/genop.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3143cee00971e6a15804bec4a7f438fd960131af5779bc6e0d6cfeb01b655527"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: interp/debugger.go: 0.0% line coverage (0/316)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/debugger.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e75e3b242ebd8ba2944f9576f202fd60ef74cba1602bff5cb53775b236cf36"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: interp/dot.go: 0.0% line coverage (0/59)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/dot.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d9a5c4c5e27817af032ee9562f995c44212d3a6522e05f22dca3bcc34d8385a"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: interp/op.go: 32.2% line coverage (1303/4042)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/op.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1897571630e993e745d47b1d320c936bf6f396a318ad54e68a48ac1e6422ad7"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: interp/trace.go: 4.1% line coverage (3/73)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/trace.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf03fb768bef01c92bce3aa178ab8e9d93538f777861e86242c48c0b00d2b7e0"}},{"ruleId":"D8","level":"warning","message":{"text":"Low coverage: stdlib/restricted.go: 32.0% line coverage (8/25)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"stdlib/restricted.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43f9f7a54a2d59a15fdf516e79ac07fb75dbcea33f6e265b648a347a3da903f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: interp/cfg.go: interp/cfg.go changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 568 in Interpreter.cfg at line 59. 1 of those changes was a fix/bug commit, and the other 1 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-07..2026-11-05, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-07 10:26:06 \u002B01:00\u0027 --until=\u00272026-11-05 10:26:06 \u002B01:00\u0027 --full-history --no-merges -- interp/cfg.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":"interp/cfg.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc509ad4e1e0bce12b3d9b0b7210d57a5a752ac1c5c81fe1a2fce923c597630a"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(marc): support the following. \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":"stdlib/generic/go1_21_generic.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dbfeead38ecdc67ceea003f9ee29e3c9340823a395ec1a27493841a96f88180"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(marc): support the following. \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":"stdlib/generic/go1_22_generic.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b28ef67638cb0c275c05eb85927b19e7278fa903f3f37dd19cee2ace0e78a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(marc): labels must be stored outside of symbols to avoid collisions. \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":"interp/cfg.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"e264440acee01f86602421e4df141ed14b3ef1b9f84d5e0436bc58a9a6425f72"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (marc): skip if no conversion or wrapping is 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":"interp/cfg.go"},"region":{"startLine":885}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f046b16efe279d6802e6ecec3a7350f937b7f8171dd17a71765f130db2ba253"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (marc): skip if no conversion or wrapping is 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":"interp/cfg.go"},"region":{"startLine":2381}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b12d12cf5d4e52367b81472d3eb41819f95a0db1f4cdb3a5312d597c0d6e987"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Check that composite literal expr matches corresponding 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":"interp/cfg.go"},"region":{"startLine":1472}}}],"partialFingerprints":{"codehealthFindingId/v1":"89dc862d53917e30e5ac6b1aedd0c54bfd127d73a0e9cadc00a26c1fee69ea53"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): move any of that code to typecheck? \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":"interp/cfg.go"},"region":{"startLine":1853}}}],"partialFingerprints":{"codehealthFindingId/v1":"268b20cb37c8c09e26f6d44858928862368d3c75740d047c48332941ca102487"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Optimisation: avoid allocation if boolean branch op (i.e. \u0027!\u0027 in an \u0027if\u0027 expr) \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":"interp/cfg.go"},"region":{"startLine":2248}}}],"partialFingerprints":{"codehealthFindingId/v1":"55a6de854285c7a6bec8a2aa5d4a69173dcb867f645fe82268642065f05329ec"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO used for allocation optimization, temporarily disabled \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":"interp/cfg.go"},"region":{"startLine":2452}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c2b9a17b1de836d4218020a66bffb423358c93c51ae5a5a762b55d83d572d9"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): maybe needs a NoType version too \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":"interp/cfg.go"},"region":{"startLine":3034}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d39cfb6568b94ec416b411f1f85b0038cd1e854c2d7c058290c014bd7218ac"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(marc): check for a non recoverable error and return it for better diagnostic. \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":"interp/gta.go"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f546793d4f685c77761f32b3b800bd825621f08edf3928db3c04309e8b981fa3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): something even more special as a name? \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":"interp/interp.go"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"b38fdf2b2835aa43ebdac7a2a1980ee4f184d5297309810cec058d7e2e7f2305"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Capture interpreter stack frames also and remove \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":"interp/interp.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"28639e7e46d57ac1b10f6dd5d0160e945f6bfed5d70dc3d50faef657e555db09"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): restore empty interfaces when type assertions work (again) on them. \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":"interp/interp_eval_test.go"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15fd42112992b9ad8c737b90be95342065e92a622d338911fb7c58694049823"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME(marc): support of stdlib generic packages like \u0022cmp\u0022, \u0022maps\u0022, \u0022slices\u0022 has changed \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":"interp/interp_eval_test.go"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"c75255f983aaa81ea23751464b5bbb33621b1898e1643f553884e091616bc1a1"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): use a pipe for the output as well, just as in TestConcurrentEvals5 \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":"interp/interp_eval_test.go"},"region":{"startLine":1525}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b224bd50e80157e4f0c6800fde569fcb0ecd4f87b82c61dc431d5147770af9c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): think about whether this should ever happen. \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":"interp/run.go"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a56270c0e4b3c33cc2748d86d8c0a235197b3ad9fe5b9f252d3f1dd188657e3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): this requires more work. the wrapped node is not complete enough. \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":"interp/run.go"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b70fd299c20dccc16dbc4a9ad609a24cf150e6a61d429dbaefa767dcfdb26e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): Try to completely remove, as maybe frameType already does the job for interfaces. \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":"interp/run.go"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"630c8801e69c574649e95a183e190dbd4c510cbcea62b7c7d1d6bfb2426b6e6e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): maybe we don\u0027t need that special case, and we\u0027re just forgetting to unwrap the valueInterface somewhere else. \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":"interp/run.go"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d374ed543f0f25c1aca0cc8c96ebee0979640b96e6606b67bf6d3ca805232a"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (marc): wrapping interpreted functions should be always done \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":"interp/run.go"},"region":{"startLine":1401}}}],"partialFingerprints":{"codehealthFindingId/v1":"badc9e0b96a75b7b4d4659d6d007cf8f99dcd3b1cb1cd9b29ad1300fca553e18"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: should we keep track of all the vals that are indeed valueInterface, \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":"interp/run.go"},"region":{"startLine":1996}}}],"partialFingerprints":{"codehealthFindingId/v1":"362c6db52db8a67c70b2180bdefec7baafdb596b31e511ce3bf16d51071e3004"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): a lot of what is done in typeAssert should probably be redone/reused 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":"interp/run.go"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e79839116ee7dd2cf015b8ba784d8717dbe53e29baee5f71d124dc29910710"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): I\u0027m assuming here that !ok means that we\u0027re dealing with the empty \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":"interp/run.go"},"region":{"startLine":3054}}}],"partialFingerprints":{"codehealthFindingId/v1":"653fdbe4ef268951fadfdf25d78593b430068e2648f68af0bfa6029a44e865a7"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): we should actually use canAssertTypes, but need to find a valid \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":"interp/run.go"},"region":{"startLine":3063}}}],"partialFingerprints":{"codehealthFindingId/v1":"9418b8af5f0b6ee68991dac1da3cd331a8aa1ffa86dc09551a6cdbf365ec9f8d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): maybe it works for the special case main, but can\u0027t be bothered for now. \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":"interp/src.go"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"b017b4213bb23c5fbfadef565e53b24c394321914594dc79bf37ba34608484ef"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): It should probably be a critical error actually, \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":"interp/src.go"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"972db44eafd1b7ee80442f61de5677d1797248d8270e381c8a5766fad44f1c10"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(dennwc): This partially fails on Windows, since it cannot recognize drive letters as \u0022root\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":"interp/src.go"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f210a4dffb7da57c2a860bf78799b869bbcbb1f9445fe8eafd36680af8e0ff"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): the algorithm below might be redundant with the one above, \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":"interp/src.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c8a12a5037dcf9139d375557ba47563bef600cdd62bff00d86dfed7e99fe3f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO (marc): check that t without receiver as first parameter is equivalent to o. \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":"interp/type.go"},"region":{"startLine":1488}}}],"partialFingerprints":{"codehealthFindingId/v1":"68f51f0988249e99aee5027fc99542bd852eeab441767876c7217ec49253992f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): generators. \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":"interp/type.go"},"region":{"startLine":1970}}}],"partialFingerprints":{"codehealthFindingId/v1":"f395982d16e8871b1fa0764a3c0c86219908826846aa1abeafc319d046b06c74"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nick): check if this field is not exported and in a different package. \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":"interp/typecheck.go"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"51e1c722579ced5967d64a1e26131bb3f07c8787653cff72fd9edcb3f9f36745"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(marc): check addressable status of array object (i.e. composite arrays are not). \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":"interp/typecheck.go"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9f56f98d7e8560f504351fdc56679731450ec12cab182eb3838a0848f4013c3"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nick): This type check is not complete and should be revisited once \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":"interp/typecheck.go"},"region":{"startLine":590}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e176ccafbe504a0a7e24bcc95b40c19e5a9196d3f98ac2c66306fd837f66f8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nick): above we are acting on itype, but really it is an rtype check. This is not clear which 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":"interp/typecheck.go"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"7132c08713b3897cf4a0ead76d527b106a273eadb17e7bc7fc42516ed17a6678"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nick): This should be an error as the const is in the frame which is undesirable. \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":"interp/typecheck.go"},"region":{"startLine":1123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a3d9d2e676819bc52b3dd312958bdc849f724c02d3cef9890545f54c1eed47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nick): This should be an error as the const is in the frame which is undesirable. \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":"interp/typecheck.go"},"region":{"startLine":1154}}}],"partialFingerprints":{"codehealthFindingId/v1":"5147b64ad19b6e2bafbf20caa994ec614e3a6884201754783633452257cd5371"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nick): This should be an error as untyped strings and bools should be constant.Values. \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":"interp/typecheck.go"},"region":{"startLine":1128}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c00720af9375f330701cb8d4d287dc1e5188fddf2fa999e002d6781acc9bab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(nick): This should be an error as untyped strings and bools should be constant.Values. \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":"interp/typecheck.go"},"region":{"startLine":1159}}}],"partialFingerprints":{"codehealthFindingId/v1":"6090a7be4905af90e2988696ee87021ac724444fa7a5ddc7216f79268c83e71f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: not sure how to parse this case \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":"extract/extract.go"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bb422ef14451dccb757e0f52a799870d34755313b37a5881f5e9216b76c2f2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): if the ident between key and value becomes annoying, be smarter about it. \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":"extract/extract_test.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b217042d22765ee6b850c2bd1590d68484649e3bb6530ddb854401c51419e36"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): restore when we can deal with empty interface. \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":"_test/assert0.go"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"91def25dc2b6d19d00614c60bc16f044ff1b5a0d47c18961e9d3d405aa3b4df8"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): restore \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":"_test/assert0.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c859b9ca9db5e0d940f7ae5a60825fcddab52e85018529c17d709dac1130ae"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): restore \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":"_test/assert0.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"70e5eaa46f7892789e6e1cbc716b92099d8d2456994327c15ac05e26958e835b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): restore when 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":"_test/assert1.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"68215bfb47f04bff522a315dbbaa32288a725c1598e9f97e795f9e50f037daab"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: re-enable the optimized case below, once we\u0027ve figured out why it \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":"_test/fun16.go"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"7463171ffc1942c91c33bbb28f17b3abfe2e770ef67f19b458fd68a9a8d0bd15"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO(mpl): restore when type assertions work again. \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":"_test/method34.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0528df46f4d6814b99f8df3a672502fb5c2a911e2f7ea4faefbf1cb06645c62c"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME expect an 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":"_test/opfloat32.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e9ea0fe5fd7853fd9e85b775e5d296e30949c33499a50c6b59a135ef9a53854"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME expect an 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":"_test/opfloat64.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"823ecbcd8e718fcb21f61e888956292e88f394f8838fc2d78cb9cb66ce5c35c2"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // b -= \u0022fff\u0022 // FIXME expect an 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":"_test/opstring.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e32397875101d41ea03936e1be35806798ffcfd1b4da6839813f541488cf91"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // c *= \u0022fff\u0022 // FIXME expect an 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":"_test/opstring.go"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f82a6509018aa641c1652fae0646932c261fad3c631f46d7d9d2568d0a209f"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // d /= \u0022fff\u0022 // FIXME expect an 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":"_test/opstring.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"731f28ec20f91c93fdae007e91dfeaa5c02dd3f755022c8c5a59f48c883af9b1"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // e %= \u0022fff\u0022 // FIXME expect an 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":"_test/opstring.go"},"region":{"startLine":27}}}],"partialFingerprints":{"codehealthFindingId/v1":"16567156e202e0e4b055cbf682c2bd0a3c3283e391642e1ae8a245cddd2e0ac3"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME 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":"_test/opstring.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"509a19664fa152fc9a2e24f0389eac6ab9b8697d00e9dcfde863670ccc2e3a47"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: expected redeclaration 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":"_test/redeclaration-global1.go"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b81b2cd6b7eeb095ae7ef161f646ceefac33f32fe92ad46de3f5bfc9688876"}},{"ruleId":"D17","level":"warning","message":{"text":"FixmeComment: // FIXME related to named returns \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":"_test/time3.go"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"021e7114cbb713745f34a7fef1e98d7e549580ed60ecb1b9c7bc83af5045e91e"}},{"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 \u0060internal/cmd/genop/genop.go\u0060 makes this repository a deployable product (line 1)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/cmd/genop/genop.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"853df0a6cff9fc900e3b46e85afa912fe69a19e91d32c678fa1c9ae7ea25b305"}},{"ruleId":"D22","level":"warning","message":{"text":"\u0060Interpreter.Symbols\u0060 signals absence with a bare \u0060T\u0060 (the zero value when absent) where its 6 sibling single-key reads use \u0060(T, error)\u0060 (an error when absent): 6 of 7 single-key reads of \u0060Interpreter\u0060 return \u0060(T, error)\u0060 (an error when absent) (6 of 7). Siblings: Interpreter.Eval (interp/interp.go:495); Interpreter.EvalPath (interp/interp.go:502); Interpreter.EvalPathWithContext (interp/interp.go:519); Interpreter.EvalWithContext (interp/interp.go:569); Interpreter.Compile (interp/program.go:33). Return \u0060(T, error)\u0060 (an error when absent) like its siblings. [rule A5]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/use.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"524d73e3833c0c2bf99426dccd3a3c7496886f18dcb7f6993c51431fde8988b6"}},{"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":"c3f7a98bafbbdc3dfa318ba663834aef10863365a2521c176882e0c51e30914d"},"taxa":[{"id":"CWE-665","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-908","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06: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":"70a1ee1d7c80cfe028e207514565a769f6b8e4ec21c202a5274fc794b48d6867"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"df466e11777d49d84c27d9fa99db99203cf525dc7f6c13d23ba24c2be05467ab"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"45c05b2f1ee2f62e587de2f9af27796ad0f996c5e123fa0f12f899eab24e2f55"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"f86117a081ccb758cc58b019642afe750fc1b3bb3131c7ab472a8d52ba7dbb06"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a22ad898b32429e01d1d72f6925672f4258acbe33485d773c5c1d57548b12a13"},"taxa":[{"id":"CWE-913","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":"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":"50378ea7b03ce609a0c8446ed4e7f6a7358afb99bfa123cfb40684a17c9ae4b4"},"taxa":[{"id":"CWE-913","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":"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":"b4bf09498c83343d5683aa3e06131b5018d2d10d4e7ecc36c605e855afc4cae8"},"taxa":[{"id":"CWE-913","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":"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":"d9b6e3da780cd552e0165579be3dfcbd4f3bccc4283c25045c35487f338ef7a3"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"d4724618071814b624bd74f3b719692d29db8582ada35f666e4f678099d9655d"},"taxa":[{"id":"CWE-242","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"24d7c28efe763ebc7bc5522de0ff5ad22433bfa3ba8c6032a53502de771087ed"},"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":"cc832cee6696ad726950604cd9aaa1c7a7e69fce5707e9113afcefb729a51b70"},"properties":{"dependency":{"package":"stdlib","version":"1.21.99","advisory":"GO-2024-3105","aliases":["BIT-golang-2024-34155","BIT-golang-2024-34156","BIT-golang-2024-34158","BIT-golang-2024-45336","BIT-golang-2024-45341","BIT-golang-2025-0913","BIT-golang-2025-22866","BIT-golang-2025-22871","BIT-golang-2025-22873","BIT-golang-2025-4673","BIT-golang-2025-47906","BIT-golang-2025-47907","BIT-golang-2025-47912","BIT-golang-2025-58183","BIT-golang-2025-58185","BIT-golang-2025-58186","BIT-golang-2025-58187","BIT-golang-2025-58188","BIT-golang-2025-58189","BIT-golang-2025-61723","BIT-golang-2025-61724","BIT-golang-2025-61725","BIT-golang-2025-61726","BIT-golang-2025-61727","BIT-golang-2025-61728","BIT-golang-2025-61729","BIT-golang-2025-61730","BIT-golang-2025-68121","BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27139","BIT-golang-2026-27142","BIT-golang-2026-27145","BIT-golang-2026-32280","BIT-golang-2026-32281","BIT-golang-2026-32282","BIT-golang-2026-32283","BIT-golang-2026-32288","BIT-golang-2026-32289","BIT-golang-2026-33811","BIT-golang-2026-33814","BIT-golang-2026-33818","BIT-golang-2026-39820","BIT-golang-2026-39822","BIT-golang-2026-39823","BIT-golang-2026-39825","BIT-golang-2026-39826","BIT-golang-2026-39836","BIT-golang-2026-42499","BIT-golang-2026-42504","BIT-golang-2026-42505","BIT-golang-2026-42507","BIT-golang-2026-56853","BIT-golang-2026-56857","BIT-golang-2026-56858","BIT-golang-2026-56859","BIT-golang-2026-56860","BIT-golang-2026-56862","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]","[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]","[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]","[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]","[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]","[GHSA redacted]","[GHSA redacted]","GO-2024-3106","GO-2024-3107","GO-2025-3373","GO-2025-3420","GO-2025-3447","GO-2025-3503","GO-2025-3563","GO-2025-3750","GO-2025-3751","GO-2025-3849","GO-2025-3956","GO-2025-4006","GO-2025-4007","GO-2025-4008","GO-2025-4009","GO-2025-4010","GO-2025-4011","GO-2025-4012","GO-2025-4013","GO-2025-4014","GO-2025-4015","GO-2025-4155","GO-2025-4175","GO-2026-4337","GO-2026-4340","GO-2026-4341","GO-2026-4342","GO-2026-4403","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4869","GO-2026-4870","GO-2026-4918","GO-2026-4946","GO-2026-4947","GO-2026-4970","GO-2026-4971","GO-2026-4976","GO-2026-4977","GO-2026-4980","GO-2026-4981","GO-2026-4982","GO-2026-4986","GO-2026-5026","GO-2026-5037","GO-2026-5038","GO-2026-5039","GO-2026-5856","GO-2026-5972","GO-2026-6088","GO-2026-6089","GO-2026-6090","GO-2026-6091","GO-2026-6218","GO-2026-6599","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"],"severity":"medium","fixedVersion":"1.22.7","relation":"direct","declaredRange":"1.21","reachability":{"kind":"production","file":"cmd/yaegi/extract.go","line":50,"symbol":"os.Getwd"}}}},{"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":"interp/typecheck.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66d8e444fdb7dd8c6623029a8f2770374fc8b397e89a52531b51f5ae059ec219"}},{"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":"interp/interp.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9f6cb62b3d1a8721d97cd793118a216c243ed36679f65488ede6b5fd7f803d"}},{"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":"interp/ast.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e10c23bf3bce36626a5dd9e19361f1b12c9a4bd1e9779aa3eef7dcb69ced2700"}},{"ruleId":"D34","level":"note","message":{"text":"Further orphaned files (smaller): 15 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: interp/debugger.go, interp/value.go, interp/gta.go, interp/src.go, interp/use.go, interp/generic.go, interp/scope.go, interp/program.go (and 7 more) (18 orphaned of 21 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; 21 of the 44 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":"interp/debugger.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"860c2eef70b6dc8a96e510c10433b1b666ac62fabffc83aad6f7212035789dfa"}},{"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":"interp/value.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"93dab943503afe15a7e0c512f738d202b84ccf70c1b134e27fe303f672dab722"}},{"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":"interp/gta.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fccfafbac748da994c5a7fdb53f7285cbe751df08a3eaf7e6ed81df8fcd0b0e"}},{"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":"interp/src.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2faa871cebf537c290ee2cff762aa37c84ace90031e5a8bb2f15b8baf0ac5d04"}},{"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":"interp/use.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c836a394acfa48852f5dad4e90b9ccad3c9343dea63e091a604748560436797b"}},{"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":"interp/generic.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46e22a7f9443d9ec28aa6c0487075227af8d75531a50b8ef4cd8fb8a5fa01b6"}},{"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":"interp/scope.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b2a3f69df7318ed5e5697852a29fbd11f7c9d375bf25aaed29fa1de2eb8009"}},{"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":"interp/program.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba28718de56b18f6c67e39779acb2a77eddd1aeab0f11a067edcd56cabbd012"}},{"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":"cmd/yaegi/test.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"167725c4c1fa01504b64084148e9a4e342e256c9fa0fd4c1f7d83f108a3dcebf"}},{"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":"interp/build.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec7547a0c06f1e86a28045d22394c6c8b29f1a4f02389165e5d87eea48051010"}},{"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":"cmd/yaegi/yaegi.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"83ded04b5889e19a90595e9af1b5925e6a22d3f0ee5483d4d5a2f523ee202140"}},{"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":"cmd/yaegi/run.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea17c6a13da889e5ccc7f66c231fe09a01f2db2042e9baa447456f5d929a2183"}},{"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":"stdlib/stdlib.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d23cf21de9711149fcf5f031d81fca40661d6088aac86b2a1480a62abf40b56"}},{"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":"cmd/yaegi/extract.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"623c4b832fa3442f97c2914e1a4c9268a95b05e526647cc5e0f504656eff42f5"}},{"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":"interp/trace.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f933489cd499609b9091fd3f27adcea8750e6690e250c358883fd6e44289dcbc"}},{"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":"1b213f6eedd4b140d0bc37bdf1496f72811a643f34064f12518b32e9e83bcfc7"},"taxa":[{"id":"CICD-SEC-9","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":"0e17f71490e4d120a48b2b2881ab866c93b272bef2febb673a3e8e42b2c288ab"},"taxa":[{"id":"CICD-SEC-9","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":"eb00976a698a5d68999b7ee6d27206fd374e916853e7ff1ead5eed42386f043f"},"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":"40fa1f90e961c5acf64085fe87173b10b556d46110c456c51a1c4139c810138f"},"taxa":[{"id":"CICD-SEC-5","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":"9e759935bc673c1bbcc6c3a0b71d4c7fad5f018c82bda27e04c84ef98fe18b58"},"taxa":[{"id":"CICD-SEC-5","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":"65d87ec21c1ecf43a0424ab644272e64330044f506a9f75bd32965b5f8696841"},"taxa":[{"id":"CICD-SEC-5","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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P12","level":"warning","message":{"text":"Coverage collected but not gated: CI collects a coverage report but no step enforces a minimum \u2014 coverage could halve and CI stays green. Add a step that fails the build when coverage drops below a floor (your coverage tool\u0027s minimum-threshold flag, or a coverage-gate action) so the number guards something. What was searched, so you can tell an absence from a miss: this repository\u0027s CI files AND its coverage configuration \u2014 the well-known coverage and test-runner config files, read at the repository root and inside workspace package directories two levels down, so a floor declared beside the tests rather than in the pipeline is credited \u2014 matched against the threshold settings this check knows by name. A floor set in your coverage service\u0027s web UI rather than in a committed file, or under a setting whose name is not one of those, is not seen here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"7f63c06044cf998d9a0698692df30d8873e29bc9b0c98ee829255017c1193d33"}},{"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":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/release.yml"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c11e2dbd483b4b423b95ac61bfcc7af1d55351b28a20d2b1105b31cfe38cc60"}},{"ruleId":"PF1","level":"note","message":{"text":"Benchmarks don\u0027t track allocations: A Go testing.B suite exists but nothing turns on its allocation measurement \u2014 allocations (the main way hot code pressures a garbage collector or allocator) aren\u0027t being measured."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"_test/m1/main_test.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ac9c0bdbf76d9de8f30cce71246a3eb97d512b522de917c26ae1d70664722ea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c0.kind == exprStmt \u0026\u0026 len(c0.child) == 1 \u0026\u0026 c0.child[0].action == aRecv\u0060 appears character-identically in 2 files \u2014 interp/cfg.go, interp/run.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":"interp/cfg.go"},"region":{"startLine":1994}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3814c4c10750074eedf2c394719aca9528158fb7a65853507ffa3f68f386e01"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(revisit) == 0 || equalNodes(nodes, revisit)\u0060 appears character-identically in 2 files \u2014 interp/cfg.go, interp/gta.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":"interp/cfg.go"},"region":{"startLine":2560}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dc4e19f7868e7265d807a161da8255ec7a77db5ab5e89e489e70e06b4181f0a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060s.Kind() != reflect.Struct || idx \u003E= s.NumField()\u0060 appears character-identically in 2 files \u2014 internal/unsafe2/go1_20_unsafe.go, internal/unsafe2/go1_21_unsafe.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":"internal/unsafe2/go1_20_unsafe.go"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf4dff9b6405cda02f16d554d835a6736de4a1cb98f26eb413f78c1c333fef7f"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060params\u0060 holds what \u0060unpackParams\u0060 returns, and \u0060params[1]\u0060 takes element 1 of it without checking its length \u2014 while this file tests that same result elsewhere before indexing it, because it can be nil or shorter. Here a short result panics with \u0060index out of range\u0060. Test \u0060len(params)\u0060 (or nil) first, as the other call site does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/typecheck.go"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"5707b10e3e4c122da4a33a33d4af765756468f03e92f2b1a59ac51987e3ddf40"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060params\u0060 holds what \u0060unpackParams\u0060 returns, and \u0060params[1]\u0060 takes element 1 of it without checking its length \u2014 while this file tests that same result elsewhere before indexing it, because it can be nil or shorter. Here a short result panics with \u0060index out of range\u0060. Test \u0060len(params)\u0060 (or nil) first, as the other call site does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/typecheck.go"},"region":{"startLine":784}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fe9eef354f682c13ce1581108486b9c4b8fcda8ed9540f74bae572102e506b2"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060params\u0060 holds what \u0060unpackParams\u0060 returns, and \u0060params[1]\u0060 takes element 1 of it without checking its length \u2014 while this file tests that same result elsewhere before indexing it, because it can be nil or shorter. Here a short result panics with \u0060index out of range\u0060. Test \u0060len(params)\u0060 (or nil) first, as the other call site does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/typecheck.go"},"region":{"startLine":825}}}],"partialFingerprints":{"codehealthFindingId/v1":"235b627fc9360f32fea19e9b1550df98bed63ac3e328d4faf157190a47d47f0c"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060params\u0060 holds what \u0060unpackParams\u0060 returns, and \u0060params[1]\u0060 takes element 1 of it without checking its length \u2014 while this file tests that same result elsewhere before indexing it, because it can be nil or shorter. Here a short result panics with \u0060index out of range\u0060. Test \u0060len(params)\u0060 (or nil) first, as the other call site does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/typecheck.go"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"7615cde2fa5c5771336842375588550aa4ac23bb65cb3d091cb84b3114758e63"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060params\u0060 holds what \u0060unpackParams\u0060 returns, and \u0060params[1]\u0060 takes element 1 of it without checking its length \u2014 while this file tests that same result elsewhere before indexing it, because it can be nil or shorter. Here a short result panics with \u0060index out of range\u0060. Test \u0060len(params)\u0060 (or nil) first, as the other call site does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/typecheck.go"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8aebd7d5aef319bd68e43aacac43926439b89803ca64037364284db5596f26a"}},{"ruleId":"X28","level":"warning","message":{"text":"Index access outside its own emptiness guard: \u0060params\u0060 holds what \u0060unpackParams\u0060 returns, and \u0060params[1]\u0060 takes element 1 of it without checking its length \u2014 while this file tests that same result elsewhere before indexing it, because it can be nil or shorter. Here a short result panics with \u0060index out of range\u0060. Test \u0060len(params)\u0060 (or nil) first, as the other call site does."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/typecheck.go"},"region":{"startLine":891}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b71e18c63d5a8b5959f77c7adb9d05ce1eb91ff5b6f4093c32762e1f822b1ac"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if n, err := strconv.Atoi(s[4:]); 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":"interp/build.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbe20ce521da24ed48a9c35ef944d299930d03ec99d3a62e4c18e0cff7d6ae53"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err1 != 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":"interp/cfg.go"},"region":{"startLine":396}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e7a5551fbaf7db9ae49620d16e45ad1c79b0d7a50df249abfcf4738a0170be9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err1 != 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":"interp/cfg.go"},"region":{"startLine":407}}}],"partialFingerprints":{"codehealthFindingId/v1":"57baa0aa374da200470116520598759f65d0c3454b6650d0a7f7f1ef5ed5ac9b"}},{"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":"interp/cfg.go"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f32e16c22fe4eda04db5dbb6a12883a24befd3d9ff46cca6b68500d10d903a5"}},{"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":"interp/cfg.go"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"510a9f9a3df5a816a2d82c297fcab16acbdab22f9f34109eec3d7234a6557986"}},{"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":"interp/cfg.go"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cfdb4fff15e3f4142b77a3abda981861396e45701a5752671dd89ea0468a91"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if typ, err = nodeType(interp, sc, c.lastChild()); 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":"interp/cfg.go"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"94032cf776f68dfdf39db693a5e121913d40709047377217da8a21b317764267"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if typ, err = nodeType(interp, sc, recvTypeNode); 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":"interp/cfg.go"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"2043fae43a3221b91c4dcc267bf54ea3f5c428c5a7c501a475bf3ae4127ce19f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if typ, err = nodeType(interp, sc, c.lastChild()); 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":"interp/cfg.go"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"de4d360e8f6b86b2877bf91ef9be1e4972b49d1dd41b015c76fcb8c53ca57560"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if typ, err = nodeType(interp, sc, n.child[1]); 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":"interp/cfg.go"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c2f710d8a3b0d907800d236152a9bad4642bb400ab0568e2cc458bc923b14c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if atyp, err = nodeType(interp, sc, n.child[n.nleft]); 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":"interp/cfg.go"},"region":{"startLine":693}}}],"partialFingerprints":{"codehealthFindingId/v1":"13e29c94818e6bb31a785c5b4e252dc09d569904ed13020fbbbbac8e7ac380e4"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if src.typ, err = nodeType(interp, sc, src); 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":"interp/cfg.go"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c79ffaafe9610b358704cea3cac5f4a92a3b000009786e45f307e6d26524ec"}},{"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":"interp/cfg.go"},"region":{"startLine":762}}}],"partialFingerprints":{"codehealthFindingId/v1":"d53b11a1c187b8cf6b65176927c3da7dbe31101b3e395f0904a1801b25e3b7ad"}},{"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":"interp/cfg.go"},"region":{"startLine":859}}}],"partialFingerprints":{"codehealthFindingId/v1":"529c88c45f4f4f7a7ae35b5e82e526e86d46a22393dc9586f1c93fe7fe19a001"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if n.typ, err = nodeType(interp, sc, n); 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":"interp/cfg.go"},"region":{"startLine":951}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a13087d90e43c6f56aa9a524191607663d50b53062b0ae653fea94053520879"}},{"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":"interp/cfg.go"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"90aed797a1427d402c33363037d22fafe3cd6fb66390131c3c304f89e5009e3a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, err = interp.cfg(g, t.node.anc.scope, importPath, pkgName); 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":"interp/cfg.go"},"region":{"startLine":1022}}}],"partialFingerprints":{"codehealthFindingId/v1":"484b70e67fcccbee18419e95e351eea05a2b72544a61f3b9ae2fd76a541c4e41"}},{"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":"interp/cfg.go"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f224068417b554087421295cc86f95ae127d965a4dcbc435a1454ab612a492b"}},{"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":"interp/cfg.go"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ccc4203cd6cc12e2039960e126dff5d6b9a35b232886b01cd08754218d14a1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if n.typ, err = nodeType(interp, sc, n); 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":"interp/cfg.go"},"region":{"startLine":1224}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2b59888cfdda4b97ba31e14eb15dd4c3e8f4b380496c30c73aa66d056d1a689"}},{"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":"interp/cfg.go"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcb6c4d390c3966a30ba1f282bbc5eeba75b4ae60baa5e56f5375749da427b22"}},{"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":"interp/cfg.go"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6f792e3bd024fd45df945d70d20bb9a555f5e42c0e888a1824b9e0b199ef6c2"}},{"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":"interp/cfg.go"},"region":{"startLine":1467}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb8e24eebdb5150f26d2b93ddeb74622a2292ab6c2527eee6890b8e0d203fc84"}},{"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":"interp/cfg.go"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"de3da1e1d1e6e3a65c0d510f3f3323b4a7d6a8995840241ec7be98a70ccef79f"}},{"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":"interp/cfg.go"},"region":{"startLine":2054}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dab2eec94e651b22d0e12a25ade2b412f9f367c2e197c6ca25a1b5c763bee74"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if c1.typ, err = nodeType(interp, sc, c1); 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":"interp/cfg.go"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed44b8cdd2ae295a5cb6f033f8b9e064248623a0fde05330966e328442f2fc7e"}},{"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":"interp/cfg.go"},"region":{"startLine":2198}}}],"partialFingerprints":{"codehealthFindingId/v1":"94c51659c2777e770d77c8e82b6bb3efb59038dd7442d050a061e3ffaa456ab3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if n.typ, err = nodeType(interp, sc, n); 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":"interp/cfg.go"},"region":{"startLine":2220}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f80ed68330a74a33541abe4ac6b29374f64d60ee3bb553360d3b2c8b4b8b95a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if n.typ, err = nodeType(interp, sc, n); 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":"interp/cfg.go"},"region":{"startLine":2243}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e800024a6ae10f82b023b5fc6123988818c23e50a915c09d7994302a3c7d19f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if n.typ, err = nodeType(interp, sc, n.child[l]); 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":"interp/cfg.go"},"region":{"startLine":2274}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb92f5f8234af76716b8ede5c90a43fe6adfb6c2616da708a49fcaf805aa8c66"}},{"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":"interp/run.go"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"63e0c078740548fa7a54ad7afbde47680d53198d223061834e3c6e6f659126a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060a, _ = n.typ.zero()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060a\u0060 as if the call succeeded. When \u0060n.typ.zero\u0060 fails, \u0060a\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060a\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/run.go"},"region":{"startLine":2556}}}],"partialFingerprints":{"codehealthFindingId/v1":"34be247d5e8b1eb148816515ea357a5d7e2f7ee6ee98bef3924c35e058ef7db7"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060a, _ = n.typ.zero()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060a\u0060 as if the call succeeded. When \u0060n.typ.zero\u0060 fails, \u0060a\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060a\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/run.go"},"region":{"startLine":2659}}}],"partialFingerprints":{"codehealthFindingId/v1":"943b5f8423d400ab250909f7bd1b5f0d5228c94786f47ebf1f45ee2af64c8e0d"}},{"ruleId":"X3","level":"warning","message":{"text":"Discarded error (assigned to \u0060_\u0060, then its result used): \u0060z, _ := t.zero()\u0060 writes the call\u0027s error to \u0060_\u0060 and then uses \u0060z\u0060 as if the call succeeded. When \u0060t.zero\u0060 fails, \u0060z\u0060 is its zero value (nil for a pointer, a map or an interface), so the program panics later or goes on with a default it never chose, and nothing records why. Check the error before using \u0060z\u0060 (return it, wrapped with what was being done), or, if the failure genuinely cannot matter, say why in a comment on the line."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"interp/type.go"},"region":{"startLine":2212}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea81bf1bf608f375c9f4f4658da183efd83b3bf2f2b280c10ec613aa007101b"}},{"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":"interp/typecheck.go"},"region":{"startLine":835}}}],"partialFingerprints":{"codehealthFindingId/v1":"49798618ff1157fe58b9bec0c53a19ccf201b59c1479c909eeb9d941eac730f9"}}],"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-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-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-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-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-665","guid":"fe279ff9-a979-f952-9df9-3f7d05af85d8","name":"CWE-665","shortDescription":{"text":"CWE-665"},"helpUri":"https://cwe.mitre.org/data/definitions/665.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-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-908","guid":"ca1da1d1-5eaf-e95b-adbb-4eb2bc10b9fc","name":"CWE-908","shortDescription":{"text":"CWE-908"},"helpUri":"https://cwe.mitre.org/data/definitions/908.html"},{"id":"CWE-913","guid":"062167e8-5db3-0857-a865-a1fc4aad34bc","name":"CWE-913","shortDescription":{"text":"CWE-913"},"helpUri":"https://cwe.mitre.org/data/definitions/913.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":"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":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A06:2025","guid":"491554d7-b8e4-9652-91a9-53700dc92ece","name":"Insecure Design","shortDescription":{"text":"Insecure Design"},"helpUri":"https://top10.owasp.org/2025/A06_2025-Insecure_Design/"},{"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/"}]},{"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-3","guid":"458c83a6-ebf7-cf55-8cc3-b4d949bbf271","name":"Dependency Chain Abuse","shortDescription":{"text":"Dependency Chain Abuse"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-03-Dependency-Chain-Abuse"},{"id":"CICD-SEC-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"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":19,"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."]}]}