{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"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":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX2","name":"Stateful singletons","shortDescription":{"text":"Stateful singletons"},"helpUri":"https://codehealth.canine.dev/dimensions/AX2"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"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":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"PF1","name":"Benchmark discipline","shortDescription":{"text":"Benchmark discipline"},"helpUri":"https://codehealth.canine.dev/dimensions/PF1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"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":"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":"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":"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":"cache.New (cyclomatic 290): cache.New has cyclomatic complexity 290 (threshold 15). Most of this is not in the body itself: 2 of the 290 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 355, 303, 277, \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":"middleware/cache/cache.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed343c50e512f760442123f9a7463475dffdf10565ce1d5db1eca6c39c5cec5c"}},{"ruleId":"D1","level":"warning","message":{"text":"static.New (cyclomatic 53): static.New has cyclomatic complexity 53 (threshold 15). Most of this is not in the body itself: 6 of the 53 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 342, 217, 317). 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":"middleware/static/static.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"52a6d10fe4f7dcb56f8135703df97675fa03c9b5d0b17089d4e7ddf0eb9851ed"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultRes.SendFile (cyclomatic 40): DefaultRes.SendFile has cyclomatic complexity 40 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"0786a475e2696fbbbfc3ceaa9eadaf538843e3a643a4738b396a8094ed773381"}},{"ruleId":"D1","level":"warning","message":{"text":"cors.New (cyclomatic 37): cors.New has cyclomatic complexity 37 (threshold 15). Most of this is not in the body itself: 15 of the 37 points are its own statements and the rest belongs to one function literal inside it that branches (line 157). 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":"middleware/cors/cors.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7954ff0aadf2580a317cbbe928e7b74ffb31f5d94a84bcfbf060d9f79833b0"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.getOffer (cyclomatic 36): fiber.getOffer has cyclomatic complexity 36 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 17 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":"helpers.go"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"19ea25525be06867d9fb4a3af2438e78b53ccf287863e58a532884d518d23ff8"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.genericParseType (cyclomatic 36): fiber.genericParseType has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers.go"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"4259cbbf5a4cb5b5e4fdd996eda26bdf87598cb67a1366c5cd6b6ec50c495644"}},{"ruleId":"D1","level":"warning","message":{"text":"App.next (cyclomatic 36): App.next has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (App.nextCustom) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router.go"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69bdd5eedf381f979055d7b4b41d302240a993c58aa7c88f413a90c3b66b67b"}},{"ruleId":"D1","level":"warning","message":{"text":"App.nextCustom (cyclomatic 36): App.nextCustom has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (App.next) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router.go"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"795f309f253edd86f05a2e480e4e4e6cea0afdbc60b529c83cfe76d358de9784"}},{"ruleId":"D1","level":"warning","message":{"text":"logger.createTagMap (cyclomatic 35): logger.createTagMap has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 17 function literals inside it that branch (lines 120, 278, 163, \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":"middleware/logger/tags.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb3d19010fd8009d6f88082eadc2128c1fd022c1cef7b423854cea45d112e35"}},{"ruleId":"D1","level":"warning","message":{"text":"session.sameValue (cyclomatic 35): session.sameValue 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":"middleware/session/equal.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e40d5618c15186e68abd9bb719d3446d8bb7a5804c0c118d55890183731dd75f"}},{"ruleId":"D1","level":"warning","message":{"text":"idempotency.New (cyclomatic 34): idempotency.New has cyclomatic complexity 34 (threshold 15). Most of this is not in the body itself: 1 of the 34 points is its own statement and the rest belongs to 3 function literals inside it that branch (lines 144, 107, 98). 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":"middleware/idempotency/idempotency.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"76551b6178c0c5644102753f018efa25aaf549adbb9499a5150d65663b084d13"}},{"ruleId":"D1","level":"warning","message":{"text":"proxy.Balancer (cyclomatic 33): proxy.Balancer has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 10 of the 33 points are its own statements and the rest belongs to one function literal inside it that branches (line 84). 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":"middleware/proxy/balancer.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f139d9b1cab4b1a709c23195b85b027581791073bdb71557ebe69c47a36c7bea"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.isJSONPMemberExpression (cyclomatic 32): fiber.isJSONPMemberExpression has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"aede876c3cc046a2589b0d16f926bd9b55273c4d043f0d2e7fb5e38f610164c9"}},{"ruleId":"D1","level":"warning","message":{"text":"App.Test (cyclomatic 32): App.Test has cyclomatic complexity 32 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app.go"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ed61483893fc155575e53b6ec8c559c4ab034992ee225e6bcd8121d85d2486f"}},{"ruleId":"D1","level":"warning","message":{"text":"client.roundTripCancelable (cyclomatic 31): client.roundTripCancelable has cyclomatic complexity 31 (threshold 15). Of this number, 30 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/cancel.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"d552a2541b0efb8b8be3137bb32fb23d30b58c05ca9f221a956da76f45e2af2e"}},{"ruleId":"D1","level":"warning","message":{"text":"adaptor.handlerFunc (cyclomatic 31): adaptor.handlerFunc has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 1 of the 31 points is its own statement and the rest belongs to one function literal inside it that branches (line 873). 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":"middleware/adaptor/adaptor.go"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0282566c734f908792c7eaafbc6697fe4e68fe296ccce901ccd246c2634e33a"}},{"ruleId":"D1","level":"warning","message":{"text":"routeParser.analyseParameterPart (cyclomatic 31): routeParser.analyseParameterPart has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc34ff1380aefaa970673dcc8fc9edfa76153fa369e49ee8097311e885dbdd68"}},{"ruleId":"D1","level":"warning","message":{"text":"routeParser.matchBacktrack (cyclomatic 31): routeParser.matchBacktrack has cyclomatic complexity 31 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccb31a7c6cb683e5033b56c99409ee22eaadc131146e6a6ca60c80244bf6d4a5"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.adaptExpressHandler (cyclomatic 29): fiber.adaptExpressHandler has cyclomatic complexity 29 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 8 belong to 6 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":"adapter.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"41f8da832896b94d920c108727d25c85caf2f76ed1082068c8e917ac86911daa"}},{"ruleId":"D1","level":"warning","message":{"text":"App.serverErrorHandler (cyclomatic 29): App.serverErrorHandler has cyclomatic complexity 29 (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":"app.go"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"b099b2fdfaa1283a56522b6b3d742203aba0f9a168170186c415037df09da5d5"}},{"ruleId":"D1","level":"warning","message":{"text":"fileServer.requestPath (cyclomatic 29): fileServer.requestPath has cyclomatic complexity 29 (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":"middleware/static/static.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f77c9c59e1ecc5e9e134ce034df61bb9473b8b2bb883c5715f094c4a78423f5"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.buildRouteURL (cyclomatic 28): fiber.buildRouteURL 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":"router.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"476e2d9368a5104bdd63789529cfe9c9394129296d842cbdc71b22787327d528"}},{"ruleId":"D1","level":"warning","message":{"text":"App.ensureAutoHeadRoutesLocked (cyclomatic 28): App.ensureAutoHeadRoutesLocked 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":"router.go"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"5815b5b1090b5001a1a335ff95592f013932c774041da60648fcdb8f53eeca40"}},{"ruleId":"D1","level":"warning","message":{"text":"core.execFunc (cyclomatic 28): core.execFunc has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 9 of the 28 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 82, 187). 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":"client/core.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"e630f31bda6780d8134080e17f7c3989a014823d5bcb78a33529844f7847171d"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultRes.Render (cyclomatic 26): DefaultRes.Render has cyclomatic complexity 26 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"54489272cf1d1e9b76a49c2b804abd55ab3eb432a630cb9674b055ef47862152"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultReq.Range (cyclomatic 25): DefaultReq.Range has cyclomatic complexity 25 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"req.go"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbdb5a84e725156e56264684983c0ba7edf5dddd417da28c5d92e6102b066887"}},{"ruleId":"D1","level":"warning","message":{"text":"skipRouteIndex.buildLookahead (cyclomatic 25): skipRouteIndex.buildLookahead has cyclomatic complexity 25 (threshold 15). Of this number, 24 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router_skip.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"08d0db1da510162e8609eb0c02fb6f2f2e9029a70ae75b8cfef2956146ec21ab"}},{"ruleId":"D1","level":"warning","message":{"text":"App.startupMessage (cyclomatic 24): App.startupMessage has cyclomatic complexity 24 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listen.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd901dd562b6fa9686e30a851de71102a9d21031191a596898ee242cb134fd50"}},{"ruleId":"D1","level":"warning","message":{"text":"basicauth.New (cyclomatic 24): basicauth.New has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 1 of the 24 points is its own statement and the rest belongs to one function literal inside it that branches (line 41). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/basicauth/basicauth.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"7de0090f9daa6f92117e256bcefd9fe2fac6f0a17216558a8132f6ddcea27e23"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.New (cyclomatic 23): fiber.New 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, 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":"app.go"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"39c6cc9fe18bc40b1359adab90c3b4b23870105b217c093948c191582fe96e4c"}},{"ruleId":"D1","level":"warning","message":{"text":"keyauth.configDefault (cyclomatic 23): keyauth.configDefault has cyclomatic complexity 23 (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":"middleware/keyauth/config.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2fedd441a9273d47bce52f374795669fa7ece917719eaabf73b9078d360fb6f"}},{"ruleId":"D1","level":"warning","message":{"text":"proxy.canFastJoinPath (cyclomatic 23): proxy.canFastJoinPath has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/proxy/upstream.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e1affe899d9161af12cf8a19c812569271e6268de59cc33315a17cb0ca5105"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.findParamLen (cyclomatic 22): fiber.findParamLen has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed9bc9a04f8e49f887a5b869456ba8f6931bace09ab276d6321a51908558d83b"}},{"ruleId":"D1","level":"warning","message":{"text":"wiretarget.SegmentsAsRouted (cyclomatic 22): wiretarget.SegmentsAsRouted has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/wiretarget/wiretarget.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef446dd882ae20ea0b84180c41f9e4b64ab714f91187bdc0da34d5a08841e7a"}},{"ruleId":"D1","level":"warning","message":{"text":"csrf.New (cyclomatic 22): csrf.New has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 109). 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":"middleware/csrf/csrf.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"ceac6a41e2d68aa519feec1fd339d5ca1ac3ff5794ce902eee665958bdc3fe25"}},{"ruleId":"D1","level":"warning","message":{"text":"helmet.New (cyclomatic 22): helmet.New has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 4 of the 22 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":"middleware/helmet/helmet.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc223a758ca62faf45f1b69af4d4f4dd43a8a7a730fa0d08beb47465125ce808"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultReq.Fresh (cyclomatic 22): DefaultReq.Fresh has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"req.go"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"73839c1b390a1abb090cbf71ba314240af24b207091104c5a8c3db3761dd6a6f"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.addParameterMetaInfo (cyclomatic 21): fiber.addParameterMetaInfo 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":"path.go"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a0897d8abbdf77a2b80ac03225ea176d3022b10aef24ceb3e19fe93013eaf4"}},{"ruleId":"D1","level":"warning","message":{"text":"App.Listen (cyclomatic 21): App.Listen has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listen.go"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"184c62ff6b9bb9795d5cd0f6ef008cd705ab1c7823df6d9bda6751f4ae7c8925"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultCtx.Endpoint (cyclomatic 21): DefaultCtx.Endpoint 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":"ctx.go"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"4881ae615cc565758cec79d3d272284692eac5a1102bfc2fbb78916cafecdc01"}},{"ruleId":"D1","level":"warning","message":{"text":"proxy.followRedirects (cyclomatic 21): proxy.followRedirects 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":"middleware/proxy/redirect.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"9964125c08fb27f86438e2091f2f133545793e13a9897e0e735eacbb988b423a"}},{"ruleId":"D1","level":"warning","message":{"text":"mediatype.NormalizeRequestContentType (cyclomatic 20): mediatype.NormalizeRequestContentType has cyclomatic complexity 20 (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":"internal/mediatype/mediatype.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e95ba2ccc042cb80c9fdae9e372dfa2c299b3c7018fff180b63b820bcadc575a"}},{"ruleId":"D1","level":"warning","message":{"text":"routeParser.getMatch (cyclomatic 20): routeParser.getMatch has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c37c435b806c3660216250046fcbdfe7a927953130ac62bcb5f39837648a4e8"}},{"ruleId":"D1","level":"warning","message":{"text":"App.resolveSkip (cyclomatic 19): App.resolveSkip has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router_skip.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bdb73011f786c4b848c6ebcc0d4b62f42136af424d2234565faae5c6a42fd3c"}},{"ruleId":"D1","level":"warning","message":{"text":"client.parserRequestHeader (cyclomatic 19): client.parserRequestHeader has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/hooks.go"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d085fa74648bd723770eb0c05b53323b84732563eaf05509d8f64a96bb21cb1"}},{"ruleId":"D1","level":"warning","message":{"text":"domainMatcher.match (cyclomatic 19): domainMatcher.match has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"domain.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1da554532484b72bbd8cfad4934a38c4ad27c133993e933f243166e3885513d0"}},{"ruleId":"D1","level":"warning","message":{"text":"domainRouter.domainRoutes (cyclomatic 19): domainRouter.domainRoutes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"domain.go"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb92ca2973bc8b4e49fa0e3fd456e99531572e22dde2a046d23fdbf95ef2f4e"}},{"ruleId":"D1","level":"warning","message":{"text":"client.setConfigToRequest (cyclomatic 18): client.setConfigToRequest 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":"client/client.go"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"25e625d6502888b32a84a1f246a32f60061c9db1507a23d97a2e2c7c9c79702a"}},{"ruleId":"D1","level":"warning","message":{"text":"CookieJar.cookiesForRequest (cyclomatic 18): CookieJar.cookiesForRequest 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. This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/cookiejar.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"a635a436b2809fc405402aea99afb5f585640bb126b5ee4baa8f0b9d1f3b90ed"}},{"ruleId":"D1","level":"warning","message":{"text":"CookieJar.parseCookiesFromResp (cyclomatic 18): CookieJar.parseCookiesFromResp has cyclomatic complexity 18 (threshold 15). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/cookiejar.go"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a442cbc8c16d4191f157b14f133430d8d4f30b52867996489c12622de8f7e1b"}},{"ruleId":"D1","level":"warning","message":{"text":"etag.New (cyclomatic 18): etag.New 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 56). 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":"middleware/etag/etag.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d0aa3462f663eefcd1dfb021e032c870468de5dbb3c2060f51139dcd6a83ebc"}},{"ruleId":"D1","level":"warning","message":{"text":"logger.New (cyclomatic 18): logger.New has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 6 of the 18 points are its own statements and the rest belongs to one function literal inside it that branches (line 91). 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":"middleware/logger/logger.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc1d9c72cfcfc18840364cb13ab5e79a5e44266ab4b3d01dc1df0418746998f"}},{"ruleId":"D1","level":"warning","message":{"text":"pprof.New (cyclomatic 18): pprof.New 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 37). 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":"middleware/pprof/pprof.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"d290289ddeac0cec89b2e52de1d2a31039d8114e131e9f4fb2d8c6b6b1f50a62"}},{"ruleId":"D1","level":"warning","message":{"text":"proxy.embeddedIPv4 (cyclomatic 18): proxy.embeddedIPv4 has cyclomatic complexity 18 (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":"middleware/proxy/blockedip.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"17541827162ba9e7aca79a60f2107e913a9899cb3bbc6bbf59544d35fbcf236c"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.parseDomainPattern (cyclomatic 17): fiber.parseDomainPattern 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":"domain.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"de11e893b87af417c5623c5f65a063f0f31dd10da6fa482e88e5ae44bd13488f"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.RoutePatternMatch (cyclomatic 17): fiber.RoutePatternMatch has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"b800fe2093c773ffb3ffdffded9dd0a4abed7e2eff01ad7f42f70bcd92914c96"}},{"ruleId":"D1","level":"warning","message":{"text":"fiber.cleanPathSegments (cyclomatic 17): fiber.cleanPathSegments has cyclomatic complexity 17 (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":"path.go"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b2df597d97bbb953b74142f6a5a17821691a5bc862df4849c0d52005cb4675"}},{"ruleId":"D1","level":"warning","message":{"text":"Bind.All (cyclomatic 17): Bind.All 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":"bind.go"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"52de28e7f71bc09907b18e1b929917fcae6dadd0753eaa13ab2f93b576bf2645"}},{"ruleId":"D1","level":"warning","message":{"text":"client.doRedirectsWithClient (cyclomatic 17): client.doRedirectsWithClient 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":"client/transport.go"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d162a3266042a9f12711d898617db59ce10234d724d9e335267c31306a47127"}},{"ruleId":"D1","level":"warning","message":{"text":"urlnorm.rewrite (cyclomatic 17): urlnorm.rewrite has cyclomatic complexity 17 (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":"internal/urlnorm/urlnorm.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3f0a0c518f5f5b8a65e16f8e94ed9959a75241b67bfc275820d4b6a58af773"}},{"ruleId":"D1","level":"warning","message":{"text":"encryptcookie.configDefault (cyclomatic 17): encryptcookie.configDefault 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":"middleware/encryptcookie/config.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9fcdba192069ca4287f061681ad9cb2de4988a3a3db96827f1d6296ce4468a"}},{"ruleId":"D1","level":"warning","message":{"text":"timeout.New (cyclomatic 17): timeout.New has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to one function literal inside it that branches (line 60). 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":"middleware/timeout/timeout.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"713933821a64b38fec766dc9f6ee0381546f994fbfa1443e7e07ab30f775bd25"}},{"ruleId":"D1","level":"warning","message":{"text":"App.processSubAppsRoutes (cyclomatic 16): App.processSubAppsRoutes 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":"mount.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fa2c39ad1bd700681f7388cfd533ed0f0f1f2acc84d4475a2c374f88cacc8aa"}},{"ruleId":"D1","level":"warning","message":{"text":"client.SetValWithStruct (cyclomatic 16): client.SetValWithStruct has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 1125). 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":"client/request.go"},"region":{"startLine":1111}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb89f40a32b3e8355c594aba186000a19ef1aa03d040aaa305dbd1e1c777f961"}},{"ruleId":"D1","level":"warning","message":{"text":"extractors.Chain (cyclomatic 16): extractors.Chain has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 851). 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":"extractors/extractors.go"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf3be30bf1030860574d05eb2613eed6eb41f70a8c63c95d0ac48a4a1d675ee3"}},{"ruleId":"D1","level":"warning","message":{"text":"rulematch.DotSegments (cyclomatic 16): rulematch.DotSegments has cyclomatic complexity 16 (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":"internal/rulematch/capture.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dfb606da33ad0c0e9fd94b7cd31e5897760089ba144ec0590595a1f36e9cdee"}},{"ruleId":"D1","level":"warning","message":{"text":"adaptor.HTTPMiddleware (cyclomatic 16): adaptor.HTTPMiddleware 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 546). 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":"middleware/adaptor/adaptor.go"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e45f44a5228d409c8c5fbdb4096c103057902d493fd4463b0fcfa05201bd4f"}},{"ruleId":"D1","level":"warning","message":{"text":"helmet.configDefault (cyclomatic 16): helmet.configDefault has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/helmet/config.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"13711603fa149a59b9bd8a816b03012c1e8d535a33775a7c808bf82945de6a22"}},{"ruleId":"D1","level":"warning","message":{"text":"SlidingWindow.New (cyclomatic 16): SlidingWindow.New 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 27). 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":"middleware/limiter/limiter_sliding.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ecb1e6fb130857caaa19e11f3f91d569967ea15940d38512d1959debf05b57"}},{"ruleId":"D1","level":"warning","message":{"text":"Store.getSession (cyclomatic 16): Store.getSession 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":"middleware/session/store.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa09f8acbd91987654fa9637ddd5f33cb0ae839d3c5e8c868d1402cc88ae006c"}},{"ruleId":"D1","level":"warning","message":{"text":"DefaultReq.isTrustedProxyIP (cyclomatic 16): DefaultReq.isTrustedProxyIP 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":"req.go"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b75a321938db410c7af929cd515df6fe33990dab33fa99633824575407b0af2"}},{"ruleId":"D1","level":"warning","message":{"text":"Route.match (cyclomatic 16): Route.match 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":"router.go"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"465820b813e8f8ed38ca18aeeaa849a33575375510fd4b56a67e3cc7d3803915"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.New (cognitive 464): cache.New has cognitive complexity 464 (threshold 15). Drivers by points: if/else 199 (371 pts), boolean chains 65, loops 9 (24 pts), match/switch 2 (4 pts) (nesting depth added 189). Most of this is not in the body itself: 1 of the 464 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 355, 303, 277, \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":"middleware/cache/cache.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b8b7d070abc9a22ac03fcf21457a7255425a0b6beefe6598a5391e81f295f12"}},{"ruleId":"D2","level":"warning","message":{"text":"routeParser.matchBacktrack (cognitive 76): routeParser.matchBacktrack has cognitive complexity 76 (threshold 15). Drivers by points: if/else 20 (63 pts), boolean chains 7, loops 2 (5 pts), jumps 1 (nesting depth added 46). Of this number, 71 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"76130771d22ec088a8d98fcb41330080c8aa0030144c206c450b2ad37645ba98"}},{"ruleId":"D2","level":"warning","message":{"text":"App.next (cognitive 66): App.next has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (56 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 32). 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. This shape REPEATS in the file: one other method here (App.nextCustom) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router.go"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"266447aa12dd5387153a5fe7d817d962e3af8419ea185054591487259c5009b0"}},{"ruleId":"D2","level":"warning","message":{"text":"App.nextCustom (cognitive 66): App.nextCustom has cognitive complexity 66 (threshold 15). Drivers by points: if/else 25 (56 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 32). 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. This shape REPEATS in the file: one other method here (App.next) has the same decision points, in the same order, at the same nesting depths \u2014 so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router.go"},"region":{"startLine":839}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bc1025fcdc149ae836072bd82774bac989f1d4eb5dbc6ef147abddf3268f1db"}},{"ruleId":"D2","level":"warning","message":{"text":"static.New (cognitive 61): static.New has cognitive complexity 61 (threshold 15). Drivers by points: if/else 31 (45 pts), boolean chains 15, match/switch 1 (nesting depth added 14). Most of this is not in the body itself: 6 of the 61 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 342, 217, 317). 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":"middleware/static/static.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3971b049cd8492226bafb030897814f6fc37a68160f64192ba07732aff9eec"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.buildRouteURL (cognitive 58): fiber.buildRouteURL has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (43 pts), boolean chains 8, loops 3 (7 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router.go"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"321b8bbfdd6d43ba2a46456ded0e37c9c48d9d366530ae28b712a89e4c669d3a"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultRes.SendFile (cognitive 55): DefaultRes.SendFile has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (37 pts), boolean chains 12, loops 3 (6 pts) (nesting depth added 17). Of this number, 50 points are the body\u0027s own statements and 5 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f717588904ff24ec7876b345073e3f2ad541039fa34f91b7fb1129b497f691"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.getOffer (cognitive 53): fiber.getOffer has cognitive complexity 53 (threshold 15). Drivers by points: if/else 18 (37 pts), boolean chains 8, loops 3 (6 pts), match/switch 2 (nesting depth added 22). Of this number, 26 points are the body\u0027s own statements and 27 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers.go"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"5981fcc469559827651213d8482f0ec931f650fa6da503bf815f8fe528946003"}},{"ruleId":"D2","level":"warning","message":{"text":"App.Test (cognitive 50): App.Test has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (39 pts), boolean chains 5, match/switch 2 (5 pts), loops 1 (nesting depth added 20). Of this number, 49 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app.go"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7f138adda380a22242cdc5a7cc7e69bc85e96f9baa6a9d9fea28a367860bee0"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultRes.Render (cognitive 48): DefaultRes.Render has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (41 pts), boolean chains 6, loops 1 (nesting depth added 23). Of this number, 42 points are the body\u0027s own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":1058}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64fbece98d3ba4c061073ab50797cc801ee2277a213d8d4bf6772061fd6dcb8"}},{"ruleId":"D2","level":"warning","message":{"text":"proxy.Balancer (cognitive 46): proxy.Balancer has cognitive complexity 46 (threshold 15). Drivers by points: if/else 24 (36 pts), boolean chains 6, loops 2 (4 pts) (nesting depth added 14). Of this number, 20 points are the body\u0027s own statements and 26 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":"middleware/proxy/balancer.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"db5d5e454eae8a56de7a60ecb674159d8a5f7799d4b3d32a2e9ff3f8842e9d47"}},{"ruleId":"D2","level":"warning","message":{"text":"routeParser.analyseParameterPart (cognitive 46): routeParser.analyseParameterPart has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (28 pts), boolean chains 12, loops 2 (4 pts), match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f4a598585f28f794ea167b4456f8019d1c8fb26daf5be714bb6efcf3246cf0"}},{"ruleId":"D2","level":"warning","message":{"text":"skipRouteIndex.buildLookahead (cognitive 46): skipRouteIndex.buildLookahead has cognitive complexity 46 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 6 (11 pts), boolean chains 4 (nesting depth added 25). Of this number, 45 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router_skip.go"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"faff5863cfdea16860a9382ffa40a703f9b4848a78d6dd22b822ad1dace64907"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.isJSONPMemberExpression (cognitive 45): fiber.isJSONPMemberExpression has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 11, match/switch 1 (2 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"16d7e43bd3484f64e93de01adccb799679072a988510dd458c7c9b33ce2f88ae"}},{"ruleId":"D2","level":"warning","message":{"text":"adaptor.handlerFunc (cognitive 45): adaptor.handlerFunc has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (38 pts), loops 3 (4 pts), boolean chains 2, match/switch 1 (nesting depth added 16). None of this is in the body itself: all 45 points belong to one function literal inside it that branches (line 873). 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":"middleware/adaptor/adaptor.go"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"440988a1d0443be12c9a66015c2bcb48d9f1bee67efb197c7a32b6eb56330d1a"}},{"ruleId":"D2","level":"warning","message":{"text":"idempotency.New (cognitive 45): idempotency.New has cognitive complexity 45 (threshold 15). Drivers by points: if/else 26 (36 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 13). None of this is in the body itself: all 45 points belong to 3 function literals inside it that branch (lines 144, 107, 98). 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":"middleware/idempotency/idempotency.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"f746ff604f00f5e7c6d1c6e1852e80a456582aa088570a95454c8c983662d562"}},{"ruleId":"D2","level":"warning","message":{"text":"CookieJar.parseCookiesFromResp (cognitive 44): CookieJar.parseCookiesFromResp has cognitive complexity 44 (threshold 15). Drivers by points: if/else 17 (35 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 22). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/cookiejar.go"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"9930dc7f9fc328430b3fda7a2d4c0d33236ed1fa664d9f6340bee61d677f727d"}},{"ruleId":"D2","level":"warning","message":{"text":"csrf.New (cognitive 44): csrf.New has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (42 pts), boolean chains 1, match/switch 1 (nesting depth added 20). Most of this is not in the body itself: 2 of the 44 points are its own statements and the rest belongs to one function literal inside it that branches (line 109). 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":"middleware/csrf/csrf.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"520065ceba096ecf05b9028884f0cd24b35ee617f50a1265f77ed38b75b32788"}},{"ruleId":"D2","level":"warning","message":{"text":"cors.New (cognitive 43): cors.New has cognitive complexity 43 (threshold 15). Drivers by points: if/else 29 (34 pts), boolean chains 9 (nesting depth added 5). Most of this is not in the body itself: 15 of the 43 points are its own statements and the rest belongs to one function literal inside it that branches (line 157). 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":"middleware/cors/cors.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"646c5ec617ec18edf8e2d215207112818770ed6b5ae08cde74854a284c1823c9"}},{"ruleId":"D2","level":"warning","message":{"text":"proxy.followRedirects (cognitive 41): proxy.followRedirects has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (37 pts), boolean chains 3, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/proxy/redirect.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"1955a1bbda203858ea5b4f378961cd7de56352edd1fdc5846149c96bb9438900"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultReq.Range (cognitive 40): DefaultReq.Range has cognitive complexity 40 (threshold 15). Drivers by points: if/else 20 (36 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 17). Of this number, 38 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":"req.go"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"f94cef2d99dd3d0c407539a072945d56bd20c2638803ed112231b17f2a3e37cd"}},{"ruleId":"D2","level":"warning","message":{"text":"core.execFunc (cognitive 39): core.execFunc has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 5, match/switch 3 (4 pts) (nesting depth added 14). Most of this is not in the body itself: 5 of the 39 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 82, 187). 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":"client/core.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"902a64d8bb7c6863d6a9b2dad763f24ee6a82248a37bfb44150535bba1dde5ac"}},{"ruleId":"D2","level":"warning","message":{"text":"App.ensureAutoHeadRoutesLocked (cognitive 38): App.ensureAutoHeadRoutesLocked has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (27 pts), boolean chains 6, loops 4 (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":"router.go"},"region":{"startLine":1563}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c20abf620499cfd8c43ea9aa30dc9bc29e267d3b58e0006745ba2b90bea6868"}},{"ruleId":"D2","level":"warning","message":{"text":"domainRouter.domainRoutes (cognitive 38): domainRouter.domainRoutes has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 4 (6 pts), boolean chains 3 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"domain.go"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"840773bc33f2099665424821e30d56773510c1b141d067de8ae1a098bb27e812"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.createTagMap (cognitive 38): logger.createTagMap has cognitive complexity 38 (threshold 15). Drivers by points: if/else 27 (33 pts), boolean chains 2, loops 2, match/switch 1 (nesting depth added 6). None of this is in the body itself: all 38 points belong to 17 function literals inside it that branch (lines 120, 278, 163, \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":"middleware/logger/tags.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"4caee2bc51edbe91d6d6e2447da12d17954ff34419d00d002b20e812d2592947"}},{"ruleId":"D2","level":"warning","message":{"text":"session.sameValue (cognitive 38): session.sameValue has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 11, loops 2 (4 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/session/equal.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"e61e98d666697783f10153566ab723ba102e02374cb67fafc3fde3c86fbf6e05"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.adaptExpressHandler (cognitive 37): fiber.adaptExpressHandler has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (36 pts), match/switch 1 (nesting depth added 18). Of this number, 21 points are the body\u0027s own statements and 16 belong to 6 function literals inside it that branch. 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":"adapter.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"571cb41c85207f97aa530b30060addf650a438d2bec093f8b9054679f90de070"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.genericParseType (cognitive 36): fiber.genericParseType has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (31 pts), match/switch 2 (3 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers.go"},"region":{"startLine":1233}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dcc599f112d8384d26a2d01fc56c717b30e61de8913b19378df650fa89552f8"}},{"ruleId":"D2","level":"warning","message":{"text":"routeParser.getMatch (cognitive 36): routeParser.getMatch has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (27 pts), loops 2 (5 pts), boolean chains 4 (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":"path.go"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"153cbabc0b825ca3ead91178e76c695493f8a6f749fa46e22e45bd23fe7b65c7"}},{"ruleId":"D2","level":"warning","message":{"text":"client.roundTripCancelable (cognitive 35): client.roundTripCancelable has cognitive complexity 35 (threshold 15). Drivers by points: if/else 23 (29 pts), boolean chains 6 (nesting depth added 6). Of this number, 34 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/cancel.go"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"f003fd4b78d11c0969b775784524400c2163e57954e3d8aaab86cf9ff61ca0e1"}},{"ruleId":"D2","level":"warning","message":{"text":"App.processSubAppsRoutes (cognitive 33): App.processSubAppsRoutes has cognitive complexity 33 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mount.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"325f3c51cb16b5699e4138772ecfe3d09d677f13ac4063efb4b208b24c1d30ab"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.parseDomainPattern (cognitive 32): fiber.parseDomainPattern has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"domain.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"35cafc4fea617def09847015fe111f6659407654d58b13b2807b09158f99b427"}},{"ruleId":"D2","level":"warning","message":{"text":"client.doRedirectsWithClient (cognitive 31): client.doRedirectsWithClient has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (27 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/transport.go"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b8ac2f6c81d02f6ab91057e716d90254f4cc7b0e5accb0d3bc23ee6f891bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"CookieJar.cookiesForRequest (cognitive 31): CookieJar.cookiesForRequest has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (24 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 13). Of this number, 29 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/cookiejar.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"952b674d9986e0834a571d6709fcff1c077ea4074466070a254ad4639071a260"}},{"ruleId":"D2","level":"warning","message":{"text":"wiretarget.SegmentsAsRouted (cognitive 31): wiretarget.SegmentsAsRouted has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (20 pts), boolean chains 8, match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/wiretarget/wiretarget.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"d541b7a6c84d6308401fb88878f6a0ce4520357769fc2c948291c5f2b1adffa7"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultReq.Fresh (cognitive 31): DefaultReq.Fresh has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 6 (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":"req.go"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"621eacbacfa7f6fba7470f9cc215c91b45b96a30c76c42770e1b9cf6c45cda93"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.findParamLen (cognitive 30): fiber.findParamLen has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 4 (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":"path.go"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ad92e6eae155def885f5d31259e39cda2965cf7208fb5607dc0dacb93d4637"}},{"ruleId":"D2","level":"warning","message":{"text":"App.startupMessage (cognitive 30): App.startupMessage has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 5, loops 2 (5 pts) (nesting depth added 7). Of this number, 29 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listen.go"},"region":{"startLine":566}}}],"partialFingerprints":{"codehealthFindingId/v1":"e71fdb6a06b290d7c83c5ff59114f29b8bd52e9f79c6d0012a91808b2fccb9a0"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.addParameterMetaInfo (cognitive 29): fiber.addParameterMetaInfo has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (19 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":"path.go"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"925379bd8fc6f9640d4047420edaa27a2a1bf7ee3d0bf76cc9f86fb570a4958b"}},{"ruleId":"D2","level":"warning","message":{"text":"keyauth.configDefault (cognitive 29): keyauth.configDefault has cognitive complexity 29 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/keyauth/config.go"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"aef69debd9c3dd84f86882b1075078be7361c7e074f11b370cf32fd01e0a3d5e"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.defaultLoggerInstance (cognitive 29): logger.defaultLoggerInstance has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (20 pts), loops 2 (8 pts), boolean chains 1 (nesting depth added 14). Of this number, 17 points are the body\u0027s own statements and 12 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":"middleware/logger/default_logger.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"583206b20d7c03ecd1a18d6d553d79c971c1ade66df8460e4692b36fb578e941"}},{"ruleId":"D2","level":"warning","message":{"text":"App.Listen (cognitive 28): App.Listen has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 5, match/switch 1 (2 pts) (nesting depth added 10). Of this number, 27 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listen.go"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cae26a57ff3343e950dc2d06eb5462789f0c3e5bcd8cf0f34cf21c5a8ecb2ce"}},{"ruleId":"D2","level":"warning","message":{"text":"App.buildTree (cognitive 28): App.buildTree has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 6 (13 pts), boolean chains 2 (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":"router.go"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"67e005d50301b009448594b66cbdea9c57d2b6502277f7d35a986f2d3c3f2d64"}},{"ruleId":"D2","level":"warning","message":{"text":"proxy.canFastJoinPath (cognitive 28): proxy.canFastJoinPath has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 7, match/switch 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/proxy/upstream.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2489f0f05b05b49bf83e663baa23cbcf6cd4ca41cda016f13f13758d3e93fe1"}},{"ruleId":"D2","level":"warning","message":{"text":"domainMatcher.match (cognitive 26): domainMatcher.match has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"domain.go"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f322cc444ebdc4a7c5b5eb627f0192906b8644db5f04c54edc4955a31fb6590"}},{"ruleId":"D2","level":"warning","message":{"text":"mediatype.NormalizeRequestContentType (cognitive 26): mediatype.NormalizeRequestContentType has cognitive complexity 26 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 5 (9 pts), boolean chains 8 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/mediatype/mediatype.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e4360edac329b1cf502db5d627f6e5dd88e1b88211d868c2a14fd9fce48ff85"}},{"ruleId":"D2","level":"warning","message":{"text":"favicon.New (cognitive 26): favicon.New has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 2 (nesting depth added 10). Of this number, 17 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/favicon/favicon.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a80f172256ac1ba63e58421a700f9ceee927f18370c8f442ae3775ad89d99af"}},{"ruleId":"D2","level":"warning","message":{"text":"logger.New (cognitive 26): logger.New has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 6). Most of this is not in the body itself: 9 of the 26 points are its own statements and the rest belongs to one function literal inside it that branches (line 91). 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":"middleware/logger/logger.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a6089ada392e1ef6764ee58b8ef5f51b3ca8e345458d77be450d0ae9bf1489e"}},{"ruleId":"D2","level":"warning","message":{"text":"App.resolveSkip (cognitive 25): App.resolveSkip has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router_skip.go"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"d72a16f063e24a17ea6f02777ddec0e6f2a77b5cc1b57ed8d420022f80476d63"}},{"ruleId":"D2","level":"warning","message":{"text":"Bind.All (cognitive 25): Bind.All has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bind.go"},"region":{"startLine":516}}}],"partialFingerprints":{"codehealthFindingId/v1":"60062cceb8f624fc455ca327af43e8f501368352e36a8409a2a9c9267ec83b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"binder.structKeyKind (cognitive 25): binder.structKeyKind has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"binder/mapping.go"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afab5f707033edfd4a10665b49052644f91fc5d3b9b9e8ac37cee72f56289d7"}},{"ruleId":"D2","level":"warning","message":{"text":"CookieJar.setByHostAndPath (cognitive 25): CookieJar.setByHostAndPath has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 13). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/cookiejar.go"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"58deb8c035a20a8151a2c5c3965499029c4ac2349b48526fd972c51433604a05"}},{"ruleId":"D2","level":"warning","message":{"text":"basicauth.New (cognitive 25): basicauth.New has cognitive complexity 25 (threshold 15). Drivers by points: if/else 19 (21 pts), boolean chains 4 (nesting depth added 2). None of this is in the body itself: all 25 points belong to one function literal inside it that branches (line 41). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/basicauth/basicauth.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"2da74a62e7d77a2426c910f51de034e7f03ff741aa917f2c4cd9f94c486238b9"}},{"ruleId":"D2","level":"warning","message":{"text":"helmet.New (cognitive 25): helmet.New has cognitive complexity 25 (threshold 15). Drivers by points: if/else 20 (23 pts), boolean chains 2 (nesting depth added 3). Most of this is not in the body itself: 5 of the 25 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":"middleware/helmet/helmet.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf0ce345b92c20308618c2cea82e97c5d5a81ddbed3b572a2f89cb417b107f9"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.getBindingPrecedence (cognitive 24): fiber.getBindingPrecedence has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (4 pts), match/switch 1 (4 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":"bind.go"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"236bcf6fbb007f4a512c01a476cad0a0d254c94e8359198291a324b2721f6ec9"}},{"ruleId":"D2","level":"warning","message":{"text":"client.substitutePathParams (cognitive 23): client.substitutePathParams has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/hooks.go"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"cee881c674b0fe1b367af425f5f75037777c4c40af9a33b31b7e1e184591ae73"}},{"ruleId":"D2","level":"warning","message":{"text":"extractors.Chain (cognitive 23): extractors.Chain has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (4 pts), boolean chains 3, loops 1 (nesting depth added 9). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to one function literal inside it that branches (line 851). 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":"extractors/extractors.go"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"d090868b5b4fa261e0f22e19dc51d8862ac1d434de50074baa89c781477a2653"}},{"ruleId":"D2","level":"warning","message":{"text":"mediatype.Params (cognitive 23): mediatype.Params has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 9). None of this is in the body itself: all 23 points belong to one function literal inside it that branches (line 138). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/mediatype/mediatype.go"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"44f5897f08b88e8b9b5b5878db13bf90ceb186362303624ffed029f7ac2ae310"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.appendCanonicalQueryString (cognitive 23): cache.appendCanonicalQueryString has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/keygen.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a87c437cb42151ac6f3406b43cf9ebc9e83524fc1c31ebed6e69a332e3e613"}},{"ruleId":"D2","level":"warning","message":{"text":"Session.saveSessionWithContext (cognitive 23): Session.saveSessionWithContext has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (22 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":"middleware/session/session.go"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0defb1c2779777909db9bc97d47b56c7fb73b192bac78ed53b271534c80e49e"}},{"ruleId":"D2","level":"warning","message":{"text":"constProbe.locate (cognitive 23): constProbe.locate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f0d71f490561b01b8420f79d0a36b8127bf76b37a4b4a6e6cb43357de57c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.New (cognitive 22): fiber.New has cognitive complexity 22 (threshold 15). Drivers by points: if/else 20, loops 2. Of this number, 21 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. 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":"app.go"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c77b86cc633dc4721931cd2b3e5f9a3760366e4d8c7fcb2b9087422ed92f62"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.needsPathNormalization (cognitive 22): fiber.needsPathNormalization has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ce3025e95d4bbf23d59b6d40889a0275e6a9c9b048d3eab873b448c148acc7a"}},{"ruleId":"D2","level":"warning","message":{"text":"App.deleteRoute (cognitive 22): App.deleteRoute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (16 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router.go"},"region":{"startLine":1268}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7f38ea0f7d17ef661bc3372f2fa1b661a7c5caec2e4175a931f9ae081ace77"}},{"ruleId":"D2","level":"warning","message":{"text":"Storage.gc (cognitive 22): Storage.gc has cognitive complexity 22 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (7 pts), boolean chains 2, match/switch 1 (2 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":"internal/storage/memory/memory.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b2a701bfe7a850f3a1a29413d4dbbc3d78c62a2200e42f891b41ae4a6816348"}},{"ruleId":"D2","level":"warning","message":{"text":"Store.getSession (cognitive 22): Store.getSession has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 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":"middleware/session/store.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4f56ffa6950ee797c35e9257c423049dc9c5b41abb4bc849b4bdae02b16533"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.cleanPathSegments (cognitive 21): fiber.cleanPathSegments has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":514}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c2de0abbbd3433101b390cf0fcc98142c0d96f4a9bce5c9f904843a4b797d1"}},{"ruleId":"D2","level":"warning","message":{"text":"adaptor.copyContextValues (cognitive 21): adaptor.copyContextValues has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/adaptor/adaptor.go"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"55bd7ff044816f59c05ee5e04c13333d17035dd7d233fee9250e780840840ab5"}},{"ruleId":"D2","level":"warning","message":{"text":"hostauthorization.parseAllowedHosts (cognitive 21): hostauthorization.parseAllowedHosts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/hostauthorization/hostauthorization.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d5396a61c28096d5cadbd5faefbdbcc6ac4f9e0a0f8a9a72524656414b0825c"}},{"ruleId":"D2","level":"warning","message":{"text":"fileServer.requestPath (cognitive 21): fileServer.requestPath has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9, match/switch 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/static/static.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b963a8f2e9283bca2faae341ceb8e654554bd6362c990be3766c5083075b7590"}},{"ruleId":"D2","level":"warning","message":{"text":"Route.match (cognitive 21): Route.match has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router.go"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef2f6ee85093f942d6baca1226b9f97d0512d1d283d12bff1f4da85e8f402bf0"}},{"ruleId":"D2","level":"warning","message":{"text":"App.serverErrorHandler (cognitive 20): App.serverErrorHandler has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (9 pts), match/switch 1 (nesting depth added 2). 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":"app.go"},"region":{"startLine":1794}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e1949fc3f4b08292b432e86690a8f51557098de3d63a437b14b7d071a0819d7"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultReq.extractIPFromHeader (cognitive 20): DefaultReq.extractIPFromHeader has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"req.go"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"46e50307f81d182e34e704e8eb835040b8000ecc755eb66b8ca0417e73f0292e"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultReq.isTrustedProxyIP (cognitive 20): DefaultReq.isTrustedProxyIP has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, loops 2 (3 pts) (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":"req.go"},"region":{"startLine":977}}}],"partialFingerprints":{"codehealthFindingId/v1":"58d1d7b326fa548639bfedf202f045bde1022aa70678a2517c51b9c659f39aa7"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.acceptsLanguageOfferExtended (cognitive 19): fiber.acceptsLanguageOfferExtended has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 4, boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers.go"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"1faa97dc93c378e5009b43a2cc85fc0c424fae089a34471bb5d909262495cadb"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.hasDotSegment (cognitive 19): fiber.hasDotSegment has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"53ac7b4c1cc62d56b62a7ccffc3f6a5394ecdd9138f83d39ab1e54b819c124a2"}},{"ruleId":"D2","level":"warning","message":{"text":"App.ErrorHandler (cognitive 19): App.ErrorHandler has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app.go"},"region":{"startLine":1715}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5dbd839d16b88b903c71b4b69d01e1b95eeb8c3b408afbab449d42c85afdb06"}},{"ruleId":"D2","level":"warning","message":{"text":"binder.parseParamSquareBrackets (cognitive 19): binder.parseParamSquareBrackets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"binder/mapping.go"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"c67b2988dbe56f450095e6ff40579c5145f1888bdf0c8aef16a15ddca58ab2d4"}},{"ruleId":"D2","level":"warning","message":{"text":"CookieJar.ensureHostCapacityLocked (cognitive 19): CookieJar.ensureHostCapacityLocked has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 7). This file\u0027s own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes \u2014 or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/cookiejar.go"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"6801916b66a1da37578ec35cc3ebb9a1c9fafd1990ba2a14b9047e98d2b6c602"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultCtx.Endpoint (cognitive 19): DefaultCtx.Endpoint has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, 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":"ctx.go"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f77fc13a47fe86aac0a3326ddffe57841989770e243d8856799992f030753b0"}},{"ruleId":"D2","level":"warning","message":{"text":"rulematch.DotSegments (cognitive 19): rulematch.DotSegments has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (6 pts), match/switch 2 (5 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/rulematch/capture.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"b660416f366f9bb094956be84772e8ab73b5f046ff2804f351823527e10b4a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"adaptor.resolveRemoteAddr (cognitive 19): adaptor.resolveRemoteAddr has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/adaptor/adaptor.go"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e6b978606b7751b5bc4beb7eaaafd66287413cc30fa29dfef22749853613ce6"}},{"ruleId":"D2","level":"warning","message":{"text":"compress.encodingQuality (cognitive 19): compress.encodingQuality has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 1 (nesting depth added 9). Of this number, 10 points are the body\u0027s own statements and 9 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/compress/compress.go"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"16f75c890c630d2a91622b0e957666e1d3b03f4652356f5e3ae09c7bf8fc7c5a"}},{"ruleId":"D2","level":"warning","message":{"text":"encryptcookie.configDefault (cognitive 19): encryptcookie.configDefault has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/encryptcookie/config.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"cebff3ddfd79561fe6608d4a7e30efe9cab3eac5f881296810020773f996447c"}},{"ruleId":"D2","level":"warning","message":{"text":"hostauthorization.isValidHostSyntax (cognitive 19): hostauthorization.isValidHostSyntax has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/hostauthorization/hostauthorization.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"e21c095a049b850fd3ddaa98fa1a909dc40915795d27c94334a338bb47b67e44"}},{"ruleId":"D2","level":"warning","message":{"text":"SlidingWindow.New (cognitive 19): SlidingWindow.New has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4 (nesting depth added 5). None of this is in the body itself: all 19 points belong to one function literal inside it that branches (line 27). 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":"middleware/limiter/limiter_sliding.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f650a55708082c7b358993c3f09046307b369a7ab86d4d0cc3fff28480b43e6"}},{"ruleId":"D2","level":"warning","message":{"text":"redirect.New (cognitive 19): redirect.New has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 2, loops 2 (nesting depth added 7). Most of this is not in the body itself: 4 of the 19 points are its own statements and the rest belongs to one function literal inside it that branches (line 217). 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":"middleware/redirect/redirect.go"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2354da85c3e4678a27467c8154bd0449594a3da26f28f95ba3e11e3e49c57f31"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultRes.Format (cognitive 19): DefaultRes.Format has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (5 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":"res.go"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f93ef4307ce5107f700585a610ce3cc8f4ba73b74069f5832c138a4b99290f8"}},{"ruleId":"D2","level":"warning","message":{"text":"routeScan.skip (cognitive 19): routeScan.skip has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router_filter.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"069e8d610e8aed8391df298d2d4a1159f2224678d4f8d130868560baac8b64b0"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.RoutePatternMatch (cognitive 18): fiber.RoutePatternMatch has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 4 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"886ee2cdb41a4b76b7606367f692113442346c11cf6933aaad9a3c37c266f9be"}},{"ruleId":"D2","level":"warning","message":{"text":"App.registerForHosts (cognitive 18): App.registerForHosts has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (5 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":"router.go"},"region":{"startLine":1345}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e61f92f3e04cc5cdfa802a7859a7e120d84ee815294cddd00561326be1ebdc4"}},{"ruleId":"D2","level":"warning","message":{"text":"binder.parseToMap (cognitive 18): binder.parseToMap has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"binder/mapping.go"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1dade80fcd8d7ec0e2362641b379050a4f0cb900640ff3db2feb288743b2818"}},{"ruleId":"D2","level":"warning","message":{"text":"binder.buildFieldInfo (cognitive 18): binder.buildFieldInfo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (5 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":"binder/mapping.go"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fd732428f14a04c29edb75cc01262451804546c0a7a13e4bc0fb40df1b3d79"}},{"ruleId":"D2","level":"warning","message":{"text":"client.parserRequestHeader (cognitive 18): client.parserRequestHeader has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), loops 6, match/switch 1 (nesting depth added 3). 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":"client/hooks.go"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba91e524ff091808020b47fc7973bbbbc50dd9849b4f4401ac8f851bb04c157f"}},{"ruleId":"D2","level":"warning","message":{"text":"defaultLogger.privateLogw (cognitive 18): defaultLogger.privateLogw has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 1 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"log/default.go"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f7fb6deb877aaf25bb967f9674dd764e85cb13c6af7f4696cec273a8808573c"}},{"ruleId":"D2","level":"warning","message":{"text":"adaptor.HTTPMiddleware (cognitive 18): adaptor.HTTPMiddleware has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 3, loops 1 (nesting depth added 3). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 546). 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":"middleware/adaptor/adaptor.go"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d0a3a5039a929ec4a24d4ab072942097398750404cafaeda37a03d6c90bb986"}},{"ruleId":"D2","level":"warning","message":{"text":"basicauth.parseHashedPassword (cognitive 18): basicauth.parseHashedPassword has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 1, match/switch 1 (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":"middleware/basicauth/config.go"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"c42521c650e12efafa55be99d889ab4df7335875d58b3cf4bc2c3fdb97d6bc55"}},{"ruleId":"D2","level":"warning","message":{"text":"encryptcookie.decryptRequestCookies (cognitive 18): encryptcookie.decryptRequestCookies has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/encryptcookie/encryptcookie.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0ed07761ef53b4e5be59207cf3b2aa6e82093df2eeae5d851fb03460d7d526"}},{"ruleId":"D2","level":"warning","message":{"text":"etag.New (cognitive 18): etag.New has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12, boolean chains 6. None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 56). 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":"middleware/etag/etag.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c31b5d5befb334659e2337f96799efa8f9443fdcbf5da2e938fa0be64940ff3"}},{"ruleId":"D2","level":"warning","message":{"text":"timeout.New (cognitive 18): timeout.New has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, match/switch 3 (4 pts) (nesting depth added 3). None of this is in the body itself: all 18 points belong to one function literal inside it that branches (line 60). 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":"middleware/timeout/timeout.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"66e9b1ddbaeeacf004b69abc1426002cf16df0e9fd6e45965b43cb32c05d88a9"}},{"ruleId":"D2","level":"warning","message":{"text":"Route.urlHasDotSegment (cognitive 18): Route.urlHasDotSegment has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, 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":"router.go"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e884960e41bd3b7e01b4d1a41deafa05911a44a9970e2b6ee1c4010d893d69f"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.unescapeSafePath (cognitive 17): fiber.unescapeSafePath has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":400}}}],"partialFingerprints":{"codehealthFindingId/v1":"f61bc839e88d58ac42e889b48f7b21d20182aaa095a31ae214a49368e271ba3a"}},{"ruleId":"D2","level":"warning","message":{"text":"fiber.escapeStrayPercent (cognitive 17): fiber.escapeStrayPercent has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9131086689e8788aea4fee62ad6a276f9eb01f457c5012140bec6252c73ccac"}},{"ruleId":"D2","level":"warning","message":{"text":"bindShape.indexes (cognitive 17): bindShape.indexes has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 5, loops 1 (nesting depth added 6). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 249). 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":"binder/mapping.go"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae84cf4b3994c7d55e1eea0eee0ac86921aa931ca8d8dbbbdae2b4601a08717"}},{"ruleId":"D2","level":"warning","message":{"text":"client.setConfigToRequest (cognitive 17): client.setConfigToRequest has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15, match/switch 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/client.go"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d668d9687b9fa32fc00dfa5438c384ee5c2b190ad143fbe5a6b05b13a19a0cd"}},{"ruleId":"D2","level":"warning","message":{"text":"Response.Save (cognitive 17): Response.Save has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 1 (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":"client/response.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4eca206f31d0f9d395c83d0b6d64486f28e6b10fbf5e73976654a1568b4caab"}},{"ruleId":"D2","level":"warning","message":{"text":"mediatype.quotedParamEnd (cognitive 17): mediatype.quotedParamEnd has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/mediatype/mediatype.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f0d89c747795f23739249222cec55a54e43ca49923b18080486423cf28ec47"}},{"ruleId":"D2","level":"warning","message":{"text":"schemehost.Match (cognitive 17): schemehost.Match has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/schemehost/schemehost.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"1451324dd2b02b049e043bdb0be7e3fe48a0e88b0ef0826588dbcd708ec9b56f"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.hasDirective (cognitive 17): cache.hasDirective has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/cachecontrol.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"46eeb6295ea79a178fdf9eb02b7d0b7c8d321c48f3e43b941ccc5c46602a88c6"}},{"ruleId":"D2","level":"warning","message":{"text":"keyauth.New (cognitive 17): keyauth.New has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (nesting depth added 4). None of this is in the body itself: all 17 points belong to one function literal inside it that branches (line 45). 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":"middleware/keyauth/keyauth.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"205c3f2938610994cd780eba988ca052aa8f70c9c040e6afcff67f3abb757320"}},{"ruleId":"D2","level":"warning","message":{"text":"client.writeMultipartBody (cognitive 16): client.writeMultipartBody has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/hooks.go"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4e735a7faa27db50b0f129e7268235eba208212f0eef045c1d2d97c77348a89"}},{"ruleId":"D2","level":"warning","message":{"text":"fieldname.JoinedInReceivedOrder (cognitive 16): fieldname.JoinedInReceivedOrder has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fieldname/fieldname.go"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ab5dc6ef95f2aba722c525501150a66032762c467fd620069188036f5532adc"}},{"ruleId":"D2","level":"warning","message":{"text":"fieldname.KeepReceivedOrder (cognitive 16): fieldname.KeepReceivedOrder has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 4). Of this number, 13 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":"internal/fieldname/fieldname.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c6eb9c2f94d14419f230fab1baf5087d7549c87b059359aadd5ad476c2cb3bd"}},{"ruleId":"D2","level":"warning","message":{"text":"headerlist.NextQuoted (cognitive 16): headerlist.NextQuoted has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/headerlist/headerlist.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"e036ebee69457af8fb57d24218ef1737f7233a978569c24fb27dd0c4bad06a45"}},{"ruleId":"D2","level":"warning","message":{"text":"urlnorm.rewrite (cognitive 16): urlnorm.rewrite has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (6 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 3). 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/urlnorm/urlnorm.go"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"60cfb9a93b6edeb8d06b0c21069449e606a8a31e1c4588a52442c9f71d0f28c6"}},{"ruleId":"D2","level":"warning","message":{"text":"basicauth.configDefault (cognitive 16): basicauth.configDefault has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 3). Of this number, 11 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/basicauth/config.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"b27ebe393de202a38a26544adf2600fa4ab629f4e4dbe6107eb93a7d36675b7b"}},{"ruleId":"D2","level":"warning","message":{"text":"hostauthorization.parseNormalizedAuthority (cognitive 16): hostauthorization.parseNormalizedAuthority has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), match/switch 1 (2 pts), loops 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":"middleware/hostauthorization/hostauthorization.go"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"27522a4853c0df62427d744e35d4652b152e23c0d4621b3363488927de0af27b"}},{"ruleId":"D2","level":"warning","message":{"text":"DefaultReq.FormValue (cognitive 16): DefaultReq.FormValue has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"req.go"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"162bdc05d7a7eda95f97de699a0a48345c667d2e6f3a8e42aad40817d54a90df"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: cache.New: FunctionTooLong \u2014 New runs 772 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 672 over it, 7.72\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/cache.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"815f44e2701295291224cc7651cbbcc934820b5f6809ff6ce37b430692132f79"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: App: TooManyMethods \u2014 132 methods, declared across 9 files: ./app.go (50), ./router.go (25), ./mount.go (23), ./listen.go (10), \u002B5 more file(s). The bar is 30 methods; this is 102 over it, 4.40\u00D7 the bar. That list is where to read them, not a suggestion to split the file: the members belong to the type wherever they are declared, so moving them between files leaves the count unchanged. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"e455e4b9503517bb8602101adbbdfb9f60c58906638b0eeecaa37d9fe491a3db"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Client: TooManyMethods \u2014 93 methods. The bar is 30 methods; this is 63 over it, 3.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/client.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a2e76c2a7dcf3d8fbd21d22ccafe8ed505e33166ed0fddcf2b175e4239c688d"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefaultReq: TooManyMethods \u2014 87 methods. The bar is 30 methods; this is 57 over it, 2.90\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"req.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"486a6c55ec944376a8c14a69dcc405325fe8f30165fabc784344472b3bb6ad10"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Request: TooManyMethods \u2014 80 methods. The bar is 30 methods; this is 50 over it, 2.67\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/request.go"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"78de6fc01225ebd7b1a42a47af71f3296d5f5d43b384f4151513ed9539911171"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefaultCtx: TooManyMethods \u2014 79 methods. The bar is 30 methods; this is 49 over it, 2.63\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"af84b302d40cb425656a8c92f548adc6fcd91d37be00daa83db00028d4fcb9e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./router.go: FileTooLong \u2014 941 significant lines (blank, comment-only and punctuation-only lines excluded), about 65% of them inside a single declaration: App (25 blocks, 664-1890). The bar is 500 significant lines; this is 441 over it, 1.88\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad336ba4f3085f5650bf8473d3d7e24bf468750ed1e52ab3195ebb3dd68ddc67"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DefaultRes: TooManyMethods \u2014 54 methods. The bar is 30 methods; this is 24 over it, 1.80\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab448b4d3fdfbf542584e59743bb0d72c40a0e7bffc2635115729f20e36ed6f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DefaultReq: ClassTooLong \u2014 717 significant lines (blank, comment-only and punctuation-only lines excluded), 87 methods, 88 blocks, lines 65-1881. The bar is 400 significant lines; this is 317 over it, 1.79\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"req.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf025a5e8dd646fdedb78cfa006ca165913610689d2493d8e512797a8c2f2f12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./path.go: FileTooLong \u2014 896 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 396 over it, 1.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"path.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad40a10aa4974b8eac64fe4d575b3a43c59e92cae956ca088a0195b5dc3e9451"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: cache/cache.go: FileTooLong \u2014 886 significant lines (blank, comment-only and punctuation-only lines excluded), about 87% of them inside a single declaration: New (225-1554). The bar is 500 significant lines; this is 386 over it, 1.77\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/cache.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a4ba9e16d0e770e536dca75911bb28e011f4220ef2712038479decafafd3d3"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: Config: TooManyFields \u2014 53 stored fields. The bar is 30 stored fields; this is 23 over it, 1.77\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app.go"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c568c73c49b8fa809df882d05f9d4a80cead9d00a6ba840d4e3a0c485cd28f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./req.go: FileTooLong \u2014 861 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: DefaultReq (88 blocks, 65-1881). The bar is 500 significant lines; this is 361 over it, 1.72\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"req.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a26e7b82d79ca9900d7ac352673fa55bc06970e7d4bb736a6eb707bd87f14148"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: logger.createTagMap: FunctionTooLong \u2014 createTagMap runs 164 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/logger/tags.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf5beffe32164d22453f89ebe1386c14a1adb830d52a5c67d32d0de4f4f632f4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./res.go: FileTooLong \u2014 814 significant lines (blank, comment-only and punctuation-only lines excluded), about 69% of them inside a single declaration: DefaultRes (55 blocks, 164-1703). The bar is 500 significant lines; this is 314 over it, 1.63\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0b0d9b460639358cfcd404355ee90294667e72d07137c7f741197a0ba78cecc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./app.go: FileTooLong \u2014 801 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 301 over it, 1.60\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9947ac75d39e9e932bbb9f3fd4cac9b34da85cae21e03da2c4a3f493d1f81dd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: static.New: FunctionTooLong \u2014 New runs 151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 51 over it, 1.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/static/static.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"e871e368108f98398d2661d8e09507e0e1e6a2ee47fc608f88c262e5b5164ab0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./helpers.go: FileTooLong \u2014 740 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 240 over it, 1.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"helpers.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffee36fc7b0fc8098c7289484b50169e37e8b9ce9607fc264c4cceb65eb7f77f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DefaultRes: ClassTooLong \u2014 563 significant lines (blank, comment-only and punctuation-only lines excluded), 54 methods, 55 blocks, lines 164-1703. The bar is 400 significant lines; this is 163 over it, 1.41\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0cb314fa949bc91bb2308501856baffc0e2227d59c30634227d884924a4623e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: binder/mapping.go: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"binder/mapping.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1c7b7976e57d2042c2a556061f1a1a8955376b3d4f8f33382960ec72fe35c3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/client.go: FileTooLong \u2014 620 significant lines (blank, comment-only and punctuation-only lines excluded), about 76% of them inside a single declaration: Client (94 blocks, 45-943). The bar is 500 significant lines; this is 120 over it, 1.24\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/client.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fababc5fba048dc902b2ea43ce6490bb3da46452964fee0c01c7c32cd17a1e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: client/request.go: FileTooLong \u2014 593 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 93 over it, 1.19\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/request.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c8c092011139841f126d45a5cbf818842d160be82387c9aa24fb5ce24e44d9"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: App: ClassTooLong \u2014 473 significant lines (blank, comment-only and punctuation-only lines excluded), 132 methods, 51 blocks, lines 77-1983. The bar is 400 significant lines; this is 73 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app.go"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"67224588a3d421cc1bd6e47a514b4553a9917752abbacfa30e7a7757daa4d91f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Client: ClassTooLong \u2014 472 significant lines (blank, comment-only and punctuation-only lines excluded), 93 methods, 94 blocks, lines 45-943. The bar is 400 significant lines; this is 72 over it, 1.18\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/client.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8cb6bfdbedbb1df937634266809103c7f6a55b495ab6a9eaf2388a83d0b7ba9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: fiber.adaptExpressHandler: FunctionTooLong \u2014 adaptExpressHandler runs 113 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"adapter.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"0494a95d6e3627142ffd615d4d660706526fbf09a55dfaaff478116592642a7f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: State: TooManyMethods \u2014 33 methods. The bar is 30 methods; this is 3 over it, 1.10\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"state.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"82e0858fc7ede3f7b2e75138a337b6811649267dcf66f8ee2f490e3491df197f"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: DefaultCtx: ClassTooLong \u2014 437 significant lines (blank, comment-only and punctuation-only lines excluded), 79 methods, 80 blocks, lines 57-1180. The bar is 400 significant lines; this is 37 over it, 1.09\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"46dc18cadeed60275f1ee51a2fd874c84772ea9af330d8e3f2e91bf1a22ee43d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: adaptor/adaptor.go: FileTooLong \u2014 531 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 31 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/adaptor/adaptor.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"289eaebe3cc95995743352ef634c556b00d1da60cb803bbc599129f97b362a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: adaptor.handlerFunc: FunctionTooLong \u2014 handlerFunc runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/adaptor/adaptor.go"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b492d406e0d41e720514a49bd0e36c83fbdf201e49f28a74ddbcb17911b6513"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ./ctx.go: FileTooLong \u2014 522 significant lines (blank, comment-only and punctuation-only lines excluded), about 84% of them inside a single declaration: DefaultCtx (80 blocks, 57-1180). The bar is 500 significant lines; this is 22 over it, 1.04\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3c77301f848a77d35805eacdc9cb1be1563e15a4223c1b2ad5e96280bf5eb3a"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DefaultRes.SendFile: MethodTooLong \u2014 SendFile runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"431b6a16efc8131f0f30a10c4c480886b7cdccdac73e1e14cbd3e84ab49cc960"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Session: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/session/session.go"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb77d4faa96045444a68b00f32ca71b85bdd8e6f39d384a03462fb54f5235f21"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: SharedState: TooManyMethods \u2014 31 methods. The bar is 30 methods; this is 1 over it, 1.03\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"shared_state.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0d571a5e189a22ebcd13912b474c31e0b61b82d35bf3b378e659ece9d49996"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (67 shared lines): router.go:664-837 | router.go:839-1006 \u2014 These two members are variants of one another: 67 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":"router.go"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60b1b1bc17ed1f1df70f84b4fa2f41ff6711f26f7b3046e13d3732051a80591"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (108 corresponding lines): middleware/limiter/limiter_fixed.go:14-121 | middleware/limiter/limiter_sliding.go:14-135 \u2014 These two members are one piece of code written twice and then edited apart: 108 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":"middleware/limiter/limiter_fixed.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"665405f029b74acacbe142afd2b585b867852ddb416d367b68d6f0cbad4de4b1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (47 corresponding lines): router.go:1008-1058 | router.go:1060-1106 \u2014 These two members are one piece of code written twice and then edited apart: 47 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":"router.go"},"region":{"startLine":1008}}}],"partialFingerprints":{"codehealthFindingId/v1":"d87c396d71c27273643eeb462defa39a9805446dc245fa44216a0977411f9e4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): client/request.go:235-262 | client/request.go:474-501 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/request.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"595ecdf25423b9ffb79792fb4e487d4aa05851926436ee73880992fc4c6ea533"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): middleware/redirect/redirect.go:44-78 | middleware/rewrite/rewrite.go:66-98 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/redirect/redirect.go"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b3b390c063379a9abfdb2fc0daa5cba165bffd4d17d2ad6a9a56b5bebda7e1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): middleware/cache/manager.go:162-190 | middleware/limiter/manager.go:128-156 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"middleware/cache/manager.go"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa5541d8b01d4603918c6ad4bb9dc5634399589e28c0906cae8d3c92bf97e9cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (34 corresponding lines): middleware/session/session.go:617-651 | middleware/session/session.go:653-686 \u2014 These two members are one piece of code written twice and then edited apart: 34 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":"middleware/session/session.go"},"region":{"startLine":617}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1a83dd0a4449ab45ba0894cdf814f422f4afb755ad8187dbb3d7ce63356d279"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): client/request.go:168-193 | client/response.go:111-136 \u2014 These two members are one piece of code written twice and then edited apart: 26 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":"client/request.go"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"dca8cf040085ebccf86a191042979bbd1932071185718c0f0beb63760a5ce531"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (28 corresponding lines): mount.go:180-210 | mount.go:215-242 \u2014 These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"mount.go"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1f909855febd53359ce5d5a9ce9898b2f450061ea43388e1628192428d3ed7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): redirect.go:235-264 | redirect.go:267-298 \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":"redirect.go"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"f08cf73e44d4d437de0cc500cb640d6e2e2ead3b2ea529c5b2b7f51ca3eaffb0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): listen.go:347-371 | listen.go:376-409 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"listen.go"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"98158ea40e87b1e3d3d3f5ea2a50d06838d6e10bca0e3e84344301a1f74445a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): log/default.go:70-94 | log/default.go:98-126 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"log/default.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca71f252b5189d2ffb0f09da64494dbef288e80ca04b0301b5ff1525137ffd6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (23 corresponding lines): internal/quotedstring/quotedstring.go:13-36 | middleware/basicauth/basicauth.go:201-223 \u2014 These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/quotedstring/quotedstring.go"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee6c65885a9b10a09b10b5f0fae13deefeb1169643983ae0aacd7e596bb7a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): shared_state.go:99-118 | shared_state.go:318-341 \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":"shared_state.go"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8f45c3ce231a6cd86289588e704fbdd5fbd2102af872530fc685f505167b027"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): binder/mapping.go:403-425 | binder/mapping.go:447-466 \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":"binder/mapping.go"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"03af84a24917b5a037905ffa3c7aabd1d2717fa0147eecab6df262a16418cc09"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): middleware/cache/manager.go:193-214 | middleware/csrf/storage_manager.go:40-58 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"middleware/cache/manager.go"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c6c660324563bf06268b088936b5912dc81646b5a3e6b023a26817e6c9a535"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): binder/header.go:19-32 | binder/resp_header.go:19-32 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"binder/header.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"3619aba37ed81e6cdbd2c31903c5fbcd815b5a7917ae2928fc27975d51b155fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): middleware/csrf/csrf.go:379-408 | middleware/csrf/csrf.go:413-441 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"middleware/csrf/csrf.go"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a65d3aef2d0f1e9b9d1a3cac721889bc9075d57f10ce2c5d3bb1bb95ec91c1e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): binder/cookie.go:19-32 | binder/query.go:19-33 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"binder/cookie.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd970380462621b9b07fa06dfb2a9a3da9d4d3d84b899d582f0c0ce29ff2597"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (27 corresponding lines): log/context.go:95-123 | log/context.go:136-162 \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":"log/context.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a2549084b545ee8abb5c50957be93bc23cb94427e9c21dcd149fceac586c10f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): middleware/encryptcookie/encryptcookie.go:11-39 | middleware/responsetime/responsetime.go:10-34 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/encryptcookie/encryptcookie.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0867763e4c64591eb3cd2dc6680c85d7cc62bbda8a14532a4629cc1f96faf25b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): internal/headerlist/headerlist.go:80-98 | internal/headerlist/headerlist.go:273-294 \u2014 These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/headerlist/headerlist.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"28bcb32b2c7152ff3b2bb9543a19fe989a935d048df7217981571b08259b6f6f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): shared_state.go:343-372 | shared_state.go:374-402 \u2014 These two members are one piece of code written twice and then edited apart: 29 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":"shared_state.go"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be2e5bbae51177017e02add084a9125fae8c3b2e3abadc954f90dfc4b3c4883"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 12\u002B corresponding lines): bind.go:238-249 | bind.go:253-264 | bind.go:269-280 | bind.go:284-295 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 12 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":"bind.go"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bc541cb09023c50fbdb3ed9ff01282fd6df8843a31306aa57b2e2161c8fc1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): constraint.go:452-466 | constraint.go:541-555 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"constraint.go"},"region":{"startLine":452}}}],"partialFingerprints":{"codehealthFindingId/v1":"783a395baeef70851c49f18f0b9121d9644e0665cdf87595c85a721d8aa64e0d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (5 members, 11\u002B corresponding lines): bind.go:299-310 | bind.go:314-324 | bind.go:328-339 | bind.go:345-360 | bind.go:378-389 \u2014 These 5 members are one piece of code written 5 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 5 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"bind.go"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f44732cbdfe9a1bd7824b33ec888c56caab8f3a2f1187b35877ec6c2624ab9e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): hooks.go:327-347 | hooks.go:349-369 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"hooks.go"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d70bf045c4bfd7234721f667f1260661bf0109bd6bf520e80526bf45cdd5af7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 15\u002B corresponding lines): res.go:732-746 | res.go:752-766 | res.go:772-786 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 15 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"res.go"},"region":{"startLine":732}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa624c46bc78834001e210c204a6de125efea66d42c6fc287a05e75460657881"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): internal/fieldname/fieldname.go:455-473 | internal/fieldname/fieldname.go:531-545 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fieldname/fieldname.go"},"region":{"startLine":455}}}],"partialFingerprints":{"codehealthFindingId/v1":"65284b7e8a4d7b611eac591236244c9551c09a63e1d3d4a1104a8f0a80cdd6e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): addon/retry/config.go:47-68 | addon/retry/exponential_backoff.go:45-63 \u2014 These two members are one piece of code written twice and then edited apart: 19 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":"addon/retry/config.go"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a65e06104508968c16779b021046415abe34f7fd96fe7f272aadc357caa880"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): domain.go:854-860 | domain.go:902-908 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"domain.go"},"region":{"startLine":854}}}],"partialFingerprints":{"codehealthFindingId/v1":"807e8106e75464cd41ef4a373f43cdf3dc2c4bae8b7715b1196b93863d276481"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): constraint.go:468-482 | constraint.go:557-571 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"constraint.go"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1c12cd14ae7f3c696336ce16b1ae78b2131a7c843ac77989480d3108c6b22cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): middleware/cache/manager.go:237-247 | middleware/csrf/storage_manager.go:61-71 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/manager.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a1253ea720d4b60807620c9eca6be9c570d500ff2864660e9b5cef0a96d5e6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): req.go:1537-1546 | res.go:713-723 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"req.go"},"region":{"startLine":1537}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf2f65a114b9aaf60f5ea2c7cef90947120fc701275cb6724eaaa832ff533c54"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): constraint.go:499-509 | constraint.go:526-536 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"constraint.go"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3c0ec18d45953e2da59feb42b13a6377cb978596deda3225492b57afcf124a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): middleware/logger/default_logger.go:237-247 | middleware/logger/default_logger.go:315-325 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/logger/default_logger.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9fd92c139158ee6245160b7e388a4956580645cbfd632b1ea8ca8c7b6461257"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): middleware/logger/utils.go:127-139 | middleware/logger/utils.go:142-154 | middleware/logger/utils.go:159-171 \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":"middleware/logger/utils.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1569831915b934837af69b0160205a27bf6622648f603fc0d7db0e11acd345"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): middleware/cache/credential.go:534-544 | middleware/cache/credential.go:546-558 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/credential.go"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"b22c2ba28c75ad04ca2b3c7e6a6c2cd2657bd05383f4798b5b7a9a6d288b6d27"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): middleware/earlydata/config.go:49-73 | middleware/timeout/config.go:43-63 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/earlydata/config.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6fee1d176c9cfd2d6b7dd1a392c72b81a441b92a20a080abd0e07250ab367f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): middleware/cache/manager.go:250-260 | middleware/csrf/storage_manager.go:74-84 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/manager.go"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f15137796c93a75559ba717800d2136e397d1d2ff6fb79e4cf9fc1209013b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): group.go:65-82 | app.go:1106-1120 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"group.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"f900cd8a83c9e12747e435c9207054e3e26b64ada403df5807c02ca233f6279a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 12\u002B corresponding lines): app.go:192-204 | constraint.go:28-39 | internal/nilerror/nilerror.go:8-20 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 12 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":"app.go"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"639b0f0f2715346cab890b9299dac1569b1e28d415b2c233cb19669d5c25fe4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): client/client.go:510-521 | client/request.go:221-228 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/client.go"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"59029c48327b5561ca0cbc2604c6b1dadd084a297d7c40dfd348ab93e09e6247"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (4 corresponding lines): internal/wiretarget/wiretarget.go:418-421 | res.go:831-835 \u2014 These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/wiretarget/wiretarget.go"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"95de225e7b59298d5a48d17effce49eef04c9f5a149daf5eb81d113cd03c0804"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): middleware/redirect/config.go:61-80 | middleware/rewrite/config.go:50-64 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/redirect/config.go"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"a32b93e28e51aad12a66f1494b089bcedfa8317c4b3f3793c355a1356d8870eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (7 corresponding lines): middleware/cache/credential.go:196-202 | middleware/cache/vary.go:121-129 \u2014 These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/credential.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dcbcc62168b8cd590325df61a24c482cfd413a83131d74e7046e99108d9dfc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): middleware/expvar/config.go:19-34 | middleware/pprof/config.go:27-45 \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":"middleware/expvar/config.go"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd776efec14b568b3cba3b5c4f1fa8a68b07a915225511c4f0db024b96f1bfb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): middleware/requestid/config.go:35-52 | middleware/responsetime/config.go:27-42 \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":"middleware/requestid/config.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2aa46b8e6ab6c3b0b2cc02d818d246f1dca2513f948b31844dff4a838c22741"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): helpers.go:101-106 | internal/ctxlocal/ctxlocal.go:19-24 \u2014 These two members are one piece of code written twice and then edited apart: 6 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":"helpers.go"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"3828803c1580a536b6e89a9ca5c9bd8d0b603af83124b3d0d4245f1eeae569d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): client/transport.go:442-452 | internal/mediatype/mediatype.go:124-134 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"client/transport.go"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"d13c7d5e837c1d6edd42ea268ea3c6bb7878a7b44544f0f7128cfd52500b7d95"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): domain.go:217-219 | internal/wiretarget/wiretarget.go:400-402 | middleware/adaptor/adaptor.go:832-834 | middleware/proxy/upstream.go:299-301 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 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":"domain.go"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"208d05c3a054d193b5f97ac612f92396a79972366d6dbd6d77d7d01c43f5ee1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201333 lines \u00D7 2): router.go:768-800 | router.go:938-969 \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 \u0060router.go:768\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":"router.go"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"436867d3bcfcf44b19dca241d4373024b2bf3133489b0950cc5f7a8d2c7c4a04"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201326 lines \u00D7 2): middleware/limiter/limiter_fixed.go:15-40 | middleware/limiter/limiter_sliding.go:15-39 \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 \u0060middleware/limiter/limiter_fixed.go:15\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":"middleware/limiter/limiter_fixed.go"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"2767dad6c267a92c2a9c0574e79a65175e916951ed6b2be69ce483d4b65e804d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): middleware/redirect/redirect.go:55-78 | middleware/rewrite/rewrite.go:75-98 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060middleware/redirect/redirect.go:55\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":"middleware/redirect/redirect.go"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d466e48e0ca5f3ec0e2d418383b14bca1d63c337adf6f9602efa22cec80f15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): router.go:703-723 | router.go:875-895 \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 \u0060router.go:703\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":"router.go"},"region":{"startLine":703}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc8e0394ed30bc172af7de3fdd9550730728184b6270a45ebc7966fceca3bfe7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): middleware/limiter/limiter_fixed.go:72-90 | middleware/limiter/limiter_sliding.go:80-98 \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 \u0060middleware/limiter/limiter_fixed.go:72\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":"middleware/limiter/limiter_fixed.go"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"16efa535e64d5e84cfc9be8a247dd75436adf65fbb765638bdfdb6b29bee1377"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): internal/fieldname/fieldname.go:68-84 | internal/fieldname/fieldname.go:90-106 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fieldname/fieldname.go"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae03cbe34d9295ad72ca00848b8e2d8f575cfdb3e5368e793879110f672e147d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): client/request.go:247-262 | client/request.go:486-501 \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 \u0060client/request.go:247\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":"client/request.go"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"d35d073577600b5ecd3a32dd60b8635f2e080b614d8edd25bd04250acf70b4bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): listen.go:322-337 | listen.go:454-469 \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":"listen.go"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"4089ad42e66d05bd6be2f79e72424ec5c2570056f939706f997945e20fa589ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): shared_state.go:100-115 | shared_state.go:319-334 \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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060shared_state.go:336\u0060 calls \u0060decodeSharedStateValue\u0060 and \u0060shared_state.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":"shared_state.go"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ae2b8eae170e2177914c62ef5d087d0d8cb12b7891575ccc6c1d96a2a59646"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201315 lines \u00D7 2): domain.go:492-506 | mount.go:230-239 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"domain.go"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"6011d618d2c6004fb7efce7f5b7920687a59d26719e67f58c9c26ff6a1acb613"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): res.go:1117-1131 | res.go:1140-1154 \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 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":"res.go"},"region":{"startLine":1117}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca13df327527f9c747f867496ccc2c382cd9703f9d547f28e299e0f43ef02b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): internal/headerlist/headerlist.go:85-98 | internal/headerlist/headerlist.go:125-138 \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 \u0060internal/headerlist/headerlist.go:85\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":"internal/headerlist/headerlist.go"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd06f8dfde141991eaf994002698e585b96de3ee5aba79ea712e03c1bdfece83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): listen.go:354-367 | listen.go:387-398 \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":"listen.go"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"4713241317c25890aaffaecee31e50f0887ea923c355bee8d43c395b0e58ad20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): router.go:688-701 | router.go:860-873 \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 \u0060router.go:688\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":"router.go"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"d47291209b495a98081ed8a169456efb6866b8da5fdcddaa00dd51958065a385"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): binder/form.go:69-81 | binder/query.go:21-33 \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 \u0060binder/form.go:69\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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"binder/form.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cbcfdeee5eeec50a4ac31b6a47431d55a67e36c4751b3698af4cf78e1c63363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201312 lines \u00D7 2): middleware/cache/keygen.go:196-207 | middleware/paginate/page_info.go:159-166 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at \u0060middleware/cache/keygen.go:196\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, \u0060middleware/cache/keygen.go:213\u0060 calls \u0060releaseKeyBuffer\u0060, \u0060appendEscapedBoundKeySegment\u0060 and \u0060middleware/paginate/page_info.go:167\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":"middleware/cache/keygen.go"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1666cc173729ec2114f063351add4709cc1d8e66f92d53dad7b55b1f08ae5f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): router_skip.go:252-263 | router_skip.go:267-278 \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. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"router_skip.go"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"8410a30611e386fe89fc988ab345166f4b1ce198c653dc3d393f59b5f7bf11e5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): internal/fspath/fspath.go:151-161 | path.go:354-364 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit. Check import visibility before settling on that home: \u0060internal/fspath/fspath.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fspath/fspath.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fee395074f06eca494fa3946eb1d376278d10796d83bd03851378d943c9f339"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): path.go:1209-1219 | path.go:1320-1330 \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 \u0060path.go:1209\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, \u0060path.go:1331\u0060 calls \u0060restore\u0060 and \u0060path.go:1220\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":"path.go"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63b2bf28a90b684b15dc99370194a958785175b17af26df4f7e2bf724ce7ae2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): binder/header.go:20-29 | binder/resp_header.go:20-29 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The matched lines also register a scope-exit action (a \u0060defer\u0060-style statement) that runs when the function holding them returns: moved into a called unit it would run when THAT unit returns instead \u2014 before the caller uses what it releases \u2014 so keep the registration at the call site and extract only the work around it, or have the extracted unit hand the resource back for the caller to register."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"binder/header.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f5e946b4e22b32e087abbfdf4e05f8fd214ad7a31914529e34f723b725736b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/tlstest/tls.go:24-33 | internal/tlstest/tls.go:72-81 \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 \u0060internal/tlstest/tls.go:24\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, \u0060internal/tlstest/tls.go:82\u0060 calls \u0060IPv4\u0060 and \u0060internal/tlstest/tls.go:34\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":"internal/tlstest/tls.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f99b63f3543e53453925961e092003387a93fd0ad513a7f90f1e45484b2fea2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): binder/cookie.go:24-32 | binder/header.go:24-32 | binder/resp_header.go:24-32 \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 all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060binder/cookie.go:24\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. 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. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060val\u0060 to \u0060= range req.Header.Cookies(\u0060 in one and \u0060= range req.Header.All(\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"binder/cookie.go"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e3d79d507568dd50cfae5c3584192c7cc1eb308582d8a71a06b77f072149297"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): binder/mapping.go:690-698 | binder/mapping.go:764-772 \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 \u0060binder/mapping.go:690\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":"binder/mapping.go"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"20f70e243586984f0a9a01a30517bb3faeb1322a9841793ba3ad6dced6c87b5a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): client/cookiejar.go:165-173 | client/cookiejar.go:209-216 \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 \u0060client/cookiejar.go:165\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":"client/cookiejar.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"70ff0b37902602c242abdf0664e32e09c3a59fdce45273b5467456a6c1fe5196"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): client/cookiejar.go:648-655 | client/cookiejar.go:693-700 \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":"client/cookiejar.go"},"region":{"startLine":648}}}],"partialFingerprints":{"codehealthFindingId/v1":"a393c744fc1756140bd8101b2a9fb5c72bdf5a032be22fc70a4b034b3e8ebdcd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): client/request.go:174-181 | client/response.go:117-124 \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 \u0060client/request.go:174\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":"client/request.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"581fdac42b7a4131fe6762f35a8b763263de8b6a3447d05fdf019a88389a30b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): constraint.go:500-507 | constraint.go:527-534 \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":"constraint.go"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bd2c067490cafbaa5fcbc696ce117eb95b83b126e45a4b33fd5ad83614c94e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): path.go:412-417 | path.go:454-459 \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 \u0060path.go:412\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":"path.go"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a50524863d01daa26d41de906a937c4fad0eeb68585a7642bed23dd6130b5e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): app.go:1292-1306 | domain.go:807-820 | group.go:213-227 \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 all 3 call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"app.go"},"region":{"startLine":1292}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa5761d1c8ceb7b1f00ca4fccf32c06d3fb13d7c627749dfd69c3d0e685dfa5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): binder/mapping.go:843-853 | internal/schemehost/schemehost.go:224-234 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Check import visibility before settling on that home: \u0060internal/schemehost/schemehost.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"binder/mapping.go"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"487fab02317091c08ca431ef048390533419e9082b8505e1f6d9dce9a7fc6959"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): internal/logtemplate/errors.go:26-32 | middleware/logger/errors.go:25-31 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Check import visibility before settling on that home: \u0060internal/logtemplate/errors.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/logtemplate/errors.go"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"604d9eb51e3d4cd2ce2dce49beb770a533b05ba062a524629ac418b78aec8a18"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): internal/memory/memory.go:164-171 | internal/storage/memory/memory.go:252-259 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/memory/memory.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"9551b90777e1633e8bf3d6c531320889de4f849b6eeb3993debd2db975a2dae3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): internal/memory/memory.go:174-185 | internal/storage/memory/memory.go:262-273 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/memory/memory.go"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"e127b1e323f388bfb2f2de934b27f6a71c3640ac4135a448bcc484753fdd517f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): internal/wiretarget/wiretarget.go:405-414 | middleware/adaptor/adaptor.go:837-846 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Check import visibility before settling on that home: \u0060internal/wiretarget/wiretarget.go\u0060 sits under a restricted \u0060internal\u0060 directory, which only code inside its own subtree is permitted to import from \u2014 so it is reachable from some of these sites and not from others, and being able to see the copies is not the same as being allowed to share them. The home has to be somewhere every one of these sites is permitted to import from; if there is no such place, that restriction may be exactly why the copies are separate."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/wiretarget/wiretarget.go"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd2c4f8c7d5ce32b06fb061b1f5d2b20d190a863482b5466c92d801af6727344"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): middleware/cache/manager.go:102-120 | middleware/limiter/manager.go:77-95 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/manager.go"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf354db2bf7d83056e936607497f969c62789c5769449db1a793f7dd6151cd23"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): middleware/cors/cors.go:69-75 | middleware/csrf/csrf.go:34-40 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cors/cors.go"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aade85a7111420b5d9278c7d3c24f233192f820789ff5388681a63c4c7af534"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): constraint.go:454-464 | constraint.go:543-553 \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":"constraint.go"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb38b91e91020d97e625fcffb367b2c06333d8113929b89af8b5ba4d06d76338"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201325 lines \u00D7 2): internal/tlstest/tls.go:43-67 | internal/tlstest/tls.go:90-112 \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 \u0060internal/tlstest/tls.go:43\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":"internal/tlstest/tls.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1365af4bf29af3ee3ee7471cf2bba240fd5bfc0a69778f1befb901456f144ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): middleware/cache/manager.go:218-234 | middleware/limiter/manager.go:160-176 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. Each matched range is the entire body of the declaration above it, so the region is already a complete unit: move that whole declaration to the shared location and have each site call it, rather than lifting the lines out of their bodies. Any \u0060return\u0060 inside it is the body\u0027s own exit and keeps its meaning in the moved unit."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/manager.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce53df4550f0a97f81c6305244ddf60efefb0686054d63bed4fd59bbd71a3e8c"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: Test_SendFile_ByteRange: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022SendFile byte-range tests are flaky on Windows\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx_test.go"},"region":{"startLine":6551}}}],"partialFingerprints":{"codehealthFindingId/v1":"0576dca53792cd4cfc4d05f3cc33438b25ba8ae09796b4262170927d998eaa76"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: Test_SendFile_ByteRange_RFC9110: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022SendFile byte-range tests are flaky on Windows\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx_test.go"},"region":{"startLine":6637}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f4ebe7d1ac40211a2eaed43ff445f36f41716e4821011baf355c6f2b8acbcf0"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: Test_SendFile_ByteRange_DotSegments: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022SendFile byte-range tests are flaky on Windows\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx_test.go"},"region":{"startLine":6691}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f62df163ce3bafe3482eac5e9eaa927f0fbd67ae73950dfaf03841993ebbe61"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: Test_SendFile_ByteRange_DirectoryIndex: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022SendFile byte-range tests are flaky on Windows\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx_test.go"},"region":{"startLine":6716}}}],"partialFingerprints":{"codehealthFindingId/v1":"238123f85ac7d78cc12ca32412f7b2f9950c0e885d277fb41134400c39600f8b"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: Test_SendFile_ByteRange_IfRangeETag: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022SendFile byte-range tests are flaky on Windows\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx_test.go"},"region":{"startLine":6762}}}],"partialFingerprints":{"codehealthFindingId/v1":"4658aa6b86349e409f3d881047cb079bcf3ff22ce22b50b2e5c54cf8bcd97d1a"}},{"ruleId":"D11","level":"error","message":{"text":"Test declared unreliable: Test_SendFile_KeepsFileServerAnswer: This test is disabled or skipped with a reason naming unreliability \u2014 the repository\u0027s own words: \u0022SendFile byte-range tests are flaky on Windows\u0022. A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository\u0027s own test source \u2014 the suite itself was not re-run, since the reliability runner does not support this ecosystem.)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx_test.go"},"region":{"startLine":6790}}}],"partialFingerprints":{"codehealthFindingId/v1":"1642f74ca6074ac5876d0fe89d6f0f6f56fe608c273b4c412ac638c486ffa9ba"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/cache/cache.go: middleware/cache/cache.go changed 40 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 290 in cache.New at line 225. 31 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/cache/cache.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":"middleware/cache/cache.go"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81a166e8b6995200ed84e0ff36de4ce3c0411acef581091a96f85c96650226d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: res.go: res.go changed 59 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in DefaultRes.SendFile at line 1262. 45 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- res.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":"res.go"},"region":{"startLine":1262}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a2232660399db8792ae3753b6d78bab6eb464aa8e448d07762c8e3d16a2f046"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: app.go: app.go changed 68 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in App.Test at line 1500. 47 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- app.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":"app.go"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"a64c396938487dcb0dca00b166fa5247a1852588e48a1ff427e1b7137261d914"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: router.go: router.go changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in App.next at line 664. 33 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- router.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":"router.go"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad3ddd18d2600d06990329eef318476d6e3ff1a0d26470f3a328f6d761214c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/static/static.go: middleware/static/static.go changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 53 in static.New at line 183. 22 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/static/static.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":"middleware/static/static.go"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"c96e1e5e490a88ec04262006adea5b52d10bb3aa1490ca0655e76e0d735dd949"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: helpers.go: helpers.go changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in fiber.getOffer at line 661. 23 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- helpers.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":"helpers.go"},"region":{"startLine":661}}}],"partialFingerprints":{"codehealthFindingId/v1":"94f644d08e1f8de219a481c6ce17d6a84a4fe78b08a323cae33c5fbb24517dd2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: req.go: req.go changed 65 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in DefaultReq.Fresh at line 553. 36 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- req.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":"req.go"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e7b33d122265125489b3e7c7d2cdf26319626f5b56fd0aefdebab59b0f581d5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: path.go: path.go changed 33 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in routeParser.matchBacktrack at line 1275. 21 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- path.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":"path.go"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcdcdd40b8cc5e9f46ff628735dcb175e7067667001dfee7b285583f5eef3b1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/proxy/balancer.go: middleware/proxy/balancer.go changed 30 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in proxy.Balancer at line 20. 26 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/proxy/balancer.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":"middleware/proxy/balancer.go"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cefeef8875ee398809b055e14e44cd583e257c34538381f7f4177a59bf6ca4e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: ctx.go: ctx.go changed 37 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in DefaultCtx.Endpoint at line 512. 20 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- ctx.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":"ctx.go"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b512577b52b9db48d2773d982576356bc9828cd75e601ef2cab0ff52f487a0e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/adaptor/adaptor.go: middleware/adaptor/adaptor.go changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in adaptor.handlerFunc at line 865. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/adaptor/adaptor.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":"middleware/adaptor/adaptor.go"},"region":{"startLine":865}}}],"partialFingerprints":{"codehealthFindingId/v1":"80cc6144f0853d6b6e702fcf9f1f9c5d65fab3d14f05f3e78de1ad7dd7a85bd9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: client/core.go: client/core.go changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in core.execFunc at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- client/core.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":"client/core.go"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1fa4354fe94e5fbca0738a5ae944701077dae76d099dd5e57cfad46f8746ac0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: mount.go: mount.go changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in App.processSubAppsRoutes at line 776. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- mount.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":"mount.go"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3635bbf882057d5db242ea021d30d3758f61716b5ffac3ec13998be78c952f3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: domain.go: domain.go changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in domainRouter.domainRoutes at line 557. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- domain.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":"domain.go"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aaa7e37cfbd8431f66b0163fc774e2b0b85481dd035708c5d5e0450424ba08c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: extractors/extractors.go: extractors/extractors.go changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in extractors.Chain at line 827. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- extractors/extractors.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":"extractors/extractors.go"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a803e6367842560f3eea9cea7c918ba769fa8be075cdfd8195cdbc3778ca94a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/cors/cors.go: middleware/cors/cors.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 37 in cors.New at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/cors/cors.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":"middleware/cors/cors.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"c874b6769214c2a1ee414674181a12780a9aa9ecabad97730b0b12475240a027"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/idempotency/idempotency.go: middleware/idempotency/idempotency.go changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in idempotency.New at line 83. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/idempotency/idempotency.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":"middleware/idempotency/idempotency.go"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"0931469b250938129382f7095051376ff5e1f8fa6ffdfe9bd48cc43d0099f13a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: client/hooks.go: client/hooks.go changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in client.parserRequestHeader at line 366. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- client/hooks.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":"client/hooks.go"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4bf794562be5d4072cdf3aaf875644ed98b72fa7e09008877f906cb43643843"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/timeout/timeout.go: middleware/timeout/timeout.go changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in timeout.New at line 57. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/timeout/timeout.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":"middleware/timeout/timeout.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa46f569102a7392d2743f8ac1f96ad7726caf81af4dc8133838ad66339c4ba4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/proxy/redirect.go: middleware/proxy/redirect.go changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in proxy.followRedirects at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/proxy/redirect.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":"middleware/proxy/redirect.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc758529b6c31785be0f2fc690f45153187680e00aa072d7d0a0b905e03850c4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: client/client.go: client/client.go changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in client.setConfigToRequest at line 968. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- client/client.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":"client/client.go"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"fccaee56d0ec397852ede7ed03acd70fcfda5a58c16e8fee350cb1593ccffe52"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/logger/tags.go: middleware/logger/tags.go changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in logger.createTagMap at line 93. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/logger/tags.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":"middleware/logger/tags.go"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a43dfa9cd06a4e732c6c1a1b47bd99b1a61e20a9f7fd53e26ec405ecb0a14bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: client/cookiejar.go: client/cookiejar.go changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in CookieJar.parseCookiesFromResp at line 531. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- client/cookiejar.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":"client/cookiejar.go"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0db3e192f4d725830c8e9860a6ae7a835887183b7c722e3f35e51a1a626a9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/etag/etag.go: middleware/etag/etag.go changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in etag.New at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/etag/etag.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":"middleware/etag/etag.go"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a4d72de0efa0fe0c6c22a147b8c49db08ae954fcdc2a75d122b805e9db794aa"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/session/store.go: middleware/session/store.go changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Store.getSession at line 188. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/session/store.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":"middleware/session/store.go"},"region":{"startLine":188}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0ce0d73cb9f271e3b0a20292113d1a9100dcac12f7ef16513e4ccaf253f5412"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: listen.go: listen.go changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in App.Listen at line 236. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- listen.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":"listen.go"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c8ada3ca5d5ddbf1a4364ed311300c2ea55255b08adc8e85f652d5f91975b0b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/csrf/csrf.go: middleware/csrf/csrf.go changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in csrf.New at line 80. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/csrf/csrf.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":"middleware/csrf/csrf.go"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"d882b29227c96ad1704023a1efcdf0c0a5321c716b50e3f1d508d707360f30a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/limiter/limiter_sliding.go: middleware/limiter/limiter_sliding.go changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in SlidingWindow.New at line 14. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/limiter/limiter_sliding.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":"middleware/limiter/limiter_sliding.go"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"382bee4bd0be1918b0f3c4cc436a8e42b0af43575f7398a12677ecac808ac57f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: client/transport.go: client/transport.go changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in client.doRedirectsWithClient at line 545. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- client/transport.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":"client/transport.go"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"64aee869d71376a8b6c8acedab9501160a96664cc5eb368e3d4169c94829e836"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/basicauth/basicauth.go: middleware/basicauth/basicauth.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in basicauth.New at line 34. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/basicauth/basicauth.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":"middleware/basicauth/basicauth.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f293e1fbba64feed12546c4bbea81508e1f3d5025d3d42bf254398f694384e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: internal/wiretarget/wiretarget.go: internal/wiretarget/wiretarget.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in wiretarget.SegmentsAsRouted at line 195. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- internal/wiretarget/wiretarget.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/wiretarget/wiretarget.go"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9538dceadc753f1be0b6e5079dd050194fb30d6dc5e4ea0ef42b4ab6f558536"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: middleware/logger/logger.go: middleware/logger/logger.go changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in logger.New at line 30. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/logger/logger.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":"middleware/logger/logger.go"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"56034ccb2197526d13573d13f7cc1217e69e6e0aa20b8c338f4caab226bd702e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/proxy/proxy.go: middleware/proxy/proxy.go changed 38 times in last 90 days and 34 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 12 (its worst body is proxy.doActionWithPolicy at line 164), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: hold a streamed upstream response to the proxy\u0027s body bound\u201D; \u201C\uD83D\uDC1B bug: hold the default proxy request bound atomically\u201D; \u201C\uD83D\uDC1B bug: keep a streamed upstream response\u0027s trailer section off the client\u0027s response\u201D; \u201C\uD83D\uDC1B bug: fix header, body, routing and session handling defects\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/proxy/proxy.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":"middleware/proxy/proxy.go"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9017f7426c6c64e3df01e91e94d6d4dde68bd0c8e9cc419d99645724962d37"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/redirect/redirect.go: middleware/redirect/redirect.go changed 39 times in last 90 days and 23 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is redirect.authoritySpan at line 315), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: skip rewrite and redirect rules whose capture adds a dot segment\u201D; \u201C\uD83D\uDC1B bug: read \u0022$10\u0022 as the tenth capture in redirect and rewrite targets\u201D; \u201Cfix(redirect): fold what Go folds, and read an anchor as consuming nothing\u201D; \u201Cfix(redirect): read quoted pipes, case folding, and bound deep nesting\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/redirect/redirect.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":"middleware/redirect/redirect.go"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0889d2f7dfb9420e25a596abb306d3693b08cb338cece4e579351205238e319"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: binder/mapping.go: binder/mapping.go changed 27 times in last 90 days and 18 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is binder.structKeyKind at line 858), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: keep pooling bind decoders of forms with a few thousand keys\u201D; \u201C\uD83D\uDC1B bug: budget nested bind indexes in bytes, cached keys per type\u201D; \u201C\uD83D\uDC1B bug: count every nested slice index, only for types that multiply slices\u201D; \u201C\uD83D\uDC1B bug: limit the slice elements nested form keys may allocate\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- binder/mapping.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":"binder/mapping.go"},"region":{"startLine":858}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cc009607ba325391f9f959bb38c05d89452fbe53c1cc1f7e669ab63dd863ab5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/fieldname/fieldname.go: internal/fieldname/fieldname.go changed 22 times in last 90 days and 16 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 13 (its worst body is fieldname.KeepReceivedOrder at line 318), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: do not store a response varying on a header changed behind the cache\u201D; \u201C\uD83D\uDC1B bug: fix header, body, routing and session handling defects\u201D; \u201C\uD83D\uDC1B bug: drop a streamed trailer section in place whatever its size\u201D; \u201C\uD83D\uDC1B bug: read a response header line its own Trailer field names\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- internal/fieldname/fieldname.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/fieldname/fieldname.go"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a945fdc546a3c7b75f40addeabce062e0aca2abdce4e49a95c00040ed5c50d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/session/session.go: middleware/session/session.go changed 22 times in last 90 days and 15 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is Session.saveSessionWithContext at line 434), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: do not read session data holding a NaN as edited in place\u201D; \u201C\uD83D\uDC1B bug: count a value changed in place as the request\u0027s own session change\u201D; \u201C\uD83D\uDC1B bug: fix header, body, routing and session handling defects\u201D; \u201C\uD83D\uDC1B bug: keep a running request from undoing a session change it did not make\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/session/session.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":"middleware/session/session.go"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"496d7dbfc7d303e2553c30750066dcc61c8c18d631becedcf982f9c39909a930"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/proxy/headers.go: middleware/proxy/headers.go changed 17 times in last 90 days and 14 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is proxy.stripHopByHopRequestHeaders at line 64), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: fix header, body, routing and session handling defects\u201D; \u201C\uD83D\uDC1B bug: drop a held trailer section whatever the hop-by-hop policy\u201D; \u201C\uD83D\uDC1B bug: keep repeated header lines in received order behind the adaptor\u201D; \u201C\uD83D\uDC1B bug: fail a streamed body read past the trailer name cap\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/proxy/headers.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":"middleware/proxy/headers.go"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"86a0db4d072300ea3f83669eb588c5f8034858972b9e4234c500bd09d590ba10"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/hostauthorization/hostauthorization.go: middleware/hostauthorization/hostauthorization.go changed 14 times in last 90 days and 11 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is hostauthorization.isValidHostSyntax at line 237), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83E\uDE79 fix: compare IPv6 hosts by address in CORS, CSRF and redirects\u201D; \u201C\uD83E\uDE79 fix: refuse hostauthorization entries no request could match\u201D; \u201C\uD83E\uDE79 fix: parse bracketed hosts as IPv6 only and refuse IP wildcard entries\u201D; \u201C\uD83D\uDC1B bug: treat IPv4-mapped hosts as IPv4 and refuse bracketed names\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/hostauthorization/hostauthorization.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":"middleware/hostauthorization/hostauthorization.go"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2367818735897bb8dbc79ecadb468bc7e34b0330a9f40335f19092f666df9b7b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/cache/utils.go: middleware/cache/utils.go changed 11 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is cache.appendAuthHash at line 295), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: do not store a response varying on a header changed behind the cache\u201D; \u201C\uD83D\uDC1B bug: count the cookies of each name in one pass\u201D; \u201C\uD83D\uDC1B bug: count cookies by name when telling one added behind the cache\u201D; \u201C\uD83D\uDC1B bug: do not store a response varying on a cookie added behind the cache\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/cache/utils.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":"middleware/cache/utils.go"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"2441c49f8740b99be0b3f13f007e7ce31c742403a0f7a22d8c00e2b4305b5646"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/cache/config.go: middleware/cache/config.go changed 10 times in last 90 days and 10 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is cache.configDefault at line 198), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: escape a custom cache key so it cannot spell a Vary variant\u0027s key\u201D; \u201C\uD83D\uDC1B bug: count each cache entry\u0027s key and stored headers toward MaxBytes\u201D; \u201C\uD83D\uDC1B bug: cap the number of cache entries along with MaxBytes\u201D; \u201C\uD83D\uDC1B bug: count cache entries with an empty body toward MaxBytes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/cache/config.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/cache/config.go"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c5db4410e9e6aab457b51b04100047a5361f319a8fa3869488ca8cbd3d374c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/keyauth/keyauth.go: middleware/keyauth/keyauth.go changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is keyauth.New at line 31), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: leave out the Bearer error parameters for a rejected key in another scheme\u201D; \u201C\uD83D\uDC1B bug: keep the keyauth Bearer error parameters for Bearer attempts only\u201D; \u201C\uD83D\uDC1B bug: keep the keyauth Bearer error parameters for a malformed token\u201D; \u201C\uD83D\uDC1B bug: omit the Bearer error parameters from the keyauth challenge when no credentials are sent\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/keyauth/keyauth.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":"middleware/keyauth/keyauth.go"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"64f548cd6f1099b66c46d02d7d1f54258bef109685b55ce9b088ec0b83868f74"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/encryptcookie/encryptcookie.go: middleware/encryptcookie/encryptcookie.go changed 8 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is encryptcookie.decryptRequestCookies at line 103), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: keep responsetime and encryptcookie off a timed-out response\u201D; \u201C\uD83D\uDC1B bug: drop undecryptable request cookies in linear time\u201D; \u201C\uD83D\uDC1B bug: encrypt every Set-Cookie line in encryptcookie\u201D; \u201C\uD83D\uDC1B bug: keep the first cookie value that decrypts when a name repeats\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/encryptcookie/encryptcookie.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":"middleware/encryptcookie/encryptcookie.go"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"234d9e969ee3f08b2e36f82141e86f5fe3fae007c1464badae10144e3b7b35dc"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/proxy/response.go: middleware/proxy/response.go changed 7 times in last 90 days and 7 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is proxy.adoptUpstreamResponse at line 35), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: spell out what bounds a custom client\u0027s streams and the answer a hook cannot keep\u201D; \u201C\uD83D\uDC1B bug: keep a response the ModifyResponse hook sets after a streamed body read failed\u201D; \u201C\uD83D\uDC1B bug: hold a streamed upstream response to the proxy\u0027s body bound\u201D; \u201C\uD83D\uDC1B bug: move a buffered upstream body into the response instead of copying it\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/proxy/response.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":"middleware/proxy/response.go"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"d55e03d505ea69c8e3addae39c5c586a15c8fbe7b29c7d006ebffebc06a1d0b0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: redirect.go: redirect.go changed 8 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is Redirect.Message at line 267), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: pool a Redirect by its message count, not its capacity\u201D; \u201C\uD83D\uDC1B bug: keep oversized Redirect message arrays out of the pool\u201D; \u201C\uD83D\uDC1B bug: fix client, session, basicauth and other bugs found in the docs audit\u201D; \u201C\uD83E\uDDF9 chore: trim the comments added by the audit fixes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- redirect.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":"redirect.go"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae3b3d79a5993ced2536aad5c94c5226d152b36a99fd51f8574a792cec0245a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/cache/vary.go: middleware/cache/vary.go changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is cache.parseVary at line 34), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: do not store a response varying on a header changed behind the cache\u201D; \u201C\uD83D\uDC1B bug: do not store a response varying on a cookie added behind the cache\u201D; \u201C\uD83D\uDC1B bug: fix header, body, routing and session handling defects\u201D; \u201C\uD83D\uDC1B bug: key a stored variant by the headers its lookup saw\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/cache/vary.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":"middleware/cache/vary.go"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"98367a1d1057902903f641867a9e4cadc0126d9552fa9318cf287e4376e4d017"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/timeout/config.go: middleware/timeout/config.go changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is timeout.configDefault at line 43), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: answer 500 when OnTimeout panics after the deadline\u201D; \u201C\uD83D\uDC1B bug: run OnTimeout on a ctx of its own once the deadline passed\u201D; \u201C\uD83D\uDC1B bug: return an error from timeout when OnTimeout answers without one\u201D; \u201C\uD83D\uDC1B bug: answer a timed-out handler with 503, not 408\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/timeout/config.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/timeout/config.go"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"617a75cc7b27b1bc12652f5a574598b6899fcb2bb7edbfa4bfcfb1f66bf2257c"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: client/response.go: client/response.go changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is Response.Save at line 203), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: yield each header key once in Headers()\u201D; \u201C\uD83D\uDC1B bug: copy response header keys before reading their values\u201D; \u201C\uD83D\uDC1B bug: snapshot request ownership before the transport goroutine starts\u201D; \u201C\uD83D\uDC1B bug: snapshot client request ownership on response\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- client/response.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":"client/response.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e9ef5ac02617fd02d01343f5780d5cd1d81e36b70d331e835c10e771b9330ef"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: state.go: state.go changed 6 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 3 (its worst body is State.setService at line 249), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: close the review findings from the maintainer pass\u201D; \u201C\uD83D\uDC1B bug: register a service once per name and skip the auto-HEAD scan when nothing changed\u201D; \u201C\uD83D\uDC1B bug: match services by name when removing them, and make the rollover credit test deterministic\u201D; \u201C\uD83E\uDDF9 chore: drop the comments on struct fields the audit fixes added\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- state.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":"state.go"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd581ead2168715de82ef52d022938d4f0e430448db928e618be3ebe03c2390"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/cache/keygen.go: middleware/cache/keygen.go changed 8 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is cache.appendCanonicalQueryString at line 138), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: keep the order of a repeated query parameter\u0027s values in the cache key\u201D; \u201C\uD83D\uDC1B bug: escape a custom cache key so it cannot spell a Vary variant\u0027s key\u201D; \u201C\uD83D\uDC1B bug: key cached QUERY responses by Content-Type and Content-Encoding\u201D; \u201C\uD83D\uDC1B bug: end a refused credential\u0027s cached entry and stop serving it stale\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/cache/keygen.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":"middleware/cache/keygen.go"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"639cf2b5e0694d922b9cb22db3d1e9164398d3cfca9a78b747de8dde7dbd7c5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/cache/manager.go: middleware/cache/manager.go changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is item.decodable at line 65), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: count each cache entry\u0027s key and stored headers toward MaxBytes\u201D; \u201C\uD83D\uDC1B bug: do not store cache entries an external Storage cannot decode\u201D; \u201C\uD83D\uDC1B bug: finish revalidation manifest cleanup and retry orphan bodies\u201D; \u201C\uD83D\uDC1B bug: replay Vary on cache hits and mark credential-keyed entries private\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/cache/manager.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":"middleware/cache/manager.go"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"47fa296da452877363ed0f546f843468c8a2dced0f77913ad4d03208ca55864f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/basicauth/config.go: middleware/basicauth/config.go changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is basicauth.configDefault at line 118), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: fix client, session, basicauth and other bugs found in the docs audit\u201D; \u201C\uD83D\uDC1B bug: refuse a repeated Authorization field in basicauth\u201D; \u201C\uD83D\uDC1B bug: run one check per hash tier so mixed bcrypt costs stay indistinguishable\u201D; \u201C\uD83D\uDC1B bug: equalize basicauth verification time across mixed hash algorithms\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/basicauth/config.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/basicauth/config.go"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"0291cc6f27179443c76555340f7dcf61631c78cbb5569cc11b0ebf95c7500e7a"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/memory/memory.go: internal/memory/memory.go changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is Storage.gc at line 127), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B fix: make uncacheable revalidation cleanup generation-safe\u201D; \u201C\uD83D\uDC1B bug: saturate absolute expiries, carry route ids into copies, and tighten attachment and promotion\u201D; \u201C\uD83D\uDC1B bug: round durations without overflowing and scope Name to the latest registration\u201D; \u201C\uD83E\uDDF9 chore: trim the comments added by the audit fixes\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- internal/memory/memory.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/memory/memory.go"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e14b61eba667813c7839d8082b638e3df2e26ce059979a8e70f8e88d43f30a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/proxy/client.go: middleware/proxy/client.go changed 7 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is proxy.selectClient at line 78), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: hold a streamed upstream response to the proxy\u0027s body bound\u201D; \u201C\uD83D\uDC1B bug: hold the default proxy request bound atomically\u201D; \u201C\uD83D\uDC1B bug: fix header, body, routing and session handling defects\u201D; \u201C\uD83D\uDC1B bug: fix the findings of the max-effort review of the proxy and limiter\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/proxy/client.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":"middleware/proxy/client.go"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c99b0a848f19ba7fd01bd829820137a2f35e0abbb9f25b982837f39f3613e28"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/hostauthorization/config.go: middleware/hostauthorization/config.go changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 5 (its worst body is hostauthorization.configDefault at line 58), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83E\uDE79 fix: refuse hostauthorization entries no request could match\u201D; \u201C\uD83E\uDE79 fix: parse bracketed hosts as IPv6 only and refuse IP wildcard entries\u201D; \u201C\uD83D\uDC1B bug: treat IPv4-mapped hosts as IPv4 and refuse bracketed names\u201D; \u201C\uD83E\uDE79 fix: parse IPv6 hosts once and keep refused requests allocation-free\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/hostauthorization/config.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/hostauthorization/config.go"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"79dcc7341fa1f268461516202eb0e806b8dd6cb477e493a9fe482aa2f7098bf4"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: internal/storage/memory/memory.go: internal/storage/memory/memory.go changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is Storage.gc at line 165), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: saturate absolute expiries, carry route ids into copies, and tighten attachment and promotion\u201D; \u201C\uD83D\uDC1B bug: round durations without overflowing and scope Name to the latest registration\u201D; \u201C\uD83E\uDDF9 chore: trim the comments added by the audit fixes\u201D; \u201C\uD83D\uDC1B bug: fix cache accounting, TTL rounding, session reset, etag, keyauth and app lifecycle issues\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- internal/storage/memory/memory.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"internal/storage/memory/memory.go"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d9549dea64bd9d9b39db550fbeb76e2dccdc19d77db34802b551da81b810b58"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/limiter/manager.go: middleware/limiter/manager.go changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is manager.get at line 128), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: namespace session, csrf and limiter keys in a shared storage\u201D; \u201C\uD83D\uDC1B bug: fix the proxy and limiter review findings\u201D; \u201C\uD83D\uDC1B fix(limiter): bound the rate-limit key before it reaches storage\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/limiter/manager.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":"middleware/limiter/manager.go"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ddc44e7565616584e4316d29532c22dc0e7fbbddf1ae8247ff43630c498c24"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/proxy/config.go: middleware/proxy/config.go changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is proxy.configDefault at line 124), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: hold a streamed upstream response to the proxy\u0027s body bound\u201D; \u201C\uD83D\uDC1B bug: fix header, body, routing and session handling defects\u201D; \u201C\uD83D\uDC1B bug: fix the proxy and limiter review findings\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/proxy/config.go\u0060: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/proxy/config.go"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b7e83a5fbc219f64f64e4fd4e0002f46dcac3f84a92fcd0515bddd7b106872e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/cache/heap.go: middleware/cache/heap.go changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 7 (its worst body is indexedHeap.matches at line 187), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: drop a Vary manifest once no cached entry stored under it is left\u201D; \u201C\uD83D\uDC1B fix: avoid cache restore blocking and duplicate heap nodes\u201D; \u201C\uD83D\uDC1B fix: make uncacheable revalidation cleanup generation-safe\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/cache/heap.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":"middleware/cache/heap.go"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"53822059a273c7be77532ff815899c5b2ec1bb23974b17fd673624db164e52b6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: group.go: group.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 4 (its worst body is Group.Name at line 22), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: panic when Use receives two sub-apps or two path arguments\u201D; \u201C\uD83D\uDC1B bug: panic when Use receives handlers and a sub-app in one call\u201D; \u201C\uD83D\uDC1B bug: close the review findings from the maintainer pass\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- group.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":"group.go"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac02f8299aa0ad90bde5289794071e8336872c87acd050c12f22a9243eb5e711"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: addon/retry/exponential_backoff.go: addon/retry/exponential_backoff.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 6 (its worst body is ExponentialBackoff.withDefaults at line 45), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: fix client, session, basicauth and other bugs found in the docs audit\u201D; \u201C\uD83E\uDDF9 chore: trim the comments added by the audit fixes\u201D; \u201C\uD83D\uDC1B bug: fix adaptor, retry, log, paginate and favicon issues\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- addon/retry/exponential_backoff.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":"addon/retry/exponential_backoff.go"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b52662661cd9bae2ad27b85d39db2c1eb177a44c17b4c6fc51d737408dc6ae"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: services.go: services.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is App.startServices at line 89), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: close the review findings from the maintainer pass\u201D; \u201C\uD83E\uDDF9 chore: trim the comments added by the audit fixes\u201D; \u201C\uD83D\uDC1B bug: fix cache accounting, TTL rounding, session reset, etag, keyauth and app lifecycle issues\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- services.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":"services.go"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"23e054f6e23d24a9f42087dd01e3ed05bab01226e5e3ca41909ea2ad347524b5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: middleware/sse/event.go: middleware/sse/event.go changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 11 (its worst body is sse.writeEvent at line 33), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: \u201C\uD83D\uDC1B bug: round durations without overflowing and scope Name to the latest registration\u201D; \u201C\uD83E\uDDF9 chore: trim the comments added by the audit fixes\u201D; \u201C\uD83D\uDC1B bug: fix timeout, proxy, static, compress and sse middleware issues\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:42:14 \u002B01:00\u0027 --until=\u00272026-11-13 10:42:14 \u002B01:00\u0027 --full-history --no-merges -- middleware/sse/event.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":"middleware/sse/event.go"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"626824704af306835d9f0c309b5507d8d3c3c896387631cfad5295557050bcd8"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 3 significant file(s) lose their only recent owner: adapter.go, middleware/session/data.go, internal/logtemplate/template.go. Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3c40a2e23bca492446b28fa4c901ff060ac238030b3be8bb3c27afe20dc0ba69"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 1 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (5 single-owned of 134 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; 134 of the 208 production source files in this repository met that bar). They are anonymized user #2 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: middleware/paginate/config.go."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Create WithOverrideEmptyValues \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":"bind.go"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"61dd3671e0b21f96b77ff6caafa1ab837b577af8d8550351c2c954211f0a093c"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Could be improved: 53.8 ns/op  32 B/op  1 allocs/op \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":"ctx.go"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"face3e0fb8633796b37fa5a40a132b9576aacb528f88deaedbe4a5002360e863"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: We should clean this up \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx_test.go"},"region":{"startLine":2025}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fa4e3aca017df07b32858a3dc9d76924886cd4a5408b723e5db2d0cb27fbc4e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO We should clean this up \u2014 source code is not a task system: move the work to your tracker and leave a reference instead (e.g. \u0060// REF: #123\u0060), so the task is planned where tasks live and the ticket links back to the code."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx_test.go"},"region":{"startLine":5562}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78565b2b1bcece8ca6c1acc214d6c562743ee9365bf761e97705afae9dfa164"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //nolint:depguard // TODO: Required to capture output, use internal log package instead \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":"listen_test.go"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"558a3d664151ab0f61e7ff6a8a47ef427d360108b82276db1a4ddf3c2ca4c59d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // future TODO: add support for optional groups \u0022/abc(/def)?\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":"path.go"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e0dd2b24805f8e2ff49a08fc3fa8a07eaea874507e2b4fddb1a030f1186e737"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //nolint:predeclared // TODO: Rename to some non-builtin \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":"middleware/recover/config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43eb0e934cc06317635acf8f374d1b2e184416a2275c853afad60c9307cee4d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //nolint:predeclared // TODO: Rename to some non-builtin \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":"middleware/recover/recover.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f1f460f78000b71edddacc7b174bd18db92acbb8572bdfd12b872512fddaeb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: //nolint:predeclared // TODO: Rename to some non-builtin \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":"middleware/recover/recover_test.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25850bab60b5cb4fe8bb7ec949e6aea91789bb6fdaea568ca405f6a94c934056"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c310af783de50f9e94af422a526004169d02aff668c20fea8bb9ecdf5f5b180"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d5b8f11381d61a58459ffc7c595fd52d09c03c711894a63a9578043d2338412b"},"taxa":[{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83469b39922508e16a07f1286f06a231e6bb077c68efb685b49a33d7e9eacc5c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6ac52ea0a9caacace7119a515790d29ce661b3d2c733a19fd5e974aa26a02c22"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c049b6b10864a0f950a8e81be4543fb60340961de346a5c753a88cad67c6217c"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"bc4df0eb11af0d185d910e4b7c88894c3a3c46f157f4c328ce7b5c1f4b30744e"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1ccf0d47932654dc4842a344732ecd6361a2c7c5fb3bf7d5872f395cc14e239a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"11bcc34126a6a421c32de7d6867c58cab832fcd34801bdc69db2ea50476a9c53"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"91bacd43aedf9f521c19a743c29db2194d98d20fca35340a56ae6d26393e6de2"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"0b1f6aa47ac6ed1dacadb7de87eb4e266117eb64a4491f34acd7cfe7d91bb17e"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b26e4d63129cb8f9eb97ce9b999163b437f4f780c070995a02040fd504ed7d56"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"1eb98d37bce40d3f5e51ae493dd4974ec83a42097929254222f21a7b20d1b41f"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f151509f60cc29ee67ebb3e3c0a7edfc942d099098ef0500386d4678710942d0"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"891b21fe71aef1b5ebb529809926afdd6e61aa237fa9ecce0516077eb66e2604"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c94e826adb724e5ce629e0980d3d1e52a266608f48cadb64822bd2aca1326034"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"34a66167d57378ac282b59c580f20485f925a4c2bdfe491179a47bee524e3cf7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"f90980b81b87751c2d51aa95e35c1f351df18ac9b42d5e64c40758aa0506dfea"},"taxa":[{"id":"CWE-269","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-4","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"d360ab7acdb4c38025682f2b86e908e0a4f5b1e21cf6d0ead3a5ea3d530e00d7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"35273adc2e386d21567d6d29f2a25eec4b353d38659b54ad8d93646191c371e7"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e9c3f24cc420d21baddf1886abd33095b7a5fbd34eb6c4f216a0eaa14c412b13"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e2fd481bf0c2aa2eff22edd1f9b757c559dbfbbd93c43df4e13362c05480a24a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fef84eb7a38121dbe03d81cfaefd04c4a006600e19e79fad9a27610ef7d241a"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"376037412bacfc4d1e4080688ae93bd65d67e15bf565ffd3b1b3640daefa0d0d"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"381c1a18281fb3d946e95d11f61c986b2b18dbad7894ffe66a052dc7c1d6c3aa"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"85f4c94bc6c482e637e30bc0d7d236cdd23cd223f19147d17fe1d389106a44a1"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-8","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"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":"6e87f2282851a084038848960268edae06ee6b49e6283bbafadcaf89a10a6825"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"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":"29a1fc3b38611441d18e6dd41eaec8194fcbd529ba4bfa636909962220445b64"},"taxa":[{"id":"CWE-330","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A04:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"0372f1c18e4835a949755ee75b7c0ffdd15f84f2e6e50efa97b1e0ace79da86a"},"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":"67e54a6060e1a5af09ab6c798bba3a9b810946332f8b86c2377e9ba209b71e96"},"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":"1cd36f24f14b740288d1d1284cb202b5a066e28dba0fd1e4b9a6631d9b96eb54"},"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":"b102ab30e4e6c849c01d78209afa08e28d8db4d7263a0bf2fbbe527427e9484e"},"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":"fd291152df874a1cac00eb6b3f33b4d59c1ba2042ea60ab76d21e5b0e11ee55c"},"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":"7e0d75e59e99e956e35ed96f260f5b764c82c94fed751342bb9bedc03f01be15"},"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":"7f7bb0ea50476e23d6a5d82d96c6fef6f5a7238303698ba0327ccaeba7d46ab9"},"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":"c5f0c46a746705fe7fb1fec6260b14041bf07f6f574671d65a28bcf006478491"},"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":"b8fbe35c3f2026ef76a39726d016c8cc1917f3b85e1b41527448135f03560c24"},"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":"d2cd4437b7be35d57a4cdd45425982677203e5498a05982ba428a10fd3ba9aee"},"properties":{"dependency":{"package":"stdlib","version":"1.26.0","advisory":"GO-2026-4599","aliases":["BIT-golang-2026-111943","BIT-golang-2026-25679","BIT-golang-2026-27137","BIT-golang-2026-27138","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-33810","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-46600","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]","GO-2026-4600","GO-2026-4601","GO-2026-4602","GO-2026-4603","GO-2026-4864","GO-2026-4865","GO-2026-4866","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-5942","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"],"reachability":{"kind":"production","file":"internal/origin/origin.go","line":61,"symbol":"url.Parse"}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 2 of 134 analysed file(s) have no living knowledge left \u2014 their last meaningful change has decayed away, so if one breaks, no one currently understands it (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; 134 of the 208 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each \u2014 most significant first: internal/tlstest/tls.go, middleware/paginate/config.go. 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":"internal/tlstest/tls.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d89d9bd26f6ac34f765b6e1909c8e06f2fd724f1f2b2aa8d501f426a9db968"}},{"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":"middleware/paginate/config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0a5b94655e3c99443ca67ba0d8b6fb84f6cf417af9a912bd6c6e1dc2f6706d5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: config.go \u2194 proxy.go: \u0060middleware/proxy/config.go\u0060 and \u0060middleware/proxy/proxy.go\u0060 change together 69% of the time (9 of the 13 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets). They sit in the same directory, and in this ecosystem sibling files there normally share one namespace/package \u2014 so a direct reference between them needs no import and this pass cannot see whether one exists. Read the pair before acting: if one file only DECLARES what the other consumes (a constants/types file beside its user), the co-change is definitional and the question is whether the split earns its keep; if they duplicate structure, extract the common part into a shared function or type they both call; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060a545e1a8\u0060 \uD83D\uDD12 security: harden proxy middleware against SSRF, redirect downgrade\u2026; \u0060fcd66f5a\u0060 \uD83D\uDD25 feat: Add KeepConnectionHeader option to Proxy middleware (#3662); \u0060aae8892c\u0060 Improve proxy middleware (#3468) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/proxy/config.go"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"435ff70e914ea68db3c36848d807f470fe456d868cf54766202b55fdbfbadcab"}},{"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":"90f83b4fa27db32740afe9540c905f3c0499caed87f61049a8a903ecc95b41c3"},"taxa":[{"id":"CICD-SEC-8","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":"9cc08ee4e1631eaed08f9c5a5809b4f52443da6da15fddcc65b7c358f203c17c"},"taxa":[{"id":"CICD-SEC-4","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":"d657599f6f99da1927d3377533dfc0888b34c4d84aa7d5579841fd72d0e39bce"},"taxa":[{"id":"CICD-SEC-6","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":"c593d4dbd23724f337bfb8d2c1653812f143ae255bd9b59d4b3e9c37779fa6f4"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AX2","level":"warning","message":{"text":"Stateful handler dependency: DefaultCtx: \u0060DefaultCtx\u0060 is shared by every request (\u0060configDependentPaths\u0060 is called per request from the fasthttp handler \u0060DefaultCtx.Reset\u0060, on the one \u0060DefaultCtx\u0060 value that handler\u0027s shared receiver holds) but writes its fields outside any lock (path, detectionPath, treePathHash, pathSlashes, pathPrint, indexRoute; e.g. \u0060path\u0060 in \u0060configDependentPaths\u0060 at line 838). Unsynchronised concurrent writes are a data race in Go: an update is lost or a value tears, and a concurrent map write aborts the process."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"ctx.go"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1d0f1c2e55ea7785e8579e89403559c83d1c09a6a9717e085dcff990552484"}},{"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":"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":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!req.Header.IsGet() \u0026\u0026 !req.Header.IsHead()\u0060 appears character-identically in 2 files \u2014 client/transport.go, middleware/proxy/redirect.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":"client/transport.go"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"98e0cc4349209a729039702a800450983133124b4f2826995faececa8d963a11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(b \u003E= \u00270\u0027 \u0026\u0026 b \u003C= \u00279\u0027) || (b \u003E= \u0027a\u0027 \u0026\u0026 b \u003C= \u0027f\u0027) || (b \u003E= \u0027A\u0027 \u0026\u0026 b \u003C= \u0027F\u0027)\u0060 appears character-identically in 2 files \u2014 internal/wiretarget/wiretarget.go, middleware/proxy/upstream.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/wiretarget/wiretarget.go"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"e846c831ed00a6348560725d62b846eafa2f9997dfbd4adb30936bce4d70e347"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.IsAbandoned() \u0026\u0026 c.RequestCtx().LastTimeoutErrorResponse() != nil\u0060 appears character-identically in 3 files \u2014 middleware/encryptcookie/encryptcookie.go, middleware/responsetime/responsetime.go, middleware/session/middleware.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":"middleware/encryptcookie/encryptcookie.go"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6a51688c808a793a3a104f6384e50b747ae34d4066e2ed94f6786a64a82aa76"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.Method() != fiber.MethodGet \u0026\u0026 c.Method() != fiber.MethodHead\u0060 appears character-identically in 2 files \u2014 middleware/favicon/favicon.go, middleware/healthcheck/healthcheck.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":"middleware/favicon/favicon.go"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"b147c59e0f762fb89093f784b39101138e2fab112313aae4cf4d7dd2c800c950"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060err != nil \u0026\u0026 !errors.Is(err, errCacheMiss)\u0060 appears character-identically in 2 files \u2014 middleware/cache/cache.go, middleware/cache/credential.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":"middleware/cache/cache.go"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bc240a106aa995e2133f55cc95a79c9c4fc401d2ff0ad9fa519d8d7031ccd93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(cfg.Rules) \u003E 0 \u0026\u0026 len(cfg.RuleList) \u003E 0\u0060 appears character-identically in 2 files \u2014 middleware/redirect/config.go, middleware/rewrite/config.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":"middleware/redirect/config.go"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"83916d2e05b953421e3c7651f65662a18ff9696d05584a267cdcab9d44ff6ea5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(host) \u003E= 2 \u0026\u0026 host[0] == \u0027[\u0027 \u0026\u0026 host[len(host)-1] == \u0027]\u0027\u0060 appears character-identically in 2 files \u2014 client/cookiejar.go, client/transport.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":"client/cookiejar.go"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"f544b6d63480ed05119e1cdc6de1bc96cba4f6cf6facf614ebe7a659609f27d1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(key) == 1 \u0026\u0026 (key[0] == \u0027q\u0027 || key[0] == \u0027Q\u0027)\u0060 appears character-identically in 2 files \u2014 helpers.go, middleware/compress/compress.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":"helpers.go"},"region":{"startLine":704}}}],"partialFingerprints":{"codehealthFindingId/v1":"e34a79a5bbf3041d1a1845c0fe232315f0361cdef9d6e2e42b897fd456155610"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(layouts) == 0 \u0026\u0026 app.config.ViewsLayout != \u0022\u0022\u0060 appears character-identically in 2 files \u2014 app.go, res.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":"app.go"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c0732044817a2b4300319539709a0d82569a602d5d1a03e3d486901e26281fe"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(value) \u003E= 2 \u0026\u0026 value[0] == \u0027\u0022\u0027 \u0026\u0026 value[len(value)-1] == \u0027\u0022\u0027\u0060 appears character-identically in 2 files \u2014 middleware/cache/cachecontrol.go, res.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":"middleware/cache/cachecontrol.go"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdba3c6c1135ef6c526309cc01ecfaab6ae30cd59107074dd76b75a055209e1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060method != fiber.MethodGet \u0026\u0026 method != fiber.MethodHead\u0060 appears character-identically in 2 files \u2014 middleware/envvar/envvar.go, middleware/static/static.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":"middleware/envvar/envvar.go"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0d3965b155d3843ae85bc024b3e1e152d129cf2e5b7042bd4283bea1ad3420f"}},{"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":"redirect.go"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5d037b291cb32365c76524cc8ad8a5acce834c3492d25b4cb580f5ca531c8da"}},{"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":"redirect.go"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"e06a201c270d26345348533e8b139dacbd9acbd5e92ddef34f17e850de3e85e8"}},{"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":"req.go"},"region":{"startLine":621}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ece77494c2d4f73d2cf52307b830ee02b99d5f8be6a8f2d21226e68645ae0ca"}},{"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":"req.go"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e669eb1868b2e2c60e9683b79751596f935ca7cc5307c1283ad8258a559aba6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if streamErr != 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":"middleware/sse/sse.go"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3ab9ec69f153b048aa93eb9f75d53e7a542ef76ef807e9957b6392f819b472"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := s.Comment(\u0022\u0022); err != nil\u0060 takes every exception and records none of it \u2014 the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"middleware/sse/sse.go"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"0258e10eabc322f3242350aac305d253b18b602c70c6133cb5354469f4088b85"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := gob.NewDecoder(bytes.NewReader(s.rawData)).Decode(\u0026snapshot); 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":"middleware/session/session.go"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"301ed89228444af7da4cbecc9b092c327196b4a1c9a00afcb9246bfa6c0e2926"}},{"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":"middleware/paginate/page_info.go"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"14250ef4cea55ba1593abcabc87f26d08dc4e202db2a1a9ac1508cb3bc5b1662"}},{"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":"middleware/paginate/page_info.go"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"9168d9cd1514d8e6b6eb2a4c1054dc5dd410a79859d5db93388be33427f50178"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if err := unmarshal(data, \u0026values); 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":"middleware/paginate/page_info.go"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"12b6723afa660bfe3010c7242f75702c9b23633519111f89036fc7f20a3a6179"}},{"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":"middleware/logger/logger.go"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"3810b73c5c5966de26dba6b3a62562f3a7245032d5ca49b904a7e2d05bf2af08"}},{"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":"middleware/cache/utils.go"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"3af570b28b3e129a214f45b6200b9506def1bd0392ba19b270aa9958f9c470b6"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060if _, writeErr := w.Write(buf[:n]); writeErr != 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":"middleware/adaptor/adaptor.go"},"region":{"startLine":1050}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f0f64f87cbb02320c2c05bb5cf3d6931e656f16cc8632c3555fbecd1c33b477"}},{"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":"middleware/adaptor/adaptor.go"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b6bbb27e2aa54343b17439204a04ec7c86f7a418a171807239f2331a9c2daa1"}},{"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":"internal/schemehost/schemehost.go"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"535d304bd75d37b352d20e837a3bf543f138fc3c0e963e4eeab8a2ef0dd3b97c"}},{"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":"internal/origin/origin.go"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"211e0b1f9f89648775898341d6b213de7b3c9741dde62e850c385356b1ea082a"}},{"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":"addon/retry/exponential_backoff.go"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce45f419f8b56f0905e856eae7c4fee156456d621f62d82166b15ba119bb7c0a"}}],"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-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-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-269","guid":"70e1f5f6-81e5-4e5a-ba40-b541c3a346e2","name":"Improper Privilege Management","shortDescription":{"text":"Improper Privilege Management"},"helpUri":"https://cwe.mitre.org/data/definitions/269.html"},{"id":"CWE-330","guid":"f811ddf9-2e54-865b-9c76-f97905849790","name":"Use of Insufficiently Random Values","shortDescription":{"text":"Use of Insufficiently Random Values"},"helpUri":"https://cwe.mitre.org/data/definitions/330.html"},{"id":"CWE-353","guid":"09d7e902-d4ee-f05d-ae6c-0a1554d0c18f","name":"Missing Support for Integrity Check","shortDescription":{"text":"Missing Support for Integrity Check"},"helpUri":"https://cwe.mitre.org/data/definitions/353.html"},{"id":"CWE-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-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A04:2025","guid":"6a9f5bfd-1a56-6453-beec-a7eff0ba3007","name":"Cryptographic Failures","shortDescription":{"text":"Cryptographic Failures"},"helpUri":"https://top10.owasp.org/2025/A04_2025-Cryptographic_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"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-4","guid":"c859d8ea-8b24-a157-9406-94929c10397a","name":"Poisoned Pipeline Execution (PPE)","shortDescription":{"text":"Poisoned Pipeline Execution (PPE)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-04-Poisoned-Pipeline-Execution"},{"id":"CICD-SEC-6","guid":"f2ee2486-b260-2952-a41f-6b67fa713940","name":"Insufficient Credential Hygiene","shortDescription":{"text":"Insufficient Credential Hygiene"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-06-Insufficient-Credential-Hygiene"},{"id":"CICD-SEC-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":44,"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."]}]}