{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D5","name":"Coupling","shortDescription":{"text":"Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D5"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D7","name":"Architectural Integrity","shortDescription":{"text":"Architectural Integrity"},"helpUri":"https://codehealth.canine.dev/dimensions/D7"},{"id":"D9","name":"Test Distribution","shortDescription":{"text":"Test Distribution"},"helpUri":"https://codehealth.canine.dev/dimensions/D9"},{"id":"D10","name":"Test Quality","shortDescription":{"text":"Test Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D10"},{"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":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC1","name":"Text alternatives","shortDescription":{"text":"Text alternatives"},"helpUri":"https://codehealth.canine.dev/dimensions/AC1"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC4","name":"Keyboard semantics","shortDescription":{"text":"Keyboard semantics"},"helpUri":"https://codehealth.canine.dev/dimensions/AC4"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AC7","name":"A11y enforcement","shortDescription":{"text":"A11y enforcement"},"helpUri":"https://codehealth.canine.dev/dimensions/AC7"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AX6","name":"Interface segregation","shortDescription":{"text":"Interface segregation"},"helpUri":"https://codehealth.canine.dev/dimensions/AX6"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"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":"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":"P5","name":"DR \u0026 Backup","shortDescription":{"text":"DR \u0026 Backup"},"helpUri":"https://codehealth.canine.dev/dimensions/P5"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"R1","name":"Type Safety","shortDescription":{"text":"Type Safety"},"helpUri":"https://codehealth.canine.dev/dimensions/R1"},{"id":"R10","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/R10"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X16","name":"Unfloored truncation loop","shortDescription":{"text":"Unfloored truncation loop"},"helpUri":"https://codehealth.canine.dev/dimensions/X16"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X2","name":"Cancellation propagation","shortDescription":{"text":"Cancellation propagation"},"helpUri":"https://codehealth.canine.dev/dimensions/X2"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X29","name":"Per-element action decided by a fixed element","shortDescription":{"text":"Per-element action decided by a fixed element"},"helpUri":"https://codehealth.canine.dev/dimensions/X29"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X5","name":"Nullable reference types","shortDescription":{"text":"Nullable reference types"},"helpUri":"https://codehealth.canine.dev/dimensions/X5"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"AgentBuilder.decides (cyclomatic 66): AgentBuilder.decides has cyclomatic complexity 66 (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":"src/flock/core/agent.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1b1dc22377659cac3a2a007343bb0095c9c22cddd99579074865fd120840e69"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentNode.AgentNode (cyclomatic 65): AgentNode.AgentNode has cyclomatic complexity 65 (threshold 15). Of this number, 38 points are the body\u0027s own statements and 27 belong to 9 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"317fec8a64cef1cbe01be98f328629d321899d9553b50f14e132aa00013b8559"}},{"ruleId":"D1","level":"warning","message":{"text":"LogicOperationsDisplay.LogicOperationsDisplay (cyclomatic 55): LogicOperationsDisplay.LogicOperationsDisplay has cyclomatic complexity 55 (threshold 15). Most of this is not in the body itself: 4 of the 55 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 116, a function literal at line 131, a function literal at line 323, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"da3d7a98acf2d0b6ac64d59167d64ff8f6986f7aa7ddb06345e098076158413a"}},{"ruleId":"D1","level":"warning","message":{"text":"PublishControl.PublishControl::renderField (cyclomatic 54): PublishControl.PublishControl::renderField has cyclomatic complexity 54 (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":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"675ecb18e1ad4d8428dc09c1196eae51c76611390dac55efddd63916687bef26"}},{"ruleId":"D1","level":"warning","message":{"text":"HistoricalArtifactsModule.HistoricalArtifactsModule (cyclomatic 52): HistoricalArtifactsModule.HistoricalArtifactsModule has cyclomatic complexity 52 (threshold 15). Of this number, 23 points are the body\u0027s own statements and 29 belong to 15 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"baa9f4164f8d331cedd3d2f22e6d48ccba941b021a5d0d0913951b035ac5095f"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphAssembler._build_agent_nodes (cyclomatic 47): GraphAssembler._build_agent_nodes has cyclomatic complexity 47 (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":"src/flock/api/graph_builder.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdf592b1cd30993065461b59e7f301a1433364cd3bc1858452ca802fd37c1d50"}},{"ruleId":"D1","level":"warning","message":{"text":"DecisionDisplay.DecisionBars (cyclomatic 40): DecisionDisplay.DecisionBars has cyclomatic complexity 40 (threshold 15). Of this number, 39 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":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"abf31f7b3aa95a8dc1a45bcf340fe01e551abcb2cbf0481dded662acdb855cc6"}},{"ruleId":"D1","level":"warning","message":{"text":"TraceModuleJaeger.TraceModuleJaeger (cyclomatic 38): TraceModuleJaeger.TraceModuleJaeger has cyclomatic complexity 38 (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. This shape REPEATS in the file: one other method here (TraceModuleJaeger.TraceModuleJaeger::renderSpanNode) 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":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"226389fecc96036d3fff1195d6aff0c268a5ef401d67289597c5c8389f029a89"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphCanvas.GraphCanvas (cyclomatic 35): GraphCanvas.GraphCanvas has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 10 of the 35 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 196, 291, 178, \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":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a24444cc1c34728e7be9f4b46da6e917f1f5e78c00aa8cd747485cc865e0b39"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenClawEngine.evaluate (cyclomatic 33): OpenClawEngine.evaluate has cyclomatic complexity 33 (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":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"8858733fbf9f335ddcd119a53a98c1455f69f35fa076da763b425f4bfbfd9fe8"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketClient.updateFilterStateFromPublishedMessage (cyclomatic 33): WebSocketClient.updateFilterStateFromPublishedMessage has cyclomatic complexity 33 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: 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":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f3a7553fe0219bdee02b2db915b22ce5853ef90580c6f03a6822cac628eb67f"}},{"ruleId":"D1","level":"warning","message":{"text":"useKeyboardShortcuts.useKeyboardShortcuts (cyclomatic 33): useKeyboardShortcuts.useKeyboardShortcuts has cyclomatic complexity 33 (threshold 15). Most of this is not in the body itself: 1 of the 33 points is its own statement and the rest belongs to one function literal inside it that branches (line 28). 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":"src/flock/frontend/src/hooks/useKeyboardShortcuts.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ce631aae48bf2d49d9df61595274e9e1bd8e524cf95aaeb26e29c20a37952ba"}},{"ruleId":"D1","level":"warning","message":{"text":"DecisionEngine._checklist_decision (cyclomatic 30): DecisionEngine._checklist_decision has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/decisions/engine.py"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"e13423334aadab2bc897f49d7f470d0ae245bc93b90e3975af8af064b986f73f"}},{"ruleId":"D1","level":"warning","message":{"text":"DSPyEngine._evaluate_internal (cyclomatic 29): DSPyEngine._evaluate_internal has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/engines/dspy_engine.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"08028ca3a0af4a2a6807ee95d808cd56842facb083280a5e3f6d040f14ddb4a1"}},{"ruleId":"D1","level":"warning","message":{"text":"TournamentBracket.TournamentBracket (cyclomatic 28): TournamentBracket.TournamentBracket has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 2 of the 28 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 284, a function literal at line 263, a function literal at line 113, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/TournamentBracket.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"327a7cae3797cb7b724260461788140e174eff37657c0ee486487b09ee48246b"}},{"ruleId":"D1","level":"warning","message":{"text":"DSPySignatureBuilder.prepare_signature_for_output_group (cyclomatic 27): DSPySignatureBuilder.prepare_signature_for_output_group has cyclomatic complexity 27 (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":"src/flock/engines/dspy/signature_builder.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3a9ad5a0bc2b04445e878dad40eb8afa880988648fdcb28baa24003216e800"}},{"ruleId":"D1","level":"warning","message":{"text":"OpenClawEngine._build_responses_payload (cyclomatic 27): OpenClawEngine._build_responses_payload has cyclomatic complexity 27 (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":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"631d3573fceae84bf92909aaf586c4331cb764b1fd84c4157173fb02140f3304"}},{"ruleId":"D1","level":"warning","message":{"text":"MultiSelect.MultiSelect (cyclomatic 27): MultiSelect.MultiSelect has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 9 of the 27 points are its own statements and the rest belongs to 7 function items inside it that branch (handleKeyDown, a function literal at line 43, a function literal at line 212, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/MultiSelect.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"1695885dbc714cff071db8fa0cbcb5225d4c1b8f781835da2f2ccdd60208ec62"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputProcessor.make_outputs_for_group (cyclomatic 26): OutputProcessor.make_outputs_for_group has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/agent/output_processor.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee22e1ed85df92434151a0fadd434a26ba59694579d9a74a99533d015c8ad086"}},{"ruleId":"D1","level":"warning","message":{"text":"AgentBuilder.consumes (cyclomatic 26): AgentBuilder.consumes has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/core/agent.py"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea4a0a4548c7fa4dc1411ade366d4f5fef0ad310e19e0d64abd8fb8a7f6a84bb"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketClient.setupEventHandlers (cyclomatic 26): WebSocketClient.setupEventHandlers has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 1 of the 26 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 219, 182, 261, \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":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"7305c2ebaad79b9ed24b1a53cc3e2074c176edbf0d15931030be62fcfc628431"}},{"ruleId":"D1","level":"warning","message":{"text":"DecisionEngine.evaluate (cyclomatic 25): DecisionEngine.evaluate has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/decisions/engine.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"e81b1df399766c6fb45f3de5172404b5fcd16fa990e0caffc82dd5482c8cab85"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageHistoryTab.MessageHistoryTab (cyclomatic 25): MessageHistoryTab.MessageHistoryTab has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 4 of the 25 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 280, a function literal at line 36, a function literal at line 84, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageHistoryTab.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"769334a72e07e0b19aa68ec0a1aa007a7566463fd2602d55a3022fd7cfd834f0"}},{"ruleId":"D1","level":"warning","message":{"text":"ThemeSelector.ThemeSelector (cyclomatic 25): ThemeSelector.ThemeSelector has cyclomatic complexity 25 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 10 belong to 6 function items inside it that branch. 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":"src/flock/frontend/src/components/settings/ThemeSelector.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"b05be7367a1d28e1c9415b9120e7afd912be110ffbc8900ee0c81c8817b7f4fa"}},{"ruleId":"D1","level":"warning","message":{"text":"TracingSettings.TracingSettings (cyclomatic 25): TracingSettings.TracingSettings has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 10 of the 25 points are its own statements and the rest belongs to 7 function items inside it that branch (handleClearTraces, loadTraceServices, loadTraceStats, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/TracingSettings.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f81b0970c982db0a9be462697352ad3a80f5d4c31c4d0b7b89e17c817fda24f6"}},{"ruleId":"D1","level":"warning","message":{"text":"OutputUtilityComponent.on_post_evaluate (cyclomatic 24): OutputUtilityComponent.on_post_evaluate has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/components/agent/output_utility.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"55de892f4f8fdebba2d48e8418cf90ccb3af8dd19662f4524513b7001d7a9d45"}},{"ruleId":"D1","level":"warning","message":{"text":"RunStatusTab.RunStatusTab (cyclomatic 24): RunStatusTab.RunStatusTab has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 4 of the 24 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 244, a function literal at line 29, getStatusColor, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/RunStatusTab.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"16171fb7c35662aa5c8315e4305d195b701fe4fe81bee40ae3efe9d5a87c7998"}},{"ruleId":"D1","level":"warning","message":{"text":"layout.resolveNodeOverlaps (cyclomatic 23): layout.resolveNodeOverlaps has cyclomatic complexity 23 (threshold 15). Of this number, 21 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":"src/flock/frontend/src/services/layout.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c26b4a6e1de589f6d330c456f38e77d47805dec49910383e6e36c451946234a"}},{"ruleId":"D1","level":"warning","message":{"text":"calibration.calibrate (cyclomatic 22): calibration.calibrate 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":"src/flock/decisions/calibration.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"f894fd86998ea82d0c34efe9cff51294b79750fea36a5e46e72833c34fbb6efb"}},{"ruleId":"D1","level":"warning","message":{"text":"_QuestionMeta.__new__ (cyclomatic 22): _QuestionMeta.__new__ 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":"src/flock/decisions/choice.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"954337424813d3efd6be67d86a13f478d579318c597ab572750fdb7e2531af5f"}},{"ruleId":"D1","level":"warning","message":{"text":"ScheduledAgentDisplay.ScheduledAgentDisplay::formatScheduleDetails (cyclomatic 21): ScheduledAgentDisplay.ScheduledAgentDisplay::formatScheduleDetails 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":"src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e61df6a4ed985327771040fc3092f87bd013882ce7c74dbba72a5bbd9a4fbb8"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketClient.connect (cyclomatic 21): WebSocketClient.connect has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 457, 406, 421, \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":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":392}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cda6b8405abe7ea74f2ac371a1d31f6a9ebf1560f41d66e0155c87e89be4d8"}},{"ruleId":"D1","level":"warning","message":{"text":"SavedFiltersControl.SavedFiltersControl (cyclomatic 21): SavedFiltersControl.SavedFiltersControl has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 5 of the 21 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 31, handleSavePreset, handleApplyPreset, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/filters/SavedFiltersControl.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9a13074563d66d52e93f47d2f10fe62de20d7238cfbb0eabece86d02bf7126d"}},{"ruleId":"D1","level":"warning","message":{"text":"TimerComponent._timer_loop (cyclomatic 20): TimerComponent._timer_loop 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":"src/flock/components/orchestrator/scheduling/timer.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"f673994652a7e9998b0be8d82f95063ac8a3c8710689ad80ca52b420734fd1a8"}},{"ruleId":"D1","level":"warning","message":{"text":"graph.decision_view (cyclomatic 20): graph.decision_view has cyclomatic complexity 20 (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":"src/flock/decisions/graph.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63d8a1a8b40380f6367ff79700cfb24015b545d7aea3547e6cdf03969c65f8d"}},{"ruleId":"D1","level":"warning","message":{"text":"WebSocketClient.handleMessage (cyclomatic 20): WebSocketClient.handleMessage has cyclomatic complexity 20 (threshold 15). Of this number, 19 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":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5600b3b1041f50aed602a77021fd4d02bc930f5f4ceab650778ac34457e58d4"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageDetailWindow.MessageDetailWindow (cyclomatic 20): MessageDetailWindow.MessageDetailWindow has cyclomatic complexity 20 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 4 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f95269b0f1113e0b613842fc4a769319191f792a7cbd7f16561bc3edece26599"}},{"ruleId":"D1","level":"warning","message":{"text":"DashboardLayout.DashboardLayout (cyclomatic 20): DashboardLayout.DashboardLayout has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/layout/DashboardLayout.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"268aea5dfa6f2e23a647cb920e88f11dfe7476be687f7bbe516430236e45dcf4"}},{"ruleId":"D1","level":"warning","message":{"text":"graph._question_info (cyclomatic 19): graph._question_info 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":"src/flock/decisions/graph.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a24fd99745b58964317327a72aa4003f33bfcb00c7252a94868c6109b076753"}},{"ruleId":"D1","level":"warning","message":{"text":"trace_and_logged._extract_span_attributes (cyclomatic 19): trace_and_logged._extract_span_attributes 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":"src/flock/logging/trace_and_logged.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b66dda004ce812346e7babbeceed7d3f5e96ecafd58131757aadfb93d9cd5d"}},{"ruleId":"D1","level":"warning","message":{"text":"App.App (cyclomatic 19): App.App has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 6 function literals inside it that branch (lines 19, 67, 89, \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":"src/flock/frontend/src/App.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"81f6e6a5013293a986a76d903246482ad9e4e812bd602e8e14494b917ed1e499"}},{"ruleId":"D1","level":"warning","message":{"text":"DSPyArtifactMaterializer.normalize_output_payload (cyclomatic 18): DSPyArtifactMaterializer.normalize_output_payload has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/engines/dspy/artifact_materializer.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"da6e7b035fa3a41fe0c5e0c7e9caceec19da5fbd93e97f7a22eadec9c7a81ed8"}},{"ruleId":"D1","level":"warning","message":{"text":"DSPyArtifactMaterializer.materialize_artifacts (cyclomatic 18): DSPyArtifactMaterializer.materialize_artifacts has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/engines/dspy/artifact_materializer.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"b56a90d2f4e3fe88c5da8baf54f82b51e41f14c0ee849e793e8e33fe19ce649f"}},{"ruleId":"D1","level":"warning","message":{"text":"trace_and_logged._serialize_value (cyclomatic 18): trace_and_logged._serialize_value has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/logging/trace_and_logged.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"e29d018c0cfdfe09a8140fce6c3c769818dd8926b8dfe6fc3177df66f796cb4e"}},{"ruleId":"D1","level":"warning","message":{"text":"LiveOutputTab.LiveOutputTab (cyclomatic 18): LiveOutputTab.LiveOutputTab has cyclomatic complexity 18 (threshold 15). Most of this is not in the body itself: 5 of the 18 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 24, 68, 87, \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":"src/flock/frontend/src/components/details/LiveOutputTab.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"e46e5bb3583dcc96431dd3bd93cf58dda09be98f92a452c51b2557998c5cd039"}},{"ruleId":"D1","level":"warning","message":{"text":"TraceModuleJaeger.TraceModuleJaeger::renderSpanNode (cyclomatic 17): TraceModuleJaeger.TraceModuleJaeger::renderSpanNode has cyclomatic complexity 17 (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. This shape REPEATS in the file: one other method here (TraceModuleJaeger.TraceModuleJaeger) 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":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":501}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c2c4c89ed01d9a48c751f441c3b9030967f5fcdf50216e2753e88ad0547f97"}},{"ruleId":"D1","level":"warning","message":{"text":"GraphAssembler._build_logic_config_for_subscription (cyclomatic 16): GraphAssembler._build_logic_config_for_subscription 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":"src/flock/api/graph_builder.py"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b8bfa969b6f157a7975d1fafd4f17539a695e48bc3f2572f10c03ceefc4431b"}},{"ruleId":"D1","level":"warning","message":{"text":"BuiltinCollectionComponent.on_collect_artifacts (cyclomatic 16): BuiltinCollectionComponent.on_collect_artifacts 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":"src/flock/components/orchestrator/collection.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"6807573c18823ca074a5e33613e6e462e010f848283d6514982c066f10af01a0"}},{"ruleId":"D1","level":"warning","message":{"text":"ArtifactsComponent._publish_upload (cyclomatic 16): ArtifactsComponent._publish_upload 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":"src/flock/components/server/artifacts/artifacts_component.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"a698a46d1f29444786fa72c7c82fa833833ce0450dfdf0b67b683c99ad8eb2aa"}},{"ruleId":"D1","level":"warning","message":{"text":"helpers._build_logic_config (cyclomatic 16): helpers._build_logic_config 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":"src/flock/components/server/control/helpers.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f9081afe2887b311c524b8197c1908f164e664cd78a364cf671e36cc146ab6"}},{"ruleId":"D1","level":"warning","message":{"text":"Flock.get_correlation_status (cyclomatic 16): Flock.get_correlation_status 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":"src/flock/core/orchestrator.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3d44b7e558a4a283f6f19d6db44f67c72ceb1a9bf28e3da33a1d2e150cb27f"}},{"ruleId":"D1","level":"warning","message":{"text":"FoundryResponsesAdapter._handle (cyclomatic 16): FoundryResponsesAdapter._handle 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":"src/flock/integrations/foundry/adapter.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d1bcaa63b0292862c5d77a7f383db87eff655cc5fe9d6d3db23ec4acbed444f"}},{"ruleId":"D1","level":"warning","message":{"text":"FlockMCPClient.__init__ (cyclomatic 16): FlockMCPClient.__init__ has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/mcp/client.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c7e6f6cd56e0298eaa88e8cfda4524781c7f378a0f9686e899744bc0233d15"}},{"ruleId":"D1","level":"warning","message":{"text":"extra.initKeyboardShortcuts (cyclomatic 16): extra.initKeyboardShortcuts has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 165). 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":"docs/javascripts/extra.js"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d9a112657cd31d65335aa46544d1dbe37a6ac293253916b93b65fc415c5c57"}},{"ruleId":"D1","level":"warning","message":{"text":"MessageFlowEdge.MessageFlowEdge (cyclomatic 16): MessageFlowEdge.MessageFlowEdge has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function item 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":"src/flock/frontend/src/components/graph/MessageFlowEdge.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"79b477df6ac99607e4dfb2bfc641138bfa41b4b72cec4f357846f743b03318db"}},{"ruleId":"D1","level":"warning","message":{"text":"PendingJoinEdge.PendingJoinEdge (cyclomatic 16): PendingJoinEdge.PendingJoinEdge has cyclomatic complexity 16 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 4 belong to one function item inside it that branches. To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/PendingJoinEdge.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c54a2546ea6b49f588ff52121a80ce1c75eb5b00d2683e86b160aed84064670"}},{"ruleId":"D1","level":"warning","message":{"text":"NodeDetailWindow.NodeDetailWindow (cyclomatic 16): NodeDetailWindow.NodeDetailWindow has cyclomatic complexity 16 (threshold 15). Of this number, 8 points are the body\u0027s own statements and 8 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/NodeDetailWindow.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"48c1ffef581d0f178a393926562c17081feb5d0958c476222e02c93beccdc0a7"}},{"ruleId":"D2","level":"warning","message":{"text":"TraceModuleJaeger.TraceModuleJaeger (cognitive 124): TraceModuleJaeger.TraceModuleJaeger has cognitive complexity 124 (threshold 15). Drivers by points: boolean chains 53, if/else 31 (44 pts), ternaries 22 (25 pts), error handling 1, match/switch 1 (nesting depth added 16). Of this number, 33 points are the body\u0027s own statements and 91 belong to 30 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f720e2566d0a969a6220dab8418d067b3b657d5f2f03ef4e9bb699fd697a83a"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentBuilder.decides (cognitive 98): AgentBuilder.decides has cognitive complexity 98 (threshold 15). Drivers by points: if/else 40 (69 pts), boolean chains 17, loops 6 (10 pts), ternaries 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/core/agent.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"a554dacc2485b21f2a83a0cb98169217a89dd77f2528e24159c61ae493a5838c"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphAssembler._build_agent_nodes (cognitive 94): GraphAssembler._build_agent_nodes has cognitive complexity 94 (threshold 15). Drivers by points: ternaries 21 (48 pts), if/else 14 (34 pts), boolean chains 7, loops 4 (5 pts) (nesting depth added 48). 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":"src/flock/api/graph_builder.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfb9b6610ec2bf5d321ec99991e72f756ea7091a47868e2b1dd60efee4a337a4"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenClawEngine.evaluate (cognitive 70): OpenClawEngine.evaluate has cognitive complexity 70 (threshold 15). Drivers by points: if/else 24 (53 pts), error handling 4 (10 pts), boolean chains 5, loops 1, ternaries 1 (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"b00ad75005dba4f69dab3ff73f18f2edf4a9bfc85bf5ea4ed3fd6558fd1715d5"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputProcessor.make_outputs_for_group (cognitive 67): OutputProcessor.make_outputs_for_group has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (45 pts), loops 7 (21 pts), boolean chains 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/agent/output_processor.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"89edbcc771ea48c4ee3b799f7726db42144f8de2de96766662277f31a76a0c23"}},{"ruleId":"D2","level":"warning","message":{"text":"PublishControl.PublishControl::renderField (cognitive 64): PublishControl.PublishControl::renderField has cognitive complexity 64 (threshold 15). Drivers by points: boolean chains 32, ternaries 12 (25 pts), if/else 7 (nesting depth added 13). 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":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"e515401873e18594c22e8683df4b23cbf166013cc440e4f8ed2588c3ca50f624"}},{"ruleId":"D2","level":"warning","message":{"text":"layout.resolveNodeOverlaps (cognitive 56): layout.resolveNodeOverlaps has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 6 (26 pts), if/else 7 (19 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 35). Of this number, 53 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":"src/flock/frontend/src/services/layout.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"7650e4abc2d1aa0da8d01296a0a5ad2c86d856352210f136553ba0dd948b2708"}},{"ruleId":"D2","level":"warning","message":{"text":"DSPySignatureBuilder.prepare_signature_for_output_group (cognitive 54): DSPySignatureBuilder.prepare_signature_for_output_group has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 5, loops 3 (5 pts), ternaries 1 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/engines/dspy/signature_builder.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"0088aaf92b522654e5945704b57f4667ed63dcce736e59d0a26420f9bc850882"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentNode.AgentNode (cognitive 53): AgentNode.AgentNode has cognitive complexity 53 (threshold 15). Drivers by points: boolean chains 29, if/else 14 (16 pts), ternaries 8 (nesting depth added 2). Of this number, 32 points are the body\u0027s own statements and 21 belong to 9 function items inside it that branch. 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":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"84d9fe695cd4f9034c812495e77534b874432663b2da94cdbe16dd36664549b6"}},{"ruleId":"D2","level":"warning","message":{"text":"useKeyboardShortcuts.useKeyboardShortcuts (cognitive 46): useKeyboardShortcuts.useKeyboardShortcuts has cognitive complexity 46 (threshold 15). Drivers by points: if/else 22 (34 pts), boolean chains 9, ternaries 1 (3 pts) (nesting depth added 14). None of this is in the body itself: all 46 points belong to one function literal inside it that branches (line 28). 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":"src/flock/frontend/src/hooks/useKeyboardShortcuts.ts"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"322b7163ad5cad9b3e51a4dbd5f55e12e0dad5aafeb5f548d452c668f5a6c5d4"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionEngine._checklist_decision (cognitive 42): DecisionEngine._checklist_decision has cognitive complexity 42 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 7 (13 pts), boolean chains 9, ternaries 3 (6 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":"src/flock/decisions/engine.py"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"387bdb4fcebfba4637c4935338def01ea169bc594fb52236f2d25e31d94b4f04"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionDisplay.DecisionBars (cognitive 42): DecisionDisplay.DecisionBars has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 18 (28 pts), boolean chains 12, if/else 2 (nesting depth added 10). Of this number, 41 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":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"30754e6ef11850b7c5a50ea8ca6107efbe7aacf0ca03d2602a2136d47eb6bc88"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageHistoryTab.MessageHistoryTab (cognitive 42): MessageHistoryTab.MessageHistoryTab has cognitive complexity 42 (threshold 15). Drivers by points: ternaries 9 (28 pts), if/else 8, boolean chains 4, error handling 2 (nesting depth added 19). Most of this is not in the body itself: 6 of the 42 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 36, a function literal at line 280, a function literal at line 84, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageHistoryTab.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f83ce4ad4a801b9f2e557ae823a39a9161f5681931d125e0bf9c54d11a1c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionEngine.evaluate (cognitive 41): DecisionEngine.evaluate has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (23 pts), ternaries 5 (10 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/decisions/engine.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e4eae7cff2a1b6e9f09b7430afb0b37decbe608199ea948c71005a0f2aa8fe"}},{"ruleId":"D2","level":"warning","message":{"text":"DSPyEngine._evaluate_internal (cognitive 41): DSPyEngine._evaluate_internal has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (23 pts), boolean chains 9, ternaries 5 (6 pts), error handling 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":"src/flock/engines/dspy_engine.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb4595b760dd4f5ea2cf45cad71c3a555f7828e2bad8a3e00541db2665f7ddb6"}},{"ruleId":"D2","level":"warning","message":{"text":"DSPyArtifactMaterializer.materialize_artifacts (cognitive 40): DSPyArtifactMaterializer.materialize_artifacts has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (21 pts), error handling 3 (11 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/engines/dspy/artifact_materializer.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"c08492243ca49d543bc9d056288b5ae6124e3e649450708b9b8cc7c5473684eb"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenClawEngine._build_responses_payload (cognitive 40): OpenClawEngine._build_responses_payload has cognitive complexity 40 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 5, loops 2 (3 pts), ternaries 3 (nesting depth added 8). 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":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"931c1c7787705e694a91d7bb13efb6a284c8899b41bcc36c75085e3e8bc0a293"}},{"ruleId":"D2","level":"warning","message":{"text":"calibration.calibrate (cognitive 38): calibration.calibrate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 6, loops 3 (5 pts), ternaries 1 (4 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":"src/flock/decisions/calibration.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"57053e9bd605b1429255d2db3040f19d36c4ca7817f5ef302a153b7d6c586877"}},{"ruleId":"D2","level":"warning","message":{"text":"HistoricalArtifactsModule.HistoricalArtifactsModule (cognitive 38): HistoricalArtifactsModule.HistoricalArtifactsModule has cognitive complexity 38 (threshold 15). Drivers by points: boolean chains 19, if/else 14, ternaries 4, error handling 1. Most of this is not in the body itself: 14 of the 38 points are its own statements and the rest belongs to 15 function items inside it that branch (a function literal at line 230, a function literal at line 105, a function literal at line 197, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bead8f89cb410bc8fb489c040b9ed1d7de4b6061720c616afd2684ec1532421"}},{"ruleId":"D2","level":"warning","message":{"text":"OutputUtilityComponent.on_post_evaluate (cognitive 36): OutputUtilityComponent.on_post_evaluate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (21 pts), loops 2 (6 pts), boolean chains 5, error handling 1 (2 pts), ternaries 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":"src/flock/components/agent/output_utility.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b651ae3f129cf82572828f5ce635742e58edce29a9d3306662edf4a7d7efbb43"}},{"ruleId":"D2","level":"warning","message":{"text":"DSPyArtifactMaterializer.normalize_output_payload (cognitive 35): DSPyArtifactMaterializer.normalize_output_payload has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (4 pts), boolean chains 3, error handling 1 (3 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":"src/flock/engines/dspy/artifact_materializer.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"8246d8cbb4a0d45beaf9b78654bb1d688757a1fce3d531fa94a8115d24d1ddf2"}},{"ruleId":"D2","level":"warning","message":{"text":"ScheduledAgentDisplay.ScheduledAgentDisplay::formatScheduleDetails (cognitive 34): ScheduledAgentDisplay.ScheduledAgentDisplay::formatScheduleDetails has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 4 (14 pts), boolean chains 9, if/else 8 (9 pts), error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce3fd194619356df2d283519bad422f466205fa1a396ca3a5a7610e187e096e"}},{"ruleId":"D2","level":"warning","message":{"text":"BuiltinCollectionComponent.on_collect_artifacts (cognitive 33): BuiltinCollectionComponent.on_collect_artifacts has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 1 (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":"src/flock/components/orchestrator/collection.py"},"region":{"startLine":34}}}],"partialFingerprints":{"codehealthFindingId/v1":"92cde033f2353a46778f7128c5703d8b05401e1ee2626f7af0213fcb4c831871"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentScheduler.schedule_artifact (cognitive 33): AgentScheduler.schedule_artifact has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (29 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/orchestrator/scheduler.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51289e9e1c93d969917f29bb6d257700dea426d0791ec934ee1e2d9e4498d74"}},{"ruleId":"D2","level":"warning","message":{"text":"trace_and_logged._extract_span_attributes (cognitive 32): trace_and_logged._extract_span_attributes has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), error handling 2 (3 pts), loops 3, boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/logging/trace_and_logged.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"8af45e9d227ae46361ba0845c44326dddcb1d639dc90a99f81fec3b3aa440732"}},{"ruleId":"D2","level":"warning","message":{"text":"LogicOperationsDisplay.LogicOperationsDisplay (cognitive 32): LogicOperationsDisplay.LogicOperationsDisplay has cognitive complexity 32 (threshold 15). Drivers by points: boolean chains 21, if/else 9 (10 pts), error handling 1 (nesting depth added 1). Most of this is not in the body itself: 3 of the 32 points are its own statements and the rest belongs to 8 function items inside it that branch (a function literal at line 116, calculateClientTime, a function literal at line 40, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"76e19ddc533d6693b77d724076e08c1e09c08c758704237fdcc8912f435847a4"}},{"ruleId":"D2","level":"warning","message":{"text":"MessageDetailWindow.MessageDetailWindow (cognitive 31): MessageDetailWindow.MessageDetailWindow has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 7 (20 pts), boolean chains 8, if/else 2, error handling 1 (nesting depth added 13). Of this number, 26 points are the body\u0027s own statements and 5 belong to 2 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"08ad4498bf415ed71aa43310561f8eb76dcc33a3892892dbade578680d665dbe"}},{"ruleId":"D2","level":"warning","message":{"text":"App.App (cognitive 31): App.App has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 3 (8 pts), boolean chains 2, error handling 2 (nesting depth added 10). None of this is in the body itself: all 31 points belong to 6 function literals inside it that branch (lines 19, 67, 89, \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":"src/flock/frontend/src/App.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"85bd929c6fb2d08aa5abb4c51e1a88a53305be21b95504ecd0ba9cf81478d505"}},{"ruleId":"D2","level":"warning","message":{"text":"graph._question_info (cognitive 30): graph._question_info has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 4, loops 2 (4 pts), ternaries 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":"src/flock/decisions/graph.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa040b94916ccf77098052082217ced3db033986def9c876e42ad0dc196f4d90"}},{"ruleId":"D2","level":"warning","message":{"text":"TimerComponent._timer_loop (cognitive 29): TimerComponent._timer_loop has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 4, error handling 2, loops 1, ternaries 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":"src/flock/components/orchestrator/scheduling/timer.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad43668bad701d6eb9fdec153106757e4595ae6ca18677646fc0a5c24b505ae7"}},{"ruleId":"D2","level":"warning","message":{"text":"AgentBuilder.consumes (cognitive 29): AgentBuilder.consumes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 7, ternaries 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":"src/flock/core/agent.py"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4496099c0d223c04fd84123c420c6fcc0143b2ad6539ceec49cb7ddb09104c1"}},{"ruleId":"D2","level":"warning","message":{"text":"Flock.run_until_idle (cognitive 29): Flock.run_until_idle has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), loops 2 (5 pts) (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":"src/flock/core/orchestrator.py"},"region":{"startLine":652}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c6ca583f1e2f953f4103113e06ccc34a65dff980bdaf1c35b5588e40eb4386"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenClawEngine._extract_responses_output_text (cognitive 29): OpenClawEngine._extract_responses_output_text has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 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":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":1196}}}],"partialFingerprints":{"codehealthFindingId/v1":"61824d4f940a9904269427e8ca41d5661c8d1dab5ea31b5662764fcf0794d9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"TournamentBracket.TournamentBracket (cognitive 28): TournamentBracket.TournamentBracket has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 15 (17 pts), if/else 6, boolean chains 5 (nesting depth added 2). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 10 function items inside it that branch (a function literal at line 284, lineColor, a function literal at line 263, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/TournamentBracket.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca4dd087511e79a88087fb9c740a389e7907edbff776961627bfbceaccf76cb"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphCanvas.GraphCanvas (cognitive 28): GraphCanvas.GraphCanvas has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14, boolean chains 11, ternaries 1 (2 pts), match/switch 1 (nesting depth added 1). Most of this is not in the body itself: 6 of the 28 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 196, 291, 178, \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":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce13199fda397eec1d36803f389aebb54c7196532b94b0a02e091dc40f12774"}},{"ruleId":"D2","level":"warning","message":{"text":"RunStatusTab.RunStatusTab (cognitive 28): RunStatusTab.RunStatusTab has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 7 (15 pts), boolean chains 5, if/else 5, match/switch 2, error handling 1 (nesting depth added 8). Most of this is not in the body itself: 6 of the 28 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 244, a function literal at line 29, a function literal at line 48, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/RunStatusTab.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"983cc07a02f1f50b7edc7a0510ebe2aef521fc6494a30a13b3edbb5018e41555"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketClient.updateFilterStateFromPublishedMessage (cognitive 27): WebSocketClient.updateFilterStateFromPublishedMessage has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 11 (13 pts), boolean chains 10, if/else 4 (nesting depth added 2). Of this number, 25 points are the body\u0027s own statements and 2 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":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"115ef66624f71c742db9c4912febf5bab92f41ec3665fbd469620dd64e5d331e"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphAssembler._build_logic_config_for_subscription (cognitive 26): GraphAssembler._build_logic_config_for_subscription has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 5 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/api/graph_builder.py"},"region":{"startLine":1256}}}],"partialFingerprints":{"codehealthFindingId/v1":"94cbeb0a32aca400d25decf18b84f0ddd07edca48af2212d4cb7107f08adda62"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers._build_logic_config (cognitive 26): helpers._build_logic_config has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (14 pts), ternaries 5 (10 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/components/server/control/helpers.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"6edde44c666bd1194b6aba37f34e92303616b5b7379b0a7ce389bf74c64537e2"}},{"ruleId":"D2","level":"warning","message":{"text":"dapr_state_blackboard_store._build_dapr_query (cognitive 26): dapr_state_blackboard_store._build_dapr_query has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (26 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/storage/dapr/dapr_state_blackboard_store.py"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"6947c1dde512109bfa0c2b11a01f7895bd89de37f3230741850a28b22650fa41"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketClient.setupEventHandlers (cognitive 26): WebSocketClient.setupEventHandlers has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 10, ternaries 3 (4 pts) (nesting depth added 2). None of this is in the body itself: all 26 points belong to 7 function literals inside it that branch (lines 219, 182, 261, \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":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1163ac70c275121bc08e1e6d81234a3ddffc99b1ba3967668a03abeab00f2660"}},{"ruleId":"D2","level":"warning","message":{"text":"TracingSettings.TracingSettings (cognitive 26): TracingSettings.TracingSettings has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 7 (9 pts), if/else 8, boolean chains 5, error handling 4 (nesting depth added 2). Most of this is not in the body itself: 8 of the 26 points are its own statements and the rest belongs to 7 function items inside it that branch (handleClearTraces, handleSaveSettings, loadTraceServices, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/TracingSettings.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f12d517ca8bbed439c6a0b8a01473087aa5713ea5c5f2102d0a9c34e036f381"}},{"ruleId":"D2","level":"warning","message":{"text":"trace_and_logged._serialize_value (cognitive 25): trace_and_logged._serialize_value has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 3 (6 pts), loops 1 (2 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":"src/flock/logging/trace_and_logged.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1d7f2e5f8b55ae613a46abd2662d900ee08a1dd4d92530ff47b010c7d17554"}},{"ruleId":"D2","level":"warning","message":{"text":"Context.fire_time (cognitive 25): Context.fire_time has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 1 (4 pts), boolean chains 2, ternaries 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":"src/flock/utils/runtime.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"db356e664585a558e0777abed0af190d4a8bf095338647aff3e5c11139cfe92a"}},{"ruleId":"D2","level":"warning","message":{"text":"Flock.run_until (cognitive 24): Flock.run_until has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (23 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":"src/flock/core/orchestrator.py"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"649f3aea9b93869d6537583189e6da1fd7b507513da91fca5d2ada1d817acd2a"}},{"ruleId":"D2","level":"warning","message":{"text":"_QuestionMeta.__new__ (cognitive 24): _QuestionMeta.__new__ has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, loops 3, ternaries 3 (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":"src/flock/decisions/choice.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"0621fd1e459846a8240028b28329803beee24ada381940f4f707af5a23c95225"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenClawEngine._materialize_artifacts_for_output_group (cognitive 24): OpenClawEngine._materialize_artifacts_for_output_group has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":966}}}],"partialFingerprints":{"codehealthFindingId/v1":"38fa18822be51564ed0f366c33a57bce41009ed0abd62f4780483b8482f3678d"}},{"ruleId":"D2","level":"warning","message":{"text":"Flock.get_correlation_status (cognitive 23): Flock.get_correlation_status has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/core/orchestrator.py"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"11753febd0da4a612efb5ca092c4802b4931271a60107cedbef4e92e0ea816c3"}},{"ruleId":"D2","level":"warning","message":{"text":"DSPySignatureBuilder.prepare_execution_payload_for_output_group (cognitive 23): DSPySignatureBuilder.prepare_execution_payload_for_output_group has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), ternaries 1 (4 pts), boolean chains 2 (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":"src/flock/engines/dspy/signature_builder.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"00fd7a876c4130585996acbef66e7434c5aab131a9c6fb6f8461e6e1af654cf9"}},{"ruleId":"D2","level":"warning","message":{"text":"FlockMCPClient.__init__ (cognitive 23): FlockMCPClient.__init__ has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/mcp/client.py"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"211826736c5d623fdca7463e0c0a280257af7b3297541df817504ac7ea9e4adc"}},{"ruleId":"D2","level":"warning","message":{"text":"WebSocketClient.handleMessage (cognitive 23): WebSocketClient.handleMessage has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 5, error handling 2 (4 pts), ternaries 1 (nesting depth added 4). Of this number, 20 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"1139ecf33cbac9a9bef9c10614cf20d50b1b2db858071947f4b5957b4a8cde32"}},{"ruleId":"D2","level":"warning","message":{"text":"LiveOutputTab.LiveOutputTab (cognitive 23): LiveOutputTab.LiveOutputTab has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, ternaries 3 (4 pts), error handling 1, loops 1 (nesting depth added 5). Most of this is not in the body itself: 5 of the 23 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 68, 24, 87, \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":"src/flock/frontend/src/components/details/LiveOutputTab.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa12c080513789a86865cc5e9592b3a2fe665702bc8b6fc1a09583f69eeea67"}},{"ruleId":"D2","level":"warning","message":{"text":"MultiSelect.MultiSelect (cognitive 22): MultiSelect.MultiSelect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 7, ternaries 5, match/switch 1 (nesting depth added 4). Most of this is not in the body itself: 6 of the 22 points are its own statements and the rest belongs to 7 function items inside it that branch (handleKeyDown, a function literal at line 43, a function literal at line 36, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/MultiSelect.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"435bd88b99091cbf9cf5e9e17ccfae5b5c118e06397718b739f5499d0cbb0498"}},{"ruleId":"D2","level":"warning","message":{"text":"SavedFiltersControl.SavedFiltersControl (cognitive 22): SavedFiltersControl.SavedFiltersControl has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 5, error handling 3, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 4 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 31, handleSavePreset, handleApplyPreset, \u2026). The named helpers are already separate functions; the literals\u0027 work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal\u0027s work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/filters/SavedFiltersControl.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a91640be1ecd35f0f4009d68b98701203dc7e51c491f5b34e8403f41ee4727"}},{"ruleId":"D2","level":"warning","message":{"text":"SemanticContextProvider.get_context (cognitive 21): SemanticContextProvider.get_context has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 4 (5 pts), boolean chains 1, 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":"src/flock/semantic/context_provider.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadfdac161bb0649e147baf8e33234504f8531a95fdc9aeea9d69ec96073a980"}},{"ruleId":"D2","level":"warning","message":{"text":"DashboardLayout.DashboardLayout (cognitive 21): DashboardLayout.DashboardLayout has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 13, if/else 4 (5 pts), boolean chains 3 (nesting depth added 1). Of this number, 16 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. 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":"src/flock/frontend/src/components/layout/DashboardLayout.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"52579a15c18239666cfb3524ef4cde36c9db881ec440480efa272fbf649135a6"}},{"ruleId":"D2","level":"warning","message":{"text":"MCPIntegration.configure_servers (cognitive 20): MCPIntegration.configure_servers has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 2, loops 1 (2 pts), ternaries 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":"src/flock/agent/mcp_integration.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"05412fec711e5c08e86f41fcbd117643502a5da6254e0b7f3e75df100267bf90"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphAssembler._derive_blackboard_edges (cognitive 20): GraphAssembler._derive_blackboard_edges has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/api/graph_builder.py"},"region":{"startLine":1059}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9a6542a0b7bff3dee36b23181614073b055de971b35c3ef620daf6313f9ab0"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers._compute_agent_status (cognitive 20): helpers._compute_agent_status has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (18 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/components/server/control/helpers.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc93c740670aea9a540955f051284ed63bd6f23001cb8479609cee016dc5510"}},{"ruleId":"D2","level":"warning","message":{"text":"themed_formatter.create_rich_renderable (cognitive 20): themed_formatter.create_rich_renderable has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (5 pts), ternaries 2 (4 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":"src/flock/logging/formatters/themed_formatter.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"899c85e3fbc4f624fad6b4724571437dcaa880a8215f50f55ba905fa254458f4"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphAssembler._apply_pending_label_offsets (cognitive 19): GraphAssembler._apply_pending_label_offsets has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (8 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":"src/flock/api/graph_builder.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdc000d96ff4f82e6b050cc8336f1c4ba5200b84d85ac27fa32b1b651287b03d"}},{"ruleId":"D2","level":"warning","message":{"text":"DaprStateBlackboardStore._query_via_dapr_api (cognitive 19): DaprStateBlackboardStore._query_via_dapr_api has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/storage/dapr/dapr_state_blackboard_store.py"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"76b60a27af9e6738641a5ad48fb03f22208dd7f022859016e287fb8382b7236b"}},{"ruleId":"D2","level":"warning","message":{"text":"helpers._get_correlation_groups (cognitive 18): helpers._get_correlation_groups has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/components/server/control/helpers.py"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bbcf5ffb461dd3c8b27fb8d6acd8aa386b3a04275fdc47df1d5c3c1e0872051"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionEngine._wire_questions (cognitive 18): DecisionEngine._wire_questions has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 3 (8 pts), if/else 2 (5 pts), loops 2 (3 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":"src/flock/decisions/engine.py"},"region":{"startLine":829}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f9de861d5dcaff4231df11b88f9acf06e971c4e6e2997e8b3542ade6e0fb7d"}},{"ruleId":"D2","level":"warning","message":{"text":"graph.decision_view (cognitive 18): graph.decision_view has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11, boolean chains 7. 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":"src/flock/decisions/graph.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e4174be02505f17bb64b4bfd0e804ff80933a54f6084ce046d7dc62a794ade5"}},{"ruleId":"D2","level":"warning","message":{"text":"theme_builder.create_rich_renderable (cognitive 18): theme_builder.create_rich_renderable has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 2 (5 pts), ternaries 2 (4 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":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"28aaa22540098199c849d4611a0003dedb23e4e512d8963de9c93e0c9f8cce68"}},{"ruleId":"D2","level":"warning","message":{"text":"FlockStreamableHttpClient.create_transport (cognitive 18): FlockStreamableHttpClient.create_transport has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 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":"src/flock/mcp/servers/streamable_http/flock_streamable_http_server.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9997bf390ecc04a0e3033a28287c495f352911a96d86bed4896870f8fb2510b"}},{"ruleId":"D2","level":"warning","message":{"text":"LoggingUtility._consume_stream (cognitive 18): LoggingUtility._consume_stream has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 1 (3 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":"src/flock/utils/utilities.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c15b270e198e73c3ec87342081a79fa1e8c5f495c7d7ffc4f3247642285bf6d"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphAssembler._derive_agent_edges (cognitive 17): GraphAssembler._derive_agent_edges has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (4 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/api/graph_builder.py"},"region":{"startLine":764}}}],"partialFingerprints":{"codehealthFindingId/v1":"3657b7869a8000e005d3af0aef19be92c7bc9e827915e0976332309e960dbc94"}},{"ruleId":"D2","level":"warning","message":{"text":"GuardComponent._extract_context_documents (cognitive 17): GuardComponent._extract_context_documents has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (7 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":"src/flock/components/agent/guard.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5399ca3db55fd38d0de2970cb7e8424ec35709b9376494d13ece3aae7441b21"}},{"ruleId":"D2","level":"warning","message":{"text":"TimerComponent._wait_for_next_fire (cognitive 17): TimerComponent._wait_for_next_fire has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), ternaries 1 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/components/orchestrator/scheduling/timer.py"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44a1ce676296546bd3b7047d0dd530f432ea93d21fdc07365662c0b73ad4159"}},{"ruleId":"D2","level":"warning","message":{"text":"_HttpDecisionProvider.decide_many (cognitive 17): _HttpDecisionProvider.decide_many has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 3, error handling 2 (3 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/decisions/providers.py"},"region":{"startLine":426}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc0f8517baa92428d3f6b35707e41a235a251960755165205bc312e359392bb5"}},{"ruleId":"D2","level":"warning","message":{"text":"DSPyArtifactMaterializer.select_output_payload (cognitive 17): DSPyArtifactMaterializer.select_output_payload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), ternaries 1 (4 pts), 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":"src/flock/engines/dspy/artifact_materializer.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"c759c338f3c29b4162bf9da510827cde99eb78e14dcd7bf4529594b130cc3d19"}},{"ruleId":"D2","level":"warning","message":{"text":"FoundryResponsesAdapter._handle (cognitive 17): FoundryResponsesAdapter._handle has cognitive complexity 17 (threshold 15). Drivers by points: error handling 6, ternaries 2 (4 pts), if/else 3, loops 2 (3 pts), boolean chains 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":"src/flock/integrations/foundry/adapter.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ba170fa48e7ed5dc718890bedad667ff5b562800e2718e13aee826ed0a78d04"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenClawEngine._extract_error_message (cognitive 17): OpenClawEngine._extract_error_message has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (5 pts), boolean chains 1, error handling 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":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":1299}}}],"partialFingerprints":{"codehealthFindingId/v1":"8098865fba85955741403d5e0c5689a7f8e6dc152db41a1d3806595cde3209ba"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenClawSSEDispatcher._extract_completed_text (cognitive 17): OpenClawSSEDispatcher._extract_completed_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 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":"src/flock/integrations/openclaw/streaming.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"a602f868ab2473b09c2ecbc988a2dfa2899abcfb107ffef0ca20b55893840641"}},{"ruleId":"D2","level":"warning","message":{"text":"ArtifactManager.publish (cognitive 17): ArtifactManager.publish has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/orchestrator/artifact_manager.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"918a02a25024a2e2995ee51dd2d5862226eda8e7e66d0f33aea1b534bd073efc"}},{"ruleId":"D2","level":"warning","message":{"text":"DaprStateBlackboardStore._query_via_index_scan (cognitive 17): DaprStateBlackboardStore._query_via_index_scan has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (8 pts), loops 3 (5 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/storage/dapr/dapr_state_blackboard_store.py"},"region":{"startLine":518}}}],"partialFingerprints":{"codehealthFindingId/v1":"55985d140e83a2b35f73314105f2c60cb157f86a17ad17a9e574fd18b24b616e"}},{"ruleId":"D2","level":"warning","message":{"text":"cli_helper.kingfisher (cognitive 17): cli_helper.kingfisher has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/utils/cli_helper.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8f30c6c336b57a23a0ebe7a06830b1a74e01fde20c46347f234d54d5e4131a2"}},{"ruleId":"D2","level":"warning","message":{"text":"GraphAssembler._build_pending_join_edges (cognitive 16): GraphAssembler._build_pending_join_edges has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (6 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":"src/flock/api/graph_builder.py"},"region":{"startLine":919}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f3681ff90af5fbb3a5c5ec1b020661109693e1c78aca379d27fe9e26d2cce13"}},{"ruleId":"D2","level":"warning","message":{"text":"_Workflow._loop (cognitive 16): _Workflow._loop 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":"src/flock/application/application.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a033d0010bffc7fd7bcddd37dfb818c9637954a41a153bfc7a49e4decf6968d"}},{"ruleId":"D2","level":"warning","message":{"text":"TimerComponent._calculate_next_fire_time (cognitive 16): TimerComponent._calculate_next_fire_time has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 3 (7 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":"src/flock/components/orchestrator/scheduling/timer.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"658264de6ab7779aa8e801f50563adb5c893287ba1c84deb1460e5f6b6a7a3ae"}},{"ruleId":"D2","level":"warning","message":{"text":"ArtifactsComponent._publish_upload (cognitive 16): ArtifactsComponent._publish_upload has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (6 pts), boolean chains 5, error handling 4, loops 1 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/components/server/artifacts/artifacts_component.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbfeb2a58eac5169a75978de9cbe1da06becf87b24884dab6c8333756a6c81ef"}},{"ruleId":"D2","level":"warning","message":{"text":"Flock._run_initialize (cognitive 16): Flock._run_initialize has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/core/orchestrator.py"},"region":{"startLine":1283}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e39dd0adde82796d2b7cae614a80f609ea9cbf0f4584c002224e7c7926ce5fe"}},{"ruleId":"D2","level":"warning","message":{"text":"Subscription._matches_text_predicates (cognitive 16): Subscription._matches_text_predicates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/core/subscription.py"},"region":{"startLine":324}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c034c3e985fed6bf22b903041f9fec6525cbe26d244427f278f2fa5b6aa43b1"}},{"ruleId":"D2","level":"warning","message":{"text":"DecisionEngine._run_tournament (cognitive 16): DecisionEngine._run_tournament has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), boolean chains 2, ternaries 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":"src/flock/decisions/engine.py"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8add831558897ca23672904deeb01ed2b5ce3b413326ce559c3ebc13975d93e"}},{"ruleId":"D2","level":"warning","message":{"text":"OpenClawSSEConsumer._iter_frames (cognitive 16): OpenClawSSEConsumer._iter_frames has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (streaming.parse_sse_lines) 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":"src/flock/integrations/openclaw/streaming.py"},"region":{"startLine":431}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c60ead8be49cf06f75e0eeaac9ac762c1f559881404b3a689988576cb3d9d4"}},{"ruleId":"D2","level":"warning","message":{"text":"streaming.parse_sse_lines (cognitive 16): streaming.parse_sse_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 1 (3 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (OpenClawSSEConsumer._iter_frames) 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":"src/flock/integrations/openclaw/streaming.py"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"c615bed968411549e119e55082850d00af5c0e2a3cc3f1d28975c5c58d6331c3"}},{"ruleId":"D2","level":"warning","message":{"text":"auto_trace._parse_trace_filters (cognitive 16): auto_trace._parse_trace_filters has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), error handling 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":"src/flock/logging/auto_trace.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c104036db173e3d12b08a0be19ad5d9a909481e44232e8342aa8d6e32b23919"}},{"ruleId":"D2","level":"warning","message":{"text":"genai_spans.output_messages (cognitive 16): genai_spans.output_messages has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/logging/genai_spans.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"a532f2bb329763601108a8891c1a5b5a6542f50f1528b01c47b876a9a9ec284c"}},{"ruleId":"D2","level":"warning","message":{"text":"FlockMCPConfiguration.from_dict (cognitive 16): FlockMCPConfiguration.from_dict has cognitive complexity 16 (threshold 15). Drivers by points: error handling 4 (8 pts), if/else 8 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/mcp/config.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"607580cdeb3ac03100873d052876e6d5a71d347b8812749731f82efdf4939c43"}},{"ruleId":"D2","level":"warning","message":{"text":"FlockSSEClient.create_transport (cognitive 16): FlockSSEClient.create_transport has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (15 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":"src/flock/mcp/servers/sse/flock_sse_server.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b684705d8b7d28252a41406ce29f05b665e772d478421f6579e04590c104ed9"}},{"ruleId":"D2","level":"warning","message":{"text":"visibility_utils._validate_visibility (cognitive 16): visibility_utils._validate_visibility has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/utils/visibility_utils.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"6036ff645351aa9c096a58ee31401e15b1c266d8a9b462fa9ab41b021168045c"}},{"ruleId":"D2","level":"warning","message":{"text":"NodeDetailWindow.NodeDetailWindow (cognitive 16): NodeDetailWindow.NodeDetailWindow has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 9 (10 pts), boolean chains 3, if/else 3 (nesting depth added 1). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 154, 176, 182). 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":"src/flock/frontend/src/components/details/NodeDetailWindow.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b6acbe25779aff0588cbd2be2ffb6b3bcba86541bd11a32af698e2a06f88c0"}},{"ruleId":"D2","level":"warning","message":{"text":"ThemeSelector.ThemeSelector (cognitive 16): ThemeSelector.ThemeSelector has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, error handling 3, if/else 2, ternaries 1. Of this number, 10 points are the body\u0027s own statements and 6 belong to 6 function items inside it that branch. 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":"src/flock/frontend/src/components/settings/ThemeSelector.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"91fb9bd617d9468b0e549c7e08275bf94a5812459de162b116ddab5e878aade4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TraceModuleJaeger.TraceModuleJaeger: FunctionTooLong \u2014 TraceModuleJaeger runs 1223 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1123 over it, 12.23\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":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f9b17cc499b3258a2bab69307297f4abace7500e138cf21996a52761c034366"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: GraphCanvas.GraphCanvas: FunctionTooLong \u2014 GraphCanvas runs 553 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 453 over it, 5.53\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb04daf944273757b2aac87814c5744b81e8241981dc8b1a70606d7b5c224a78"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: PublishControl.PublishControl: FunctionTooLong \u2014 PublishControl runs 534 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 434 over it, 5.34\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":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2abc7544fbe581913bd45648ecf32fa3344faea38c5e3959702b6f5c058b7bd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MessageDetailWindow.MessageDetailWindow: FunctionTooLong \u2014 MessageDetailWindow runs 365 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 265 over it, 3.65\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":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"298139932d29553dd6adc57ac39baba11568d0020f8980b6ee8c940533b60a1b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LogicOperationsDisplay.LogicOperationsDisplay: FunctionTooLong \u2014 LogicOperationsDisplay runs 349 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 249 over it, 3.49\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":"src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c42a92ce7703bde345f8ff2ad9fc847866ba971101add7081e3474b44c8bc43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AgentNode.AgentNode: FunctionTooLong \u2014 AgentNode runs 347 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 247 over it, 3.47\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":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dc9fa5a33c60b8a7b21206c984935fa743ed0f07cc5a3d551d2fa5a9b14ee1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: HistoricalArtifactsModule.HistoricalArtifactsModule: FunctionTooLong \u2014 HistoricalArtifactsModule runs 328 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 228 over it, 3.28\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":"src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c42c81dc2106de0109ec03aaccc8b30a9387eb7d446319bc4c8784ab537ee3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TracingSettings.TracingSettings: FunctionTooLong \u2014 TracingSettings runs 309 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 209 over it, 3.09\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":"src/flock/frontend/src/components/settings/TracingSettings.tsx"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ba5bcc5aa9e6fdaa65d4b0bd1718e795fc8f48dabad88175d3f38f89a059385"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: TraceModuleJaeger: ClassTooLong \u2014 1223 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 823 over it, 3.06\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":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0634f8057f949c385bd2e58d9466aeb8d6c39d1a1185e7ee6cd4a54cd5a37f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MessageHistoryTab.MessageHistoryTab: FunctionTooLong \u2014 MessageHistoryTab runs 282 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 182 over it, 2.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageHistoryTab.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f76c642ce0d056f680c838bb21ab8f5b55ec925185dd9ef8f9645c76fe7bb0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RunStatusTab.RunStatusTab: FunctionTooLong \u2014 RunStatusTab runs 269 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 169 over it, 2.69\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/RunStatusTab.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"25a3cb44191a4f691dffdab72ef3816751ea4f3eaf54486ddb596d03d1c1cb25"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: modules/TraceModuleJaeger.tsx: FileTooLong \u2014 1277 significant lines (blank, comment-only and punctuation-only lines excluded), about 96% of them inside a single declaration: TraceModuleJaeger (73-1558). The bar is 500 significant lines; this is 777 over it, 2.55\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":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d06933f5216f91a6d908b61192a4778293c25aaa8a633889ecf2203f004b0c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: TournamentBracket.TournamentBracket: FunctionTooLong \u2014 TournamentBracket runs 229 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 129 over it, 2.29\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":"src/flock/frontend/src/components/graph/TournamentBracket.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b1e69944e50f99c8f16d9e3235ac3bdea3ae305125d1dfeedcc4bf417e55d8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/DecisionDisplay.tsx: FileTooLong \u2014 1118 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 618 over it, 2.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e3829dca6d28f8f0fca17f642f1be757e34e2da9e2ad8cbe6a5f9b33d04918a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/graph_builder.py: FileTooLong \u2014 1030 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 530 over it, 2.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":"src/flock/api/graph_builder.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0ed6b46575039d87483e45b1e9120d57a2d49be833c3c64418b7aa23e17d433"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DashboardLayout.DashboardLayout: FunctionTooLong \u2014 DashboardLayout runs 206 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 106 over it, 2.06\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":"src/flock/frontend/src/components/layout/DashboardLayout.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e49cc552ff538e65487c99f0eb7fb6ef3dedd440bae8306f9707769dfb9cb0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: openclaw/engine.py: FileTooLong \u2014 993 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 493 over it, 1.99\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":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"774649830771018c528edbc095f71a9801b2feafc08443d9030bcced942df5c4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ScheduledAgentDisplay.ScheduledAgentDisplay: FunctionTooLong \u2014 ScheduledAgentDisplay runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86\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":"src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbb26c9543840bbab7f70337dcb9499c650b5384c8ccbdcfee3dbce3f6dc6123"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/agent.py: FileTooLong \u2014 926 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 426 over it, 1.85\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":"src/flock/core/agent.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4eb96b4055362144d1d4dabe697ff6cedfe3cdecfafc4b1ed3a37f631ff0509"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MultiSelect.MultiSelect: FunctionTooLong \u2014 MultiSelect runs 176 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 76 over it, 1.76\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":"src/flock/frontend/src/components/settings/MultiSelect.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"9734163e5eb93b85640cb0d46b0970e5d9b1626c8ef32d287b38a2ac61462412"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: Flock: TooManyMethods \u2014 51 methods. The bar is 30 methods; this is 21 over it, 1.70\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":"src/flock/core/orchestrator.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80415ce7283d5307c953b2ec695298f9ad627d6efe0a120f97821cc3b75f5e6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: NodeDetailWindow.NodeDetailWindow: FunctionTooLong \u2014 NodeDetailWindow runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/NodeDetailWindow.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9113ffa012edead8859460d1d338d8d6bfc44ba41d1bc00dbf6d0ba83595c57"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ModuleWindow.ModuleWindow: FunctionTooLong \u2014 ModuleWindow runs 170 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 70 over it, 1.70\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/ModuleWindow.tsx"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fc7c64fcf1ae812874636c50595fc3a1663dd625f9a03285aa94aaae342a41"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dapr/dapr_state_blackboard_store.py: FileTooLong \u2014 849 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 349 over it, 1.70\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":"src/flock/storage/dapr/dapr_state_blackboard_store.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a86a05c28d07c657f240c14805b23b14a41f223b19a10dfbcc25573e46f4f70"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LiveOutputTab.LiveOutputTab: FunctionTooLong \u2014 LiveOutputTab runs 159 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 59 over it, 1.59\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":"src/flock/frontend/src/components/details/LiveOutputTab.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"938d6e723e4fe63f3047ecdb933f61bbfd920007d78aaeacd6ebb76c314af2ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: decisions/engine.py: FileTooLong \u2014 784 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 284 over it, 1.57\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":"src/flock/decisions/engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e72a20e99e1442021ebe81eb10680a2e81fdee1577897f927f39ebc5a8251807"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AppearanceSettings.AppearanceSettings: FunctionTooLong \u2014 AppearanceSettings runs 154 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 54 over it, 1.54\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":"src/flock/frontend/src/components/settings/AppearanceSettings.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"752ff5d64d6ae5890c077c871b0083ff5eecb418f9b242aa297086838cd2348d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/orchestrator.py: FileTooLong \u2014 757 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 257 over it, 1.51\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":"src/flock/core/orchestrator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"404e63d2a8cfb92c8faff6874af65deb5ef30a6c3a5127aedb812cb4c26edb1d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: AdvancedSettings.AdvancedSettings: FunctionTooLong \u2014 AdvancedSettings runs 139 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 39 over it, 1.39\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":"src/flock/frontend/src/components/settings/AdvancedSettings.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"5569ed9183e52b7e4e0e6880bf97ea1d34c1c1470f95587453631ccdc4aa272a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: GraphCanvas: ClassTooLong \u2014 553 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 153 over it, 1.38\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"767b1ae5d2dc89951c5929055366bbfb5c2799fad56b897f7c5ebffca3ad8e15"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: application/application.py: FileTooLong \u2014 689 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 189 over it, 1.38\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":"src/flock/application/application.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bee8027303920677274c08724eb5f3c04238e9d40053cc5788e748682ea69c3"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: PublishControl: ClassTooLong \u2014 534 significant lines (blank, comment-only and punctuation-only lines excluded), 1 methods. The bar is 400 significant lines; this is 134 over it, 1.34\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1df6d898251b657bdaa79b2b3400f5ae5c85bd40b89638bfbdf481d2105baa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: core/store.py: FileTooLong \u2014 609 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 109 over it, 1.22\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":"src/flock/core/store.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5376070e2b62988cd7606fc8748bf0a11e6659f58b73ebaddd784b928e91367"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: SavedFiltersControl.SavedFiltersControl: FunctionTooLong \u2014 SavedFiltersControl runs 121 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 21 over it, 1.21\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":"src/flock/frontend/src/components/filters/SavedFiltersControl.tsx"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0eed45af3d1c5d53d044eb8deaba4564d5d9ba6ff737e9f1c5b57c0277b8ac2"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: OpenClawEngine: TooManyMethods \u2014 36 methods. The bar is 30 methods; this is 6 over it, 1.20\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":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c8c53ed4e6ee58a533027112383ea15e0a71cbd9c8c19448dfce742aafe309"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: graph/GraphCanvas.tsx: FileTooLong \u2014 596 significant lines (blank, comment-only and punctuation-only lines excluded), about 93% of them inside a single declaration: GraphCanvas (44-785). The bar is 500 significant lines; this is 96 over it, 1.19\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"916eb9c5faca4ff394caec2e04b18e2885bd72ce27a8c9013047b998acb114d2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: dspy/streaming_executor.py: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 91 over it, 1.18\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":"src/flock/engines/dspy/streaming_executor.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28d20ff48a812afae57471bc082ddf458676aef8e1591619bf20f6c081f2596"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: artifacts/artifacts_component.py: FileTooLong \u2014 587 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 87 over it, 1.17\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":"src/flock/components/server/artifacts/artifacts_component.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f64e4fa6ede8c45f50d06e425db90fe3ded73d1d0a7efafad3f71cc907c0940"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MessageNode.MessageNode: FunctionTooLong \u2014 MessageNode runs 117 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 17 over it, 1.17\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":"src/flock/frontend/src/components/graph/MessageNode.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"59675238fc67b93ccf62985ffedc07395a87e1ce895f62769459e27ae7a742fb"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: GraphAssembler: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"src/flock/api/graph_builder.py"},"region":{"startLine":65}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a938ce22db2e2d1a8f9c160795357ba0ddae31d14eb046e4e990eb62b99c3b7"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: DaprStateBlackboardStore: TooManyMethods \u2014 35 methods. The bar is 30 methods; this is 5 over it, 1.17\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":"src/flock/storage/dapr/dapr_state_blackboard_store.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b659d15f0fa42d0c2aee44b2e3e76d2ee4c2aee799ae508cfc7aec21a8df30b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: controls/PublishControl.tsx: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: PublishControl (23-736). The bar is 500 significant lines; this is 49 over it, 1.10\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":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b6c98424334b0cd231d4733f5a5ca6db9452f28640df302e4a9408e94daae0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: engines/dspy_engine.py: FileTooLong \u2014 548 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 48 over it, 1.10\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":"src/flock/engines/dspy_engine.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddca298682c0b3e511f16c724906fe024c095e9a919837943bfff9c1716fe5d7"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: WebSocketClient.setupEventHandlers: MethodTooLong \u2014 setupEventHandlers runs 109 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 9 over it, 1.09\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":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b215ab5a230ff6d871b25a2f37576a2818daa0d65e7b3a9cfbc9acf265faf6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: JsonAttributeRenderer.JsonAttributeRenderer: FunctionTooLong \u2014 JsonAttributeRenderer runs 106 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 6 over it, 1.06\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":"src/flock/frontend/src/components/modules/JsonAttributeRenderer.tsx"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"da592dd766c3a71dbfa4e852b38d42e7fe85ec0f0ffe9ab863e30276ec8c4e09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: decisions/providers.py: FileTooLong \u2014 529 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 29 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":"src/flock/decisions/providers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3e9181feb81b24eb13529343258e3e1bc3db55dd26538c0d0ab86b6b78bffe"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: WebSocketClient: ClassTooLong \u2014 423 significant lines (blank, comment-only and punctuation-only lines excluded), 21 methods. The bar is 400 significant lines; this is 23 over it, 1.06\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":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"26a9d416a53e4853984d48146fe6cdc9b8277a4031fc8369bb3f81c73bd357e7"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: IndexedDBService: ClassTooLong \u2014 415 significant lines (blank, comment-only and punctuation-only lines excluded), 30 methods. The bar is 400 significant lines; this is 15 over it, 1.04\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":"src/flock/frontend/src/services/indexeddb.ts"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4fe72e6249896d4cbbd3b136d5c143521fbc0ab89c2b4e5e609b9eae49702ca"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: FilterPills.FilterPills: FunctionTooLong \u2014 FilterPills runs 101 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1 over it, 1.01\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/filters/FilterPills.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"10741c46a2f876ee72250eefe24e6a045541ac582d71fa59d4c656277920ba02"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: services/indexeddb.ts: FileTooLong \u2014 503 significant lines (blank, comment-only and punctuation-only lines excluded), about 83% of them inside a single declaration: IndexedDBService (149-845). The bar is 500 significant lines; this is 3 over it, 1.01\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":"src/flock/frontend/src/services/indexeddb.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"66c8552bd3f4437dfc985c9f7c54481fadc7186d908b99d945979f9caa11728d"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (26 shared lines): src/flock/logging/formatters/theme_builder.py:233-297 | src/flock/logging/formatters/themed_formatter.py:245-331 \u2014 These two members are variants of one another: 26 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":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"336815290f2b46a56beb73d032dbfd9e28be047115b437e8ca998dac6478c3c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (99\u2013103 lines \u00D7 2): src/flock/logging/formatters/theme_builder.py:90-188 | src/flock/logging/formatters/themed_formatter.py:83-185 \u2014 before extracting anything, compare \u0060src/flock/logging/formatters/theme_builder.py\u0060 and \u0060src/flock/logging/formatters/themed_formatter.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/flock/logging/formatters/theme_builder.py:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"138d6f85390cb10ef92944c3bbcd8c992fb30e9ea03ddd49575b920221187a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (46\u201348 lines \u00D7 2): src/flock/core/agent.py:1385-1432 | src/flock/core/agent.py:1523-1568 \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":"src/flock/core/agent.py"},"region":{"startLine":1385}}}],"partialFingerprints":{"codehealthFindingId/v1":"685101afb8bf1f63ebd99c8cfa683fd2bdaeeb20e4edac407e073664e5b503b0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27\u201347 lines \u00D7 2): src/flock/api/graph_builder.py:1257-1283 | src/flock/components/server/control/helpers.py:251-297 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/api/graph_builder.py"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7935640b473a7ccf199fa90f4a60d006702b68eacfcc0619eb75ea50e1eedaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201338 lines \u00D7 2): src/flock/core/orchestrator.py:731-768 | src/flock/core/orchestrator.py:850-872 \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":"src/flock/core/orchestrator.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"87648665ac0f4187a9b2e553932e14d9ed6b4c93a10f51c48922748f25d4dcd0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): src/flock/mcp/types/types.py:206-242 | src/flock/mcp/types/types.py:293-329 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/mcp/types/types.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"e545de7c2069d49a17609a183819ddfbde3e72b98454645ab498f17f7407fd85"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (32\u201336 lines \u00D7 2): src/flock/integrations/openclaw/streaming.py:81-116 | src/flock/integrations/openclaw/streaming.py:458-489 \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":"src/flock/integrations/openclaw/streaming.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"60729b973332a082508a863d30cafcc831a34fe82ccc02d11bfea382cec22071"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): src/flock/logging/trace_and_logged.py:360-390 | src/flock/logging/trace_and_logged.py:413-443 \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":"src/flock/logging/trace_and_logged.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fe75ce8f413a89e2b2f9ec5d1b8a6db04b9d2b8f62cb75d13bee9f54b2277a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (25\u201327 lines \u00D7 2): src/flock/api/graph_builder.py:1290-1316 | src/flock/components/server/control/helpers.py:302-326 \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 \u0060src/flock/api/graph_builder.py:1290\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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":"src/flock/api/graph_builder.py"},"region":{"startLine":1290}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d1f3d68c5517d7dff7fe919af37fb8d3c88f11554aa912d6ce9614c71f6652"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201326 lines \u00D7 2): src/flock/logging/formatters/theme_builder.py:206-224 | src/flock/logging/formatters/themed_formatter.py:210-235 \u2014 before extracting anything, compare \u0060src/flock/logging/formatters/theme_builder.py\u0060 and \u0060src/flock/logging/formatters/themed_formatter.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc618b386d7864b7b5785e1c0a09b7cc62d4d8b4176e181a7152331e23f5182"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201325 lines \u00D7 2): src/flock/orchestrator/batch_accumulator.py:120-138 | src/flock/orchestrator/batch_accumulator.py:152-176 \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":"src/flock/orchestrator/batch_accumulator.py"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ebb375505876a777e5b5bd241c73e1e7cfe5863bda1c0b0310516c85938813"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): src/flock/agent/component_lifecycle.py:133-155 | src/flock/agent/component_lifecycle.py:173-196 \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":"src/flock/agent/component_lifecycle.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"02ab470b53acc071d4d04d54f9b920e461b33df54a14d4022df712a34097a425"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): src/flock/integrations/openclaw/engine.py:164-187 | src/flock/integrations/openclaw/engine.py:215-236 \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 \u0060src/flock/integrations/openclaw/engine.py:164\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":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bd5cacce93f50e9fdca1762c26e2f6b65b4a711c7e4b87c16cf404a165ed11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): src/flock/integrations/openclaw/streaming.py:55-78 | src/flock/integrations/openclaw/streaming.py:432-455 \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":"src/flock/integrations/openclaw/streaming.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ed8d354ea14a3e3b57e9b3fe261422cc473e7447bfc5f4c25f3de23ebd6603d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): src/flock/mcp/types/types.py:182-203 | src/flock/mcp/types/types.py:269-290 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/mcp/types/types.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f58473ed2ca6ee74ea8844a70e62dbcbd403190067f7d9f3a07cb0f7f7ce4888"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 2): src/flock/api/service.py:440-456 | src/flock/components/server/agents/agents_component.py:136-154 \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 \u0060src/flock/components/server/agents/agents_component.py:136\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. 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":"src/flock/api/service.py"},"region":{"startLine":440}}}],"partialFingerprints":{"codehealthFindingId/v1":"9adba8c48b2b803a0a348d623d50257c1630c671e5b905d71eba7736254840f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): src/flock/orchestrator/server_manager.py:256-274 | src/flock/orchestrator/server_manager.py:372-387 \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 \u0060src/flock/orchestrator/server_manager.py:256\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":"src/flock/orchestrator/server_manager.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcd023592e93f1c0f85034c38b04ee66a4237bc03589849212587c1cee5971f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): src/flock/engines/dspy/streaming_executor.py:422-438 | src/flock/integrations/openclaw/engine.py:561-577 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/engines/dspy/streaming_executor.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"8416ac667e3b177134f1dd119b2f0f58bf2fffbfb5e6f5c2063e510b415c4120"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/flock/logging/formatters/theme_builder.py:233-248 | src/flock/logging/formatters/themed_formatter.py:245-264 \u2014 before extracting anything, compare \u0060src/flock/logging/formatters/theme_builder.py\u0060 and \u0060src/flock/logging/formatters/themed_formatter.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/flock/logging/formatters/theme_builder.py:233\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"466aea1ef6a2a0d1af80b3aa9db552cc7c9953f210b02d2449df55be77672d20"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): src/flock/storage/dapr/dapr_state_blackboard_store.py:984-999 | src/flock/storage/dapr/dapr_state_blackboard_store.py:1012-1027 \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 \u0060src/flock/storage/dapr/dapr_state_blackboard_store.py:984\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/storage/dapr/dapr_state_blackboard_store.py"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"6448b75a413857afaea0b852692d45b18fce0337fca575990209bb1d84a7c8eb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): src/flock/mcp/servers/sse/flock_sse_server.py:83-97 | src/flock/mcp/servers/streamable_http/flock_streamable_http_server.py:97-111 \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":"src/flock/mcp/servers/sse/flock_sse_server.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"d94a132a9faea0a5e33c34a4f3b1336cc8b935f169be73dad4864b8e810984be"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): src/flock/logging/formatters/theme_builder.py:26-39 | src/flock/logging/formatters/themed_formatter.py:26-43 \u2014 before extracting anything, compare \u0060src/flock/logging/formatters/theme_builder.py\u0060 and \u0060src/flock/logging/formatters/themed_formatter.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e638dae7f1834ea1fa7d514e2a580ede9dcf1c89c654f85e7c20d13a2c820c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/flock/engines/dspy/signature_builder.py:244-256 | src/flock/engines/dspy/signature_builder.py:402-414 \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":"src/flock/engines/dspy/signature_builder.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb30dc56c6416f2bc846b1ea3a7779b0978e22b15ae2cf28579eea32fcce8e41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/flock/engines/dspy/signature_builder.py:286-298 | src/flock/engines/dspy/signature_builder.py:460-472 \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":"src/flock/engines/dspy/signature_builder.py"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc5840bc8af6788fbe0b0cc82c9f84f6608c4b97a970420f6d4fc13de49189c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/flock/engines/dspy/streaming_executor.py:287-299 | src/flock/engines/dspy/streaming_executor.py:557-569 \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":"src/flock/engines/dspy/streaming_executor.py"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"6500420ac9533684578d8ffeb8623e56be1448be1e10cd7d7ad12a28714d547d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/flock/mcp/servers/sse/flock_sse_server.py:70-82 | src/flock/mcp/servers/streamable_http/flock_streamable_http_server.py:79-91 \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":"src/flock/mcp/servers/sse/flock_sse_server.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"8165618eb4fc7f9546ba48b1674aa23b41a6b10d2defcf7d39a989c4f0ecb970"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): src/flock/storage/dapr/dapr_state_blackboard_store.py:739-751 | src/flock/storage/dapr/dapr_state_blackboard_store.py:782-794 \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":"src/flock/storage/dapr/dapr_state_blackboard_store.py"},"region":{"startLine":739}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dc5c5e315a2483ac0f8882feee017638d82424a031e8714081a124e35b24d8f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/flock/components/agent/guard.py:172-182 | src/flock/components/agent/guard.py:203-213 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/components/agent/guard.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1e7e137faef6c26a3820a41619b8fe325a603a97c3ce085cc62dd07c81f221b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/flock/core/store.py:334-344 | src/flock/storage/dapr/dapr_state_blackboard_store.py:1091-1101 \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":"src/flock/core/store.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"77308854da4851f86ca673daf277be1a0d60bd4fc103e929c0339d8891ab6a60"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3): src/flock/components/server/traces/trace_component.py:434-442 | src/flock/components/server/traces/trace_component.py:542-550 | src/flock/components/server/traces/trace_component.py:592-600 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/flock/components/server/traces/trace_component.py:434\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":"src/flock/components/server/traces/trace_component.py"},"region":{"startLine":434}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d3ea9e6c23cbcdd574da71d6a7f15b5a956b960a89d4befd971096e3d70a9ab"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/flock/components/server/agents/agents_component.py:74-82 | src/flock/components/server/artifacts/artifacts_component.py:156-164 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/components/server/agents/agents_component.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"5309d8f1c59c36aa31fe61bdf268e59dc6cdba6af462d7aaa1913aec2d8b9f06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): src/flock/decisions/providers.py:563-571 | src/flock/decisions/providers.py:669-677 \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 \u0060src/flock/decisions/providers.py:563\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/decisions/providers.py"},"region":{"startLine":563}}}],"partialFingerprints":{"codehealthFindingId/v1":"1150cee941aa131f0534820a2cf737a7fdd4732be94ffa3e1c2744e4e6c94239"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20138 lines \u00D7 4): src/flock/components/server/agents/agents_component.py:160-163 | src/flock/components/server/artifacts/artifacts_component.py:444-451 | src/flock/components/server/artifacts/artifacts_component.py:558-565 | src/flock/components/server/artifacts/artifacts_component.py:640-647 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/flock/components/server/artifacts/artifacts_component.py:444\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":"src/flock/components/server/agents/agents_component.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e9e0fe1866b482c5682d98ff0ddd55faa2451b4dcaad625ba47e56f1d42a24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/flock/api/graph_builder.py:798-805 | src/flock/api/graph_builder.py:1095-1102 \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 \u0060src/flock/api/graph_builder.py:798\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":"src/flock/api/graph_builder.py"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"1941b95532703abadff0f4047c41d9fa85351819dbef363b78c428b2936983fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): src/flock/logging/trace_and_logged.py:341-347 | src/flock/logging/trace_and_logged.py:393-400 \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":"src/flock/logging/trace_and_logged.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"7849f6aa3b12c2b8dc348a45afdb3f97c710b13e69488dff12e8f5470db25656"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (4\u20137 lines \u00D7 4): src/flock/api/service.py:325-331 | src/flock/api/service.py:370-376 | src/flock/api/service.py:461-464 | src/flock/components/server/agents/agents_component.py:163-166 \u2014 there are 4 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/flock/api/service.py:325\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060src/flock/components/server/agents/agents_component.py:161\u0060 calls \u0060Query\u0060 and \u0060src/flock/api/service.py:461\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":"src/flock/api/service.py"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e813eb0a2a95817a6dab6d5b9975b2b516c7c938574a2291e71ae5697c7cff2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5\u20137 lines \u00D7 2): src/flock/logging/formatters/theme_builder.py:272-276 | src/flock/logging/formatters/themed_formatter.py:288-294 \u2014 before extracting anything, compare \u0060src/flock/logging/formatters/theme_builder.py\u0060 and \u0060src/flock/logging/formatters/themed_formatter.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/flock/logging/formatters/theme_builder.py:272\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"76c4bebd4884ee2095e6c807cbf889c62cfd4d95a6e592e54d8280757960a4dc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): src/flock/logging/formatters/theme_builder.py:243-248 | src/flock/logging/formatters/themed_formatter.py:258-264 | src/flock/logging/formatters/themed_formatter.py:422-429 \u2014 before extracting anything, compare \u0060src/flock/logging/formatters/theme_builder.py\u0060 and \u0060src/flock/logging/formatters/themed_formatter.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/flock/logging/formatters/theme_builder.py:243\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":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a698649126e7a9475fe9c77cb3db86ebf1038a1a6b4cd5c2db88a299eefdafa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3): src/flock/logging/formatters/theme_builder.py:272-276 | src/flock/logging/formatters/themed_formatter.py:288-292 | src/flock/logging/formatters/themed_formatter.py:453-459 \u2014 before extracting anything, compare \u0060src/flock/logging/formatters/theme_builder.py\u0060 and \u0060src/flock/logging/formatters/themed_formatter.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/flock/logging/formatters/theme_builder.py:272\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":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"6385536fdee502c19369c8f0043e7cf950c46fd1fd9a0bd9e271c2811c75c55a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): src/flock/logging/formatters/theme_builder.py:281-285 | src/flock/logging/formatters/themed_formatter.py:301-306 \u2014 before extracting anything, compare \u0060src/flock/logging/formatters/theme_builder.py\u0060 and \u0060src/flock/logging/formatters/themed_formatter.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060src/flock/logging/formatters/theme_builder.py:281\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":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c228be9217564edcde1608c2e26ddd13c2a8ff5e111e9a7902c24c2aa238476"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/flock/api/graph_builder.py:611-621 | src/flock/components/agent/output_utility.py:143-153 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060agent\u0060 to \u0060object\u0060 in one and \u0060\u0022Agent\u0022\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":"src/flock/api/graph_builder.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"062f17944dc4b745bb8635e108bb392bd41f36c7d754f051a64669b778eeedfd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): src/flock/components/server/agents/agents_component.py:55-62 | src/flock/components/server/artifacts/artifacts_component.py:137-144 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/components/server/agents/agents_component.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"77669fbc30db9fd8e2459c78d226479650bf085e5b5713b1efeb9c07bccd8fc9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): src/flock/core/artifacts.py:48-57 | src/flock/core/visibility.py:77-86 \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 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":"src/flock/core/artifacts.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"429a1bffff9d09530058b7e0545f820cc0446835d8d4f74f3f1409b40e17d4d4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): src/flock/integrations/foundry/__init__.py:73-79 | src/flock/storage/__init__.py:87-93 | src/flock/storage/dapr/__init__.py:79-85 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 3 times. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/integrations/foundry/__init__.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"112177fdc866e73af2199eac573dc50c12065164be3e2da070aa87c79d1b30ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): src/flock/logging/formatters/theme_builder.py:192-202 | src/flock/logging/formatters/themed_formatter.py:189-206 \u2014 before extracting anything, compare \u0060src/flock/logging/formatters/theme_builder.py\u0060 and \u0060src/flock/logging/formatters/themed_formatter.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7eae28334a4eae02855c84acaf87724cbd90c4c8d4404930cc7fe6903d98ea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): src/flock/orchestrator/artifact_manager.py:60-76 | src/flock/orchestrator/scheduler.py:223-234 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. Note first that the copies are not typed on the same thing: the declarations holding them bind \u0060listener\u0060 to \u0060PublicationListener\u0060 in one and \u0060TaskOutcomeListener\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":"src/flock/orchestrator/artifact_manager.py"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba66c1105e216ee4901679aeda5a64436f8103b86eaedc2dc434b69df6b7629e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (54\u201355 lines \u00D7 3): examples/12-dapr/inmemory/flock_dapr_inmemory.py:76-130 | examples/12-dapr/postgresql_unencrypted/flock_dapr_postgresql.py:77-130 | examples/12-dapr/redis_encrypted/flock_dapr_redis.py:77-130 \u2014 \u0060examples/12-dapr/inmemory/flock_dapr_inmemory.py\u0060 and \u0060examples/12-dapr/postgresql_unencrypted/flock_dapr_postgresql.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 85 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/12-dapr/inmemory/flock_dapr_inmemory.py:76\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":"examples/12-dapr/inmemory/flock_dapr_inmemory.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ece8cb0ca93878032fa1ce6851d9e51c0573c7e8c1ecc121de5e35600de054f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (28\u201343 lines \u00D7 3): examples/09-server-components/05_websocket_component.py:82-124 | examples/09-server-components/06_artifacts_component.py:86-114 | examples/09-server-components/11_tracing_component.py:113-140 \u2014 before extracting anything, compare \u0060examples/09-server-components/05_websocket_component.py\u0060 and \u0060examples/09-server-components/06_artifacts_component.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/09-server-components/05_websocket_component.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"b086017d5c3656bf75ab518644823df2f7d0e1c7f526746f08b7dbe645c7d12c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201340 lines \u00D7 2): examples/09-server-components/08_control_routes_component.py:105-144 | examples/09-server-components/12_complete_composition.py:246-267 \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 \u0060examples/09-server-components/08_control_routes_component.py:105\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":"examples/09-server-components/08_control_routes_component.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dc841b427d575918ae348f6033e53ecf7351ba7194433e11a048bd0e1081758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201336 lines \u00D7 4): examples/09-server-components/06_artifacts_component.py:122-142 | examples/09-server-components/08_control_routes_component.py:97-121 | examples/09-server-components/10_themes_component.py:98-133 | examples/09-server-components/11_tracing_component.py:148-181 \u2014 before extracting anything, compare \u0060examples/09-server-components/06_artifacts_component.py\u0060 and \u0060examples/09-server-components/08_control_routes_component.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/09-server-components/08_control_routes_component.py:97\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. Note 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":"examples/09-server-components/06_artifacts_component.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb0ba99a1744ebdbb279741861bad92e677baf3dc8e415e9cae1e5803a1cdd41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20\u201333 lines \u00D7 5): examples/09-server-components/06_artifacts_component.py:127-146 | examples/09-server-components/08_control_routes_component.py:104-124 | examples/09-server-components/10_themes_component.py:105-137 | examples/09-server-components/11_tracing_component.py:153-185 | examples/09-server-components/12_complete_composition.py:245-264 \u2014 before extracting anything, compare \u0060examples/09-server-components/06_artifacts_component.py\u0060 and \u0060examples/09-server-components/08_control_routes_component.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 141 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/09-server-components/08_control_routes_component.py:104\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":"examples/09-server-components/06_artifacts_component.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f924e4be738c582b9bdad982f408d32af7b3ce652458edba5781358c1e17a9e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 3): examples/12-dapr/inmemory/flock_dapr_inmemory.py:138-167 | examples/12-dapr/postgresql_unencrypted/flock_dapr_postgresql.py:139-168 | examples/12-dapr/redis_encrypted/flock_dapr_redis.py:139-168 \u2014 \u0060examples/12-dapr/inmemory/flock_dapr_inmemory.py\u0060 and \u0060examples/12-dapr/postgresql_unencrypted/flock_dapr_postgresql.py\u0060 are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other \u2014 this scan matched 2 separate duplicated blocks between them, totalling at least 85 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/12-dapr/inmemory/flock_dapr_inmemory.py:138\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":"examples/12-dapr/inmemory/flock_dapr_inmemory.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"39eb05dcd2b1a0d3d3590d76fdb49ab33ec123afd518ee26fbd5079cb09c7ba7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 3): examples/09-server-components/04_health_component.py:100-122 | examples/09-server-components/06_artifacts_component.py:77-99 | examples/09-server-components/11_tracing_component.py:104-126 \u2014 before extracting anything, compare \u0060examples/09-server-components/06_artifacts_component.py\u0060 and \u0060examples/09-server-components/11_tracing_component.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 207 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/09-server-components/04_health_component.py"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"112b05f5f83e8776e8d01aa0577617e96df5c098818fb7db6979d27dac2b49d0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2): examples/09-server-components/07_agents_component.py:117-138 | examples/09-server-components/08_control_routes_component.py:68-89 \u2014 before extracting anything, compare \u0060examples/09-server-components/07_agents_component.py\u0060 and \u0060examples/09-server-components/08_control_routes_component.py\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 62 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/09-server-components/07_agents_component.py:117\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":"examples/09-server-components/07_agents_component.py"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d5d390c433543e50b65046ac71b9fec568ce5c6f2b8f0b7c130846d9a91758"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 6): examples/09-server-components/05_websocket_component.py:81-100 | examples/09-server-components/06_artifacts_component.py:85-104 | examples/09-server-components/07_agents_component.py:138-157 | examples/09-server-components/08_control_routes_component.py:86-105 | examples/09-server-components/10_themes_component.py:87-106 | examples/09-server-components/11_tracing_component.py:112-131 \u2014 before extracting anything, compare \u0060examples/09-server-components/05_websocket_component.py\u0060 and \u0060examples/09-server-components/06_artifacts_component.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/09-server-components/05_websocket_component.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"794eb76b4b504901a56c4d6fdacb663e9459247684b69a2fe5e755061b83d93b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): examples/09-server-components/01_authentication_component.py:28-47 | examples/09-server-components/01_authentication_component.py:187-205 \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 \u0060examples/09-server-components/01_authentication_component.py:28\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":"examples/09-server-components/01_authentication_component.py"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f26379f6456e29b2446ce48d2400fe67550f9de3ae171f45ca482b9f043102"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): examples/01-getting-started/15_iot_sensor_batching.py:118-136 | examples/01-getting-started/15_iot_sensor_batching.py:141-156 \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":"examples/01-getting-started/15_iot_sensor_batching.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b7a77499192a7d3afd715f18003a8e69ce85a577d5e6f1054d9927c5fbc3d17"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201319 lines \u00D7 2): examples/09-server-components/01_authentication_component.py:141-159 | examples/09-server-components/01_authentication_component.py:301-312 \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 \u0060examples/09-server-components/01_authentication_component.py:141\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":"examples/09-server-components/01_authentication_component.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"1460b4c98219cb45a41ebe258e654cb71e8e7e20351cb7a82433cbae359a4489"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): examples/09-server-components/04_health_component.py:108-126 | examples/09-server-components/09_static_files_component.py:225-244 \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":"examples/09-server-components/04_health_component.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d69d58ed1d36da52f6127dfe6b8e9b0630da8e451403e0a7b6ceaf9333748c94"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 8): examples/09-server-components/04_health_component.py:107-125 | examples/09-server-components/05_websocket_component.py:80-99 | examples/09-server-components/06_artifacts_component.py:84-103 | examples/09-server-components/07_agents_component.py:137-156 | examples/09-server-components/08_control_routes_component.py:85-104 | examples/09-server-components/09_static_files_component.py:224-241 | examples/09-server-components/10_themes_component.py:86-105 | examples/09-server-components/11_tracing_component.py:111-130 \u2014 before extracting anything, compare \u0060examples/09-server-components/05_websocket_component.py\u0060 and \u0060examples/09-server-components/06_artifacts_component.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/09-server-components/04_health_component.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"807f29e2763ee68aa8217271f61f0cc2d7773a142afb349081bef2a5c68147fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): examples/03-hackathon/07_joinspec_correlation.py:150-166 | examples/03-hackathon/07_joinspec_correlation.py:187-204 \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 \u0060examples/03-hackathon/07_joinspec_correlation.py:187\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":"examples/03-hackathon/07_joinspec_correlation.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"87376c12da2eed4ace36fd2ab8da523510bc54febe7b21d510ebdb7b98165281"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201318 lines \u00D7 2): examples/09-server-components/01_authentication_component.py:137-154 | examples/09-server-components/01_authentication_component.py:288-298 \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. 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":"examples/09-server-components/01_authentication_component.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"744ced180c041ee01ba58a3323fd6211981b7c979ad6de7842aa6e0e59292249"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): examples/09-server-components/05_websocket_component.py:62-79 | examples/09-server-components/06_artifacts_component.py:71-88 \u2014 before extracting anything, compare \u0060examples/09-server-components/05_websocket_component.py\u0060 and \u0060examples/09-server-components/06_artifacts_component.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/09-server-components/05_websocket_component.py:62\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":"examples/09-server-components/05_websocket_component.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd49dac65b5388695b0fa0cb5057e9c00f983dcbb3b97cfa48b48f2a2755f63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 5): examples/09-server-components/05_websocket_component.py:68-84 | examples/09-server-components/06_artifacts_component.py:124-142 | examples/09-server-components/08_control_routes_component.py:101-121 | examples/09-server-components/10_themes_component.py:102-133 | examples/09-server-components/11_tracing_component.py:150-181 \u2014 before extracting anything, compare \u0060examples/09-server-components/05_websocket_component.py\u0060 and \u0060examples/09-server-components/06_artifacts_component.py\u0060 as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 133 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060examples/09-server-components/08_control_routes_component.py:101\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":"examples/09-server-components/05_websocket_component.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"122b32f7dbb19992370f3cde2ee630fa1c91f38e88263d0f7a37cc5cef5a4aa9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201316 lines \u00D7 3): examples/15-decisions/07_escalation.py:136-151 | examples/15-decisions/08_voting.py:134-147 | examples/15-decisions/09_shadow.py:126-139 \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 \u0060examples/15-decisions/07_escalation.py:136\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":"examples/15-decisions/07_escalation.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f39149199b72373ea2e0e51ba5f50d6eeb9f53b8e11500dd07ae35256318630"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): examples/02-patterns/visibility/01_basic_visibility.py:75-88 | examples/02-patterns/visibility/01_basic_visibility.py:91-105 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060examples/02-patterns/visibility/01_basic_visibility.py:89\u0060 calls \u0060run_until_idle\u0060 and \u0060examples/02-patterns/visibility/01_basic_visibility.py:72\u0060 does not \u2014 after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/02-patterns/visibility/01_basic_visibility.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"39211646a66def32b257136d9dae511a1fa9e2516a2f94442f8f6512f105a266"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): examples/05-engines/potion_batch_engine.py:142-153 | examples/06-agent-components/cheer_meter_component.py:102-114 \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 \u0060examples/05-engines/potion_batch_engine.py:142\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"examples/05-engines/potion_batch_engine.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"56365e18ce1bb9994bbe22c56ec481bb04ab0b90c4cd7036f402e9ec94344c7a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): examples/09-server-components/01_authentication_component.py:128-141 | examples/09-server-components/12_complete_composition.py:84-95 \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 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 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":"examples/09-server-components/01_authentication_component.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"81ccdfd9f5590e0c3aac31d05bf3b4162fbd7b63f4202d237118d4999f32caa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/05-engines/01_adapter_comparison.py:122-132 | examples/05-engines/01_adapter_comparison.py:138-148 \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":"examples/05-engines/01_adapter_comparison.py"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d88eecd26c103d9d9e6fb0d8ed60b1c0fdbb50a7feae5add9d23b7a8f2ab82"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/15-decisions/04_question_types.py:202-212 | examples/15-decisions/10_explain.py:165-175 \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":"examples/15-decisions/04_question_types.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"8685612ae6c7e69e3a0a86834f77309acf2b508740935d8b261839b7c96d4ffd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/15-decisions/05_compliance_checklist.py:211-221 | examples/15-decisions/11_coverage.py:163-173 \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":"examples/15-decisions/05_compliance_checklist.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc16e437110f672a010eb003a32a0b0d4024ecdbf222df137b90c331e9b832cb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): examples/15-decisions/08_voting.py:175-185 | examples/15-decisions/09_shadow.py:177-187 \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":"examples/15-decisions/08_voting.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"35616860d2249536ad023949d680b5ac5a18c4543c6d9aa5f0b1c8752f81c3f3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/01-getting-started/05_mcp_and_tools.py:30-39 | examples/01-getting-started/07_web_detective.py:28-37 \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":"examples/01-getting-started/05_mcp_and_tools.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c84ce8973f7bf6ebc46dc3e7d7431e39323dd64dc0fe542edad2426e0820bb2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): examples/15-decisions/04_question_types.py:170-179 | examples/15-decisions/10_explain.py:127-136 \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":"examples/15-decisions/04_question_types.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"7004cd833a678675f77cc3434d198df28fea1f55986931627dd2b62fb81599e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/15-decisions/10_explain.py:128-136 | examples/15-decisions/13_human_review.py:138-146 \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":"examples/15-decisions/10_explain.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"e98b9e86bf1962f80deda7487ea1cc0b0433d00d4e8760cda58f4372c4e4a87d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/15-decisions/11_coverage.py:98-106 | examples/15-decisions/12_long_documents.py:97-105 \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 \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060examples/15-decisions/12_long_documents.py:109\u0060 calls \u0060manuals\u0060 and \u0060examples/15-decisions/11_coverage.py:110\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":"examples/15-decisions/11_coverage.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"88cf4d3e70f8f6acc668809d66626b9e77a3bf1c79dd1501b04a2370592f8d05"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): examples/03-hackathon/09_mcp_web_researcher.py:258-265 | examples/03-hackathon/10_mcp_filesystem_roots.py:219-226 | examples/03-hackathon/11_agent_components_news_batching.py:360-369 \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":"examples/03-hackathon/09_mcp_web_researcher.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b837a0aa90303bd9c050db2facac9f3a1ed4204b39b7e0535e9641651698984"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): examples/15-decisions/05_compliance_checklist.py:139-147 | examples/15-decisions/11_coverage.py:85-93 \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 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":"examples/15-decisions/05_compliance_checklist.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"1950279b32532b515e4941c8ead5f47e8ec7d7cb1c4665be4adfd1a962e0e647"}},{"ruleId":"D6","level":"warning","message":{"text":"Low cohesion: Flock (LCOM4 5): Flock\u0027s methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable \u2014 your repository\u0027s bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected \u2014 and which would otherwise dominate this list \u2014 are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/core/orchestrator.py"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"29dfe027db2577ebba5a581d5fc4702895cd107f661556bea754ea4f7ae0e89e"}},{"ruleId":"D10","level":"warning","message":{"text":"Skipped test: should emit warning when storage quota exceeded: Skipped \u2014 switched off by it.skip"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/indexeddb.test.ts"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"52180934ee7ce251af337d65f8d4249c0479568bd0ff8adaeb32dfd99c6da6cf"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: should pass filters from filterStore to backend: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/store/graphStore.test.ts"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb994712d58f6c4cca2b2b644f1a3fcc86249546cc1e611d08894d5357d86204"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: should update filter facets from backend statistics: This test sets up 3 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 1 check(s) that the doubles were called. It pins how the code is wired, not what it does: it passes with a wrong result and fails when a call is harmlessly reordered or merged. Assert the outcome instead (the value returned, the state left behind), build collaborators and value objects for real or with a small hand-written fake, and keep doubles for the boundaries the test cannot own \u2014 the network, the clock, the file system."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/store/graphStore.test.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bda8797fccdadfe0cc57024ec9245b6161989033257e532233adfcd17801012"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/core/agent.py: src/flock/core/agent.py changed 35 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in AgentBuilder.decides at line 803. 19 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/core/agent.py\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":"src/flock/core/agent.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9da221f43e547758c816009f9b368ac32ed91a0a018e95d5b88da4b03279fd0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/frontend/src/components/graph/DecisionDisplay.tsx: src/flock/frontend/src/components/graph/DecisionDisplay.tsx changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in DecisionDisplay.DecisionBars at line 1254. 14 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/frontend/src/components/graph/DecisionDisplay.tsx\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":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"f104b1b903a8a78c1d3c8926c2c4bb96e978a405057afa33d5ada931e4c1ed8c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/api/graph_builder.py: src/flock/api/graph_builder.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in GraphAssembler._build_agent_nodes at line 322. 12 of those changes were fix/bug commits, and the other 12 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/api/graph_builder.py\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":"src/flock/api/graph_builder.py"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"7734b9d2446685177b775f91f3124a4410994ba5994d67967cd5cd9bbdf206d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/decisions/engine.py: src/flock/decisions/engine.py changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in DecisionEngine._checklist_decision at line 892. 18 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/decisions/engine.py\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":"src/flock/decisions/engine.py"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"41448d21838b0452d5ff0d8ca54f7c98412c394eada0125415e8b7c680d7c839"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/frontend/src/components/controls/PublishControl.tsx: src/flock/frontend/src/components/controls/PublishControl.tsx changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 146 in PublishControl.PublishControl at line 23. 5 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/frontend/src/components/controls/PublishControl.tsx\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":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54246ae5021fa5e43f13ecaa6d1ff5378c0fbab092c41bc49698d9b94cacfe6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/engines/dspy_engine.py: src/flock/engines/dspy_engine.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in DSPyEngine._evaluate_internal at line 386. 10 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/engines/dspy_engine.py\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":"src/flock/engines/dspy_engine.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c29c2fbd2517601943a8a171dd00ac5514922a0d197e686265f3df4b6290a47"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/decisions/graph.py: src/flock/decisions/graph.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in graph.decision_view at line 174. 3 of those changes were fix/bug commits, and the other 15 changed it for other reasons \u2014 this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/decisions/graph.py\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":"src/flock/decisions/graph.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"103f05ed8b96375b7621f258463112135e588d5c4343843ee38d1df4bb34111d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/components/server/artifacts/artifacts_component.py: src/flock/components/server/artifacts/artifacts_component.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in ArtifactsComponent._publish_upload at line 307. 11 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/components/server/artifacts/artifacts_component.py\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":"src/flock/components/server/artifacts/artifacts_component.py"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"0519bcc892befd106183a62d914ad133851a5441614d1e7e6e8a38ce341a221d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/frontend/src/components/graph/AgentNode.tsx: src/flock/frontend/src/components/graph/AgentNode.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in AgentNode.AgentNode at line 12. 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/frontend/src/components/graph/AgentNode.tsx\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":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"53fd97cf6b2e00107011384ce8b2b13b12eae5742cdab296adf34616f9f2dd22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/engines/dspy/signature_builder.py: src/flock/engines/dspy/signature_builder.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in DSPySignatureBuilder.prepare_signature_for_output_group at line 175. 4 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/engines/dspy/signature_builder.py\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":"src/flock/engines/dspy/signature_builder.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c13ddce284bc40d6cd6d5a2853c7da33e6711f279110c58ced476b4d78ee46f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/logging/trace_and_logged.py: src/flock/logging/trace_and_logged.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in trace_and_logged._extract_span_attributes at line 249. 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/logging/trace_and_logged.py\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":"src/flock/logging/trace_and_logged.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"86af4293e1a2b9702aca94bf6ae6fbd51dfef2d90bde3f22c4ebbfc413026a6d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/decisions/calibration.py: src/flock/decisions/calibration.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in calibration.calibrate at line 96. 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/decisions/calibration.py\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":"src/flock/decisions/calibration.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"e35a96a1c259ff3e5d8359e5fed7d9d748cf5e6cea99c58adcdb27d0d23727bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/decisions/choice.py: src/flock/decisions/choice.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in _QuestionMeta.__new__ at line 144. 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/decisions/choice.py\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":"src/flock/decisions/choice.py"},"region":{"startLine":144}}}],"partialFingerprints":{"codehealthFindingId/v1":"97487ac1c563aa9a664539610cd3e15842164330a3bf1bc59f4750a8a8068291"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/logging/telemetry.py: src/flock/logging/telemetry.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in TelemetryConfig.setup_tracing at line 160. 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/logging/telemetry.py\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":"src/flock/logging/telemetry.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ca6a05897b7b73c4dd080901be17dca4b0fe7d93c2503e6e1273a633e55a6a2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/frontend/src/components/graph/MessageNode.tsx: src/flock/frontend/src/components/graph/MessageNode.tsx changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in MessageNode.MessageNode at line 8. 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/frontend/src/components/graph/MessageNode.tsx\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":"src/flock/frontend/src/components/graph/MessageNode.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"0efa570fdb867408e63a4638358df285317fcd11edf4c409a2a859dbe07c6288"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/frontend/src/services/websocket.ts: src/flock/frontend/src/services/websocket.ts changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in WebSocketClient.setupEventHandlers at line 166. 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/frontend/src/services/websocket.ts\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":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"77a5e3495b850316115fe5469ec103e8249b580f07f8af327fbfe106b57f2e86"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/agent/output_processor.py: src/flock/agent/output_processor.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in OutputProcessor.make_outputs_for_group at line 46. 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/agent/output_processor.py\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":"src/flock/agent/output_processor.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"106801d3e721940dafd955baf017baa146fe415e1e41776067abcc140d333a6f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/frontend/src/components/details/RunStatusTab.tsx: src/flock/frontend/src/components/details/RunStatusTab.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in RunStatusTab.RunStatusTab at line 22. 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/frontend/src/components/details/RunStatusTab.tsx\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":"src/flock/frontend/src/components/details/RunStatusTab.tsx"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e819bb2e4f6836a62916451a159327f010d7f62d815d7d24780df820b6eece"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: src/flock/frontend/src/App.tsx: src/flock/frontend/src/App.tsx changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in App.App at line 16. 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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/frontend/src/App.tsx\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":"src/flock/frontend/src/App.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b1066d38aa133dbdc1fe1a443852b4ecf921d1f65ee3dfa7c0bd0c5756bc64f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/core/image.py: src/flock/core/image.py changed 11 times in last 90 days and 9 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 image.check_inline_images at line 194), 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: \u201Cfix: embedded models are checked by their field values, not model_dump() (#513)\u201D; \u201Cfix: extra base64 padding cannot shrink the image size estimate (#513)\u201D; \u201Cfix: the store-side image check enforces only the limits (#513)\u201D; \u201Cfix: image check covers embedded models and containers under url; accurate upload timing (#513)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/core/image.py\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":"src/flock/core/image.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a06d062808498f7504be31d2368d98802e2bab634c3b136a8863e07ce877783"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/api/collector.py: src/flock/api/collector.py changed 13 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 12 (its worst body is DashboardEventCollector.on_pre_consume at line 170), 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: \u201Cfix: an agent\u0027s last error is the failure the collector saw last, not the latest timestamp (#585)\u201D; \u201Cfix: agent status per agent in O(1), ordered by creation, and carried by the run events (#585)\u201D; \u201Cfix: agent status follows its runs, also when they end out of order; counted subscriptions keep their count (#585)\u201D; \u201Cfix: run durations use the monotonic clock; Run Status shows active runs without a duration (#571)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/api/collector.py\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":"src/flock/api/collector.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"5512c2dbc778a3d09726fccc21d946bf497cbbc563b74bf51781ad4116889ad2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/core/store.py: src/flock/core/store.py changed 9 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 BlackboardStore.consumptions_of at line 137), 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: \u201Cfix: an artifact\u0027s history is read by its ID in every store (#605)\u201D; \u201Cfix: a histogram range too wide for exact 64-bit buckets is rejected (#572)\u201D; \u201Cfix: histogram buckets in whole microseconds in every store; errors count by their resolved type (#572)\u201D; \u201Cfix: models with field aliases work everywhere: payloads are rebuilt from field names too (#544)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/core/store.py\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":"src/flock/core/store.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3a683a498e991e3f7cde11c69abf9086acba5fad63680491cb15f1c797ad6b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/components/server/traces/trace_component.py: src/flock/components/server/traces/trace_component.py changed 11 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 trace_component._span_from_row at line 61), 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: \u201Cfix: one trace flush at a time, no clear before it finished (#601)\u201D; \u201Cfix: dashboard trace reads connect like the tracer\u0027s exporter (#599)\u201D; \u201Cfix: agent traces for names with a slash, off the event loop, with literal SQL (#597)\u201D; \u201Cfix: the dashboard reads the trace file the tracer writes (#594)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/components/server/traces/trace_component.py\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":"src/flock/components/server/traces/trace_component.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a1e52d9c765eceb984d974b2f829ee115407a48c46cb7ed1e0edb868a6385fb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/engines/dspy/image_inputs.py: src/flock/engines/dspy/image_inputs.py 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 9 (its worst body is image_inputs.dspy_input_model at line 76), 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: \u201Cfix: models with field aliases work everywhere: payloads are rebuilt from field names too (#544)\u201D; \u201Cfix(dspy): a computed Image field is sent as an image too (#510)\u201D; \u201Cfix(dspy): keep computed fields in image copies; check the model before scanning (#510)\u201D; \u201Cfix(dspy): vision check inspects the DSPy input copy that is sent (#510)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/engines/dspy/image_inputs.py\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":"src/flock/engines/dspy/image_inputs.py"},"region":{"startLine":76}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f05eefec820a7cff17918a560b1582ee43aa80b982a6767939953765e9cafb"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/api/thumbnails.py: src/flock/api/thumbnails.py 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 6 (its worst body is thumbnails._locate_images at line 46), 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: \u201Cfix: image key segments match the JSON keys of the payload (#512)\u201D; \u201Cfix: image-like values never fail thumbnails; image modal on the modal layer (#512)\u201D; \u201Cfix: exact image sizes, stable thumbnail identity, documented keys (#512)\u201D; \u201Cfix: thumbnails off the event loop, key segments, modal overlay, isolated tests (#512)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/api/thumbnails.py\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":"src/flock/api/thumbnails.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a164128c17390c312047ba6e670427e0690496467dca422d7ab98e6097590f8"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/api/service.py: src/flock/api/service.py changed 6 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 1 (its worst body is BlackboardHTTPService.__init__ at line 62), 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: \u201Cfix: a run\u0027s webhook numbers survive eviction, the limit holds on insert (#618)\u201D; \u201Cfix: named runs keep their webhook sequence and their status route (#618)\u201D; \u201Cfix: requests continue the caller\u0027s trace at the agents level (#601)\u201D; \u201Cfix(api): carry the REST correlation id on the artifact; tolerate consumptions without one; apply external log level to dspy/litellm\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/api/service.py\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":"src/flock/api/service.py"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d05ce428b2dae3882745ffb3820298ad6762ee25a7382feb627e3db17982890"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/cli.py: src/flock/cli.py changed 6 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 10 (its worst body is cli.decisions_calibrate at line 182), 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: \u201Cfix: decisions record the decider\u0027s mode, so escalating or voting deciders get no suggestion even without an escalation or vote; the CLI prints thresholds exactly (#542)\u201D; \u201Cfix: honest recall in the calibration example; no suggestions for escalating or voting deciders; decisions record item thresholds; one threshold per item; accessible threshold list (#542)\u201D; \u201Cfix: the calibrate CLI finds persisted decisions of unimported types, rejects a zero target; dotted item ids keep their dots (#542)\u201D; \u201Cfix: calibration labels per question, grouped per decider, checked bounds; item thresholds can name their checklist (#542)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/cli.py\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":"src/flock/cli.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"388cb5313f1a52cdadbb999ce4408468c569283b334cfb3bdd30e632dc800805"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/decisions/coverage.py: src/flock/decisions/coverage.py changed 5 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 9 (its worst body is coverage.combine_results at line 96), 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: \u201Cfix: explicit coverage visibility covers decisions about subjects with mixed visibilities (#536)\u201D; \u201Cfix: coverage skips history without its subject; direct-only subscriptions cannot aggregate (#536)\u201D; \u201Cfix: coverage history counts only decisions the subscriptions receive; callable keys accept alias-only models; no sort per agent (#536)\u201D; \u201Cfix: coverages carry a revision; the highest per group is current (#536)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/decisions/coverage.py\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":"src/flock/decisions/coverage.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d52c378bf24a0fd10484446df58e5e145da1b822942db9607d0ba1458b019d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/decisions/explain.py: src/flock/decisions/explain.py 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 10 (its worst body is explain.decision_case at line 104), 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: \u201Cfix: explanations use the question text actually asked; only handles after .explains(); docs describe the more button (#534)\u201D; \u201Cfix: every decision of an AND handle reaches the explainer; batch guard in both call orders; expandable explanation note (#534)\u201D; \u201Cfix: explains(visibility=) for mixed subjects, checked before the LLM; no batch subscriptions (#534)\u201D; \u201Cfix: explanations show only evaluated candidates and refused items; no explanation without a decision (#534)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/decisions/explain.py\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":"src/flock/decisions/explain.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"c984017a47100a597bd294294f101a8eb98aae3bc849897847218699350b0d7d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/api/image_uploads.py: src/flock/api/image_uploads.py 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 8 (its worst body is image_uploads.image_slot at line 51), 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: \u201Cfix: server re-encodes dashboard images; robust upload parsing and pending state (#511)\u201D; \u201Cfix: one count per aliased field; publishing waits for picture conversions (#511)\u201D; \u201Cfix: alias keys for uploads, late picture conversions, transparent WebP (#511)\u201D; \u201Cfix: bound upload requests, accept field aliases, keep list defaults (#511)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/api/image_uploads.py\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":"src/flock/api/image_uploads.py"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b70116ec215563199229e8299861510bb9e344a88093e19a567aa3085eaab41"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/logging/auto_trace.py: src/flock/logging/auto_trace.py 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 9 (its worst body is AutoTracedMeta.__new__ at line 224), 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: \u201Cfix: export OTLP over HTTP when the OTel variables ask for it (#679)\u201D; \u201Cfix: keep a host\u0027s request span and repeated baggage headers (#601)\u201D; \u201Cfix: requests continue the caller\u0027s trace at the agents level (#601)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/logging/auto_trace.py\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":"src/flock/logging/auto_trace.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"78c3c75a7105f85f54a923a3aba46e50a1b22614a0a5bff7f8b5dbb538d58d89"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/orchestrator/artifact_manager.py: src/flock/orchestrator/artifact_manager.py 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 13 (its worst body is ArtifactManager.publish at line 107), 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: \u201Cfix: check inline images before every store write, also with sibling keys (#513)\u201D; \u201Cfix(orchestrator): validate dict publishes against the registered model\u201D; \u201Cfix(orchestrator): resolve simple type names on dict publish; harden Dapr example stacks\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/orchestrator/artifact_manager.py\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":"src/flock/orchestrator/artifact_manager.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb8ed8542705349c86949b56632fe59a2b8a162b287cb54d6d1414e217ad6e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/frontend/src/utils/imageFields.ts: src/flock/frontend/src/utils/imageFields.ts 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 imageFields.imageFieldKind at line 28), 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: \u201Cfix: thumbnails off the event loop, key segments, modal overlay, isolated tests (#512)\u201D; \u201Cfix: server re-encodes dashboard images; robust upload parsing and pending state (#511)\u201D; \u201Cfix: alias keys for uploads, late picture conversions, transparent WebP (#511)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/frontend/src/utils/imageFields.ts\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":"src/flock/frontend/src/utils/imageFields.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a95d472af653999c4879a44604507baaadb966e1f42b810975a83d0c3a3e39"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/application/application.py: src/flock/application/application.py 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 14 (its worst body is FlockApplication._check_contract at line 834), 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: \u201Cfix: FlockApplication accepts alias inputs given as another model or by field name (#544)\u201D; \u201Cfix: models with field aliases work everywhere: payloads are rebuilt from field names too (#544)\u201D; \u201Cfix: address review findings (shutdown gate, init lock, start-up cancellation, sample build)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/application/application.py\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":"src/flock/application/application.py"},"region":{"startLine":834}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e24b02df5e5d1cdb4130f74b703a9da6482019a9d13c418d800b0dcd14b7010"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/decisions/review.py: src/flock/decisions/review.py 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 10 (its worst body is review.review_decision at line 24), 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: \u201Cfix: an unknown decision id is a LookupError whatever the reviewer\u0027s name (#540)\u201D; \u201Cfix: a late review keeps the decision\u0027s end of embargo; refused decisions offer their options for review (#540)\u201D; \u201Cfix: reviewers cannot take an agent\u0027s name; a dashboard review refreshes the graph (#540)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/decisions/review.py\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":"src/flock/decisions/review.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"03598552af1e0a62d42b56a137ed7add46aa071d31fda587cf425c9ea9684fd6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: src/flock/decisions/sections.py: src/flock/decisions/sections.py 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 9 (its worst body is sections._paragraphs at line 35), 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: \u201Cfix: paragraphs lose their surrounding whitespace, so no empty section; the request bound is per pass (#538)\u201D; \u201Cfix: section splits skip whole separator runs; split_sections rejects non-positive limits (#538)\u201D; \u201Cfix: bounded section requests and max_sections; a refused section keeps an item from no; no empty trailing section (#538)\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-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-05 08:56:06 \u002B01:00\u0027 --until=\u00272026-11-03 08:56:06 \u002B01:00\u0027 --full-history --no-merges -- src/flock/decisions/sections.py\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":"src/flock/decisions/sections.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d464327dbf1d73672a2afc91d318b0a2da7cf8522674e4e4b34edbc057a4991"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO (Phase 4 Completion): Update documentation \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":"tests/test_orchestrator_combined.py"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"9302857437181e8c6b1c15b4f79df46fe4a820b960bac9797501b65f372312f2"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Log warning? \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":"src/flock/orchestrator/correlation_engine.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf5db519b220b4d3aecff00a51b941002ad7f3dbf0b55e95582100830430f81b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: get_session_id_callback is currently ignored. \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":"src/flock/mcp/client.py"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"20abb6b8fb40da17fe0d541ed3c60d40b5d85e699cbde09edf0cb4ecab848c27"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO(phase2): widen to Literal[\u0022spawn\u0022, \u0022session\u0022] once session mode lands. \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":"src/flock/integrations/openclaw/config.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5743fdb48b0d4821849b4b47c32ea4302b702faf7607dbf5e240e98ee24b1b"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Refactor to test in-memory fallback separately \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":"src/flock/frontend/src/services/indexeddb.test.ts"},"region":{"startLine":582}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c37bd0f525bd5abd0b4b78a71e32456afba51c55786e62b9e11689c08d3f8fb"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Load current .env settings from backend \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":"src/flock/frontend/src/components/settings/TracingSettings.tsx"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"af8f22b13282feed8320ec63875a03bd25c8c1977fc73d8022ab7f8123bde490"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Implement backend endpoint to save to .env \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":"src/flock/frontend/src/components/settings/TracingSettings.tsx"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"ced356876d28ed4c9b3207b69c7d9bb5d3b9d4b6f285c1b45bd6537f2466c07d"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: // TODO: Update module system to use GraphNode[] instead of Maps \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":"src/flock/frontend/src/components/modules/ModuleRegistry.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6d5597ec50074d8030692c1ac3840719509146dd1fbeb379e0a954a9bc17fed"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: Add option for remote tracing DB-Path \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":"src/flock/components/server/traces/trace_component.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"c339a5a24cc36e853ee75c2bd8bc578c746dea8db363eb5019c16c2228737014"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: relevant for MCP-component in the future \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":"src/flock/components/server/agents/agents_component.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf6274c951f0c499dc8080ade1900ba85d48fd3853873ce129a6f9158c7a66e"}},{"ruleId":"D17","level":"warning","message":{"text":"TodoComment: # TODO: relevant for MCP-Component in the future \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":"src/flock/components/server/agents/agents_component.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"29f2b8c5da9b1a83fee815324f9732c1d6144a11ab3f2588ecd332fda1229b7a"}},{"ruleId":"D21","level":"note","message":{"text":"\u0060CorrelationIDFilter\u0060 spells \u0060ID\u0060 where 40 names in the project spell it \u0060Id\u0060: 40 of 41 names in project repository spell the token \u0060Id\u0060 (40 of 41; unit: names in project repository containing \u0060Id\u0060). Peers: ImageThumbnailsProps.artifactId (src/flock/frontend/src/components/common/ImageThumbnails.tsx:8); ImageThumbnails.imageId (src/flock/frontend/src/components/common/ImageThumbnails.tsx:21); LiveOutputTabProps.nodeId (src/flock/frontend/src/components/details/LiveOutputTab.tsx:6); MessageDetailWindowProps.nodeId (src/flock/frontend/src/components/details/MessageDetailWindow.tsx:9); MessageHistoryTabProps.nodeId (src/flock/frontend/src/components/details/MessageHistoryTab.tsx:7). Rename to \u0060CorrelationIdFilter\u0060. [rule N6]"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/filters/CorrelationIDFilter.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"857103a432c136190fe4904e4ad3e2769fecf8dda7649e0a394f6087f9cff8f9"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create progress bar element\u0022 repeats the code it sits on: 4 of its 4 words (create, progress, bar, element) are already in \u0060const progressBar = document.createElement(\u0027div\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/javascripts/extra.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"de0861e80dfc65bbd06232e57d5f9208b5c7e22c20bdbac8b55d7ab20e73cabb"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add active class to current link\u0022 repeats the code it sits on: 4 of its 5 words (add, active, class, link) are already in \u0060tocLink.classList.add(\u0027md-nav__link--active-toc\u0027);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/javascripts/extra.js"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"25ddbed44fd31c7fa6f513e239a6b34e106bc89660f1ea4787cc3328a881dd45"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock the graph service\u0022 repeats the code it sits on: 3 of its 3 words (mock, graph, service) are already in \u0060vi.mock(\u0027../../services/graphService\u0027, () =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/__tests__/integration/graph-snapshot.test.tsx"},"region":{"startLine":19}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc80d0ade863ac3b1bb9c861595a30fcf5d208fac1ef0aaada095bde29c3730f"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set agent view mode\u0022 repeats the code it sits on: 4 of its 4 words (set, agent, view, mode) are already in \u0060useGraphStore.setState({ viewMode: \u0027agent\u0027 });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/__tests__/integration/graph-snapshot.test.tsx"},"region":{"startLine":274}}}],"partialFingerprints":{"codehealthFindingId/v1":"93cc2170044214fbed69fb88fc77b99689177156d8ea0c6b6eff7f23e09d7667"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set blackboard view mode\u0022 repeats the code it sits on: 4 of its 4 words (set, blackboard, view, mode) are already in \u0060useGraphStore.setState({ viewMode: \u0027blackboard\u0027 });\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/__tests__/integration/graph-snapshot.test.tsx"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e97d6dd81d74ba9201bd71404da50a140c5a0fe13d4970dd0b96da13f2d3990"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock persistence to return saved positions\u0022 repeats the code it sits on: 4 of its 5 words (mock, return, saved, positions) are already in \u0060vi.mocked(graphService.mergeNodePositions).mockImplementation(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/__tests__/integration/graph-snapshot.test.tsx"},"region":{"startLine":336}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ffda42bcd344600f32b4342af2508a7783196511fe46e091a82aaccd46e032"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock IndexedDB service\u0022 repeats the code it sits on: 4 of its 4 words (mock, indexed, db, service) are already in \u0060class MockIndexedDBService\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/__tests__/integration/indexeddb-persistence.test.tsx"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e1d9e82b83e59cd7ddd771394da3b459a3c1cc43e846830b4b1ff1d15a514b6"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Auto-set filter to correlation ID if checkbox is checked\u0022 repeats the code it sits on: 6 of its 7 words (auto, set, filter, correlation, id, checked) are already in \u0060if (autoSetFilter \u0026\u0026 response.correlation_id)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bff20ace410d931a4c4cdb4bd6c82efc710eff541f92dbe6afbacc7a6db2df8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Filter by agent name (nodeId is the agent name)\u0022 repeats the code it sits on: 4 of its 5 words (agent, name, node, id) are already in \u0060if (data.agent_name === nodeId)\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/LiveOutputTab.tsx"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"5641794446f9fde290e85218950ca6508b180ba60618572c3bec4eee91c64dcf"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Find the artifact matching this node ID\u0022 repeats the code it sits on: 5 of its 5 words (find, artifact, matching, node, id) are already in \u0060const matchingArtifact = response.items.find((item) =\u003E item.id === nodeId);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6ad669338787d0c01ad6d4d3968b852d82bcdda637940dd9c367581c206cd02"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock MessageHistoryTab component\u0022 repeats the code it sits on: 4 of its 5 words (mock, message, history, tab) are already in \u0060const MockMessageHistoryTab = ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/tabs.test.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf9c074cc83b8964e1dfdf8cb9cdb588ecd0a74af771fd02b3b79247a21b36a"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock RunStatusTab component\u0022 repeats the code it sits on: 4 of its 5 words (mock, run, status, tab) are already in \u0060const MockRunStatusTab = ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/tabs.test.tsx"},"region":{"startLine":100}}}],"partialFingerprints":{"codehealthFindingId/v1":"c66fdf368caee333a120dd4b78bcbe10202b869cc73a5b09df7e58f16289cc77"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Format schedule badge for header display\u0022 repeats the code it sits on: 4 of its 5 words (format, schedule, badge, display) are already in \u0060const formatScheduleBadge = (spec: ScheduleSpecDisplay): string =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ec25d618749767400f8f822cd0c85000353a5c182ef41022ccf4875d77909de"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Appearance settings from settings store\u0022 repeats the code it sits on: 3 of its 3 words (appearance, settings, store) are already in \u0060const agentIdleColor = useSettingsStore((state) =\u003E state.appearance.agentIdleColor);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d088feaaa9539b4ca7a0b885d362d566b7b618489859f99b7c27a1b6035ef5da"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Graph settings from settings store\u0022 repeats the code it sits on: 3 of its 3 words (graph, settings, store) are already in \u0060const edgeType = useSettingsStore((state) =\u003E state.graph.edgeType);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd92e23e395d7ecabe6f3a83c42af5e5dd1f3ee47e1badd675385295e84161ed"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Calculate next fire countdown\u0022 repeats the code it sits on: 4 of its 4 words (calculate, next, fire, countdown) are already in \u0060const calculateNextFireCountdown = (nextFireTime: string | null): string | null =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"e82d1acfd20934b3db39fb90719d285368e6b51929a535c055bdd0c78c9a13ae"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Format relative time\u0022 repeats the code it sits on: 3 of its 3 words (format, relative, time) are already in \u0060const formatRelativeTime = (lastFireTime: string | null): string =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx"},"region":{"startLine":60}}}],"partialFingerprints":{"codehealthFindingId/v1":"3381e85f35d72c27ae9df3df4afc26d08e1b09d5fc2ae1b10bc46b86f072c3d8"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Format schedule details\u0022 repeats the code it sits on: 3 of its 3 words (format, schedule, details) are already in \u0060const formatScheduleDetails = (spec: ScheduleSpecDisplay): string =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dd309def8f3d4c3daab0aec6273eb6e5d72448deeca44c2094d75fc6d09c442"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Clear module store\u0022 repeats the code it sits on: 3 of its 3 words (clear, module, store) are already in \u0060useModuleStore.getState().instances.clear();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/layout/DashboardLayout.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc8314764dc1224d7664a84f3629f1312a35e4004f3ac36ff1e23bcf135aeaf"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Clear localStorage\u0022 repeats the code it sits on: 3 of its 3 words (clear, local, storage) are already in \u0060localStorage.clear();\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/layout/DashboardLayout.tsx"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"862e987545271962179fe444c3fb54025e35c1112be409cb948171f79f64963b"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Get module definition from registry\u0022 repeats the code it sits on: 4 of its 4 words (get, module, definition, registry) are already in \u0060const moduleDefinition = moduleRegistry.get(instance.type);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/ModuleWindow.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f4fd62e4ef62da416d467d2f7d7d50dd6058491ac2eb8664697bb52b302b40"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Register Trace Viewer with Timeline, Statistics, RED Metrics, and Dependencies\u0022 repeats the code it sits on: 8 of its 8 words (register, trace, viewer, timeline, statistics, red, metrics, dependencies) are already in \u0060moduleRegistry.register({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/registerModules.ts"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3801c54690367e054e555fa7431f0fc96e788645f051a315c08b043f32ca44d"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Add event listener\u0022 repeats the code it sits on: 3 of its 3 words (add, event, listener) are already in \u0060window.addEventListener(\u0027keydown\u0027, handleKeyDown);\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/hooks/useKeyboardShortcuts.ts"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e775f2269972060c48513e9da552910535a9b63d02ce39b1bc7e3470315925"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Mock IndexedDB service\u0022 repeats the code it sits on: 4 of its 4 words (mock, indexed, db, service) are already in \u0060vi.mock(\u0027../services/indexeddb\u0027, () =\u003E ({\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/hooks/useModulePersistence.test.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"07372c738d163884f9441112362c1bcb105863c7b0f14f54a3cfa313b08fb347"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Create or update streaming message node\u0022 repeats the code it sits on: 5 of its 5 words (create, update, streaming, message, node) are already in \u0060useGraphStore.getState().createOrUpdateStreamingMessageNode(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"286f4a8710a758083c2bb315fed499a092bd7ce74b9ef337177d1322c7604e18"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Set connection timeout\u0022 repeats the code it sits on: 3 of its 3 words (set, connection, timeout) are already in \u0060this.connectionTimeout = window.setTimeout(() =\u003E\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":405}}}],"partialFingerprints":{"codehealthFindingId/v1":"09c518bb7cc92a7d284c6005a38bd57cb3a0000ab23160812928e54d39a262a5"}},{"ruleId":"D24","level":"note","message":{"text":"redundant comment: \u0022Verify overlayWebSocketState called with WebSocket state\u0022 repeats the code it sits on: 5 of its 6 words (overlay, web, socket, state, called) are already in \u0060expect(overlayWebSocketState).toHaveBeenCalledWith(\u0060. Delete it, or replace it with what the code cannot say (why it is done here, a constraint, or a consequence)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/store/graphStore.test.ts"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"74e9dc376b7d6386a16e3e019c5e799840e361b2b367ecbd5f3e369df8122926"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 2 of 2 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is \u0060(repository root)\u0060 (58568 LoC, 918 module-visible types across 74 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"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":"35779a9e3cc0da96e3283be6f22503ec97fd82b4cf4670ff2ec836ae7edb3715"},"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":"dcbb3a65551e65fa2c75ea7307ea758f575d7371f2627ce104288358be543d0d"},"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":"fc87aa32799894aa9249d9bd77ed5fee8500f63cc0fbebc5eebfeacfc15c0ba1"},"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":"cf6de289b50965ac56b155d48ad0fa9772bccf6eeff84eb575dbfb868b6bb553"},"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":"495ff68f50bf026c1432f95e5e2c62068db09bcdf9343cef91856ca2da8e06f5"},"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":"9b21febfabd6bebb61bb92041b598d7caff5f445dea25a9b96230cbaf98d5e30"},"taxa":[{"id":"CWE-214","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09: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":"e389edacfe41652f45b658bbe878a6673620a5c9f41afd14f7ff54fbeb3c5e2d"},"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":"2e602d3ff905a5aa3c46fb9efe861870a67fc34cacfc99cc0bc78d1f4eeb9842"},"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":"fac063323519145d0e7d6e493d1736b2dd7cbcec3421b72eeea3f06900433953"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"e2aea25b18931085aa3d56fb89303098436bb29d1fda5dec109efbc0b68cd286"},"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":"a75da11d650460e97d4953fd3b104d027046ce88fc639c27e4e08fc0334727e7"},"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":"c5525f593acd27de52b0f2e0aaeb75147c735541d384aef37ceecf351fa244ac"},"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":"27c00b6501f0a77259f21b2a7b96e353e09be0854d572f0a1d9a97ecf4f5c83c"},"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":"1bf5ddacbee6e4c122a77d855aa073c327b5d3801ce1f174ebf9e4b658f09f96"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"765e6746295d35af5f28f0d2672484ab66069f04ecb7b8132ce0491c860ad333"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-552","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D29","level":"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":"b8f15fd932022b5b70f8bd48659616a212aa6e66d15f916cec86c7e693469055"},"taxa":[{"id":"CWE-532","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A09:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D30","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":"bf8340270d2b3fb1a57f602bcd16aecce08e99e17c81358c8b19d43602534801"},"properties":{"dependency":{"package":"oauthlib","version":"4.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"872f8162dfe13e3ca9045a654de4ba73d52fa5d70a9569c7bfd6e95b722f8813"},"properties":{"dependency":{"package":"tornado","version":"6.5.10","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"192d71e31f5b218b409fbc8278ed8879311fdc1a2ee38721d0d47695d04f91f5"},"properties":{"dependency":{"package":"diskcache","version":"5.6.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-2447"],"reachability":{"kind":"unknown"}}}},{"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":"45febc2d647d0348284f18a91d573a1bc5c52fc1742b087d5273fd0a8f2e848d"},"properties":{"dependency":{"package":"duckdb","version":"1.4.1","advisory":"PYSEC-2025-112","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"src/flock/components/server/traces/trace_component.py","line":10}}}},{"ruleId":"D34","level":"note","message":{"text":"Orphaned files with no living knowledge: 9 of 204 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; 204 of the 290 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: src/flock/components/server/auth/auth_component.py, src/flock/components/server/middleware/middleware_component.py, src/flock/components/server/cors/cors_component.py, src/flock/components/agent/guard.py, src/flock/mcp/types/handlers.py, src/flock/components/server/models/models.py, src/flock/mcp/types/factories.py, src/flock/storage/dapr/__init__.py (and 1 more). 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":"src/flock/components/server/auth/auth_component.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c9fe4fe8698ab0e781cfe0c5f45059dfcc1d131e8eb2aa2a323809f22408e4a"}},{"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":"src/flock/components/server/middleware/middleware_component.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b417d5c4c0eef94867e96ee2331bd70d291232f6f471b7b64e724242d7e07548"}},{"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":"src/flock/components/server/cors/cors_component.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02acc43ae42c97f0a1ecfc4778ad79004c07034134a6c2cb5258b362d5789cb4"}},{"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":"src/flock/components/agent/guard.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1d3f55d7abe68ea9bd83bb9154526370e353e724e820b367a4d7dbb603fea3c"}},{"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":"src/flock/mcp/types/handlers.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"68903eeb39251b0b6cd6147846f7de0c5df6602a938f301fa5b2d7c883757006"}},{"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":"src/flock/components/server/models/models.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"73e253e629695c203645cd9a8a012e1c06a60f0d2b3c1201bb60979be0880284"}},{"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":"src/flock/mcp/types/factories.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c217b974322b326c5acb4286d6926a9f32bc995da4e2201e1ce9eceb61620a3"}},{"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":"src/flock/storage/dapr/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c03cb8dcfddd7dd1d8cd875ccb51f71e8e0a8c889bee3ae11ef83b6efb5e5c3e"}},{"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":"src/flock/mcp/types/callbacks.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9631731927fb0f660c3329489dce94b1e2106bf92e0a20b4d480e040ea27806"}},{"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":"2284995d249406d27cdead34f9e13b6fbbcbaa2ed989fc24d0f1ca55962f4826"},"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":"b1d8be9fa3a6e0358d5cf54248e9c80eb77cd4108c5b2536901fe4dd972d84c9"},"taxa":[{"id":"CICD-SEC-5","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D36","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"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":"ace515990e7ee0f17b5c17e44dd168a5bdecf90804a3a3dd845cf05540978013"},"taxa":[{"id":"CICD-SEC-3","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/filters/CorrelationIDFilter.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e5dbec12ec2d60f3df477b94f8a082dd74bc1f193f8aa41620c853cf323f81"}},{"ruleId":"AC2","level":"error","message":{"text":"Custom control named only by title on \u003Cdiv\u003E: This \u003Cdiv\u003E carries a click handler, which makes it a control, and its only name is a title attribute. A plain element maps to role=\u0022generic\u0022, which does not support a name from the author, so the title is announced as nothing at all \u2014 it is a mouse-only tooltip, unreachable on touch. Give it role=\u0022button\u0022 (which it needs anyway to be operable) so the title becomes a real name, or add an aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad6c8d9fe31180971dde21d15ff0c5df13204955dfe1ce7134231254520ddafd"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":901}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba32c53cb181962acdc591eda1d10a53a643eabfccb11c4fa322e1f953f6b88"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/AppearanceSettings.tsx"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f04daf4550cd1663e72a34a1c0c65e6c372277cc27ced9b88840aa558fe696e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/AppearanceSettings.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"2623fcdca136698efb970cea7d839d5131d4264c29b70f07b232372ddf95a01b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/AppearanceSettings.tsx"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da3564126ae8e6b31a7a313c996bc2a1948ef0bcb33d92a99b624de22478511"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel htmlFor\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/MultiSelect.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"955c9257256d1c0caee45ed7600526fc401525a1c8769b7b3d25393ddd837ef4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/ThemeSelector.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"029b08f98a7876c376cd6e34013788f4e6cd34c2819cd49c29cf54360c9a0fcb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/ThemeSelector.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dcc0d180d45b7418ff6bae772223bcf5c5a2a622dde0270c0cb8dc4d339685"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/ThemeSelector.tsx"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd718048394179c81fd23932bf53194dcc673ddd81bbee576c73b8e3225744e"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Clabel\u003E that labels no control: This \u003Clabel\u003E has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association \u2014 it is the TARGET of one, so a control still has to point at it. Give the label htmlFor=\u0022\u003Cthe control\u0027s id\u003E\u0022, move the control inside the label, or point the control\u0027s aria-labelledby at this label\u0027s id."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/ThemeSelector.tsx"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa43f4e3d77fa51e79c2eadbb52e20635e6dd4f57573dccdc2fed54f0dcc826e"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Ctr\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageHistoryTab.tsx"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b219704f580e013c4ab2eb59b7413c8b8265de789902660cd4fed9dae60462"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Ctr\u003E: This \u003Ctr\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/RunStatusTab.tsx"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff278429d4e324e3fd1c9b7928a3e49c52a459092b5115c95af7684f81370223"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/filters/CorrelationIDFilter.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"f125fa28583752310e31dc38f16d1909488ea451e9aa5b378cd8d8ce8b5ec97f"}},{"ruleId":"AC4","level":"warning","message":{"text":"Modal dialog does not manage focus: This \u003Caside role=\u0022dialog\u0022\u003E is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native \u003Cdialog\u003E opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/filters/FilterFlyout.tsx"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"872fb5c078efa4d31012ff81eaf3bbefd8765b4e936f1245ca9be44ffbf414ed"}},{"ruleId":"AC4","level":"error","message":{"text":"Double-click handler on a non-interactive \u003Cdiv\u003E: This \u003Cdiv\u003E binds double-click and nothing else. No click, no key handler, and no tabIndex={0}, so it cannot even take focus. Nothing synthesises a double-click from the keyboard: Enter and Space fire a single click, and only on a native \u003Cbutton\u003E or \u003Ca href\u003E. So this behaviour has no keyboard path at all. Expose the same action on a real control, or add role \u002B tabIndex={0} \u002B a key handler alongside the double-click."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4110d0b34cf4cc04d86e8514f53660e449537eb6f59bc8f8dfc22d727723554"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2375580520129ac5b6ee739f98d2ff6180813f3b9d6a2af956a8d8d3e95fa47"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":733}}}],"partialFingerprints":{"codehealthFindingId/v1":"be0e272a126c81e490b14c89d6e625765f1e567dfe6ea263413c5df5dbdd72eb"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a69bc7c2e71b9190304757d351136bf8dba52d806fe5000967e11e1317a26ff"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/MessageFlowEdge.tsx"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"0767cbcecc7733199d40bd99f916c282cd46a9196808011bb4a864a067bd7297"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/PendingBatchEdge.tsx"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"3472713af77ef072dea97850ccb2f29b5fcaf8a2e31af6a6c6157cd7316bb771"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/PendingJoinEdge.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"98148bed729b290f4a1fc6425eec59330452e475d3c8321b2b53919cbab20e11"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/TournamentBracket.tsx"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"86ae74432167f540b5ecd1923fa8ccc484c48c0253b001c1d673d4efd85c5e5d"}},{"ruleId":"AC4","level":"error","message":{"text":"Hover-only interaction on \u003Cdiv\u003E: This \u003Cdiv\u003E binds mouse-enter and mouse-leave and nothing else \u2014 no click, no key handler, no focus handler, and no tabIndex={0}, so it cannot even take focus. A keyboard user cannot hover, so whatever the pair reveals or highlights is reachable with a mouse only. Bind the same state to focus/blur as well, and add tabIndex={0}=\u00220\u0022 so the element can receive that focus."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/TransformEdge.tsx"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"711c860919dfd4818ca58a5b03c119abb8fe592a5fa81ec0448da85ae4a2dc84"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cspan\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":544}}}],"partialFingerprints":{"codehealthFindingId/v1":"dede169e5690900e6ee80c8cd5515d77e8df54f982ceebc6def68c7bd5b3d94a"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cspan\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b7427f3ed1a1359ecc1f1e29f6170a6b71fbf2f438848a48ce0b564acfa27f7"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":612}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd6b5503ca41c85558b9681ed8f2f7b16be8b3695cb6dbe445e9aeedb8624b29"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":1119}}}],"partialFingerprints":{"codehealthFindingId/v1":"75f2f397cae6fa3d50170dd44a620a96c68980b914522f0e432d53a8b13825df"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element isn\u0027t keyboard-operable. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0} \u002B a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e0a84492923a4dbfcf7643f1b6fe706d8dcaec9f96b510940af24351c54e96c"}},{"ruleId":"AC4","level":"error","message":{"text":"Click handler on a non-interactive \u003Cdiv\u003E: A click handler on a plain element with no role and no tabindex: even where another element\u0027s key handler can reach it, assistive tech can neither focus it nor announce what it is. Use a \u003Cbutton\u003E, or add role \u002B tabIndex={0}."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/MultiSelect.tsx"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"3016c6d13957f816ee6fbc1b7ed6fe3c2ef27ddbda54a30476ddfb36dc5e6d81"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (3.0:1): \u0060.md-typeset table:not([class]) th\u0060 sets color: white on background-color: #818cf8 \u2014 3.0:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/stylesheets/extra.css"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b0760585d25236d614876a202302a366d23dd6bb23c8c171083f44465e3612"}},{"ruleId":"AC7","level":"warning","message":{"text":"Accessibility enforcement below the top rung: No accessibility enforcement found \u2014 no a11y linter (eslint-plugin-jsx-a11y) and no axe/pa11y/Lighthouse in tests or CI. Start with the linter to catch issues at author time. What was searched, so you can tell an absence from a miss: the 53 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository\u0027s test and CI files \u2014 matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/package.json"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"AX6","level":"note","message":{"text":"Fat interface: SettingsState (20 required operations): \u0060SettingsState\u0060 declares 20 required operations: \u0060setShowFilters\u0060, \u0060setShowControls\u0060, \u0060setShowSettings\u0060, \u0060setEdgeType\u0060, \u0060setEdgeStrokeWidth\u0060, \u0060setEdgeAnimation\u0060, \u0060setShowEdgeLabels\u0060, \u0060setTheme\u0060, \u0060setAgentIdleColor\u0060, \u0060setAgentActiveColor\u0060, \u0060setAgentErrorColor\u0060, \u0060setNodeShadow\u0060, \u0060setShowStatusPulse\u0060, \u0060setCompactNodeView\u0060, \u0060setLayoutDirection\u0060, \u0060setNodeSpacing\u0060, \u0060setRankSpacing\u0060, \u0060setDebugMode\u0060, \u0060setPerformanceMode\u0060, \u0060resetToDefaults\u0060. Counted over its REQUIRED operations \u2014 a method signature or a function-typed property with no \u0060?\u0060, once per signature; optional members and data properties are not counted, because no implementer is forced to write them. A wide interface forces every implementer and caller to depend on methods they don\u0027t use (the Interface-Segregation \u0027I\u0027 in SOLID). Split it into focused role-interfaces."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/store/settingsStore.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5ba366582f05c4e2255ac3c909f4fa377210c079186bdf4961cf8562f6ee7a"}},{"ruleId":"C2","level":"note","message":{"text":"Thin authorization enforcement: Only 1 place(s) refuse an unauthorized caller \u2014 too few to demonstrate default-deny across handlers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1240e406e864a89e38d5e3fa370dee11971db94808c3db2fda9b41bf2e5b8efb"}},{"ruleId":"M2","level":"note","message":{"text":"ADRs not easily discoverable: 2 ADR-shaped document(s) detected by content \u2014 \u0060examples/15-decisions/README.md\u0060, \u0060openspec/changes/archive/2026-02-17-openclaw-multi-output-envelope/design.md\u0060. They are not under a conventional ADR folder (docs/adr/) and are not named NNNN-title.md, and this check found them by their decision signature rather than by where they live \u2014 so a reader who does not already know these paths has no route to them. Detected by content signature only: records kept outside the repository, or written without a Status/Decision/Consequences shape, are not visible to this check and are not counted here."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ea921cf64dae701abd877090b3279ff10d03c2e3250e26c8c299d7c5665e0d3f"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":".github/workflows/quality.yml"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P3","level":"note","message":{"text":"No dependency-update automation: \u0060src/flock/frontend/package.json\u0060 declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices \u2014 including after an advisory is published against it. Add a \u0060.github/dependabot.yml\u0060 with one \u0060package-ecosystem\u0060 entry per ecosystem the tree uses (or an enabled \u0060renovate.json\u0060), and gate pull requests with \u0060actions/dependency-review-action\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/package.json"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a988a464c12865f2cf22c5c2adef8aa4d070a1adfbad143b2241533b1be88b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 8 sibling directories (11 clone groups): 11 duplicated blocks under src/flock/frontend/src/components/ have copies in at least two of the sibling directories common, controls, details, filters, graph, layout (\u002B2 more sibling(s) not listed) \u2014 6 of them are reported below, and 5 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 11 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 11 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 11 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/common/ImageThumbnails.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"63cde7bda95ab7f930df0767c41a04bacb0a830b7d56294a2116086cc3be25bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Wholesale file copy (62 identical lines \u00D7 2 files): src/flock/frontend/src/components/graph/PendingBatchEdge.tsx:1 \u00B7 src/flock/frontend/src/components/graph/PendingJoinEdge.tsx:1 \u2014 these 2 files are line-for-line copies of one another \u2014 62 lines are identical, in the same order, in every one of them \u2014 so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) \u2014 the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/PendingBatchEdge.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"371d74775b6b9a8dc21c9f72e2691b452561a9847aec73c38ba9c0428f1156df"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 2 locations): src/flock/frontend/src/components/details/MessageDetailWindow.tsx:62 \u00B7 src/flock/frontend/src/components/details/NodeDetailWindow.tsx:31 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"a95a3021f8f76b00aaf0b2290fec118319e81866b40144dac434728cbe651d43"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (50 matched lines \u00D7 2 locations): src/flock/frontend/src/components/settings/AppearanceSettings.tsx:122 \u00B7 src/flock/frontend/src/components/settings/GraphSettings.tsx:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 282 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/AppearanceSettings.tsx"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad27f1caa3247686cb0a2f1200bb1687d6a5f9690576c86520e89cfafe05860"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (49 matched lines \u00D7 2 locations): src/flock/frontend/src/components/graph/MessageFlowEdge.tsx:31 \u00B7 src/flock/frontend/src/components/graph/TransformEdge.tsx:27 \u2014 the two spans are one implementation copied and then locally edited \u2014 278 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/MessageFlowEdge.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c61a53e3ef5a17362b9abe57a5bc4bc69a8014c1173a43138dc65c6a0088a36"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (47 lines \u00D7 2 locations): src/flock/frontend/src/components/details/MessageHistoryTab.tsx:156 \u00B7 src/flock/frontend/src/components/details/RunStatusTab.tsx:113 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageHistoryTab.tsx"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9053c4a8e34c23496f51c2692f2d8f9441f5b4917af164b4dee3592994b81dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (44 lines \u00D7 2 locations): src/flock/frontend/src/components/graph/GraphCanvas.tsx:476 \u00B7 src/flock/frontend/src/components/graph/GraphCanvas.tsx:700 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45bf16fe49128ac5467026bb118906f8db2ed476e790f231cc0e2495b0a5522"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (38 lines \u00D7 2 locations): src/flock/frontend/src/store/graphStore.ts:135 \u00B7 src/flock/frontend/src/store/graphStore.ts:191 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/store/graphStore.ts"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"c11aa18a78b0f2f45ae43c1726408f7ead7f9d88eba9e6af6c464daba1250a2e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (36 lines \u00D7 2 locations): src/flock/frontend/src/components/details/MessageDetailWindow.tsx:158 \u00B7 src/flock/frontend/src/components/details/NodeDetailWindow.tsx:117 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f390f51f15ebe39b290fb8155eb2b066f5abcd510551f0f9afddf60e7f64bc"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (35 matched lines \u00D7 2 locations): src/flock/frontend/src/store/moduleStore.ts:29 \u00B7 src/flock/frontend/src/store/uiStore.ts:89 \u2014 the two spans are one implementation copied and then locally edited \u2014 196 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/store/moduleStore.ts"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ce4d8ebf8d036b33b55413ced3fd4f055e515d11f6a0234f60b7501a056f6d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2 locations): src/flock/frontend/src/components/settings/AdvancedSettings.tsx:101 \u00B7 src/flock/frontend/src/components/settings/GraphSettings.tsx:55 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/AdvancedSettings.tsx"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfcf9a2d4122f32ddf7a985ab3b55ccf5aed0b77a62d130359a067f0812c5402"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (30 matched lines \u00D7 2 locations): src/flock/frontend/src/components/settings/AdvancedSettings.tsx:14 \u00B7 src/flock/frontend/src/components/settings/GraphSettings.tsx:14 \u2014 the two spans are one implementation copied and then locally edited \u2014 260 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/AdvancedSettings.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"38ece75f8d402624f8250a94a224fc1cbb526e14bdf2095b647be9205d5d80e8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/flock/frontend/src/components/details/MessageHistoryTab.tsx:210 \u00B7 src/flock/frontend/src/components/details/RunStatusTab.tsx:174 \u2014 the 2 copies are spread across 2 files, and what repeats is a LIST OF ENTRIES rather than behaviour \u2014 the same entries written out more than once. Extract them into one shared, exported constant and spread that constant into each site, rather than into a function the sites call: a list like this often lives in declarative metadata (a decorator\u0027s options object, a static configuration table) that a build step must be able to read statically, where a function call is not allowed. Adding an entry to one copy and not the other is the failure this prevents."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageHistoryTab.tsx"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"638677b6dd2588c686ffea0c45e2ee5bf5c43abed9daf8f5577b0d3f7975675f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): src/flock/frontend/src/components/settings/ThemeSelector.tsx:204 \u00B7 src/flock/frontend/src/components/settings/ThemeSelector.tsx:244 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/ThemeSelector.tsx"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"6015a0e321ff9603a3b1eaefbf0aa09ebf6ab41d5ac757b474c9d21cb613a6ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/flock/frontend/src/components/controls/PublishControl.tsx:472 \u00B7 src/flock/frontend/src/components/controls/PublishControl.tsx:499 \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":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"0adf897f91205797e2821a0f3f12574f1745091fc25e2f537c511504f8363e86"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/flock/frontend/src/services/layout.ts:390 \u00B7 src/flock/frontend/src/services/layout.ts:503 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/layout.ts"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c80621a0b94cdfd3cceca368f98402e3b7ff8be86a776597c380cb9531d754"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 5 locations): src/flock/frontend/src/components/graph/GraphCanvas.tsx:523 \u00B7 src/flock/frontend/src/components/graph/GraphCanvas.tsx:546 \u00B7 src/flock/frontend/src/components/graph/GraphCanvas.tsx:569 \u00B7 src/flock/frontend/src/components/graph/GraphCanvas.tsx:592 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b596024082298884e5a6dba7e2d8c9ea97d5d239e7f6bdfdb006fe9aa0706f18"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): src/flock/frontend/src/components/settings/AppearanceSettings.tsx:47 \u00B7 src/flock/frontend/src/components/settings/AppearanceSettings.tsx:72 \u00B7 src/flock/frontend/src/components/settings/AppearanceSettings.tsx:97 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/AppearanceSettings.tsx"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c385cbec3a8d70442752df52f494d091cc3b94f63200187b5458baa7c563882"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): src/flock/frontend/src/store/graphStore.ts:276 \u00B7 src/flock/frontend/src/store/graphStore.ts:308 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/store/graphStore.ts"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2823eec1aea8778d6ac147a84e2d0092aabed496182f32e82ff4c716325aec"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): src/flock/frontend/src/components/common/ImageThumbnails.tsx:25 \u00B7 src/flock/frontend/src/components/graph/TournamentBracket.tsx:110 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/common/ImageThumbnails.tsx"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"b79e1f60813adf4fc1274145a2cd4aa8029a124779db649afaa544294df9aeb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/flock/frontend/src/services/api.ts:199 \u00B7 src/flock/frontend/src/services/api.ts:261 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/api.ts"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2eb2a1538594cb57bf9a97d47995e3c27de3eb77d09804622d6e30890a28754"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:974 \u00B7 src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:1086 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":974}}}],"partialFingerprints":{"codehealthFindingId/v1":"c64a09f855f3f5e18aca66dbf49c89f10b754efd91d67d85481851588d90e32a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/flock/frontend/src/App.tsx:89 \u00B7 src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx:105 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/App.tsx"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe39dee525fa751191b5d7d5dffbd0eb5cd48738a1e63a0d423d4dd5b2ce6514"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/flock/frontend/src/components/details/MessageHistoryTab.tsx:298 \u00B7 src/flock/frontend/src/components/details/RunStatusTab.tsx:272 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageHistoryTab.tsx"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dcfd3982fa2ee858d0b3b2a69828aa8689ccde849f3ce1c1c5797658e73b22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/flock/frontend/src/components/modules/JsonAttributeRenderer.tsx:46 \u00B7 src/flock/frontend/src/components/modules/JsonAttributeRenderer.tsx:67 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/JsonAttributeRenderer.tsx"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"a801b52b11f527a648cf7546b82648901cefd008043b82266fd3a83a88846a00"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/flock/frontend/src/components/settings/TracingSettings.tsx:194 \u00B7 src/flock/frontend/src/components/settings/TracingSettings.tsx:213 \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":"src/flock/frontend/src/components/settings/TracingSettings.tsx"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"f004ecf2cc12c6516f4d6a910865150d57e659daca3fd8c0c217ae6fcda3b950"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/flock/frontend/src/components/details/MessageHistoryTab.tsx:49 \u00B7 src/flock/frontend/src/components/details/MessageHistoryTab.tsx:96 \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":"src/flock/frontend/src/components/details/MessageHistoryTab.tsx"},"region":{"startLine":49}}}],"partialFingerprints":{"codehealthFindingId/v1":"528dede22cab0c5f01086b6f43f58b483ac74ffc1b286bbcc7a05ccf8670530b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/flock/frontend/src/components/layout/DashboardLayout.tsx:143 \u00B7 src/flock/frontend/src/components/layout/DashboardLayout.tsx:164 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/layout/DashboardLayout.tsx"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb199ebef7003d9e03d67679baadcd22b29b403b03814d8aee1467e56922d532"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): src/flock/frontend/src/services/api.ts:122 \u00B7 src/flock/frontend/src/services/api.ts:152 \u00B7 src/flock/frontend/src/services/api.ts:335 \u00B7 src/flock/frontend/src/services/api.ts:364 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/api.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"9220384c3c0b0d393135d79640f6edaa748e93bfde5866fcc9bc98d7391915a8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4 locations): src/flock/frontend/src/services/indexeddb.ts:556 \u00B7 src/flock/frontend/src/services/indexeddb.ts:606 \u00B7 src/flock/frontend/src/services/indexeddb.ts:656 \u00B7 src/flock/frontend/src/services/indexeddb.ts:706 \u2014 all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/indexeddb.ts"},"region":{"startLine":556}}}],"partialFingerprints":{"codehealthFindingId/v1":"14fd7342a0fb19fad89f76c76ca87c6fb77c7d724ed57b9c1c4aae72f5a869b3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/flock/frontend/src/components/controls/PublishControl.tsx:632 \u00B7 src/flock/frontend/src/components/settings/SettingsPanel.tsx:46 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":632}}}],"partialFingerprints":{"codehealthFindingId/v1":"a98dd047695161df93e0d3a10f1453c2884362ea0b7434fffd061a172d7f9ad0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/flock/frontend/src/components/settings/AppearanceSettings.tsx:16 \u00B7 src/flock/frontend/src/components/settings/GraphSettings.tsx:14 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/AppearanceSettings.tsx"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"167e7564c0e97475e61c0959e149c961c430b2b8527536cdee5a6a7ac3ef31c4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5 locations): src/flock/frontend/src/services/indexeddb.ts:439 \u00B7 src/flock/frontend/src/services/indexeddb.ts:526 \u00B7 src/flock/frontend/src/services/indexeddb.ts:576 \u00B7 src/flock/frontend/src/services/indexeddb.ts:626 \u00B7 \u002B1 more site(s) not listed \u2014 all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/indexeddb.ts"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5baeaa1476fe338245ad58b44ac3cab151b08f09b1485c3659aff9714456c2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/flock/frontend/src/components/controls/PublishControl.tsx:526 \u00B7 src/flock/frontend/src/components/controls/PublishControl.tsx:601 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":526}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd180a4bf529378a63c27eea5099cd69c23c926a55672d718af424a73fe99f1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/flock/frontend/src/components/graph/AgentNode.tsx:247 \u00B7 src/flock/frontend/src/components/graph/AgentNode.tsx:310 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"69361efd8eeeee553e2865f50cacae0ca007d24724bef288c4efafbd27f20df2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/flock/frontend/src/components/graph/DecisionDisplay.tsx:379 \u00B7 src/flock/frontend/src/components/graph/DecisionDisplay.tsx:773 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"75df94f372234c6ce70645e5a61c2f80c6431f5b944118aa05d52430c529cf53"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/flock/frontend/src/components/settings/TracingSettings.tsx:258 \u00B7 src/flock/frontend/src/components/settings/TracingSettings.tsx:274 \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":"src/flock/frontend/src/components/settings/TracingSettings.tsx"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea94193cc859e8bfddd33b8b5a6c3ff68ce9a07db943d1867434c104358b296"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/flock/frontend/src/services/api.ts:331 \u00B7 src/flock/frontend/src/services/api.ts:360 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/api.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"15fee646587734595a188fb06fc32ba5122f3b0b5e1eeb65842afabe1dcc4d1e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/flock/frontend/src/services/layout.ts:167 \u00B7 src/flock/frontend/src/services/layout.ts:264 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/layout.ts"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"de71a81ebc1027c32ffcabdf31fd1af364f895d4cfc36e509b07560ef656a32b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/flock/frontend/src/components/controls/PublishControl.tsx:549 \u00B7 src/flock/frontend/src/components/controls/PublishControl.tsx:580 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":549}}}],"partialFingerprints":{"codehealthFindingId/v1":"48cd39a1f0baa833e19b64c070c398c8549d34fa3458c1dbe7b4bc628180069a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:388 \u00B7 src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:400 \u00B7 src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:1120 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"f871846bc6fd5c987091e86f81984d2641f35bc7731b0d161aa7edc138e40b32"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/flock/frontend/src/hooks/useModules.ts:123 \u00B7 src/flock/frontend/src/hooks/useModules.ts:140 \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":"src/flock/frontend/src/hooks/useModules.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb33af04524bd1e17ffd17c38fb8b956cd51588e679233ec16d9b121925f81d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/flock/frontend/src/components/details/MessageDetailWindow.tsx:48 \u00B7 src/flock/frontend/src/components/details/RunStatusTab.tsx:63 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ef9cc390a29e803969f45857b14cf546fde6ad11aac2ce8d8325f830db77b1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/flock/frontend/src/components/details/MessageDetailWindow.tsx:339 \u00B7 src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx:410 \u2014 the 2 copies are spread across 2 files, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03bb0d9c7e554c4b4afa3a8b613ffee9340e0169c1b8527295bb5cf6af99a68"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/flock/frontend/src/components/filters/FilterFlyout.tsx:28 \u00B7 src/flock/frontend/src/components/filters/FilterFlyout.tsx:41 \u00B7 src/flock/frontend/src/components/filters/FilterFlyout.tsx:55 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/filters/FilterFlyout.tsx"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"60551ff8cf90be926ab8ec05c877288bd187cab15be2a4684c02bd2ac40602eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/flock/frontend/src/components/graph/DecisionDisplay.tsx:300 \u00B7 src/flock/frontend/src/components/graph/DecisionDisplay.tsx:428 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6ce77a7b31fb312a7ed1a600fb1dc849d203125294ce2037b096bb9f665682"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:1021 \u00B7 src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:1043 \u00B7 src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:1061 \u2014 all 3 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"92d1c8073276f7354ff47091d28f198c7cb0e59b212fd05c95c4ad3073881094"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/flock/frontend/src/components/settings/SettingsPanel.tsx:69 \u00B7 src/flock/frontend/src/components/settings/SettingsPanel.tsx: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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/SettingsPanel.tsx"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"08b748024dc157395d78ef4e292584e946c6a9acc837d0aa2c8d0d254d210db0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/flock/frontend/src/services/indexeddb.ts:401 \u00B7 src/flock/frontend/src/services/indexeddb.ts:425 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/indexeddb.ts"},"region":{"startLine":401}}}],"partialFingerprints":{"codehealthFindingId/v1":"49fe77fca22627507f534d01b9d103baa38d3cc84d43ba316b92fb7a83ca2268"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): src/flock/frontend/src/components/graph/GraphCanvas.tsx:629 \u00B7 src/flock/frontend/src/components/graph/GraphCanvas.tsx:692 \u2014 all 2 copies are in the same file, and the SHAPE of this repetition could not be determined. It is not a run of declarations, a listing, a declaration header, a type body or a slice through a construct \u2014 and it was not measured as a run of executable statements either, so this row cannot tell you whether a function can stand where these lines are. Read the two spans before acting, because the move is opposite in the two cases. Where they are statements, the ordinary answer holds: give the shared part one home and call it from each site. Where they turn out to be declarations, a literal\u0027s entries, or the cases of an enumeration, there is no call site to call anything from, and collapsing them would delete what each copy pins \u2014 a shared base type, a generated set, or one exported constant each site refers to is the move instead, and sometimes the honest answer is that there is nothing to extract at all. Reported because the copies drift apart the first time only one of them is edited, which is true whichever of those they are."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":629}}}],"partialFingerprints":{"codehealthFindingId/v1":"01ff8e9c5cbefac39e37fb95df5cebf76d285e65072235c14eedb4657492529a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): src/flock/frontend/src/hooks/useModules.ts:106 \u00B7 src/flock/frontend/src/hooks/useModules.ts:119 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/hooks/useModules.ts"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c632f0de90e3353caad433bca204d2fca8cdf781b878cd03e34a7d4208280d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3 locations): src/flock/frontend/src/services/layout.ts:312 \u00B7 src/flock/frontend/src/services/layout.ts:408 \u00B7 src/flock/frontend/src/services/layout.ts:521 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/layout.ts"},"region":{"startLine":312}}}],"partialFingerprints":{"codehealthFindingId/v1":"28cd8aeae6e6f00338ddd8d68669ece6e8330251bbf2abb6a4ee44ff150d2e67"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (7 matched lines \u00D7 2 locations): src/flock/frontend/src/components/graph/AgentNode.tsx:85 \u00B7 src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx:78 \u2014 the two spans are one implementation copied and then locally edited \u2014 62 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f3d31a239c5ce1c5026793f0a2a6aaf425e11a15bfe9068e6db5f415f8b374"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/flock/frontend/src/components/graph/DecisionDisplay.tsx:314 \u00B7 src/flock/frontend/src/components/graph/DecisionDisplay.tsx:438 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f1a438f436fc5fbfff164fea68147b355ac4b7feb4729fb29e0058ab6fe26fe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:1045 \u00B7 src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:1054 \u00B7 src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx:1063 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"302681f1aaff93b3851c99149beff8eb0298ea205d40641318a990aa216d44a0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): src/flock/frontend/src/components/settings/TracingSettings.tsx:303 \u00B7 src/flock/frontend/src/components/settings/TracingSettings.tsx:312 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/TracingSettings.tsx"},"region":{"startLine":303}}}],"partialFingerprints":{"codehealthFindingId/v1":"794f92d346e7c7f950c99a9f1e3d8366c771a30fd666d07911a7c4866de3e415"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/flock/frontend/src/components/controls/PublishControl.tsx:185 \u00B7 src/flock/frontend/src/components/controls/PublishControl.tsx:263 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"321730b4c466af24e5ffc204cd60eda6c4fd5927c4c65738dad12ab493b3bcdf"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/flock/frontend/src/components/controls/PublishControl.tsx:250 \u00B7 src/flock/frontend/src/components/controls/PublishControl.tsx:262 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"96e47a9cf28ff02f3468215495ea69e03c5486608c1461097d30bdadfa122181"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx:259 \u00B7 src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx:265 \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":"src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"863927d24912d09efaa1f260022fc6d6b77332152cdc30e41bf7628b631cc1e3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx:23 \u00B7 src/flock/frontend/src/store/filterStore.ts:68 \u2014 the two spans are one implementation copied and then locally edited \u2014 57 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63609d7939ccd9120d7a556962af37bb93a5ab8088f59fe878137cbd39715d1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): src/flock/frontend/src/hooks/usePersistence.ts:99 \u00B7 src/flock/frontend/src/store/graphStore.ts:465 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/hooks/usePersistence.ts"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbef4a512d78a8efae213e1782c3476ad5b3c36a907db2061fa45e9e17d25c95"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/flock/frontend/src/components/details/MessageDetailWindow.tsx:12 \u00B7 src/flock/frontend/src/components/details/NodeDetailWindow.tsx:13 \u00B7 src/flock/frontend/src/components/modules/ModuleWindow.tsx:11 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"54c4bf66f5dd1d2b0ac5fd9607fc333a5f28833c7f47d921732050aaeb9a7eee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7 locations): src/flock/frontend/src/components/filters/ArtifactTypeFilter.tsx:3 \u00B7 src/flock/frontend/src/components/filters/CorrelationIDFilter.tsx:14 \u00B7 src/flock/frontend/src/components/filters/ProducerFilter.tsx:3 \u00B7 src/flock/frontend/src/components/filters/SavedFiltersControl.tsx:4 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/filters/ArtifactTypeFilter.tsx"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be647653bc52537dbd801d1d13d70c9dc13b15cf58894b99e41589b753571a1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 13 locations): src/flock/frontend/src/components/filters/FilterPills.tsx:15 \u00B7 src/flock/frontend/src/components/filters/FilterPills.tsx:20 \u00B7 src/flock/frontend/src/components/filters/SavedFiltersControl.tsx:7 \u00B7 src/flock/frontend/src/components/graph/GraphCanvas.tsx:45 \u00B7 \u002B9 more site(s) not listed \u2014 the 13 copies are spread across 9 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/filters/FilterPills.tsx"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d1532bbfad120878134c7b28764532efdadb57e5250a8d6886d8e0e4e26b50a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7 locations): src/flock/frontend/src/components/graph/AgentNode.tsx:109 \u00B7 src/flock/frontend/src/components/graph/GraphCanvas.tsx:68 \u00B7 src/flock/frontend/src/components/graph/MessageFlowEdge.tsx:50 \u00B7 src/flock/frontend/src/components/layout/DashboardLayout.tsx:25 \u00B7 \u002B3 more site(s) not listed \u2014 the 7 copies are spread across 7 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"eef8e684f585ab449fb11faa949a0b06a57fe5f1f15a12670cb0901d6fcbda1b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): src/flock/frontend/src/components/graph/DecisionDisplay.tsx:971 \u00B7 src/flock/frontend/src/components/graph/DecisionDisplay.tsx:1000 \u2014 all 2 copies are in the same file, and the CITED SPAN is a run of DECLARATIONS inside a construct \u2014 the members of a type, or the entries of an object or array literal \u2014 with no statement anywhere in it. Do not read this as an extract-a-helper row: nothing here executes, so there is no call site, and a call expression cannot stand where a member declaration or a literal\u0027s entry was. What repeats is a SHAPE, and which shape decides the move. Where the copies declare the same members, the repetition is a missing common ancestor: give it a base type, an interface both extend, a generic instantiated twice, or \u2014 where the copies are a literal\u0027s entries rather than a type\u0027s members \u2014 one shared constant each site spreads or refers to, so the set is written once. Where they declare DIFFERENT members and only the form is shared \u2014 a decorator and its options, an annotation, a registration table\u0027s keys \u2014 the form is prescribed by a framework or a schema rather than copied, and the only collapse available is to generate the declarations from that schema; where you do not own the generator, this is the cost of the framework and there is nothing to extract. Check which of the two it is before acting: these copies still drift apart the first time only one of them is edited, which is why the repetition is reported, but the sentence to act on is not the same in both cases."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":971}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c30a8f454e38faac6e063062be71165df46d129aeee41ddb15f0166bf2d304e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 3 locations): src/flock/frontend/src/services/indexeddb.ts:393 \u00B7 src/flock/frontend/src/services/indexeddb.ts:414 \u00B7 src/flock/frontend/src/services/indexeddb.ts:454 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/indexeddb.ts"},"region":{"startLine":393}}}],"partialFingerprints":{"codehealthFindingId/v1":"daabbcfb4daf341c820d63ef90465209ea711f55daa8fe712a008f137b3d28f7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function renderField (cyclomatic 56, cognitive 64): renderField has cyclomatic complexity 56 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bc16123fba6fb8f9df7a0bb00b2351c503884ea0416db03b8474f3686da63df"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 43, cognitive 37): (anonymous) has cyclomatic complexity 43 and cognitive complexity 37; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":1254}}}],"partialFingerprints":{"codehealthFindingId/v1":"461086c7d8bef8e1e37c5f9621f9b1e9064494db7b094a7b05325df026b37374"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 37, cognitive 33): (anonymous) has cyclomatic complexity 37 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e788834235f14e7af8e2b0cbc1b9d6525ad8f40a7f53996d102da90b39806e0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleKeyDown (cyclomatic 33, cognitive 46): handleKeyDown has cyclomatic complexity 33 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/hooks/useKeyboardShortcuts.ts"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f1f7217fdfebd4fc478d33d13d2fab93b6927896d22d6495d6e3dff92529bd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function updateFilterStateFromPublishedMessage (cyclomatic 33, cognitive 33): updateFilterStateFromPublishedMessage has cyclomatic complexity 33 and cognitive complexity 33; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23b0cac19ba407b4e13a0ce39453c97340c9c5557f12d4f6c72acf5d7af872a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function TraceModuleJaeger (cyclomatic 29, cognitive 28): TraceModuleJaeger has cyclomatic complexity 29 and cognitive complexity 28; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef9c8b78bda173ee1c2576930fc4180d8efb98435d0395a2d4bf9892930fa49"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 27, cognitive 34): (anonymous) has cyclomatic complexity 27 and cognitive complexity 34; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0496d634ec469272f1b09f71fdf66a3cd51cd3f7811166f4e8cfc4dbf7e6f907"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function resolveNodeOverlaps (cyclomatic 26, cognitive 60): resolveNodeOverlaps has cyclomatic complexity 26 and cognitive complexity 60; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/layout.ts"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ec860af8d27d6168158273a6b8dfcdf2a25541eff2c2eccf2ebf31931b82a3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 22, cognitive 32): (anonymous) has cyclomatic complexity 22 and cognitive complexity 32; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca03cf9e75af19c8192bf639f11557b98a64e316869b4eb20f8c1083d0d11c1c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function HistoricalArtifactsModule (cyclomatic 22, cognitive 18): HistoricalArtifactsModule has cyclomatic complexity 22 and cognitive complexity 18; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"9202dede886a90bbb5b1ebcc14353071e1488452b63efd4a2d37128f7dab7631"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 31): (anonymous) has cyclomatic complexity 21 and cognitive complexity 31; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ff3ed5a807cfc49111fe8bbbd3ae7cca54b9cf7e78441cbd3a5b208eed10633"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 21, cognitive 16): (anonymous) has cyclomatic complexity 21 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f1dbf07052333f51457ee3c5d28e72ecce00a7b57f056547571d8be5c16c963"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handleMessage (cyclomatic 19, cognitive 20): handleMessage has cyclomatic complexity 19 and cognitive complexity 20; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"1edad08b0b3b37f9921ec8b0be510c9c0a11950261c0e738e72a52600e5774be"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 18, cognitive 15): (anonymous) has cyclomatic complexity 18 and cognitive complexity 15; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cd99281d34251f923c4d6a29a14726554b364c37eefa771490e2e58406d1a5a"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function DashboardLayout (cyclomatic 17, cognitive 16): DashboardLayout has cyclomatic complexity 17 and cognitive complexity 16; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/layout/DashboardLayout.tsx"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3de2571190b452565723fd7c72c05d3685e0241b12360bac4f9e073dd50c5c9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 17, cognitive 14): (anonymous) has cyclomatic complexity 17 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":505}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33e1378d1a221e02e66adffbca824a7280a6b8642772ed88ab7302c105fbc5b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function MessageDetailWindow (cyclomatic 16, cognitive 14): MessageDetailWindow has cyclomatic complexity 16 and cognitive complexity 14; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"554bce08524beb7a3cf938d92547581871f971a8d2e28b6927b440d10b2ea2dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 16, cognitive 13): (anonymous) has cyclomatic complexity 16 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b69f64e07640445e6662f1abc64313baff743ad4fadc1b500b4a3a1730ef0d4"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function ThemeSelector (cyclomatic 15, cognitive 13): ThemeSelector has cyclomatic complexity 15 and cognitive complexity 13; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/ThemeSelector.tsx"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdf92b96dd87d706c329a52d709ee98a575af5d5588b2e87a40c23b983e27425"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 15, cognitive 12): (anonymous) has cyclomatic complexity 15 and cognitive complexity 12; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth \u2014 arms side by side rather than stacked \u2014 and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/MessageNode.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ced365e5c41ec78bcaa2688d1eefdb7f86e0623b91d2e4c4a1c62b9b6e6913"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx: 1441 lines of code: src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx has 1441 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d110f4fae5270a9a89ccf5aa2c9daeff8613bc1875bb5a46ad2d07bc4ea834a9"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx: 1317 lines of code: src/flock/frontend/src/components/graph/DecisionDisplay.tsx has 1317 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac3cdbaedc4c15a586a65f59315fa5f25b3c8849c150f4190d1c6618e4939742"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/services/indexeddb.ts: 738 lines of code: src/flock/frontend/src/services/indexeddb.ts has 738 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/indexeddb.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b0677a54f64df83309b717ae1d3585c41f11f536f86ef7bc381ae51a0fbe8a"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/components/graph/GraphCanvas.tsx: 732 lines of code: src/flock/frontend/src/components/graph/GraphCanvas.tsx has 732 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/GraphCanvas.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d3acc5fe7a19f2c9d8c4227ba0d4175522459e85b655617821edb722c91afb0"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/components/controls/PublishControl.tsx: 684 lines of code: src/flock/frontend/src/components/controls/PublishControl.tsx has 684 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/controls/PublishControl.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3634814ee8a17e24e158195b0d833ffa82ed5b8f61c2e58cdb85c00be30d155e"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/services/websocket.ts: 655 lines of code: src/flock/frontend/src/services/websocket.ts has 655 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/websocket.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1badf3f30085fda069b0002f5e574ed9277707be4308887631afb24565ff4495"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/services/layout.ts: 519 lines of code: src/flock/frontend/src/services/layout.ts has 519 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/layout.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c11e8193f70541697a09268fdf32f88328a32016d06a38cb6b3c0e8f240637"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx: 431 lines of code: src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx has 431 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7e06d6b5c53a18939f0b43af33c83a689b3ca4b68649fb1bc82226d8584848"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/store/graphStore.ts: 426 lines of code: src/flock/frontend/src/store/graphStore.ts has 426 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/store/graphStore.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a51634f59d7a17dbf54aa7e5b9f335506385e86c604d7a352bb99ef8c12b3edb"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx: 421 lines of code: src/flock/frontend/src/components/details/MessageDetailWindow.tsx has 421 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3696a10f0b9ca291519366bdb174c0d826530b6db8e4fd3ae3c4da58cf89999"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/components/graph/AgentNode.tsx: 415 lines of code: src/flock/frontend/src/components/graph/AgentNode.tsx has 415 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3517d776a3f006f0b9d0cae4932348e36ea69af135f1b85e6041bf6ad4df8013"}},{"ruleId":"R3","level":"warning","message":{"text":"src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx: 411 lines of code: src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx has 411 significant lines (blank lines excluded), over the 400-line bar, and contains logic \u2014 a file this long is usually several responsibilities in one module."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71dedba4cf8de9072785676a49740c2d5f7ad0eabfadde3b7c958174e8c424c1"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/common/EmptyState.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbc453b4abe587fa5c3daa061a12c925a8fea7d2d5f124fb93c10201b263f48d"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/utils/mockData.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"54cbad6057c77480fffb0db7537719bd2e3b5ab8c7d01468779119e39e6b2cff"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/common/LoadingSpinner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f07447dd9add1646916044d83cca667ed95caf7d6d7781c124402e22b0221a6"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/utils/artifacts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"710b3a575107515bb0ceee5cddcd630edecbe37972d93058231152a92e766559"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/main.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e17942c0a1b11fd40975e18eb53cb5c675578a28fbefc238e6bb3270ac5b20a7"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~128 LoC): no import path from any entry point (4 application, 4 tooling, 34 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/common/EmptyState.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e7e91723d29fd2ea0193786ce49c694575961d7f5cdde67c35e41d45ae550dd"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~98 LoC): no import path from any entry point (4 application, 4 tooling, 34 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/utils/mockData.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc2b0b3faa9f77ec90f9ab0def0d8ddf5bc63b9884e1153241a8438ec08ae059"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~29 LoC): no import path from any entry point (4 application, 4 tooling, 34 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/common/LoadingSpinner.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbd9887bbd9f8164c30fe3521ced179dc26bdf1b2317fd54e3cafd1554438dca"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~24 LoC): no import path from any entry point (4 application, 4 tooling, 34 test roots considered), and no other file in the scanned tree imports it \u2014 nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/utils/artifacts.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4386b9f12521e2783598f9ae7eb0666249f0fee25012ae3b6bee68b05d9aa631"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027applyDagreLayout\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/layout.ts"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bd37e14084cf0f92e37a1ca7087a3abb9dd625d55309763059691632656fb6f"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027getThemePreview\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/themeApplicator.ts"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"36e09b3149663cbf52a44f1f89ad1e92f67770fc1bdc3c948fd33c4d13e150b3"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CorrelationGroupUpdatedEvent\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/types/graph.ts"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"98a6f7749548c10d2b33cf071132fa59b92b9c892742a6490c59c003c7ffcbea"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027BatchItemAddedEvent\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/types/graph.ts"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ee7ed5af62dbe5df4bccfcd79da80d09f16fb5cb054c7487b53af9532c36c78"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027startRenderMeasure\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/utils/performance.ts"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9f568bc694d4dbff56c399ca3500c2318f40768ddc52a274a6d1d674b27f07c"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@testing-library/user-event\u0027: Declared in src/flock/frontend/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"24f9a522d388fc05f64222dc6b4c2c22b471a92d1ae1002b95165d056c48201f"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027idb\u0027: Declared in src/flock/frontend/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e61fea0c23713a28ebc66ceee6fd4910ddfa328e3c59d386498efcb7f8f408d1"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027mock-socket\u0027: Declared in src/flock/frontend/package.json but never imported anywhere in that package or its workspace members \u2014 no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"f9e68733ce50ed5a18bcf1fb6e504fd26335d92ac9abf5219ecb4611880804f9"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/flock/frontend/src/components/graph/DecisionDisplay.tsx \u2192 src/flock/frontend/src/components/graph/TournamentBracket.tsx \u2192 src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/DecisionDisplay.tsx"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"357155fdc0fb2caad8d448b19c412f3106d8573fd7f0d8983f63c86589a40792"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/flock/frontend/src/store/filterStore.ts \u2192 src/flock/frontend/src/store/graphStore.ts \u2192 src/flock/frontend/src/store/filterStore.ts"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/store/filterStore.ts"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"73f6d255297f6b98a634223e7f4ac7eff02f8b16ea3766941567b713f0cefecc"}},{"ruleId":"X1","level":"warning","message":{"text":"Task from \u0060loop.create_task\u0060 is not kept: The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python\u0027s documentation for \u0060asyncio.create_task\u0060: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled \u2014 it surfaces, if at all, as \u0022Task exception was never retrieved\u0022 in a log. Keep the task: \u0060await\u0060 it, gather it, start it in an \u0060asyncio.TaskGroup\u0060 (\u0060async with asyncio.TaskGroup() as tg: tg.create_task(\u2026)\u0060), or, for genuine fire-and-forget, add it to a set and \u0060task.add_done_callback(tasks.discard)\u0060 with a callback that also reads its exception."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/patches/dspy_streaming_patch.py"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"009944b292a0fd5781bee61f4197a7a9e75fc76ad31c9ea6d8dd7f519846606c"}},{"ruleId":"X1","level":"warning","message":{"text":"\u0060async\u0060 Promise executor: The function passed to \u0060new Promise(\u2026)\u0060 is \u0060async\u0060. The constructor ignores what its executor returns, so anything this executor throws \u2014 every throw inside an \u0060async\u0060 function, including after an \u0060await\u0060 \u2014 rejects a Promise nobody holds instead of the one being constructed: the outer Promise never settles, whoever awaits it hangs, and the error is reported nowhere. If the body needs \u0060await\u0060, it does not need \u0060new Promise\u0060 at all: make the enclosing function \u0060async\u0060 and \u0060return\u0060 the value (or \u0060throw\u0060) directly. If it wraps a callback API, keep the executor synchronous \u2014 call the API and \u0060resolve\u0060/\u0060reject\u0060 from its callback \u2014 and do the awaiting outside it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/indexeddb.ts"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"56ea16e7b050a7987b0c05b0c14a497d6a76f3a5e7e12f622837e0eea07e7780"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060artifact.visibility_kind || artifact.visibility?.kind || \u0027Unknown\u0027\u0060 appears character-identically in 2 files \u2014 src/flock/frontend/src/components/details/MessageDetailWindow.tsx, src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx. 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":"src/flock/frontend/src/components/details/MessageDetailWindow.tsx"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a89baa02e460453723c5897206430c0b57579089966d8f861f0ed1cc7c2ddd68"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060containerRef.current \u0026\u0026 !containerRef.current.contains(event.target as Node)\u0060 appears character-identically in 2 files \u2014 src/flock/frontend/src/components/filters/CorrelationIDFilter.tsx, src/flock/frontend/src/components/settings/MultiSelect.tsx. 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":"src/flock/frontend/src/components/filters/CorrelationIDFilter.tsx"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"b45923704f0d8116e50fa756e57be8dceb285981be62378c5548497161a274b8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060range.preset === \u0027custom\u0027 \u0026\u0026 range.start \u0026\u0026 range.end\u0060 appears character-identically in 2 files \u2014 src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx, src/flock/frontend/src/store/filterStore.ts. 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":"src/flock/frontend/src/components/modules/HistoricalArtifactsModule.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"b640ec1f8eb2e68ef7a03c40be3b9810043743b55087dda0c0735fbf08e502b9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060spec.type === \u0027datetime\u0027 \u0026\u0026 spec.datetime\u0060 appears character-identically in 2 files \u2014 src/flock/frontend/src/components/graph/AgentNode.tsx, src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx. 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":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d28874b56ac1b910c5dc9b5fe2e55a452a36eacc623e65cd73f96f2b12bf918"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060spec.type === \u0027interval\u0027 \u0026\u0026 spec.interval\u0060 appears character-identically in 2 files \u2014 src/flock/frontend/src/components/graph/AgentNode.tsx, src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx. 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":"src/flock/frontend/src/components/graph/AgentNode.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e98042198072d132e84aab6bbe17a217ce882a26ec7c530057e6d7ea15bea3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060\u0022auth\u0022 in additional_params and isinstance( additional_params.get(\u0022auth\u0022), httpx.Auth )\u0060 appears character-identically in 2 files \u2014 src/flock/mcp/servers/sse/flock_sse_server.py, src/flock/mcp/servers/streamable_http/flock_streamable_http_server.py. 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":"src/flock/mcp/servers/sse/flock_sse_server.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc9f4797d4f0481667c88c6dbe4eddd34b87478e13d753d9142b5c63a1e72750"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060artifacts and artifacts[0].correlation_id\u0060 appears character-identically in 2 files \u2014 src/flock/core/orchestrator.py, src/flock/orchestrator/context_builder.py. 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":"src/flock/core/orchestrator.py"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e26a1cd771e32053e38d380de6e51697e3dd1b33046174eeece321f8b16e774"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060bool(context_history) and self.should_use_context(inputs)\u0060 appears character-identically in 2 files \u2014 src/flock/engines/dspy_engine.py, src/flock/integrations/openclaw/engine.py. 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":"src/flock/engines/dspy_engine.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"072e562d010374a6b19a2b0a3e9af159d0efd09ecaf31f1d7d4b31a96e728fea"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060component.name or component.__class__.__name__\u0060 appears character-identically in 3 files \u2014 src/flock/core/agent.py, src/flock/core/orchestrator.py, src/flock/orchestrator/component_runner.py. 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":"src/flock/core/agent.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdc21d66aba721dda3bcb232a2af9d8a2caab52d9d6d8791bbcfbdf8b7838b1c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060filters.start is None and filters.end is None\u0060 appears character-identically in 3 files \u2014 src/flock/components/server/artifacts/artifacts_component.py, src/flock/core/store.py, src/flock/storage/dapr/dapr_state_blackboard_store.py. 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":"src/flock/components/server/artifacts/artifacts_component.py"},"region":{"startLine":605}}}],"partialFingerprints":{"codehealthFindingId/v1":"66365d03f89bbdb539ac012e9260dde2a6a7bf8c59e7c039c81d6837e18e2c8d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060getattr(ctx, \u0022correlation_id\u0022, \u0022\u0022) or \u0022\u0022\u0060 appears character-identically in 2 files \u2014 src/flock/engines/dspy/streaming_executor.py, src/flock/integrations/openclaw/engine.py. 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":"src/flock/engines/dspy/streaming_executor.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"0974c20c030fbc221e91ee794324bb09c2e13c8e6997664382d18916a1a13167"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060hasattr(agent, \u0022schedule_spec\u0022) and agent.schedule_spec\u0060 appears character-identically in 3 files \u2014 src/flock/api/graph_builder.py, src/flock/components/orchestrator/scheduling/timer.py, src/flock/core/orchestrator.py. 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":"src/flock/api/graph_builder.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"9599060c431a926dac2044690f0f7d6a89f591d223cdc28ae32428ee6fb29a11"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, dict) or type(value) is Visibility\u0060 appears character-identically in 2 files \u2014 src/flock/core/artifacts.py, src/flock/core/visibility.py. 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":"src/flock/core/artifacts.py"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"27f74cb25f7f570dbd2ba9b3250fee35eacc6ede6cdda48cee13c8e065da2caa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and \u0022\\n\u0022 in value\u0060 appears character-identically in 2 files \u2014 src/flock/logging/formatters/theme_builder.py, src/flock/logging/formatters/themed_formatter.py. 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":"src/flock/logging/formatters/theme_builder.py"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de623312beae46d8fa09e4a9584e97aafa9ef40905723d4393765c5f672f433"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not accumulator or not accumulator.artifacts\u0060 appears character-identically in 2 files \u2014 src/flock/api/graph_builder.py, src/flock/components/server/control/helpers.py. 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":"src/flock/api/graph_builder.py"},"region":{"startLine":1017}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa951c8744f1b9b6f27226c1189b5ebe07df771c4b35c747ec8b6adad2e8aaf1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not backend_changed and not frontend_changed\u0060 appears character-identically in 2 files \u2014 scripts/bump_version.py, scripts/check_version_bump.py. 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":"scripts/bump_version.py"},"region":{"startLine":259}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cf1e4051f251605b23f374ceb6eb22bd886f5997337a6e587391d14b53de8b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or not value.strip()\u0060 appears character-identically in 2 files \u2014 src/flock/application/types.py, src/flock/utils/visibility_utils.py. 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":"src/flock/application/types.py"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8951e0ee98a4d5d3e4ea7e5d09a1033ed6c68f7b116ef6ca8192ee9d0184d4c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not subscription.join and not subscription.batch\u0060 appears character-identically in 2 files \u2014 src/flock/api/graph_builder.py, src/flock/components/server/control/helpers.py. 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":"src/flock/api/graph_builder.py"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4827f694de6ac3990cc2ce6117dd063a3ae05dfda65750e2f14d440f25c7aa6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060span.parent and span.parent.span_id != 0\u0060 appears character-identically in 2 files \u2014 src/flock/logging/telemetry_exporter/duckdb_exporter.py, src/flock/logging/telemetry_exporter/file_exporter.py. 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":"src/flock/logging/telemetry_exporter/duckdb_exporter.py"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3d6096110b3281a0ebeae4c647bb2ebbde8c3d79b27f4f7a5570f050143c318"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deserialize_visibility\u0060 is public, takes a document from its caller (line 71) and hands it to \u0060_validate_visibility\u0060, which calls itself at line 170 (\u0060_validate_visibility\u0060) with a piece of \u0060data\u0060 \u2014 and nowhere in \u0060_validate_visibility\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_validate_visibility\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/utils/visibility_utils.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"52153be762cf42c31fb5f44990442d7561b327c87582e97f2d2446edf18c4b4b"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060imageFieldKind\u0060 is exported and takes \u0060prop: any\u0060 from its caller, and it calls itself at line 33 (\u0060imageFieldKind\u0060) with a piece of \u0060prop\u0060 \u2014 and nowhere in \u0060imageFieldKind\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. JavaScript sets no limit of its own on that nesting: \u0060JSON.parse\u0060 accepts any depth, so a 100,000-byte body \u2014 inside Express\u0027s default 100kb limit \u2014 parses to 50,000 levels, and a walk like this one throws \u0060RangeError: Maximum call stack size exceeded\u0060 long before it reaches the bottom. Wherever that throw lands, the work fails: a request errors, and a walk running outside any \u0060try\u0060 \u2014 an event handler, a timer, a promise nobody awaits \u2014 takes the Node process down with every other request in flight. Thread a depth argument through \u0060imageFieldKind\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/utils/imageFields.ts"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"6044f35a81fbe8e3991c4cce0f830407ba92fcd0af6084f0bdcec31114c54d96"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060check_inline_images\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 216 (\u0060check_inline_images\u0060) with a piece of \u0060value\u0060 (and at line 219) \u2014 and nowhere in \u0060check_inline_images\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060check_inline_images\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/core/image.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9e4940237b706951804dad7831cc3bf4f1d39a03646de86e1b78da19bca5c03"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060find_images\u0060 is public, takes a document from its caller (line 73) and hands it to \u0060_locate_images\u0060, which calls itself at line 55 (\u0060_locate_images\u0060) with a piece of \u0060value\u0060 (and at line 58) \u2014 and nowhere in \u0060_locate_images\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_locate_images\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/api/thumbnails.py"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d26929427dedbeb4583a6b8baa9e051bfe63901f1132fd7c4b1f256c69601fc"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060compact\u0060 is public and takes \u0060value: Any\u0060 from its caller, and it calls itself at line 89 (\u0060compact\u0060) with a piece of \u0060value\u0060 (and at line 91) \u2014 and nowhere in \u0060compact\u0060 is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060compact\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/api/thumbnails.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"46966868a2aae8a311c1dbeda0dac11d4dc1b67a01aacd71c92cb0e68309a32f"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 0/15 async functions that make a cancellable request (fetch, axios, ky, ofetch, got, undici, node:http) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up \u2014 a page navigated away from, an unmounted component, a timed-out job. Take a \u0060signal\u0060 (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice \u2014 judge against how the function is used."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd89d014f84408f7063269aa5892ba3df7c9af3e981ecfb0752c5731bc62d406"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchArtifactTypes: \u0060fetchArtifactTypes\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/api.ts"},"region":{"startLine":120}}}],"partialFingerprints":{"codehealthFindingId/v1":"251ee949622a3218202edcc2ec69b8d7e3e67661da3a3b73d6485d36461017bd"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchAgents: \u0060fetchAgents\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/api.ts"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"0baf46c1f20b8985fcaf0673388a7676978790b842f1535ffc4ce910a1eebed6"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: invokeAgent: \u0060invokeAgent\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/api.ts"},"region":{"startLine":253}}}],"partialFingerprints":{"codehealthFindingId/v1":"65676c0114e59552cd4b3fe8aaae7ef3d5f03d48d25af17444227e19ae648070"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchArtifact: \u0060fetchArtifact\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/api.ts"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"698c1247079cfeb368b7f9b816cac9ff7924e49a6edc4b5a0100b6815224fef9"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchArtifacts: \u0060fetchArtifacts\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/api.ts"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"102c7e71c4539ac3eccb8799bae96e082a4a1c5c7dc18f0591349d6e6e6268af"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchArtifactSummary: \u0060fetchArtifactSummary\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/api.ts"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"d629344463add0087c0422f5f6e2c20265fce115d0194315c4aff643e7b9eca8"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchThemeList: \u0060fetchThemeList\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/themeService.ts"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"58cd5a8e5eaabc42e8b44f8714904bd4dd4d2336ce9176112429d8d844293a7f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchTheme: \u0060fetchTheme\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/themeService.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b81872bedbc56e96aaa8fb4a26a7b7d9c3829a60a2019d84ccc63811261582c"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchVersion: \u0060fetchVersion\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/AdvancedSettings.tsx"},"region":{"startLine":33}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c964574dcbc63eb4c9cb7b2f66bea88c33e983eee6f3042d296293b58bc04c0"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadTraceServices: \u0060loadTraceServices\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/TracingSettings.tsx"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"5101c3b172df67353f7c82e166b126ced8f6352cb29c6c279735730ba9ce5def"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: loadTraceStats: \u0060loadTraceStats\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/settings/TracingSettings.tsx"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ce41220145842472910a45c76bfc6602509768ef040e51b4698481887f216c8"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchTraces: \u0060fetchTraces\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"b86fc9c5e807440437d9c27f22620c809172b2d1cf24ea8d4d5887007a4db45f"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchHistory: \u0060fetchHistory\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/LiveOutputTab.tsx"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af4f4b31cb88e3ef246334fd8423dc3601b557b6a2c2a78483fb67814ec710b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchMessageHistory: \u0060fetchMessageHistory\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/MessageHistoryTab.tsx"},"region":{"startLine":36}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8fc023d529fe9c7f7917caa4f9fca8037eb48f67d3ab5c243d2273d63d56c9b"}},{"ruleId":"X2","level":"warning","message":{"text":"Async function without AbortSignal: fetchRunHistory: \u0060fetchRunHistory\u0060 awaits \u0060fetch(\u2026)\u0060 but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept \u0060{ signal }\u0060 and pass it through: \u0060fetch(url, { signal })\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/RunStatusTab.tsx"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"910d945fd953c4c16c0ac5bdf6764c98ffb494e523b66910dda255f8366d683b"}},{"ruleId":"X23","level":"note","message":{"text":"Diagnostic log message is built whether or not it is wanted: \u0060debug\u0060 at line 682 is called with an argument built by \u0060[r.uri for r in self.current_roots]\u0060 (line 684), whose cost grows with the collection it walks. Python evaluates a call\u0027s arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached \u2014 and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no \u0060isEnabledFor(logging.DEBUG)\u0060 test, no debug flag, no \u0060lambda\u0060 the logger calls only when the level is on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/mcp/client.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"694c6df2e304b97207042c6cb5c6ae2a474f55444c4921ec6eaff88b04a12e25"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/utils/runtime.py"},"region":{"startLine":355}}}],"partialFingerprints":{"codehealthFindingId/v1":"973aae94b9c4743f6a7a37ce156ad3ac62c506c1ccd6f2a542e054193aee1076"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/utils/runtime.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"394cdae48ae4185734e71631b2757c12d76c47da49ea8909dd5420a9fd4c20e5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/semantic/context_provider.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"e856151619168625ed5b645afe2e88ecf1c40c791d5e2952f4d2587500da634c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/semantic/context_provider.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ff7b30b8815e8dd76e21b0567b4f4f060c746620445aa21c07302db4be571a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/mcp/types/types.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"95d872751d64fed845f8432ece28d3fc57938d8bf6860a9b4ae2c62620226adf"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/mcp/types/types.py"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6c1239e4d6731c58300e9b517ecdda530dfa4d60dd8a96d7fd98f2b94776743"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/logging/trace_and_logged.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"423f722a4c5eefc828699ae43c5d99af3aa58b9057ca1b3dcb8b42645b984a46"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/logging/telemetry_exporter/base_exporter.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"0835ee483de17d34129d77a6afe01ae16c46e618598fe2f2816926e1e1dc8cb9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/logging/telemetry_exporter/file_exporter.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"124fe441c0a780f86cf966a732c056abfb94da7cdd963c502c24f102371e99e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/integrations/openclaw/engine.py"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2495b20e7513a4e75fb37c150d83a4c50f7fb21be0aa10bf0f049ac0276269"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/integrations/openclaw/streaming.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"37ba64705191a7260fbcdd2acc5c9b38248612e7fbfb65cf9a03855fb00ad0a2"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/integrations/openclaw/streaming.py"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"8317eeb6b0b7afc81f942091c5f03bf320fb871b263981bcd2e1be37def418af"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/services/indexeddb.ts"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"2215bea224e7c68a27bf0a06a958838aef969f99b659c3402fb388539e26f024"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(() =\u003E {})\u0060 handles the rejection by doing nothing \u2014 the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63674c2febed8537d8e22e0925fe32e148e20cee52a415e14fd2bb077137988"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/engines/dspy_engine.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"06f3301d8be549dd35734cbc10df4253d30823542847faf51a63514c56a5aee9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/engines/dspy_engine.py"},"region":{"startLine":744}}}],"partialFingerprints":{"codehealthFindingId/v1":"6905cf706172800f17b71f58443ef4828d04b093bd7f5236ac7fe1f9ea72f872"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/engines/dspy/signature_builder.py"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a6576b00a86b255ed7fb7e043cf6ba18299930b7d9ed498868b639d309bf5d9"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/engines/dspy/streaming_executor.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fb6bd62a1e0aeb9f5dfb55dd7f2450d606f59e51bd14474438a7e3856fce879"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/engines/dspy/streaming_executor.py"},"region":{"startLine":654}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f38ac09ccf4ddd073e1f1ca88e51ff22c5120f7124cc9bc3d2dd9307c2609c3"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/engines/dspy/streaming_executor.py"},"region":{"startLine":803}}}],"partialFingerprints":{"codehealthFindingId/v1":"85f971ee3dce304a2148ccbd396dc73c7cf31c681faaf8201421578ebfbc0ada"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/core/subscription.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"668e7330fc86c51f93fd4d4e3b9ccad4cdb7770a2075312f991b4d58d4dfa381"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/components/server/control/control_routes_component.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"d534e50db301871c39dcd66eadfc10c9c244a8b9c7de8e4764da624964e9edad"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\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":"src/flock/components/server/control/control_routes_component.py"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a273dcc04eb1cea65b77a5fc79325df409d36a11bffa3685e1f40bd90f38551"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) override strict null checking: ~0.8 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 14 assertion(s) across the 18133 source line(s) of the 80 TypeScript file(s) read, which is the only code the operator asserts anything in (a \u0060!\u0060 in a \u0060.js\u0060 file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: src/flock/frontend/src/components/modules/TraceModuleJaeger.tsx (7), src/flock/frontend/src/components/graph/LogicOperationsDisplay.tsx (2), src/flock/frontend/src/services/layout.ts (2). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce. Many are correct: each is a claim the checker could not verify, and it is wrong only where the value can in fact be missing, so review the densest places first."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d83a7c69636a6290f63000d5c19b2073be1fa772f51977532af9ca6f745fc2a"}},{"ruleId":"X7","level":"note","message":{"text":"Pending state with no failure state: The view draws \u0060Loading history...\u0060 under \u0060isLoadingHistory\u0060, but \u0060isLoadingHistory\u0060 is settled by a load that can fail and the component draws no failure state, so a failed load is shown as \u0022not yet\u0022 for ever, or as the loaded state over its initial value. Give the component a failure state and draw it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/details/LiveOutputTab.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea16595ad7ccc5972d109b96fcdaf6262e30ab80a40e662647fe86a7c07eddc5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_resolve_engines\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/core/agent.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c1507ce12c7b0fcb9584b1886d7e6acbf65419e4f31b58e83c59e2e5e3909d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_resolve_utilities\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/core/agent.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"d43ad58d145269b1c3c2f1adfce7cf13c572569478c73590751ac891dfacb68b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_make_listeners\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/engines/dspy/streaming_executor.py"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddb828e4997e4adc81445bd60431d38854fd19169f9b416e71f0e12e310c3b2"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_parse_json\u0060 swallows every exception into \u0060return {}\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/integrations/openclaw/streaming.py"},"region":{"startLine":221}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcca34c11ccdb5c869230a66a1ae6a7a06331e8d8a2069d08361e3c2ba1eb00d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060get_context\u0060 swallows every exception into \u0060return []\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/semantic/context_provider.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"7097124fc0ac6a581ad6f5253374b87d82981c6f270eb36e37860cb3e0e29254"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060formatRelativeTime\u0060 (in \u0060ScheduledAgentDisplay\u0060) swallows every exception into \u0060return \u0027Unknown\u0027\u0060 \u2014 a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/flock/frontend/src/components/graph/ScheduledAgentDisplay.tsx"},"region":{"startLine":72}}}],"partialFingerprints":{"codehealthFindingId/v1":"f030cf71a01b7888d0fcfdb92ac1da7a6a769cd678d4aa32fed29e9009a68a6e"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-16","guid":"659db3ea-affc-8453-8add-c1218fbfcb92","name":"Configuration","shortDescription":{"text":"Configuration"},"helpUri":"https://cwe.mitre.org/data/definitions/16.html"},{"id":"CWE-214","guid":"b10ad120-fb22-1351-9348-aa23b453e815","name":"CWE-214","shortDescription":{"text":"CWE-214"},"helpUri":"https://cwe.mitre.org/data/definitions/214.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-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-522","guid":"71fb233e-ce6a-ae57-9419-ef8373540b09","name":"Insufficiently Protected Credentials","shortDescription":{"text":"Insufficiently Protected Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/522.html"},{"id":"CWE-532","guid":"1cd8877a-76e8-ce54-b40b-779af23364a0","name":"Insertion of Sensitive Information into Log File","shortDescription":{"text":"Insertion of Sensitive Information into Log File"},"helpUri":"https://cwe.mitre.org/data/definitions/532.html"},{"id":"CWE-552","guid":"3492436b-eca2-9c54-9ba3-5dade427c903","name":"Files or Directories Accessible to External Parties","shortDescription":{"text":"Files or Directories Accessible to External Parties"},"helpUri":"https://cwe.mitre.org/data/definitions/552.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"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":"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/"},{"id":"A09:2025","guid":"78892bc9-3c98-495d-881c-8af1390d643c","name":"Security Logging \u0026 Alerting Failures","shortDescription":{"text":"Security Logging \u0026 Alerting Failures"},"helpUri":"https://top10.owasp.org/2025/A09_2025-Security_Logging_and_Alerting_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-5","guid":"cc7f4610-8859-e654-9029-d5f97d992220","name":"Insufficient PBAC (Pipeline-Based Access Controls)","shortDescription":{"text":"Insufficient PBAC (Pipeline-Based Access Controls)"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-05-Insufficient-PBAC"},{"id":"CICD-SEC-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-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":28,"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."]}]}