{"$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":"D8","name":"Code Coverage","shortDescription":{"text":"Code Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/D8"},{"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":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D16","name":"Bus Factor","shortDescription":{"text":"Bus Factor"},"helpUri":"https://codehealth.canine.dev/dimensions/D16"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D20","name":"ADR Quality","shortDescription":{"text":"ADR Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D20"},{"id":"D25","name":"ADR Conformance","shortDescription":{"text":"ADR Conformance"},"helpUri":"https://codehealth.canine.dev/dimensions/D25"},{"id":"D26","name":"Project Cohesion","shortDescription":{"text":"Project Cohesion"},"helpUri":"https://codehealth.canine.dev/dimensions/D26"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D31","name":"IaC \u0026 Container Security","shortDescription":{"text":"IaC \u0026 Container Security"},"helpUri":"https://codehealth.canine.dev/dimensions/D31","relationships":[{"target":{"id":"CWE-1032","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-732","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-16","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"],"owasp":"A02:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D36","name":"Supply-chain Provenance \u0026 Signing","shortDescription":{"text":"Supply-chain Provenance \u0026 Signing"},"helpUri":"https://codehealth.canine.dev/dimensions/D36","relationships":[{"target":{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-494","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1357","CWE-494"],"owasp":"A03:2025"}},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"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":"AX9","name":"CQS / query purity","shortDescription":{"text":"CQS / query purity"},"helpUri":"https://codehealth.canine.dev/dimensions/AX9"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"C1","name":"Data Protection","shortDescription":{"text":"Data Protection"},"helpUri":"https://codehealth.canine.dev/dimensions/C1"},{"id":"C2","name":"Access Controls","shortDescription":{"text":"Access Controls"},"helpUri":"https://codehealth.canine.dev/dimensions/C2"},{"id":"C3","name":"Audit Trail","shortDescription":{"text":"Audit Trail"},"helpUri":"https://codehealth.canine.dev/dimensions/C3"},{"id":"C4","name":"Data Retention","shortDescription":{"text":"Data Retention"},"helpUri":"https://codehealth.canine.dev/dimensions/C4"},{"id":"DM4","name":"Rich vs anemic domain model","shortDescription":{"text":"Rich vs anemic domain model"},"helpUri":"https://codehealth.canine.dev/dimensions/DM4"},{"id":"DM6","name":"Domain \u2194 infrastructure boundary","shortDescription":{"text":"Domain \u2194 infrastructure boundary"},"helpUri":"https://codehealth.canine.dev/dimensions/DM6"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P10","name":"Library API \u0026 versioning","shortDescription":{"text":"Library API \u0026 versioning"},"helpUri":"https://codehealth.canine.dev/dimensions/P10"},{"id":"P12","name":"CI test-gate honesty","shortDescription":{"text":"CI test-gate honesty"},"helpUri":"https://codehealth.canine.dev/dimensions/P12"},{"id":"P2","name":"Observability","shortDescription":{"text":"Observability"},"helpUri":"https://codehealth.canine.dev/dimensions/P2"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P4","name":"Deployment \u0026 Rollback","shortDescription":{"text":"Deployment \u0026 Rollback"},"helpUri":"https://codehealth.canine.dev/dimensions/P4"},{"id":"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":"P8","name":"Schema migrations","shortDescription":{"text":"Schema migrations"},"helpUri":"https://codehealth.canine.dev/dimensions/P8"},{"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":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"S1","name":"Web-Security Posture","shortDescription":{"text":"Web-Security Posture"},"helpUri":"https://codehealth.canine.dev/dimensions/S1"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"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":"Graph.Graph (cyclomatic 242): Graph.Graph has cyclomatic complexity 242 (threshold 15). Of this number, 34 points are the body\u0027s own statements and 208 belong to 44 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":"web/src/pages/Graph.tsx"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09521b6ad96bbfb1c54e073e3be52c92aff470150cf5125aadf482835773625"}},{"ruleId":"D1","level":"warning","message":{"text":"Chat.Chat (cyclomatic 122): Chat.Chat has cyclomatic complexity 122 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 86 belong to 30 function items 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":"web/src/pages/Chat.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"350f25c62161d58be849a7cf28eee7ed7fa85933160eb52580403ab4c1f3d4b8"}},{"ruleId":"D1","level":"warning","message":{"text":"Review.Review (cyclomatic 90): Review.Review has cyclomatic complexity 90 (threshold 15). Of this number, 78 points are the body\u0027s own statements and 12 belong to 11 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":"web/src/pages/Review.tsx"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8f1af08db62d5a03066bd847a45de8f17f582f76a72f6c3e4f286f26d3aed4"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::phrase_alignment::align_phrases_locked (cyclomatic 84): utopia_server::phrase_alignment::align_phrases_locked has cyclomatic complexity 84 (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":"crates/utopia-server/src/phrase_alignment.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"0576e97b0cfae5c11823fc8d8f4566cef3520ea18ef20cb030551281208f426f"}},{"ruleId":"D1","level":"warning","message":{"text":"Library.SourceModal (cyclomatic 81): Library.SourceModal has cyclomatic complexity 81 (threshold 15). Of this number, 41 points are the body\u0027s own statements and 40 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Library.tsx"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"de9dbdc8992bd77d3b97ef10fddbe29ae14fa597d6fbc5ab0d078a576ea331ad"}},{"ruleId":"D1","level":"warning","message":{"text":"OntologySchemaGraph.OntologySchemaGraph (cyclomatic 78): OntologySchemaGraph.OntologySchemaGraph has cyclomatic complexity 78 (threshold 15). Most of this is not in the body itself: 11 of the 78 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 848, a function literal at line 812, a function literal at line 740, \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":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"c83b2105c2b4ccf64c657bda6d8e7422b70afb092eb7333e8ee39901248cd89f"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::ontology_agent::propose_locked (cyclomatic 67): utopia_server::ontology_agent::propose_locked has cyclomatic complexity 67 (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":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec4aa60bc430091e21af3c982a7628d0bcef2a829c2e2a0e8319a52ce8b2328"}},{"ruleId":"D1","level":"warning","message":{"text":"Ontology.Ontology (cyclomatic 66): Ontology.Ontology has cyclomatic complexity 66 (threshold 15). Of this number, 51 points are the body\u0027s own statements and 15 belong to 12 function items 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":"web/src/pages/Ontology.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"b527312ab01c5df39afab293ecff3c7e0d6959559279972abdfccde6adf202ca"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_ingest::parsers::docx_xml_to_text (cyclomatic 63): utopia_ingest::parsers::docx_xml_to_text has cyclomatic complexity 63 (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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"70470a874b21497c712155f00c917bbebf71ec0cfbbf41a2d3910a7e95579cf9"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_ingest::ontology_rdf::project (cyclomatic 62): utopia_ingest::ontology_rdf::project has cyclomatic complexity 62 (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":"crates/utopia-ingest/src/ontology_rdf.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd7a03ca52ee6fd444f2866285c7ba890f8bc54d59288157ef23f718d2e6b914"}},{"ruleId":"D1","level":"warning","message":{"text":"Library.Library (cyclomatic 61): Library.Library has cyclomatic complexity 61 (threshold 15). Of this number, 40 points are the body\u0027s own statements and 21 belong to 11 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":"web/src/pages/Library.tsx"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9cafa49cdec3e29334b34b99a2d028c2bfbd3775c13febf32daaa5918ce7e80"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_store::graph::insert_fact_on (cyclomatic 60): utopia_store::graph::insert_fact_on has cyclomatic complexity 60 (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":"crates/utopia-store/src/graph.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"852ace8606f78799b8b3ef47495a1c55a1972d2cb7f50e837d4496d72d938b03"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::api::chat::chat (cyclomatic 58): utopia_server::api::chat::chat has cyclomatic complexity 58 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/chat.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"3182c36b587353bfc7f915901bd98ffaba348d31c9a7f9a2a903b6c032f6a12d"}},{"ruleId":"D1","level":"warning","message":{"text":"LoginScene.LoginScene (cyclomatic 58): LoginScene.LoginScene has cyclomatic complexity 58 (threshold 15). Most of this is not in the body itself: 2 of the 58 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 196, 70, 153, \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":"web/src/pages/LoginScene.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e5b51f1cd5ce4a3fb1f12d669f6b02e044f5a91617a9cc6acbec84eacc3eef2"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings.Settings (cyclomatic 51): Settings.Settings has cyclomatic complexity 51 (threshold 15). Of this number, 44 points are the body\u0027s own statements and 7 belong to 4 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":"web/src/pages/Settings.tsx"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"af59f332e5f336b508c280277088b969e0731984aa4399485c1330e6d6e8b7b1"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_ingest::table::render_rows (cyclomatic 44): utopia_ingest::table::render_rows has cyclomatic complexity 44 (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":"crates/utopia-ingest/src/table.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"f331bd2818da946767c11c53b06d435d9ae8f0f3635665e231ea3101181f1395"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_reason::derive::contradictions (cyclomatic 44): utopia_reason::derive::contradictions has cyclomatic complexity 44 (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":"crates/utopia-reason/src/derive.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"f55ec6ae14b0a2ea77ab08e4d5d1a40fc5abe98c1518a31037ab23ee18f65c12"}},{"ruleId":"D1","level":"warning","message":{"text":"ruleExpressions.readExpression (cyclomatic 44): ruleExpressions.readExpression has cyclomatic complexity 44 (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":"web/src/pages/ruleExpressions.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ca8048e5fc7b69a93a84eb560dade1c97834ac5a7a08b3fe396824e65668a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.EntityPanel (cyclomatic 44): Graph.EntityPanel has cyclomatic complexity 44 (threshold 15). Of this number, 20 points are the body\u0027s own statements and 24 belong to 14 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":"web/src/pages/Graph.tsx"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"7979d329889f84fb472ed6a3bed7c385706f504662ece51052f269c8c7377fb0"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_ingest::parsers::pptx_xml_to_text (cyclomatic 42): utopia_ingest::parsers::pptx_xml_to_text has cyclomatic complexity 42 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc25f7b31286485bbf5c42e4f8f979ca4ec05a87890bc6b7531de1d13b2cda1"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::time_resolution::resolve_document (cyclomatic 42): utopia_server::time_resolution::resolve_document has cyclomatic complexity 42 (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":"crates/utopia-server/src/time_resolution.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"99eae5d9cb01557ef44e615be1bf3d4dda611b417f5e42ede79c79da32afd4e5"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::extraction_open::apply_open_extraction (cyclomatic 41): utopia_server::extraction_open::apply_open_extraction has cyclomatic complexity 41 (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":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3e896bb60ab96af10b06fddef7903122d77aec94289f3ea8c0d2060bc0e4552"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.TimeScrubber (cyclomatic 41): Graph.TimeScrubber has cyclomatic complexity 41 (threshold 15). Most of this is not in the body itself: 11 of the 41 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 2167, 1966, 2028, \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":"web/src/pages/Graph.tsx"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"73861509f2209c6e686b84ecf14201280d7439a65b55e714300207cb97238ecf"}},{"ruleId":"D1","level":"warning","message":{"text":"Library.SourceEditModal (cyclomatic 40): Library.SourceEditModal has cyclomatic complexity 40 (threshold 15). Of this number, 27 points are the body\u0027s own statements and 13 belong to 4 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Library.tsx"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"e45c25abb0f8a400acb71504b10f01baf2429ca7b26f8ef50e30f9cfe95c8330"}},{"ruleId":"D1","level":"warning","message":{"text":"Graph.FactRow (cyclomatic 38): Graph.FactRow has cyclomatic complexity 38 (threshold 15). Of this number, 31 points are the body\u0027s own statements and 7 belong to 5 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":"web/src/pages/Graph.tsx"},"region":{"startLine":3350}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a689899efffbc000088aafe97ca82c55b9e79ec56d3a71c301ddccec31b7bfb"}},{"ruleId":"D1","level":"warning","message":{"text":"KbSettings.KbSettings (cyclomatic 38): KbSettings.KbSettings has cyclomatic complexity 38 (threshold 15). Of this number, 36 points are the body\u0027s own statements and 2 belong to 2 function literals 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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd39951ce65761285d9a4715b32bb10c48a7dcd0b3328bf62b5709f3e8ab43b"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_store::paths::paths_between (cyclomatic 37): utopia_store::paths::paths_between has cyclomatic complexity 37 (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":"crates/utopia-store/src/paths.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"2754602add5cf76f27ed794e9c5de6ba345739ba8e186e5f67b2f794bac2e873"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::owl_import::apply (cyclomatic 36): utopia_server::owl_import::apply has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/owl_import.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"408d7da133a2908cc91cdd5e521285b0d3e307be1bc9459d7c53b1481db397d9"}},{"ruleId":"D1","level":"warning","message":{"text":"ruleDependencies.ruleDependencies (cyclomatic 36): ruleDependencies.ruleDependencies has cyclomatic complexity 36 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 19 belong to 4 function items 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":"web/src/pages/ruleDependencies.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"8eee82b4e67fb8b80c86a2f86b0fbc0a26a72e36ee2094176f3674fa9d88979b"}},{"ruleId":"D1","level":"warning","message":{"text":"RulesPanel.RulesPanel (cyclomatic 36): RulesPanel.RulesPanel has cyclomatic complexity 36 (threshold 15). Most of this is not in the body itself: 13 of the 36 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 546, 376, 381, \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":"web/src/pages/RulesPanel.tsx"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"14f18daac57acc6b83dbca1a359f9b5fb90512312d6355be30481ff11b4200aa"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_store::errata::record (cyclomatic 34): utopia_store::errata::record has cyclomatic complexity 34 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/errata.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"836ab712e118f06cd975ef3d1f131a313cfa2f95b4a4a97859e1cd94874c633a"}},{"ruleId":"D1","level":"warning","message":{"text":"OntologySchemaGraph.buildSchemaGraph (cyclomatic 34): OntologySchemaGraph.buildSchemaGraph has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e5b9f54b4b23c0ad42833ffd211628f3571d0ce703f80c001a26ee56481d32"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::type_alignment::align_types_locked (cyclomatic 33): utopia_server::type_alignment::align_types_locked 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":"crates/utopia-server/src/type_alignment.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"a211dd020df3c24dba899a51852e4ded6d750d0a0718cad42e73d17384d80a56"}},{"ruleId":"D1","level":"warning","message":{"text":"Library.SourceBar (cyclomatic 32): Library.SourceBar has cyclomatic complexity 32 (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":"web/src/pages/Library.tsx"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef4659afc48da6a501f69362aad2e322d7a433c13e41ffd1a1218094eb6c2620"}},{"ruleId":"D1","level":"warning","message":{"text":"RulesPanel.RuleDialog (cyclomatic 32): RulesPanel.RuleDialog has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 14 of the 32 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 942, a function literal at line 857, a function literal at line 845, \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":"web/src/pages/RulesPanel.tsx"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"b520dd97585d1dbf95a4af7b370826ac93c32b4bb71335bcfc930d7101a15c8e"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_reason::rules::joined_evaluate (cyclomatic 29): utopia_reason::rules::joined_evaluate 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":"crates/utopia-reason/src/rules.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a1bf4ff29d50bb16838521fc1c4dbd767d146eb882dd610c5424471df86c686"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::dispatch (cyclomatic 29): utopia_server::dispatch has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/main.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f435cec083e8f16c64730837eb4136157a096e6e2227d4d43305558e252e69"}},{"ruleId":"D1","level":"warning","message":{"text":"Docs.DocsPage (cyclomatic 29): Docs.DocsPage has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 8 of the 29 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 158, onScrollSpy, a function literal at line 142, \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":"web/src/pages/Docs.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7e4f7763f7994f3940dfccf137d1929fdb0844daca1af9e5c8b4712f8916eb5"}},{"ruleId":"D1","level":"warning","message":{"text":"ontologyDialogs.PropertyDialog (cyclomatic 29): ontologyDialogs.PropertyDialog has cyclomatic complexity 29 (threshold 15). Of this number, 21 points are the body\u0027s own statements and 8 belong to 4 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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f06b08f2a6f4a72933f37dce5e55127072e21d9f0c3ad19a09d1e86ba06c619"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_store::governance::name_shape (cyclomatic 28): utopia_store::governance::name_shape has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/governance.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4a8edbd1ce7b837277c1ccdccb82eef260828de37184cb8ff784de1a4d4c823"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_store::reasoning::resolve (cyclomatic 28): utopia_store::reasoning::resolve has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"65e3720455d3474e52e2e912edc3faecc942dc987109c842ad590a16ba26a900"}},{"ruleId":"D1","level":"warning","message":{"text":"api.consumeChatStream (cyclomatic 28): api.consumeChatStream has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 1 of the 28 points is its own statement and the rest belongs to 3 function items inside it that branch (a function literal at line 2907, a function literal at line 2928, fail). 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":"web/src/api.ts"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"1100cb1e60a94dcd8ecd6286ef41721b58e3dacc99a0ae8e0a228929d3b739c3"}},{"ruleId":"D1","level":"warning","message":{"text":"steps.stepDetail (cyclomatic 28): steps.stepDetail has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function item 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":"web/src/steps.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"e097522fa99d86fbf838b6aed117e5eff369456f1d9cba89710b70c1d76a8b00"}},{"ruleId":"D1","level":"warning","message":{"text":"Ontology.QuestionsPanel (cyclomatic 28): Ontology.QuestionsPanel has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 12 of the 28 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 2037, a function literal at line 1918, submit, \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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b0e12d8c760acce25c59a744b7875b9174a129391877aa90dce4d6cbcb23ba"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_reason::rules::evaluate_with_pool (cyclomatic 27): utopia_reason::rules::evaluate_with_pool 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":"crates/utopia-reason/src/rules.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"74a7fb68930864315913f529e825c9d6ff97022c0ff379d39d3c55dfd20cffdd"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::api::sources_routes::validate_statements_payload (cyclomatic 27): utopia_server::api::sources_routes::validate_statements_payload 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":"crates/utopia-server/src/api/sources_routes.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"954ec341aed24a7825985477c2d546926d722bca914b79b14d3e481de27e6f2d"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::extraction_open::run_open (cyclomatic 27): utopia_server::extraction_open::run_open 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":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"38c1db2a764c9085f324780efed7371e04c1d18582515a87b8e8b16e6da67b03"}},{"ruleId":"D1","level":"warning","message":{"text":"Ontology.MissesPanel (cyclomatic 27): Ontology.MissesPanel has cyclomatic complexity 27 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 11 belong to 5 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":"web/src/pages/Ontology.tsx"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"97bfaa6cc39c529857c12a6f04c86bbc8cdb6de64a0979ce9ff6ad4f497bb144"}},{"ruleId":"D1","level":"warning","message":{"text":"index.MultiSearchSelect (cyclomatic 26): index.MultiSearchSelect has cyclomatic complexity 26 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 13 belong to 2 function literals 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":"web/src/ui/index.tsx"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c1a9c23bc3e68e97b1b42b0d3ab53ff42ace030b710929d1efad6b1f8329d65"}},{"ruleId":"D1","level":"warning","message":{"text":"DocViewer.DocViewer (cyclomatic 26): DocViewer.DocViewer has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 6 of the 26 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 110, 155, 46, \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":"web/src/pages/DocViewer.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0e847016dda1f947be6160a39ca77487bf24da2c0283e36abfcc61b6d5dd75"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::api::rule_expression_input::compile_ast (cyclomatic 25): utopia_server::api::rule_expression_input::compile_ast has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/rule_expression_input.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f0f68cd60e83e5867209ddedb463cddfedf7882364f6cbd66821f318dd19148"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::time_resolution::resolve_one (cyclomatic 25): utopia_server::time_resolution::resolve_one 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":"crates/utopia-server/src/time_resolution.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"92029cd7d2f2f3a12fae8c4b2f54204c0b440f49aa1e7302da80770d2546052a"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::webdav::parse_multistatus (cyclomatic 24): utopia_server::webdav::parse_multistatus 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":"crates/utopia-server/src/webdav.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d2f6daf34270b5d442bc89930dced2f6704a61ccb7d81b140e8c3fb708fe2c4"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_store::reasoning::materialize (cyclomatic 24): utopia_store::reasoning::materialize 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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1b31747ff2a92b183169a08601aaceaf6aad4438f2c66107e5154a5a463fe49"}},{"ruleId":"D1","level":"warning","message":{"text":"Mappings.Mappings (cyclomatic 24): Mappings.Mappings has cyclomatic complexity 24 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 8 belong to 6 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Mappings.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad84db3cec1e9861a74edf7ca88fefb8c46dddb5ee89e36fa76bcb7a93bbed82"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_extract::ontology_agent::parse_proposal_response (cyclomatic 23): utopia_extract::ontology_agent::parse_proposal_response has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-extract/src/ontology_agent.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad83abc00b4ba25c97d511b0d6f961dcfa29d09365858a6defbc789a5822219a"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::errata::review_document (cyclomatic 23): utopia_server::errata::review_document has cyclomatic complexity 23 (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":"crates/utopia-server/src/errata.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"e427edcbf410dc9735347db0476c3cc6eef9c8d59b8460ffd30458682bdf8294"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::governance::rounds (cyclomatic 23): utopia_server::governance::rounds has cyclomatic complexity 23 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/governance.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"95b4d565edbe3ae3a7b43ee37221928d22e51aa3ad57ae06f7a0f781e0057e8c"}},{"ruleId":"D1","level":"warning","message":{"text":"Members.Members (cyclomatic 23): Members.Members has cyclomatic complexity 23 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 11 belong to 5 function literals 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":"web/src/pages/Members.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"93057a1d02908d063293ed3319caeb12f8bde41f41dfe03b38377d15b699dae9"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_extract::scan_quantity (cyclomatic 22): utopia_extract::scan_quantity 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":"crates/utopia-extract/src/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ba0c134b63f6c406bd8fe17373a3c83be757528321edf75e112b68f19f6658"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_extract::open::salvage (cyclomatic 22): utopia_extract::open::salvage has cyclomatic complexity 22 (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":"crates/utopia-extract/src/open.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a60ba6c00170b9d47ba4b4b62ea54e4844186e498d3a8bcecb303a32fc26c74"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::main (cyclomatic 22): utopia_server::main has cyclomatic complexity 22 (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":"crates/utopia-server/src/main.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd3e36c0490bf33264be4ddd818855161d12b5add554992fe068c9879d2dc42e"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::api::export_routes::export (cyclomatic 22): utopia_server::api::export_routes::export has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/export_routes.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3925c97fe335c60ad7bae50dcdea16c4aa06dd7d90d66f211d1c96e029d69c"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::rdf::emit_fact (cyclomatic 22): utopia_server::rdf::emit_fact 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":"crates/utopia-server/src/rdf.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"51681d620c5b9813f1af54d835ffe5fdface10a1c49a3416c61baf5f43f33c39"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_store::resolution::resolve_by_name (cyclomatic 22): utopia_store::resolution::resolve_by_name 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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"237fa4efd79d315b55cc870ee0e9bb424738cbc2809dc75ffe52d762582dd151"}},{"ruleId":"D1","level":"warning","message":{"text":"Library.SchedulePicker (cyclomatic 22): Library.SchedulePicker has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 4 function items inside it that branch (emit, a function literal at line 233, a function literal at line 239, \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":"web/src/pages/Library.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"955beb0d5eb7e7031e671a839a785fce2f3c5d25775f74fe67a49d290640d860"}},{"ruleId":"D1","level":"warning","message":{"text":"LlmClient::chat_tools_stream_with (cyclomatic 21): LlmClient::chat_tools_stream_with 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":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3fb1a0f499e3c3b2da741c4a21adf6c86f5d723fced588d44532dd55573810"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::mappings::explore (cyclomatic 21): utopia_server::mappings::explore 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":"crates/utopia-server/src/mappings.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b349a97cf75dec0dbdc5133c5e10c7efc58b95e1f0c6b5cc9f7dc7908ff6040"}},{"ruleId":"D1","level":"warning","message":{"text":"predicateText.predicateSentence (cyclomatic 21): predicateText.predicateSentence has cyclomatic complexity 21 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/predicateText.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"de61cc26c9b4c90ef9b95845b02e62c67e6b2d2da94e260b0bb030af45d80d65"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_extract::ontology_agent::build_proposal_messages (cyclomatic 20): utopia_extract::ontology_agent::build_proposal_messages 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":"crates/utopia-extract/src/ontology_agent.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a5939e54536f830386763573933fc34bc85a0f528d8754a92c8d669f1a4009b"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_reason::derive::derive (cyclomatic 20): utopia_reason::derive::derive 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":"crates/utopia-reason/src/derive.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a1c47d0990606bca64119704af13a198e5b75f7704d66a4fc4170134e6345b"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::extraction_open::call_and_parse_one_chunk (cyclomatic 20): utopia_server::extraction_open::call_and_parse_one_chunk has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"eff6337a574117f71c34637da0a1fe4b0ce76d4ca459912626ca08020f31cb7a"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::pipeline::run (cyclomatic 20): utopia_server::pipeline::run 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":"crates/utopia-server/src/pipeline.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"c804569a18c6e6827f0c49bbd8e7899cd1c62cad9cf8ec68afe314e9808ac8e0"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_store::reasoning::attribute_rules (cyclomatic 20): utopia_store::reasoning::attribute_rules 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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fae13a608e542303e765a09c7143d5ceef5641b1f44da7516f2dd82d29f8c6"}},{"ruleId":"D1","level":"warning","message":{"text":"ontologyTables.OntologyTables (cyclomatic 20): ontologyTables.OntologyTables has cyclomatic complexity 20 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e6b7e61124daf48c374ca8c142fecfe91ab7c815ccab30d01a39c1544a700d"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_ingest::html::prune_empty_table_columns (cyclomatic 19): utopia_ingest::html::prune_empty_table_columns 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":"crates/utopia-ingest/src/html.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f688578d1cccd6857288f5065280dd7fe44cf5da1f9d7b61a770deff6eaf93"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_reason::ontology::check_ontology (cyclomatic 19): utopia_reason::ontology::check_ontology 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":"crates/utopia-reason/src/ontology.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fefdc8052d4fce2c04584373753f17b6c69fb4131564dff80e0e27058067a7a"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::http_fetch::is_public_ip (cyclomatic 19): utopia_server::http_fetch::is_public_ip has cyclomatic complexity 19 (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":"crates/utopia-server/src/http_fetch.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8644fbeccfd35955dc0256f88c25887f5918b50bca2cf85a88fff54d9759a1e"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::time_text::span (cyclomatic 19): utopia_server::time_text::span has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/time_text.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"1886313127e3726d7038c0c8b5efced6a84c1e5fa63f96625fe11aaf47820028"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::type_resolution::resolve_with (cyclomatic 19): utopia_server::type_resolution::resolve_with 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":"crates/utopia-server/src/type_resolution.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a84d05ef4012c4321ab365a498edb8de7c27fb80303785bc7791e27711a3060"}},{"ruleId":"D1","level":"warning","message":{"text":"MyKbs.MyKbs (cyclomatic 19): MyKbs.MyKbs has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 9 of the 19 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 144, 74, 83, \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":"web/src/pages/MyKbs.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"962c1e7aed9cdbf8e394b76e6d3930b3aa24e1f3bdd803b7e07543a1226dbe27"}},{"ruleId":"D1","level":"warning","message":{"text":"Review.AgentRow (cyclomatic 19): Review.AgentRow has cyclomatic complexity 19 (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":"web/src/pages/Review.tsx"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"62dfa239671a5ab7799bfd06dd193c779ae0322a2f5d47949a22c096b1da8c0d"}},{"ruleId":"D1","level":"warning","message":{"text":"Review.AlignmentPhraseRow (cyclomatic 19): Review.AlignmentPhraseRow has cyclomatic complexity 19 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 3 belong to 2 function literals 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":"web/src/pages/Review.tsx"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f97402f76cfff72a49e2ffaafc7a46a276f44cf8cf4a461772877ed80541840"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_ingest::blocks::parse (cyclomatic 18): utopia_ingest::blocks::parse 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":"crates/utopia-ingest/src/blocks.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a07fe6be38e6e23d611122a734c97a16224c89cb5b6d37ae1732211e9ae99c0f"}},{"ruleId":"D1","level":"warning","message":{"text":"Expr::decode (cyclomatic 18): Expr::decode 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":"crates/utopia-reason/src/expressions.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d72ee3cf7ba450a248eae338cc1532b36a7c60fa3392e2d95aa179326c3eea"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_reason::rules::satisfies (cyclomatic 18): utopia_reason::rules::satisfies has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform \u2014 the same kind of value, with no behaviour of its own \u2014 a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-reason/src/rules.rs"},"region":{"startLine":656}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a0277b739770f61af092a240a325b0294092407a185b4798d5bd1b80db01f3"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::adjudication::adjudicate_entities (cyclomatic 18): utopia_server::adjudication::adjudicate_entities 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":"crates/utopia-server/src/adjudication.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2072949ccfbe04085d13bbd27076d4c636db3cb1125cf64f08e960d518860de"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::api::tools_graph::paths_between (cyclomatic 18): utopia_server::api::tools_graph::paths_between has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"c802689f8450448b791ff14868488233d14a714aeb109b1700a948e0f9f2513f"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::jira_issues::render (cyclomatic 18): utopia_server::jira_issues::render 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":"crates/utopia-server/src/jira_issues.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"34758f5a4dd3c2b9d283f6da15a3cab369e0343412ee98006a0bc84e9ced76a8"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_store::ontology::update_relation_type (cyclomatic 18): utopia_store::ontology::update_relation_type has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16affd1185132f3c4a92f807ed788808d4c45f5172bcd6d79add158f5fea755"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_store::resolution::resolve_type_drift (cyclomatic 18): utopia_store::resolution::resolve_type_drift 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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1856d3a50120629ffb689b5aed7b6dfe5fa1b20b6315a19a6f73239a4fd730"}},{"ruleId":"D1","level":"warning","message":{"text":"ExpressionDraftEditor.DraftNode (cyclomatic 18): ExpressionDraftEditor.DraftNode has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to one function item 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":"web/src/pages/ExpressionDraftEditor.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd151e07f6ad6f1719b3e59bf6dfb521b0c49fb875634fccdaf78d89deb6eceb"}},{"ruleId":"D1","level":"warning","message":{"text":"Chat.TurnView (cyclomatic 18): Chat.TurnView has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to one function literal inside it that branches. To reduce it, 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":"web/src/pages/Chat.tsx"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5980e0f1691d1c7b52d6ae8e258f2f58b9f05941e89c3a5751fd5e447f6172"}},{"ruleId":"D1","level":"warning","message":{"text":"Login.Login (cyclomatic 18): Login.Login has cyclomatic complexity 18 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 2 belong to 2 function literals inside it that branch. To reduce it, 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":"web/src/pages/Login.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27cdd36d61e36e23bc3ab9d7964d7c2be679caca1ef2e867fb6deb69e8c5e4e"}},{"ruleId":"D1","level":"warning","message":{"text":"ontologyDialogs.ClassDialog (cyclomatic 18): ontologyDialogs.ClassDialog has cyclomatic complexity 18 (threshold 15). Of this number, 13 points are the body\u0027s own statements and 5 belong to 4 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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79d870002813a5e285e3f4d55aa925e975e437048c063a5b3c5e4e29ec445d9"}},{"ruleId":"D1","level":"warning","message":{"text":"Ontology.RefinePanel (cyclomatic 18): Ontology.RefinePanel has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Ontology.tsx"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79c4b6fcb2961bc4cb0fe7c3508ad1f0a8dffeb76fc22af3a22b4fa49098dc0"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_ingest::ontology_rdf::shape_signatures (cyclomatic 17): utopia_ingest::ontology_rdf::shape_signatures has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/ontology_rdf.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"590f1ff3e2922f31532090edd66d649d752732bd73b613da4f31bfc21d4e6da8"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_ingest::parsers::xlsx_sheet (cyclomatic 17): utopia_ingest::parsers::xlsx_sheet has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"44e5e1808f3ace54d32fc1bb5f4abf5a3b9ff04d7e67e113d0036221104839fa"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::api::rig_model::push_message (cyclomatic 17): utopia_server::api::rig_model::push_message has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/rig_model.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"c973aa8bae38f96051a8420d132768719139b507c552d94e8434a0c56a5a79d0"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::api::tools::get_document (cyclomatic 17): utopia_server::api::tools::get_document has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/tools.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c47879115b841798d36bf75d1c0c6605b5c31b32eda25a3195e45b94feff597"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::api::tools_graph::entity_facts (cyclomatic 17): utopia_server::api::tools_graph::entity_facts has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"b78aeffa755ca15b97f5b5bfcced56f4d00a824d98dfd87d00c890a10c5507a6"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::owl_import::plan (cyclomatic 17): utopia_server::owl_import::plan has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/owl_import.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"40d21cb88ad8c9e6566c65dbd3dda243946855594d43e9f30d43bee1427f7c23"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::webdav::fetch (cyclomatic 17): utopia_server::webdav::fetch has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/webdav.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"42f1d812b9d711895aaf242b3a4c5a87c17d64dd3a5734c0f134175098a96071"}},{"ruleId":"D1","level":"warning","message":{"text":"Settings.NewDataSourceDialog (cyclomatic 17): Settings.NewDataSourceDialog has cyclomatic complexity 17 (threshold 15). Of this number, 12 points are the body\u0027s own statements and 5 belong to 2 function literals 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":"web/src/pages/Settings.tsx"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"131df98401e8d3a34cae5436582414a90119e4ffe55b509da1d9b48dff9992c5"}},{"ruleId":"D1","level":"warning","message":{"text":"Tokens.Tokens (cyclomatic 17): Tokens.Tokens has cyclomatic complexity 17 (threshold 15). Of this number, 10 points are the body\u0027s own statements and 7 belong to 6 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":"web/src/pages/Tokens.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7561d7d11b7316bb0635d8df3b68876c4d8777d037fd85f66cad8fc0db890446"}},{"ruleId":"D1","level":"warning","message":{"text":"KbMenuList.KbGroupRow (cyclomatic 17): KbMenuList.KbGroupRow has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 6 of the 17 points are its own statements and the rest belongs to 7 function items inside it that branch (a function literal at line 142, onRowKey, onSubmenuKey, \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":"web/src/pages/KbMenuList.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f8a382c7981a2c921dee58960ba992b0183d6524b7454599e34771d540a5467"}},{"ruleId":"D1","level":"warning","message":{"text":"OntologyRegressionsPanel.CaseRow (cyclomatic 17): OntologyRegressionsPanel.CaseRow has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/OntologyRegressionsPanel.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e5d7babfad09e2e0aaee0786fd96d6ed281f6a056e165f5d984da59d4320bf5"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_extract::question_agent::build_question_messages (cyclomatic 16): utopia_extract::question_agent::build_question_messages 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":"crates/utopia-extract/src/question_agent.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"caf7f151ee745ba08bc0eb97c9a994d34a0fd91a29822a7a6d8e41ea8ef79bc1"}},{"ruleId":"D1","level":"warning","message":{"text":"LlmClient::chat_at_streaming (cyclomatic 16): LlmClient::chat_at_streaming 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":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd1f3133e24e01d5f7987b2bacd372b48b26acc48b705ab0fbde901073646713"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::implication::propose_rules (cyclomatic 16): utopia_server::implication::propose_rules 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":"crates/utopia-server/src/implication.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"564753b86992fe640cfeab82bfa25caa2b25b84e2e93e7f52aec706620ef285e"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::ingest_sources::ingest_item_with_outcome (cyclomatic 16): utopia_server::ingest_sources::ingest_item_with_outcome 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":"crates/utopia-server/src/ingest_sources.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"36113a261b0c988454e5139d774c36103213cc14493cc87a7c36f068971e9877"}},{"ruleId":"D1","level":"warning","message":{"text":"utopia_server::ontology_agent::adopt_map_to (cyclomatic 16): utopia_server::ontology_agent::adopt_map_to 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":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"5790ec0522bbda45bed65ec955fbbffd654b6dd6a181fa7e3e859f1931ddbfdd"}},{"ruleId":"D1","level":"warning","message":{"text":"objectValue.fmtObjectValue (cyclomatic 16): objectValue.fmtObjectValue 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":"web/src/objectValue.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"efd2de1efd8c081c59307a16a172bef8879b963b738d41dd1f8b318b36dc5c80"}},{"ruleId":"D1","level":"warning","message":{"text":"ontologyTables.ClassesTable (cyclomatic 16): ontologyTables.ClassesTable has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (a function literal at line 219, a function literal at line 191, a function literal at line 179, \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":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"135ec68156d28470aaf2e5c34733e90177b63a9fb51a51bc96bb5b836ab96030"}},{"ruleId":"D1","level":"warning","message":{"text":"Mappings.MappingRow (cyclomatic 16): Mappings.MappingRow has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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":"web/src/pages/Mappings.tsx"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"909967c0a66584d2a8b547f4869a633a747813ead23fdd75dc2fbd156c292ce5"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.Graph (cognitive 289): Graph.Graph has cognitive complexity 289 (threshold 15). Drivers by points: if/else 88 (122 pts), ternaries 39 (83 pts), boolean chains 70, loops 8 (14 pts) (nesting depth added 84). Of this number, 33 points are the body\u0027s own statements and 256 belong to 44 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Graph.tsx"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"c922534e26e76245d01f9de347cbc2f3a9cd64d99525c279393f46474f23ab9c"}},{"ruleId":"D2","level":"warning","message":{"text":"Library.SourceModal (cognitive 244): Library.SourceModal has cognitive complexity 244 (threshold 15). Drivers by points: ternaries 35 (220 pts), boolean chains 24 (nesting depth added 185). Of this number, 21 points are the body\u0027s own statements and 223 belong to 6 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":"web/src/pages/Library.tsx"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa38a465eefe9e8e2847d80b33655b47cfeec421de3df2afca9690b5dcd8f2f"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::phrase_alignment::align_phrases_locked (cognitive 154): utopia_server::phrase_alignment::align_phrases_locked has cognitive complexity 154 (threshold 15). Drivers by points: if/else 51 (105 pts), boolean chains 21, match/switch 9 (17 pts), loops 8 (11 pts) (nesting depth added 65). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/phrase_alignment.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b7258ff26932bc3f84a80b0f7f657da60a77827be879d4a2b43e7f13ea73fe2"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::ontology_agent::propose_locked (cognitive 141): utopia_server::ontology_agent::propose_locked has cognitive complexity 141 (threshold 15). Drivers by points: if/else 35 (80 pts), loops 19 (40 pts), match/switch 9 (16 pts), boolean chains 5 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"31eee4779de6e7ed9cfaec0c7d8bbf2dc3ce78a357ce3dce94747c08d7d319fb"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::chat::chat (cognitive 122): utopia_server::api::chat::chat has cognitive complexity 122 (threshold 15). Drivers by points: if/else 41 (94 pts), match/switch 6 (12 pts), loops 4 (11 pts), boolean chains 5 (nesting depth added 66). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/chat.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f2f05664ea65577d983c0bfdc815990115404d239acab38ef563cf23b2f4a1f"}},{"ruleId":"D2","level":"warning","message":{"text":"Chat.Chat (cognitive 115): Chat.Chat has cognitive complexity 115 (threshold 15). Drivers by points: if/else 37 (44 pts), boolean chains 38, ternaries 16 (30 pts), error handling 3 (nesting depth added 21). Of this number, 36 points are the body\u0027s own statements and 79 belong to 30 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Chat.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"e99aab95b77bdfddbb8eccb411c1fa7b95bff6d8624fac50cc5afda1714d45ec"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_reason::derive::contradictions (cognitive 112): utopia_reason::derive::contradictions has cognitive complexity 112 (threshold 15). Drivers by points: if/else 29 (78 pts), loops 10 (28 pts), boolean chains 6 (nesting depth added 67). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-reason/src/derive.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a1df5c810809585249562f898dc4dcd19097bbfcc3f92ee6190368705ed0bf1"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::parsers::docx_xml_to_text (cognitive 108): utopia_ingest::parsers::docx_xml_to_text has cognitive complexity 108 (threshold 15). Drivers by points: if/else 19 (76 pts), match/switch 13 (29 pts), boolean chains 2, loops 1 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1c1552860096be09a84d6780e10a94daf8f8540a7595c54d109d98d688ee44"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_reason::rules::evaluate_with_pool (cognitive 101): utopia_reason::rules::evaluate_with_pool has cognitive complexity 101 (threshold 15). Drivers by points: if/else 13 (55 pts), loops 9 (29 pts), match/switch 3 (16 pts), boolean chains 1 (nesting depth added 75). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-reason/src/rules.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16f18424e9a96c6a5b184e92e5730fe0c06926b8dfc4ba106cf07642b0633fb"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_reason::rules::joined_evaluate (cognitive 99): utopia_reason::rules::joined_evaluate has cognitive complexity 99 (threshold 15). Drivers by points: if/else 12 (56 pts), loops 11 (30 pts), match/switch 5 (13 pts) (nesting depth added 71). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-reason/src/rules.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ad61d72e04745b35c08397e489ab907b600537696d6280a20f803a70f56849"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::graph::insert_fact_on (cognitive 99): utopia_store::graph::insert_fact_on has cognitive complexity 99 (threshold 15). Drivers by points: if/else 31 (68 pts), match/switch 9 (16 pts), boolean chains 15 (nesting depth added 44). 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":"crates/utopia-store/src/graph.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"3170e4ce55a1ca520b084736883b2929d88e78f8fd54b39d1fac87bcbcdbd300"}},{"ruleId":"D2","level":"warning","message":{"text":"LoginScene.LoginScene (cognitive 98): LoginScene.LoginScene has cognitive complexity 98 (threshold 15). Drivers by points: if/else 30 (59 pts), loops 22 (31 pts), ternaries 3 (5 pts), boolean chains 3 (nesting depth added 40). Most of this is not in the body itself: 1 of the 98 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 196, 70, 153, \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":"web/src/pages/LoginScene.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"64122912cefba369191282967477dcd05b159aa5ef22c931876feb523248730f"}},{"ruleId":"D2","level":"warning","message":{"text":"OntologySchemaGraph.OntologySchemaGraph (cognitive 98): OntologySchemaGraph.OntologySchemaGraph has cognitive complexity 98 (threshold 15). Drivers by points: if/else 38 (50 pts), ternaries 15 (26 pts), boolean chains 21, loops 1 (nesting depth added 23). Most of this is not in the body itself: 10 of the 98 points are its own statements and the rest belongs to 13 function items inside it that branch (a function literal at line 848, a function literal at line 812, a function literal at line 740, \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":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b9f33702477142a08db03b886503edab50af521411e20bfc016e1fc023c654"}},{"ruleId":"D2","level":"warning","message":{"text":"Ontology.Ontology (cognitive 95): Ontology.Ontology has cognitive complexity 95 (threshold 15). Drivers by points: ternaries 25 (69 pts), boolean chains 14, if/else 8 (10 pts), error handling 2 (nesting depth added 46). Of this number, 73 points are the body\u0027s own statements and 22 belong to 12 function items 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":"web/src/pages/Ontology.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"825e608dc07bbd8b62c097aeaf640bf054d6ef5c3d47cec8753db7d2551a2841"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::paths::paths_between (cognitive 90): utopia_store::paths::paths_between has cognitive complexity 90 (threshold 15). Drivers by points: if/else 21 (49 pts), loops 14 (38 pts), boolean chains 3 (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/paths.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"206780f89b7ea41f1587637dfef59c7d085eded91429a5d273f63745cddc4c85"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::ontology_rdf::project (cognitive 85): utopia_ingest::ontology_rdf::project has cognitive complexity 85 (threshold 15). Drivers by points: if/else 35 (68 pts), loops 8, boolean chains 7, match/switch 1 (2 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/ontology_rdf.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"e73a2a57288d67ba246f8cb9f617aa687222bd10302a46049347a7a9de327ef6"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::reasoning::resolve (cognitive 85): utopia_store::reasoning::resolve has cognitive complexity 85 (threshold 15). Drivers by points: if/else 16 (61 pts), loops 6 (17 pts), match/switch 1 (4 pts), boolean chains 3 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"a001896f115628ff3d4a6ae5f16ef66b118f4d2f21deaca640e46d6ea5645146"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::extraction_open::apply_open_extraction (cognitive 83): utopia_server::extraction_open::apply_open_extraction has cognitive complexity 83 (threshold 15). Drivers by points: if/else 23 (50 pts), match/switch 7 (19 pts), loops 7 (11 pts), boolean chains 3 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"20639326b704a0d9f4812f0fd63aff7b13e0a1d187106e3ef69b35abde6e8065"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::time_resolution::resolve_document (cognitive 82): utopia_server::time_resolution::resolve_document has cognitive complexity 82 (threshold 15). Drivers by points: if/else 28 (57 pts), match/switch 4 (11 pts), loops 7 (10 pts), boolean chains 4 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/time_resolution.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b53b7603373efe9e6e51d6b1401fad5f9790f5f75a07a511b5a26be9cfc491"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::type_alignment::align_types_locked (cognitive 73): utopia_server::type_alignment::align_types_locked has cognitive complexity 73 (threshold 15). Drivers by points: if/else 15 (39 pts), match/switch 7 (19 pts), loops 5 (10 pts), boolean chains 5 (nesting depth added 41). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/type_alignment.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"92b115a6283cc687806eb699c4931d70ce56e469846740b21f00c274034b9441"}},{"ruleId":"D2","level":"warning","message":{"text":"Library.Library (cognitive 67): Library.Library has cognitive complexity 67 (threshold 15). Drivers by points: boolean chains 29, ternaries 13 (29 pts), if/else 7 (8 pts), loops 1 (nesting depth added 17). Of this number, 41 points are the body\u0027s own statements and 26 belong to 11 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Library.tsx"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a113a9d8a2e5be1e2864a915a0e5041a3e238fe1b1baf6b7bc4c59221bfd7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::parsers::pptx_xml_to_text (cognitive 66): utopia_ingest::parsers::pptx_xml_to_text has cognitive complexity 66 (threshold 15). Drivers by points: if/else 8 (36 pts), match/switch 10 (28 pts), boolean chains 1, loops 1 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"023786871fa7119d2e98bde13ef3fdacb7be00d0ce6e152e10d957c3eeb82268"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::table::render_rows (cognitive 64): utopia_ingest::table::render_rows has cognitive complexity 64 (threshold 15). Drivers by points: if/else 16 (31 pts), loops 9 (15 pts), boolean chains 11, match/switch 3 (7 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":"crates/utopia-ingest/src/table.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fb8c8e00da7118c5dd545fa349096052b1f5987d54f4cf72490f6b533e1e0c"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::owl_import::apply (cognitive 64): utopia_server::owl_import::apply has cognitive complexity 64 (threshold 15). Drivers by points: if/else 21 (48 pts), loops 10 (11 pts), match/switch 2 (5 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/owl_import.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"e11c9b78525cbfd5004c4cb2320d7b99b2d7087e629dbe468b65fbcab9775a1c"}},{"ruleId":"D2","level":"warning","message":{"text":"LlmClient::chat_tools_stream_with (cognitive 63): LlmClient::chat_tools_stream_with has cognitive complexity 63 (threshold 15). Drivers by points: if/else 16 (46 pts), loops 5 (17 pts) (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"11200dc2213aec550252082182be876353cec72cc81fd86e5f1369b59b3bcb77"}},{"ruleId":"D2","level":"warning","message":{"text":"Review.Review (cognitive 62): Review.Review has cognitive complexity 62 (threshold 15). Drivers by points: boolean chains 50, ternaries 10, if/else 2. Of this number, 54 points are the body\u0027s own statements and 8 belong to 11 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":"web/src/pages/Review.tsx"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"b35b7c33fa35659c73b69626c053e98b4355acd5e4bf5c9e2d2a854f2efe7b37"}},{"ruleId":"D2","level":"warning","message":{"text":"OntologySchemaGraph.buildSchemaGraph (cognitive 58): OntologySchemaGraph.buildSchemaGraph has cognitive complexity 58 (threshold 15). Drivers by points: if/else 14 (32 pts), loops 11 (18 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1c55dc63b184a5dc9f957f9665fa5c0fe5b6d0f9916855fddc4ca15728e01a"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::governance::rounds (cognitive 57): utopia_server::governance::rounds has cognitive complexity 57 (threshold 15). Drivers by points: loops 13 (31 pts), if/else 8 (25 pts), boolean chains 1 (nesting depth added 35). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/governance.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"8def2f76e4f43394e353be679c5d43ef9acb46cbd9cbdf9d6ee6514d3d247694"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_reason::derive::derive (cognitive 56): utopia_reason::derive::derive has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (40 pts), loops 7 (16 pts) (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-reason/src/derive.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2340e12a90cf98035944cf42b7e7eddcc89d12a7bbdfc39e85a7463a6a440af"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::time_resolution::resolve_one (cognitive 50): utopia_server::time_resolution::resolve_one has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (32 pts), match/switch 7 (16 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/time_resolution.rs"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb7387a77ba99900c401579a271b46c5d8b76e458078e8381fbaebae247618de"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::errata::record (cognitive 49): utopia_store::errata::record has cognitive complexity 49 (threshold 15). Drivers by points: match/switch 15 (31 pts), if/else 8 (14 pts), boolean chains 4 (nesting depth added 22). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/errata.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"251b121887c253e1613873c25fe8a22b62e3edf1c0cf8450606b83406466e89f"}},{"ruleId":"D2","level":"warning","message":{"text":"ruleDependencies.ruleDependencies (cognitive 48): ruleDependencies.ruleDependencies has cognitive complexity 48 (threshold 15). Drivers by points: if/else 21 (32 pts), loops 6 (9 pts), boolean chains 7 (nesting depth added 14). Of this number, 27 points are the body\u0027s own statements and 21 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/ruleDependencies.ts"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"92f28148968fcbaf12cd0e44dba5dcd7220a433a11e6837cacd0fe36fe758e2b"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::adjudication::adjudicate_entities (cognitive 47): utopia_server::adjudication::adjudicate_entities has cognitive complexity 47 (threshold 15). Drivers by points: if/else 9 (28 pts), match/switch 4 (12 pts), loops 4 (7 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/adjudication.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"3359f5f2ad14a13f47e2f3279c92fd6956aa016364a62dbf8caca62caf9cea7d"}},{"ruleId":"D2","level":"warning","message":{"text":"Settings.Settings (cognitive 44): Settings.Settings has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 17 (24 pts), boolean chains 18, if/else 2 (nesting depth added 7). Of this number, 35 points are the body\u0027s own statements and 9 belong to 4 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Settings.tsx"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"f266d14cd38fdaa79601de8b46861042ae4cd42ab22377ec4558b05e29a96e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.TimeScrubber (cognitive 44): Graph.TimeScrubber has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 19 (24 pts), if/else 9, boolean chains 7, loops 3, error handling 1 (nesting depth added 5). Most of this is not in the body itself: 12 of the 44 points are its own statements and the rest belongs to 11 function literals inside it that branch (lines 2167, 1966, 2028, \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":"web/src/pages/Graph.tsx"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3432cb8caec700ab38b4c16e7628852cb09b39d6849a894790c67cedb4a0f72"}},{"ruleId":"D2","level":"warning","message":{"text":"Library.SourceEditModal (cognitive 43): Library.SourceEditModal has cognitive complexity 43 (threshold 15). Drivers by points: ternaries 10 (23 pts), boolean chains 20 (nesting depth added 13). Of this number, 19 points are the body\u0027s own statements and 24 belong to 4 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":"web/src/pages/Library.tsx"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ed3eb09c456a6dcc649995fdbe9c11c6ebbdbe22aa303ef4e44aefbd814f9f"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::errata::review_document (cognitive 42): utopia_server::errata::review_document has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 6 (12 pts), loops 4 (8 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/errata.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"69e67f083923e2ef735ae79e196524bb51a840d02cd293c7d2ac4377f3cc042e"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::resolution::resolve_by_name (cognitive 42): utopia_store::resolution::resolve_by_name has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (35 pts), match/switch 3 (5 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebd5e170a822f969e1aea07480fc23fec7fbbdcf96464428081a625cac1b6cfb"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_reason::components (cognitive 41): utopia_reason::components has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (34 pts), loops 3 (7 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-reason/src/lib.rs"},"region":{"startLine":325}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad1daa85eacade6d353243a106025ede5321b9c66a2e71f7b548a39dedf0446"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::main (cognitive 41): utopia_server::main has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (19 pts), match/switch 7 (13 pts), loops 5 (9 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/main.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c3cedf0398813bf11ff882ed6f8a219ec010477de84bdff1015dc8bbd7522b"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::webdav::parse_multistatus (cognitive 40): utopia_server::webdav::parse_multistatus has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (25 pts), match/switch 4 (13 pts), boolean chains 1, loops 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/webdav.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5b3b2691a321d51cfd5959c289eaddc39d76b1709661d22ad82008e1d0da419"}},{"ruleId":"D2","level":"warning","message":{"text":"ruleExpressions.readExpression (cognitive 40): ruleExpressions.readExpression has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 14, ternaries 4 (7 pts), loops 1 (2 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":"web/src/pages/ruleExpressions.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80a4fb7081ff5b6db5191eb66abac7db3c9d102957d36ab5e8e09049fa63425"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.FactRow (cognitive 40): Graph.FactRow has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 16 (19 pts), boolean chains 16, if/else 4 (5 pts) (nesting depth added 4). Of this number, 32 points are the body\u0027s own statements and 8 belong to 5 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Graph.tsx"},"region":{"startLine":3350}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa274eeaea8a73098363532b386f92eafc30f2d98b13dc7f8f6e92d6eae8173"}},{"ruleId":"D2","level":"warning","message":{"text":"RulesPanel.RulesPanel (cognitive 40): RulesPanel.RulesPanel has cognitive complexity 40 (threshold 15). Drivers by points: ternaries 13 (18 pts), boolean chains 17, if/else 5 (nesting depth added 5). Most of this is not in the body itself: 13 of the 40 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 546, 376, 381, \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":"web/src/pages/RulesPanel.tsx"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5344fc7e555f24c4dae02b68532003dab17e5ce6ce5025d6fface4a6909cea"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::extraction_open::run_open (cognitive 38): utopia_server::extraction_open::run_open has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (27 pts), loops 3 (4 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"04ec92c9419ee5b0de5ba34de48ff601f62de63f30ea60a58b91d05ef63c2da5"}},{"ruleId":"D2","level":"warning","message":{"text":"Mappings.Mappings (cognitive 38): Mappings.Mappings has cognitive complexity 38 (threshold 15). Drivers by points: ternaries 9 (17 pts), if/else 5 (11 pts), boolean chains 10 (nesting depth added 14). Of this number, 22 points are the body\u0027s own statements and 16 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Mappings.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fc98b4ab8f39f1f9156b7dd02f482c29a56d48c686113237d7f58c0aef53156"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::ontology_agent::parse_proposal_response (cognitive 37): utopia_extract::ontology_agent::parse_proposal_response has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, match/switch 2 (4 pts), loops 2 (3 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":"crates/utopia-extract/src/ontology_agent.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"338f4d19eeb1add0cc9564308e719f21b7da05dd62c8cfb81c866ab8e4dea04e"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::blocks::parse (cognitive 37): utopia_ingest::blocks::parse has cognitive complexity 37 (threshold 15). Drivers by points: if/else 6 (19 pts), match/switch 4 (16 pts), boolean chains 1, loops 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":"crates/utopia-ingest/src/blocks.rs"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46c38745956408caff26c1b28f8ba7af758e5ac6060be2e21891425cddf547e"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::mappings::explore (cognitive 37): utopia_server::mappings::explore has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 3 (4 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/mappings.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"28306df8f2527b753c8197cf0b1479019445506fb4e602f260e27c3924de7a05"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::reasoning::materialize (cognitive 37): utopia_store::reasoning::materialize has cognitive complexity 37 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 11 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"559221c943b376e486b495ee8079f2d02b0832ea75b7fc40c8be7c269dd2a7dd"}},{"ruleId":"D2","level":"warning","message":{"text":"api.consumeChatStream (cognitive 37): api.consumeChatStream has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (25 pts), error handling 3 (5 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 9). None of this is in the body itself: all 37 points belong to 3 function items inside it that branch (a function literal at line 2907, a function literal at line 2928, fail). 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":"web/src/api.ts"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"bbea90dd6eacb149712b620364c74bacc973d5d6d20ad1d196eb46df6ed44891"}},{"ruleId":"D2","level":"warning","message":{"text":"LlmClient::chat_stream_raw (cognitive 36): LlmClient::chat_stream_raw has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (30 pts), loops 3 (6 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":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":1068}}}],"partialFingerprints":{"codehealthFindingId/v1":"c218e4e5940377803f4c83f1e514e053cc9992a6ef86f36489b929d498a9ae2a"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::webdav::fetch (cognitive 35): utopia_server::webdav::fetch has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (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":"crates/utopia-server/src/webdav.rs"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d563ae003bf153de310d66fcb00c2bdb5eaef60cb1b5908c827bda7cf85bc78"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::open::salvage (cognitive 34): utopia_extract::open::salvage has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (16 pts), match/switch 5 (12 pts), boolean chains 3, loops 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-extract/src/open.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"474f1b46ac17ed5ce692d4467b535382c004106a332f2b7631677180c1e8046c"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_reason::ontology::check_ontology (cognitive 34): utopia_reason::ontology::check_ontology has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), loops 4 (8 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 16). 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":"crates/utopia-reason/src/ontology.rs"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"f526d4ba141b0289be88f3c6bbe072cb10898566840641fcab537490ba4d60e9"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::rig_model::push_message (cognitive 34): utopia_server::api::rig_model::push_message has cognitive complexity 34 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 3 (8 pts), match/switch 3 (7 pts) (nesting depth added 22). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/rig_model.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"edd4d9e24e32c5cc07484aa2ec2291d38c6a5f419ff9c6947cdc8957b0f8c835"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::reasoning::attribute_rules (cognitive 34): utopia_store::reasoning::attribute_rules has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 3, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"a761af20c9d48604160d73aa837cae650554e64fb081cba12882c0e81141de4d"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::scan_quantity (cognitive 33): utopia_extract::scan_quantity has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-extract/src/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c68060b3ca42e056437a046c5fbe2e39695a02f6e9a948b17626804137906b"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::html::prune_empty_table_columns (cognitive 33): utopia_ingest::html::prune_empty_table_columns has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (9 pts), boolean chains 8 (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":"crates/utopia-ingest/src/html.rs"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"95f849fda648e976be49e3a8a54e4eec1d06ef2e8d151a31af5813fc71eeee36"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::export_routes::export (cognitive 33): utopia_server::api::export_routes::export has cognitive complexity 33 (threshold 15). Drivers by points: loops 14 (20 pts), if/else 7 (13 pts) (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/export_routes.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"88356f1e688c6ded6a180df40f9b496b5e4bf56fb6ff6dbfad861d65a096d5d0"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::sources_routes::validate_statements_payload (cognitive 33): utopia_server::api::sources_routes::validate_statements_payload has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (26 pts), loops 5, 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":"crates/utopia-server/src/api/sources_routes.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d2c3d73daf7b10dc7ced1ff7c075b3c757f1614e5c8d6cc65d539e8b6f3010e"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::ontology_agent::adopt_map_to (cognitive 33): utopia_server::ontology_agent::adopt_map_to has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 2 (3 pts), match/switch 1 (2 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":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"3da11e2cb90a3e039c18fcf45d66ecc38926b384692d29e7a2ff5d201f484473"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::governance::name_shape (cognitive 33): utopia_store::governance::name_shape has cognitive complexity 33 (threshold 15). Drivers by points: if/else 16 (22 pts), boolean chains 8, match/switch 1 (2 pts), 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":"crates/utopia-store/src/governance.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"df726d90f1b5153c4d27b9f8d98da58ab2d14eceb069c1f4ecdaf1741fc02735"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::ontology_agent::build_proposal_messages (cognitive 30): utopia_extract::ontology_agent::build_proposal_messages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 7 (9 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":"crates/utopia-extract/src/ontology_agent.rs"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba34048a4af19c2ef14d1cec60e827bed14ce120a62dc5f1d69ccb31e06ebdef"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::chunker::units (cognitive 30): utopia_ingest::chunker::units has cognitive complexity 30 (threshold 15). Drivers by points: loops 4 (13 pts), if/else 4 (12 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/chunker.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"939fca58e789f4a8e6c6a039a897c50a08e7c7db6b8bf929af4c5fe7a0e18c92"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::implication::read_phrases (cognitive 30): utopia_server::implication::read_phrases has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (15 pts), match/switch 3 (10 pts), loops 2 (5 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/implication.rs"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a2ccfa4ef4ce699dbe398f4f540eb50e37b88d87c28773078d5324fa8bca6b"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::resolution::resolve_type_drift (cognitive 30): utopia_store::resolution::resolve_type_drift has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (22 pts), match/switch 3 (5 pts), loops 2, boolean chains 1 (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"333e444eb5ba6c613792dc318c4e4ed0b92997095ea5da9e86fbef63aba8059f"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::ontology_rdf::shape_signatures (cognitive 29): utopia_ingest::ontology_rdf::shape_signatures has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (22 pts), loops 4 (5 pts), match/switch 1 (2 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":"crates/utopia-ingest/src/ontology_rdf.rs"},"region":{"startLine":625}}}],"partialFingerprints":{"codehealthFindingId/v1":"830721c9ecbd5f433db290140a48b592d9c4ebb4dcb72d5ee5b148994597affd"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::pipeline::run (cognitive 29): utopia_server::pipeline::run has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (19 pts), match/switch 4 (9 pts), boolean chains 1 (nesting depth added 9). 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":"crates/utopia-server/src/pipeline.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"86884aba65b2f891038668ad5f349fe969077abb128608d3b463d2ff0d26d85b"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.EntityPanel (cognitive 29): Graph.EntityPanel has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 17, ternaries 4 (6 pts), if/else 4 (5 pts), loops 1 (nesting depth added 3). Most of this is not in the body itself: 13 of the 29 points are its own statements and the rest belongs to 14 function items inside it that branch (a function literal at line 2870, a function literal at line 2931, a function literal at line 3027, \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":"web/src/pages/Graph.tsx"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"1068ea2bc69028f55f304f7569db53830707f0df83f59fdb047286955e6da5cc"}},{"ruleId":"D2","level":"warning","message":{"text":"Ontology.UniquenessPanel (cognitive 29): Ontology.UniquenessPanel has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 8 (22 pts), boolean chains 3, if/else 2 (3 pts), error handling 1 (nesting depth added 15). Most of this is not in the body itself: 3 of the 29 points are its own statements and the rest belongs to 2 function items inside it that branch (a function literal at line 1747, apply). 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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8718cc3bdbb76b4802c85c1d7fbff0e6f392b11c4a9cee645fd337606878a21"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::parsers::xlsx_sheet (cognitive 28): utopia_ingest::parsers::xlsx_sheet has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 6 (9 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba99220cb396c44d990a39b3388f67e28a9cdcec91c654615901ed169294266"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::owl_import::plan (cognitive 28): utopia_server::owl_import::plan has cognitive complexity 28 (threshold 15). Drivers by points: if/else 13 (18 pts), match/switch 2 (7 pts), loops 2, 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":"crates/utopia-server/src/owl_import.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"30ee8de01c1900e17925ac8571ce005190166f0c1119ed1638dc4d0fccd3dd31"}},{"ruleId":"D2","level":"warning","message":{"text":"steps.stepDetail (cognitive 28): steps.stepDetail has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (16 pts), ternaries 5 (10 pts), boolean chains 1, match/switch 1 (nesting depth added 11). Of this number, 26 points are the body\u0027s own statements and 2 belong to one function item 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":"web/src/steps.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9ffb76af4a45841fe6ac27f800325b5b32710863d268fca537d5c41625fafe6"}},{"ruleId":"D2","level":"warning","message":{"text":"RulesPanel.RuleDialog (cognitive 28): RulesPanel.RuleDialog has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 15, ternaries 12 (13 pts) (nesting depth added 1). Most of this is not in the body itself: 11 of the 28 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 942, a function literal at line 857, a function literal at line 845, \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":"web/src/pages/RulesPanel.tsx"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fe24a009bdfe402fa92f8d6d7802f50ddc1cb912cd8752d05e970f7536545d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Ontology.MissesPanel (cognitive 28): Ontology.MissesPanel has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 17, if/else 6 (7 pts), ternaries 3 (4 pts) (nesting depth added 2). Of this number, 14 points are the body\u0027s own statements and 14 belong to 5 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":"web/src/pages/Ontology.tsx"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"515e4db9b32e99889c33c89abb58f629576f4997787f788992042b4f9fc68ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::type_resolution::resolve_with (cognitive 27): utopia_server::type_resolution::resolve_with has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5, loops 3, match/switch 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":"crates/utopia-server/src/type_resolution.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b75fac2c8e8661f2b0cf51c885441af5802efc9b066c11da1a9eac0a5f40f26"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::parsers::pptx_slide_ids (cognitive 26): utopia_ingest::parsers::pptx_slide_ids has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":655}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8ea06c1c8a347f15bf364d0ce2b51fdafa0e926ce88e2954d9c289f18a49527"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::tools_graph::entity_facts (cognitive 26): utopia_server::api::tools_graph::entity_facts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 2 (5 pts), match/switch 4 (5 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"072f3687af43d6e759ffa5cc9a8ac86dadb6756ee32ce59cfdfdc60b542c9253"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::extraction_open::call_and_parse_one_chunk (cognitive 26): utopia_server::extraction_open::call_and_parse_one_chunk has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 6 (9 pts), loops 2 (4 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":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5d5a55ad3ab9b33b0451e81556f6ce8ef7d4f3a989a206c8fbea85d4aa82ff"}},{"ruleId":"D2","level":"warning","message":{"text":"citations.walk (cognitive 26): citations.walk has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/citations.ts"},"region":{"startLine":122}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d0af6b874169b531311d8411ea82b5b4bbd62f7f7e42a1b7926056c5a8e41c5"}},{"ruleId":"D2","level":"warning","message":{"text":"objectValue.fmtObjectValue (cognitive 26): objectValue.fmtObjectValue has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 7 (11 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":"web/src/objectValue.ts"},"region":{"startLine":9}}}],"partialFingerprints":{"codehealthFindingId/v1":"c612c9a373ef7f88f0168aaf55206c88c3bbf8aa55dd23dc06ea5a3a0e93b150"}},{"ruleId":"D2","level":"warning","message":{"text":"ontologyDialogs.PropertyDialog (cognitive 26): ontologyDialogs.PropertyDialog has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 16, ternaries 9 (10 pts) (nesting depth added 1). Of this number, 18 points are the body\u0027s own statements and 8 belong to 4 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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"371b4f057854e1433fc25a49261a25eb2811f57c0820ca16bc49a392fbc3e0a2"}},{"ruleId":"D2","level":"warning","message":{"text":"LlmClient::chat_at_streaming (cognitive 25): LlmClient::chat_at_streaming has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 3 (4 pts), boolean chains 2 (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":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fddcba410373d23b4ce577550f21efc3328d99326ee570f061dedd0ad7a8747"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::jira_issues::render (cognitive 25): utopia_server::jira_issues::render has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (18 pts), loops 4 (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":"crates/utopia-server/src/jira_issues.rs"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"1951aedf474b25d7348bdfe8622ec613e642eae7a46fa29560b8e903220017e7"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::notion::fetch_pages (cognitive 25): utopia_server::notion::fetch_pages has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 2 (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":"crates/utopia-server/src/notion.rs"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"5285fff9bac974579b907df4bedb8b58b2e06198261505fbb40b0b21a80a632b"}},{"ruleId":"D2","level":"warning","message":{"text":"Docs.DocsPage (cognitive 25): Docs.DocsPage has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 13, if/else 9 (10 pts), loops 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 5 of the 25 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 158, onScrollSpy, a function literal at line 142, \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":"web/src/pages/Docs.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"2153acf06f9577c11446a9897bc92230f5a3edd3487efc62f2d1e394f5355f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"KbSettings.KbSettings (cognitive 25): KbSettings.KbSettings has cognitive complexity 25 (threshold 15). Drivers by points: boolean chains 20, if/else 3, ternaries 2. Of this number, 23 points are the body\u0027s own statements and 2 belong to 2 function literals 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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"c411976f72d812c9d76cc05826ba24f7f3f5fd0fbc72b220a1778c13b38d4117"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::notion::append_children (cognitive 24): utopia_server::notion::append_children has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/notion.rs"},"region":{"startLine":286}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec4a7aa02f750f62814531fd15fdf7900e58982de8a87ccc5f3f4757f63b26d2"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::rdf::emit_fact (cognitive 24): utopia_server::rdf::emit_fact has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 4, boolean chains 2, match/switch 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/rdf.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ac95115b217d5285697f3912f91543f61ed6139697c596ef1f10d431bfaa830"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::type_resolution::preview_with (cognitive 24): utopia_server::type_resolution::preview_with has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 5 (9 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/type_resolution.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecdce090516e0489bd8606c1811331f3660239e8b3ebb3816cc4a2f61b8e4ecf"}},{"ruleId":"D2","level":"warning","message":{"text":"Expr::decode (cognitive 23): Expr::decode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-reason/src/expressions.rs"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b4a05641a931822e6b21577cd696ea39624d9ce1156885adebee2e25a6794a9"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::rule_expression_input::compile_ast (cognitive 23): utopia_server::api::rule_expression_input::compile_ast has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), match/switch 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/rule_expression_input.rs"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e6785d588700f7d539ceae1fd7a5ef8ff2f33b999927382db46c084bb9196f6"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::governance::lookup (cognitive 23): utopia_server::governance::lookup has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (19 pts), match/switch 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/governance.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f46807b355ba01d1391c1791f2a987dff904dc2709eb2e9fde031f2a6a4621"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::close_brackets (cognitive 22): utopia_extract::close_brackets has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2, match/switch 1 (2 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":"crates/utopia-extract/src/lib.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb27d78f4871327c1b87c491d2784840367a322c23814752b6b842ee5727b92"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::time::headings_at (cognitive 22): utopia_extract::time::headings_at has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-extract/src/time.rs"},"region":{"startLine":134}}}],"partialFingerprints":{"codehealthFindingId/v1":"ada4ceb0f7ae0eee4d87d391532aa254eb089975becf3ae02abf6c6ae27215e2"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::table::kind (cognitive 22): utopia_ingest::table::kind has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 5 (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":"crates/utopia-ingest/src/table.rs"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"c84a3f579368e53a12fa71d83f07031ca0a81714bedb209654afacd70c4809e5"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_reason::clashes (cognitive 22): utopia_reason::clashes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 6 (11 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":"crates/utopia-reason/src/lib.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"8df4dc6f82ba7c63c86ef19cc9674e7b4705ce0175601f78a71d5c500577e14b"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::http_fetch::is_public_ip (cognitive 22): utopia_server::http_fetch::is_public_ip has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, if/else 4 (8 pts), match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/http_fetch.rs"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"96df4ce1750c235b468860ffc758024a33a6bdfa638e8a01769ea941a5d75e7c"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::implication::propose_rules (cognitive 22): utopia_server::implication::propose_rules has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (14 pts), match/switch 5 (6 pts), loops 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":"crates/utopia-server/src/implication.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"e94a428c7589e1919a0f6be2364eb53033e39fc71753baed26dc2ad38bdaf383"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::ingest_sources::ingest_item_with_outcome (cognitive 22): utopia_server::ingest_sources::ingest_item_with_outcome has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/ingest_sources.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"360fe188c3e83ac74e9b874e8abee886eeb5f3ce53aa0fe44443016db141088c"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::temporal::merge_would_overlap (cognitive 22): utopia_store::temporal::merge_would_overlap has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/temporal.rs"},"region":{"startLine":616}}}],"partialFingerprints":{"codehealthFindingId/v1":"b782c8b42f2b056159328898b5d746a3839c7f3bd7ad7b0a2619106a2e2e2b7f"}},{"ruleId":"D2","level":"warning","message":{"text":"ExpressionDraftEditor.DraftNode (cognitive 22): ExpressionDraftEditor.DraftNode has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 10 (15 pts), if/else 4, boolean chains 3 (nesting depth added 5). Of this number, 14 points are the body\u0027s own statements and 8 belong to one function item 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":"web/src/pages/ExpressionDraftEditor.tsx"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"727f98a9eed0c4f6404b4688c5993a56a0602ff2798095c0a233ad776963b25e"}},{"ruleId":"D2","level":"warning","message":{"text":"Graph.layOutParallelEdges (cognitive 22): Graph.layOutParallelEdges has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (9 pts), ternaries 4 (7 pts), loops 5, boolean chains 1 (nesting depth added 6). Of this number, 13 points are the body\u0027s own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Graph.tsx"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e459996ada32489a86c3cda096a614a88ec7df699313207718c6bfc34448d17"}},{"ruleId":"D2","level":"warning","message":{"text":"Library.SourceBar (cognitive 22): Library.SourceBar has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 20, ternaries 2. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Library.tsx"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"27112b5402ec3511192050e295bceec69650d23060d18cabd94c5a1faa79613d"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::implication::parse_rule_response (cognitive 21): utopia_extract::implication::parse_rule_response has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (15 pts), match/switch 2 (4 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":"crates/utopia-extract/src/implication.rs"},"region":{"startLine":132}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b1f5d061e73210f5dce8970af94e0a65cca0393fd255d05ab560ce6ac44db1d"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::question_agent::build_question_messages (cognitive 21): utopia_extract::question_agent::build_question_messages has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 6 (7 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-extract/src/question_agent.rs"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd81562c8da7b478494c8912cc85bd870db328eb56723c018c39776a874e5b15"}},{"ruleId":"D2","level":"warning","message":{"text":"Reading::chunk (cognitive 21): Reading::chunk has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/reading.rs"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d746eeb3723d106b1dfeeed586d7c2785846b9f0a926ff44c667ca72d8cf171"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::tools::get_document (cognitive 21): utopia_server::api::tools::get_document has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, match/switch 3, 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":"crates/utopia-server/src/api/tools.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"4550c901c5c5c7d8a91239017273bcbc16e2903565f9c308e8b26a49c27ae75f"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::tools_graph::paths_between (cognitive 21): utopia_server::api::tools_graph::paths_between has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 4 (6 pts), loops 3 (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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"22c665738eba438c9a00cbfd32c05961974226b47cccd9c0c7294fc1dd0897f7"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::pending::confirm (cognitive 21): utopia_store::pending::confirm has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (4 pts), boolean chains 1, match/switch 1 (nesting depth added 12). 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":"crates/utopia-store/src/pending.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"27840e7efe3c28a5a91ef40cc16387bcd5985980155c5660505de1e25a2f636e"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::temporal::plan_closures (cognitive 21): utopia_store::temporal::plan_closures has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/temporal.rs"},"region":{"startLine":1730}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b0fcb087e32a9088aaab6e26f5a30724e19bcaa533148c1639cfe310a8a8ae0"}},{"ruleId":"D2","level":"warning","message":{"text":"predicateText.predicateSentence (cognitive 21): predicateText.predicateSentence has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 7, loops 1, ternaries 1 (nesting depth added 5). Of this number, 18 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":"web/src/predicateText.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"544054561ee0a7c3a82b47499fe2c324e633f472e6bb5173ac11e6ec6d9af2e0"}},{"ruleId":"D2","level":"warning","message":{"text":"EntityHistory.EventRow (cognitive 21): EntityHistory.EventRow has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 7 (18 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/EntityHistory.tsx"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"9325835c52b13a331e1e830eda5bbed1811f98b75a943ba31908bf69032f06e7"}},{"ruleId":"D2","level":"warning","message":{"text":"ontologyTables.ClassesTable (cognitive 21): ontologyTables.ClassesTable has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 8 (14 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). Most of this is not in the body itself: 1 of the 21 points is its own statement and the rest belongs to 4 function items inside it that branch (a function literal at line 191, a function literal at line 219, a function literal at line 179, \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":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e714577aa5293a09ac53e8f1eae006d53b2d9ff56c6a762c8e0eca7bac082f9"}},{"ruleId":"D2","level":"warning","message":{"text":"Ontology.QuestionsPanel (cognitive 21): Ontology.QuestionsPanel has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 12, ternaries 4 (5 pts), if/else 4 (nesting depth added 1). Most of this is not in the body itself: 8 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 2037, a function literal at line 1918, submit, \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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1f214feaf57474f044c89b9bc9b4681af4bc231795955396ccb9b7db7f863c1"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::errata::parse_errata_response (cognitive 20): utopia_extract::errata::parse_errata_response has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-extract/src/errata.rs"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddc9436367cb27a1e7b422ba13cb64e0cebbc4c27568f4af795003548c95f4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"Search::walk (cognitive 20): Search::walk has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 2, 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":"crates/utopia-reason/src/lib.rs"},"region":{"startLine":397}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f008d023e643502d0ca92082a7d3b551ee01575c4d73c192201e9108e41cefc"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::ontology::update_relation_type (cognitive 20): utopia_store::ontology::update_relation_type has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 6 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ad7fdfa71f25f7fa143c9eb529d75092237ebb167e9013a329c86c6af8c0d99"}},{"ruleId":"D2","level":"warning","message":{"text":"Tokens.Tokens (cognitive 20): Tokens.Tokens has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 9 (11 pts), if/else 4 (5 pts), boolean chains 4 (nesting depth added 3). Most of this is not in the body itself: 9 of the 20 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 242, 380, 213, \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":"web/src/pages/Tokens.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0214eac829c70a2348045666e753df9c649bb48d2890e3cbb49076c9dc5abf78"}},{"ruleId":"D2","level":"warning","message":{"text":"DocViewer.DocViewer (cognitive 20): DocViewer.DocViewer has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (5 pts), ternaries 4, loops 1 (nesting depth added 1). Most of this is not in the body itself: 4 of the 20 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 110, 46, 63, \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":"web/src/pages/DocViewer.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"80b51bffd79d2949686eb858b6e1a96b2f66285e0bd87a61a19c2e7a07736347"}},{"ruleId":"D2","level":"warning","message":{"text":"ontologyTables.OntologyTables (cognitive 20): ontologyTables.OntologyTables has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 10 (16 pts), boolean chains 4 (nesting depth added 6). Of this number, 16 points are the body\u0027s own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4afbc0eadab136dde3748d75b79b84a08cbaa84819b5887177931c926d580fc1"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::implication::build_rule_messages (cognitive 19): utopia_extract::implication::build_rule_messages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-extract/src/implication.rs"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"009018b48664bc518db62d6e7b51aed633e24b7dc8151f97f062fc11ab5ea9d1"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_extract::phrase_align::build_phrase_messages (cognitive 19): utopia_extract::phrase_align::build_phrase_messages has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-extract/src/phrase_align.rs"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc77abe0aebe55706752916924b4a5285e0963f6aec0c24795c62743808dfb9c"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::parsers::spreadsheet (cognitive 19): utopia_ingest::parsers::spreadsheet has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (5 pts), loops 2 (4 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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"69d9414d9e5dc8549109bad9938af6404c0321a04d256817cc30b11175b17b4c"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_reason::check_all (cognitive 19): utopia_reason::check_all has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 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":"crates/utopia-reason/src/lib.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2bbc48dad62ff8c1dfd79c30ba65335e1d5746d6867d056e336afc979daddf"}},{"ruleId":"D2","level":"warning","message":{"text":"SnowflakeEngine::run (cognitive 19): SnowflakeEngine::run has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/query_engine/snowflake.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78adf1bfe6d62780872ca1d0c458f06f4ca0d3525a6d4352dd771c83b8c06cc"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::governance::investigate (cognitive 19): utopia_server::governance::investigate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), match/switch 2 (4 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/governance.rs"},"region":{"startLine":651}}}],"partialFingerprints":{"codehealthFindingId/v1":"f19e32874e016f8b1b0a7cf9795af3f553b00bbf1a7eda1d46e0cb8e4c86639f"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::business_rules::validate_conditions (cognitive 19): utopia_store::business_rules::validate_conditions has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), boolean chains 3, match/switch 1 (2 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":"crates/utopia-store/src/business_rules.rs"},"region":{"startLine":896}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbd24982b259ac7ccc32074763ac64f65e9ddf20df5fd4a4af5819947195d1c"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::reasoning::premise_meta (cognitive 19): utopia_store::reasoning::premise_meta has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 2, 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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":1147}}}],"partialFingerprints":{"codehealthFindingId/v1":"406e07da4d53a2683d780c36c59c241287868d3dd36c87bef382ebd044af5f4c"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::resolution::name_stem (cognitive 19): utopia_store::resolution::name_stem has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (16 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"9637b3a0547a63a2d9feec3e5cdff7adfd68992b18d6fb1b3bc2ae5dcae5e780"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::parsers::docx_heading_styles (cognitive 18): utopia_ingest::parsers::docx_heading_styles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 2 (6 pts), loops 2 (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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79f317bf1987c047c5860c6a3e4456da2ed96a3bf169b6561a232dfe7892e9f"}},{"ruleId":"D2","level":"warning","message":{"text":"ClickHouseEngine::post (cognitive 18): ClickHouseEngine::post has cognitive complexity 18 (threshold 15). Drivers by points: match/switch 5 (10 pts), if/else 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/query_engine/clickhouse.rs"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"a42099ce930a6fe7447c6b9056921b2ed922259dec1abee3b6010cee76c2c46e"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::agent::tool_call_text (cognitive 18): utopia_server::api::agent::tool_call_text has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 4, match/switch 1 (4 pts), 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":"crates/utopia-server/src/api/agent.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cc5520679c3e43083ea18e8e68d378bea9e8aebbaf3b76dd3cdf0cb86c7849"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::chat::cited_numbers (cognitive 18): utopia_server::api::chat::cited_numbers has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/chat.rs"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5667cbad9aaacfc74c493938d4ae507b126b820083a7feb45e6c8f1a77d5302"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::resolution::fold_markdown_markers (cognitive 18): utopia_store::resolution::fold_markdown_markers has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 4 (7 pts), match/switch 1 (2 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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"490373426a027925365c49ebdabd1e6ba03ab37f609731c7aad8cb7247ea90c9"}},{"ruleId":"D2","level":"warning","message":{"text":"Members.Members (cognitive 18): Members.Members has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 15, ternaries 3. Of this number, 10 points are the body\u0027s own statements and 8 belong to 5 function literals 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":"web/src/pages/Members.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4abef58eecccd5136b9a8694d9655766b3d521141a0e058e0255314d9586eac"}},{"ruleId":"D2","level":"warning","message":{"text":"Packer::place (cognitive 17): Packer::place has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (17 pts) (nesting depth added 9). 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":"crates/utopia-ingest/src/chunker.rs"},"region":{"startLine":307}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9d031eb3f3372e36c78b63fe120ac92624a81cf104e3aab1e0383cc83e62c7"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::mineru::reading (cognitive 17): utopia_ingest::mineru::reading has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/mineru.rs"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"af6f16bf8d845f473f0f13578d2a59a2e16c899ab64f4eacd2848f13dd35762e"}},{"ruleId":"D2","level":"warning","message":{"text":"DatabricksEngine::run (cognitive 17): DatabricksEngine::run has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, match/switch 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/query_engine/databricks.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b3743925bebe07eb3454490ace2138998481ece01f598cb2390cf17b8e49fa3"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::agent::publishable (cognitive 17): utopia_server::api::agent::publishable has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), match/switch 2 (4 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":"crates/utopia-server/src/api/agent.rs"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc238a7b0d8a7f739012f29408b77f194eb8b030f7640c3681183cde987d1237"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::tools::list_rules (cognitive 17): utopia_server::api::tools::list_rules has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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":"crates/utopia-server/src/api/tools.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab2a34f3590f23c9440ea0060d5d20374468992dfb5a3fe6be5a6ef762cee0ab"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::github_issues::render (cognitive 17): utopia_server::github_issues::render has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (4 pts), match/switch 1 (3 pts) (nesting depth added 6). 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":"crates/utopia-server/src/github_issues.rs"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"39fa1d9815ab912f141bcdbb16fa89dc096c227950dddb40dbfdce5dd9948418"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::governance::apply (cognitive 17): utopia_server::governance::apply has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 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":"crates/utopia-server/src/governance.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd4711c6d21609373df261509192f48aaf09782b04ab0c9a534d623c9c154f7"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::http_fetch::get_inner (cognitive 17): utopia_server::http_fetch::get_inner has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/http_fetch.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"47b03c6408aa8fa28876a25b23f580c29ef14011fb8b6945fd157e9d3ffa78af"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::mapping_index::tokens (cognitive 17): utopia_server::mapping_index::tokens has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/mapping_index.rs"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcba0cd5e8f50e6d06aaf76a656a9d912a29679c70151a3d6c33c78f001fd363"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::rdf::emit_relation (cognitive 17): utopia_server::rdf::emit_relation has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 4, match/switch 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/rdf.rs"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3b9b6e6bcd0c64d2a7ab735e9ac53bc3e97e4c11a1b5fc77063b437a96d1fc"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::graph::neighborhood (cognitive 17): utopia_store::graph::neighborhood has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/graph.rs"},"region":{"startLine":1531}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fcac63d91cdc323fdcba423bbdbadd8a101f4138fb80864af5e1627c0b1bbb8"}},{"ruleId":"D2","level":"warning","message":{"text":"unread.liveAnswer.subscribe() (cognitive 17): unread.liveAnswer.subscribe() has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/unread.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4514dfbf2c7932af14c063668cf8bcc4691ea32370d26007e362d3420535642"}},{"ruleId":"D2","level":"warning","message":{"text":"index.MultiSearchSelect (cognitive 17): index.MultiSearchSelect has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, if/else 5, ternaries 1. Of this number, 10 points are the body\u0027s own statements and 7 belong to 2 function literals 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":"web/src/ui/index.tsx"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"55128d9f57a0a9efc1e1bac662d1a2c4c626c5b530b948e1dd367bcea2768c9c"}},{"ruleId":"D2","level":"warning","message":{"text":"graphVisuals.drawWorldGrid (cognitive 17): graphVisuals.drawWorldGrid has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (7 pts), if/else 5 (6 pts), boolean chains 4 (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":"web/src/pages/graphVisuals.ts"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecb016c942f0da31e40588ef20fda426f1a94702d4b27fca77c892650f2e218"}},{"ruleId":"D2","level":"warning","message":{"text":"OntologySchemaGraph.layOutParallelEdges (cognitive 17): OntologySchemaGraph.layOutParallelEdges has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 7 (12 pts), if/else 3 (4 pts), loops 1 (nesting depth added 6). Most of this is not in the body itself: 1 of the 17 points is its own statement and the rest belongs to 3 function items inside it that branch (typeFor, a function literal at line 451, a function literal at line 434). 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":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"88c303fc3d09a1e670fbb82eff77e522b7abf0ce5aae26ccad171b55b01db842"}},{"ruleId":"D2","level":"warning","message":{"text":"OntologyRegressionsPanel.CaseRow (cognitive 17): OntologyRegressionsPanel.CaseRow has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 9 (13 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/OntologyRegressionsPanel.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa87bc17bd84984c275afc69ca83749fc4b901fae453313bc384c24de3c2962b"}},{"ruleId":"D2","level":"warning","message":{"text":"ontologyDialogs.parentOptions (cognitive 17): ontologyDialogs.parentOptions has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 8). Of this number, 14 points are the body\u0027s own statements and 3 belong to one function item 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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":26}}}],"partialFingerprints":{"codehealthFindingId/v1":"032ee7edae18220609d063a9ae1f9716e15eb1ac76874c7cd70e2b1769ceee2d"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::html::promote_first_row_headers (cognitive 16): utopia_ingest::html::promote_first_row_headers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/html.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a77a309c1596a384e6cc849af65aaa9fa467b79099efd42eeec87df8173b20a"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::parsers::pptx_relationships (cognitive 16): utopia_ingest::parsers::pptx_relationships has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 2, match/switch 1 (2 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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfb50449f94158744d574d7f3eab59475d0a575d45e93393a359d662b16114d3"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_ingest::parsers::spreadsheet_row (cognitive 16): utopia_ingest::parsers::spreadsheet_row has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (9 pts), match/switch 1 (3 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":1056}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01eff720380b3365bc1daa9470aab9f32a155c68519c1abb67820412a4b3437"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_reason::derive::emit (cognitive 16): utopia_reason::derive::emit has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 2). 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":"crates/utopia-reason/src/derive.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"19881f7cff3bbca0805e719f59da62e6578d5aa8a26f06caec550e5659c0361f"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_reason::ontology::unsatisfiable (cognitive 16): utopia_reason::ontology::unsatisfiable has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 4 (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":"crates/utopia-reason/src/ontology.rs"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"d660a9c40d1eee298bd4f22af91d9b7ac2b0998cbc1d96f9fd3a1492498e85ba"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::api::review_routes::decide_violation (cognitive 16): utopia_server::api::review_routes::decide_violation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 pts), match/switch 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/review_routes.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"9888427950f97fc743b867bc85b81cf91b4d1ed1fbfaed2458804299140f69f6"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_server::object_storage::client (cognitive 16): utopia_server::object_storage::client has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/object_storage.rs"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"7723a9354dbaec7939afee2759e415fa04d1c007d40024e304ec483f34c925f0"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::business_rules::update (cognitive 16): utopia_store::business_rules::update has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 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":"crates/utopia-store/src/business_rules.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"65d6167bb3b20c502cf0014d335c4ff9a70468515f80cbf6ca22a42b09ccee9d"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::temporal::tidy (cognitive 16): utopia_store::temporal::tidy has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (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":"crates/utopia-store/src/temporal.rs"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"b97ea96b5574e37b4d6785abb30cf3d2847b818842899d091fa525de4acd311a"}},{"ruleId":"D2","level":"warning","message":{"text":"utopia_store::temporal::uniqueness_candidates (cognitive 16): utopia_store::temporal::uniqueness_candidates has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 1 (4 pts), boolean chains 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/temporal.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad20d704cc79a970be976eff50803eaa04c71f1607749ab1b96fa0db6b6d9997"}},{"ruleId":"D2","level":"warning","message":{"text":"star-history.stargazerDates (cognitive 16): star-history.stargazerDates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"scripts/star-history.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc87d3823edea94906218e287fc10f039a35953334ef41379a51e8b0708b5ec"}},{"ruleId":"D2","level":"warning","message":{"text":"ruleExpressions.expressionText (cognitive 16): ruleExpressions.expressionText has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 7, loops 1 (nesting depth added 4). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function items inside it that branch (render, literal). Those helpers are already separate functions, so extracting the branching again is not available. To reduce it, move them out of the body to the enclosing scope, where each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/ruleExpressions.ts"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cf574068f417c9dc1ed7a78beb6f110d1908e598ce5c3f431ea5f76f1b6194"}},{"ruleId":"D2","level":"warning","message":{"text":"graphDialogs.FactTimeDialog (cognitive 16): graphDialogs.FactTimeDialog has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (8 pts), if/else 5, boolean chains 3 (nesting depth added 2). Most of this is not in the body itself: 3 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 129, 147). 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":"web/src/pages/graphDialogs.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"c48434c240eb1ee812115335a80d218d78560a17060adecb17bd02f465550380"}},{"ruleId":"D2","level":"warning","message":{"text":"Library.SchedulePicker (cognitive 16): Library.SchedulePicker has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, ternaries 2 (4 pts), if/else 1, match/switch 1 (nesting depth added 2). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 4 function items inside it that branch (emit, a function literal at line 233, a function literal at line 239, \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":"web/src/pages/Library.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2118240929f599f1e2250b86b769ad67113d499d58123036e3177f211c529c7"}},{"ruleId":"D2","level":"warning","message":{"text":"Library.DocRow (cognitive 16): Library.DocRow has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (9 pts), boolean chains 7 (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":"web/src/pages/Library.tsx"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23212403758d032bbf31d5df00756a00a0f17e5a93e0684b099b7ffd5f9161d"}},{"ruleId":"D2","level":"warning","message":{"text":"MyKbs.MyKbs (cognitive 16): MyKbs.MyKbs has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 10, ternaries 3 (4 pts), if/else 2 (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 4 function literals inside it that branch (lines 144, 74, 83, \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":"web/src/pages/MyKbs.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32ba07135bf12d321901f9501af5207eb783b05e879bb1a43634e4b576f74c6"}},{"ruleId":"D2","level":"warning","message":{"text":"OntologySchemaGraph.schemaScope (cognitive 16): OntologySchemaGraph.schemaScope has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), loops 4 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 3). Of this number, 11 points are the body\u0027s own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e16c98d02eb670e2ebe9f63f192c3bdcc65ba42cb430bceae6247337f7f1f869"}},{"ruleId":"D2","level":"warning","message":{"text":"ontologyDialogs.ClassDialog (cognitive 16): ontologyDialogs.ClassDialog has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 10 (11 pts), boolean chains 5 (nesting depth added 1). Of this number, 12 points are the body\u0027s own statements and 4 belong to 4 function literals 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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"64c4c61f182f18713f038be8ee1b3760e83a495a6046fd5bffe551df49b788b9"}},{"ruleId":"D2","level":"warning","message":{"text":"Review.AlignmentPhraseRow (cognitive 16): Review.AlignmentPhraseRow has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, ternaries 5. Of this number, 13 points are the body\u0027s own statements and 3 belong to 2 function literals 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":"web/src/pages/Review.tsx"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1874df1b66bfca42629294edeb529a4e1ca199d393b89fbf7937bab9f7f6b26"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Graph.Graph: FunctionTooLong \u2014 Graph runs 1151 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 1051 over it, 11.51\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Graph.tsx"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"000fa2efc26460137ca0af01445d555184233aec781186c4089feecfd5b07c52"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Review.Review: FunctionTooLong \u2014 Review runs 779 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 679 over it, 7.79\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":"web/src/pages/Review.tsx"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea8102c4b0acfa85943004b229bb18219f9369ae0d17152854a171cb1b921350"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Chat.Chat: FunctionTooLong \u2014 Chat runs 606 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 506 over it, 6.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":"web/src/pages/Chat.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"c70cc8aa10041e39d404f879cdfcc67c5654049f6b082ff051f489ccf03aeb77"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Ontology.Ontology: FunctionTooLong \u2014 Ontology runs 560 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 460 over it, 5.60\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":"web/src/pages/Ontology.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb6283ce8cfaec98e07066faa42fc49f012630ba034e00faa43df0c54695bdd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::phrase_alignment::align_phrases_locked: FunctionTooLong \u2014 utopia_server::phrase_alignment::align_phrases_locked runs 536 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 436 over it, 5.36\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":"crates/utopia-server/src/phrase_alignment.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdde82aa0b16aaf4236ebaa1d0b367ad07234d50d086841ba710f6bd053312a2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/Graph.tsx: FileTooLong \u2014 2667 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2167 over it, 5.33\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Graph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a975bcc2e5211374699752695c6112906c06a57b6571801a1dd1912d5f34405"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Settings.Settings: FunctionTooLong \u2014 Settings runs 509 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 409 over it, 5.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":"web/src/pages/Settings.tsx"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"4509a1bc821464d4fea23af880b561b3d6f405c506cc6e321601fa29091f37b5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Library.Library: FunctionTooLong \u2014 Library runs 486 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 386 over it, 4.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":"web/src/pages/Library.tsx"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"bedca481080379fe51e257f5ab73e8fb914276ca2903254fd38a55a67d6d04a9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::ontology_agent::propose_locked: FunctionTooLong \u2014 utopia_server::ontology_agent::propose_locked runs 473 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 373 over it, 4.73\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":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"f131c5519896282fcedde70c693c7a7baa2bd53046f8a7b99807043e15d20afb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Library.SourceModal: FunctionTooLong \u2014 SourceModal runs 459 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 359 over it, 4.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":"web/src/pages/Library.tsx"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1ef556c9277a8de27705ca0c276be542d16bc064e4284380a18ffc4d17e2d4a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/Ontology.tsx: FileTooLong \u2014 2281 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1781 over it, 4.56\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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b48c5366c888f24003365bb686115bff9919f0d65ceea046d5cfb5e985c6f1"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/reasoning.rs: FileTooLong \u2014 2237 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 51 free functions. The bar is 500 significant lines; this is 1737 over it, 4.47\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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f283cd6e629a8bc8f087fac44d935c8ddb462823c3cb1f9520ff8fbffb25c564"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/api.ts: FileTooLong \u2014 2082 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1582 over it, 4.16\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":"web/src/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f35639a7841b763861fac11208e6764495c90e42dece47179615a14e2292d68"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/resolution.rs: FileTooLong \u2014 2009 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 58 free functions. The bar is 500 significant lines; this is 1509 over it, 4.02\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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b1e28d4ce897c1a785f97afd387c52563c76f798bf2f899b8259fac4e1e8555"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: OntologySchemaGraph.OntologySchemaGraph: FunctionTooLong \u2014 OntologySchemaGraph runs 393 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 293 over it, 3.93\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32e8f9466cdf3807a20a3721417ec7cc98ea824c8d90d92e42ac2052fc12e54"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/Library.tsx: FileTooLong \u2014 1951 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1451 over it, 3.90\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":"web/src/pages/Library.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d9da27e3c037a766484108987f3eb6cc08c5d0640cffd478b1e97391c6b60e7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/Review.tsx: FileTooLong \u2014 1896 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1396 over it, 3.79\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Review.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4b9c0d98b7455dcffe73ae44f56c370ce2ef548aef5c86bbcae7e6dd5ba032f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::api::router: FunctionTooLong \u2014 utopia_server::api::router runs 377 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 277 over it, 3.77\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":"crates/utopia-server/src/api/mod.rs"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"b349d576a0610bdf93e4057f98c92e76a872821f55ce33cc9274f8f293942d1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::extraction_open::apply_open_extraction: FunctionTooLong \u2014 utopia_server::extraction_open::apply_open_extraction runs 371 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 271 over it, 3.71\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":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"daa8ea191440fd20c5e6183642f4f8c4313764c7b35e49ec4b20a3c11783b701"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/graph.rs: FileTooLong \u2014 1742 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 48 free functions. The bar is 500 significant lines; this is 1242 over it, 3.48\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"99952b3c9beff5e535bc098de2d1da41ab30e845688abfb2a4351efee584b0db"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: KbSettings.KbSettings: FunctionTooLong \u2014 KbSettings runs 335 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 235 over it, 3.35\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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"a483f2e85b22ee193c5a95b7d3084672a611dbed205021b65ece9776e6b5054c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/documents.rs: FileTooLong \u2014 1568 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 66 free functions. The bar is 500 significant lines; this is 1068 over it, 3.14\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":"crates/utopia-store/src/documents.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b0c65c84b238de8163ebec3a292667567755a0671a4a45ddbd95a697bfd9e1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RulesPanel.RulesPanel: FunctionTooLong \u2014 RulesPanel runs 302 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 202 over it, 3.02\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":"web/src/pages/RulesPanel.tsx"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dbf39d823a13bea463608903ebbb195ea39bdc9e34e8c97cc88c7ed339c2e0a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ontology.rs: FileTooLong \u2014 1509 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 52 free functions. The bar is 500 significant lines; this is 1009 over it, 3.02\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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12baf0a065a201ecd0e3d85f65042945b4c8c5b2b3c6ebf7012926b1579f435e"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Graph: ClassTooLong \u2014 1151 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 751 over it, 2.88\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":"web/src/pages/Graph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"611668a50517c78c151c259c6655f5c29d941a585958b6f5375e09e6640e5093"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Members.Members: FunctionTooLong \u2014 Members runs 283 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 183 over it, 2.83\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":"web/src/pages/Members.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"c33a779d003ad3ed46fa514d4c9e551caea21e5a61e23b90bc748e25ae584ab2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Graph.EntityPanel: FunctionTooLong \u2014 EntityPanel runs 274 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 174 over it, 2.74\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":"web/src/pages/Graph.tsx"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"d728ad41cee3a93ead89605d173535afc10a441aea50543f46791eb3817d5428"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: ui/index.tsx: FileTooLong \u2014 1345 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 845 over it, 2.69\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":"web/src/ui/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f62792cda7a2e53c2b2fdd3ebb1de5a3a7e48281bfcc25726793f58ec3b38e0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: LoginScene.LoginScene: FunctionTooLong \u2014 LoginScene runs 266 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 166 over it, 2.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/LoginScene.tsx"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8558e1a576c2f9f2bf89ccd1ae4d6801e51b7a93c623acea97d2d13f651e420"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::owl_import::apply: FunctionTooLong \u2014 utopia_server::owl_import::apply runs 257 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 157 over it, 2.57\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":"crates/utopia-server/src/owl_import.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"befe835f94d6c9fee7815e6927cf1320826738c47e332e08e3bcc40577300737"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ontologyDialogs.PropertyDialog: FunctionTooLong \u2014 PropertyDialog runs 256 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 156 over it, 2.56\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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"afe924fb5da1289ed448e3e17f8ff940a3ceffabd244b8bbbd367fecd5f6b98a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: RulesPanel.RuleDialog: FunctionTooLong \u2014 RuleDialog runs 252 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 152 over it, 2.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/RulesPanel.tsx"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faf6590ffceb152d876fb8721088f4b59f7a7cea1be3975a04c7784830e410f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::materialize::materialize_in_tx: FunctionTooLong \u2014 utopia_store::materialize::materialize_in_tx runs 243 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 143 over it, 2.43\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":"crates/utopia-store/src/materialize.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f38bd5eae2ed7199536c248ec3a4439f797a4221f4db89d63996e7e1ba11a1a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/temporal.rs: FileTooLong \u2014 1210 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 36 free functions. The bar is 500 significant lines; this is 710 over it, 2.42\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":"crates/utopia-store/src/temporal.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9849902d3513ed5ad2e9378c6fceb23db185ac9746626647db772627af251e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::reasoning::resolve: FunctionTooLong \u2014 utopia_store::reasoning::resolve runs 240 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 140 over it, 2.40\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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e70653731933687fed6134a0ef731d3b234ea266c088415c955ba1766bb8136"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/Settings.tsx: FileTooLong \u2014 1195 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 695 over it, 2.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Settings.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8fadb95c9232428fc70576f838bb70277552489fa1bcbd3934aadd58b1cfac7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ontology_agent.rs: FileTooLong \u2014 1194 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 694 over it, 2.39\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"08327493a07180d0c18d1fc4618034679049e3509074ab838756315229228215"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_ingest::ontology_rdf::project: FunctionTooLong \u2014 utopia_ingest::ontology_rdf::project runs 238 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 138 over it, 2.38\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":"crates/utopia-ingest/src/ontology_rdf.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"240cdeed42883f5eba8468623c97ade43b990fd5af57601c54e1560094a5152a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Graph.TimeScrubber: FunctionTooLong \u2014 TimeScrubber runs 237 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 137 over it, 2.37\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":"web/src/pages/Graph.tsx"},"region":{"startLine":1931}}}],"partialFingerprints":{"codehealthFindingId/v1":"8988e78065dce5812105edc46a1bb0843f0644ae8480ada22da9180269ff14eb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Library.SourceEditModal: FunctionTooLong \u2014 SourceEditModal runs 237 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 137 over it, 2.37\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":"web/src/pages/Library.tsx"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bfbfa700f906c42d4b3b6099082724b3bd5368c5306031f965fd45b18e9f2b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::graph::insert_fact_on: FunctionTooLong \u2014 utopia_store::graph::insert_fact_on runs 236 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 136 over it, 2.36\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":"crates/utopia-store/src/graph.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"01900f67286fbdb26182626e72b7fd9228d809646cc0bf75a67868dcc2fd1d33"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::dispatch: FunctionTooLong \u2014 utopia_server::dispatch runs 231 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 131 over it, 2.31\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":"crates/utopia-server/src/main.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"b63928a966029fc063388209d9d076beacb89c1e2140765c8a59510deae03fdb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::mappings::explore: FunctionTooLong \u2014 utopia_server::mappings::explore runs 230 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 130 over it, 2.30\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/mappings.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a5db751ac089c95af581583a2114d80a305977a6f13a700ab688ea65714d802"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/chat.rs: FileTooLong \u2014 1123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 623 over it, 2.25\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/chat.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e8662d575d4b65046fea00242976a070cbcaa4318fd88acf393576f665b3990"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/review_routes.rs: FileTooLong \u2014 1110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 610 over it, 2.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":"crates/utopia-server/src/api/review_routes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"63acfb4ba76f1af008b95196e3afb4cc5be1e813e2991c8607c803fe1cc47f28"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: api: ClassTooLong \u2014 859 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 459 over it, 2.15\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":"web/src/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b66fdf7315c18131237b9a5a110f6c131bad20e2a52b7fb8318d17e1a0d0cc72"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::type_alignment::align_types_locked: FunctionTooLong \u2014 utopia_server::type_alignment::align_types_locked runs 211 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 111 over it, 2.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/type_alignment.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"37880d44c337d92c1f1d744e794255fe8910172789fc93f8e0855e91cefddd8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::extraction_open::run_open: FunctionTooLong \u2014 utopia_server::extraction_open::run_open runs 205 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 105 over it, 2.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"663791f25f68812c36bd7ce01a4babe5e7e18bf0bc73ef026b8f8b98742e3531"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::time_resolution::resolve_document: FunctionTooLong \u2014 utopia_server::time_resolution::resolve_document runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.04\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/time_resolution.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2795bad01516955b197b53cacd13a68e2670b36cd80d9202ecf1a892321e6b6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::reasoning::materialize: FunctionTooLong \u2014 utopia_store::reasoning::materialize runs 203 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 103 over it, 2.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":2413}}}],"partialFingerprints":{"codehealthFindingId/v1":"94ef90884a69b25cc9d6797501b52ce82865de8da26ea25b432d32e912bd787e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/phrase_alignment.rs: FileTooLong \u2014 1010 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 510 over it, 2.02\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":"crates/utopia-server/src/phrase_alignment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"209706156c1413fc17f5621403782954cb6e6ee69462070a03647aaa8bcd5a82"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::api::chat::base_tools: FunctionTooLong \u2014 utopia_server::api::chat::base_tools runs 200 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 100 over it, 2.00\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/chat.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb9ac73bb7eeacc46021418c6a9f92e28ba796119c5e9da8fdf9d465b8876190"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::resolution::merge_entities: FunctionTooLong \u2014 utopia_store::resolution::merge_entities runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":2035}}}],"partialFingerprints":{"codehealthFindingId/v1":"85ea429db5c53c08983bd37c379741678055afb7cb95f6ed552b7627ca595ed7"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Mappings.Mappings: FunctionTooLong \u2014 Mappings runs 198 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 98 over it, 1.98\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":"web/src/pages/Mappings.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0030937cb0e0e11cfd85fe69191ac3c2cc0d62c8b501a0f71375e501d8ae81"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ingest_sources.rs: FileTooLong \u2014 987 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 487 over it, 1.97\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":"crates/utopia-server/src/ingest_sources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae4d6df396a0b2ed6c46be183701bbb1bf9c0fda0aa167423668c082be882873"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/tools_graph.rs: FileTooLong \u2014 975 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 31 free functions. The bar is 500 significant lines; this is 475 over it, 1.95\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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b60f26c343fd8949874dd4a71ead360932682ac71a0997c4b8e48f28de8fe2"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Review: ClassTooLong \u2014 779 significant lines (blank, comment-only and punctuation-only lines excluded), 24 methods. The bar is 400 significant lines; this is 379 over it, 1.95\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":"web/src/pages/Review.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06955bc78befa54937131d5eec582758eebd8a3e5c3c39fc726d428c200f5487"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/models.rs: FileTooLong \u2014 964 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 464 over it, 1.93\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":"crates/utopia-core/src/models.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05ab0669fb2c2817504d0aef223520a2fc5f900fa6a397f69df7e21d6983dab3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/parsers.rs: FileTooLong \u2014 962 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 462 over it, 1.92\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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2165b75bb08fa27eff689b5ef8d38be276e4d533bfff186959a84932e58ac8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Graph.FactRow: FunctionTooLong \u2014 FactRow 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":"web/src/pages/Graph.tsx"},"region":{"startLine":3350}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a0b17d24c6303135c44f610273e8c48a8ec1cb60959ae9cad78d66b0731b752"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Ontology.ImportPanel: FunctionTooLong \u2014 ImportPanel 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":"web/src/pages/Ontology.tsx"},"region":{"startLine":2342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f86c118cbf874cb53a69b9ac802533f0fb3963b2058dfd496715148a693e2c8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Ontology.RefinePanel: FunctionTooLong \u2014 RefinePanel runs 184 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 84 over it, 1.84\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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1443}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b95bfc498e0334a5708d337cdcc4640473d82e82ece888b7fd1e7c661491a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Settings.DeploymentAdmin: FunctionTooLong \u2014 DeploymentAdmin runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\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":"web/src/pages/Settings.tsx"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"40ca92160a3b38a34802da2ef0c54ac9d0c46d5d0149d2f89039d0d69e2a6688"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ontologyDialogs.ClassDialog: FunctionTooLong \u2014 ClassDialog runs 183 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 83 over it, 1.83\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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d47b84b6bfdf3296d4fcbe5a4813e4e59010266005028e2cc0d7d412401f368"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Ontology.MissesPanel: FunctionTooLong \u2014 MissesPanel runs 182 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 82 over it, 1.82\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Ontology.tsx"},"region":{"startLine":2110}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb7ad8ad81ff4a9090c965950f09cc6ca342828b2cf4129dbbd4bf43b6d6f50d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/tools.rs: FileTooLong \u2014 899 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 399 over it, 1.80\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":"crates/utopia-server/src/api/tools.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf2092ef29fd6ed07d78d66fd1036b1ea071772e314b89adbebbe7bb2d0c5960"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Ontology.QuestionsPanel: FunctionTooLong \u2014 QuestionsPanel runs 179 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 79 over it, 1.79\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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1899}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedf9738abaf94581046fd14740561afa7ea841ea0bbda4de690ad601518ac0d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: DocViewer.DocViewer: FunctionTooLong \u2014 DocViewer runs 175 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 75 over it, 1.75\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/DocViewer.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"6057d82773e042e5e63d0b92e5e9e38c5479b9546bcda737826e5b269c72fd10"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/extraction_open.rs: FileTooLong \u2014 870 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 370 over it, 1.74\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":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cc3ddc846a75d87789872599c2a551586a05caab855df731d986cab02f9e2de"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::errata::record: FunctionTooLong \u2014 utopia_store::errata::record runs 173 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 73 over it, 1.73\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":"crates/utopia-store/src/errata.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"20fea51181c3400e457b8f5a5cdc9b2b4b70b3c118ad8fc7955d8e9ac23802ed"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/RulesPanel.tsx: FileTooLong \u2014 864 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 364 over it, 1.73\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":"web/src/pages/RulesPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2480a9705e3b67b5fdaba727cddcce40529687f21a42c939a2e8359e60855e1e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/Chat.tsx: FileTooLong \u2014 860 significant lines (blank, comment-only and punctuation-only lines excluded), about 70% of them inside a single declaration: Chat (112-904). The bar is 500 significant lines; this is 360 over it, 1.72\u00D7 the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body \u2014 the parts that share the same inputs and are named together \u2014 into its own unit in a sibling file, and have the original call them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Chat.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7053709a0669b7a2e399bfec67c64fb416488aadfc0460b53100e39ebb4671ab"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: MyKbs.MyKbs: FunctionTooLong \u2014 MyKbs runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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":"web/src/pages/MyKbs.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"755282856dafa4366d58a6db8f2c674b96c02a1893c337401f7324c13e365c9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Tokens.Tokens: FunctionTooLong \u2014 Tokens runs 168 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 68 over it, 1.68\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":"web/src/pages/Tokens.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa90ad24bec8af2978fe6b1aa3c22e273b124e57a511748bfdf533ce8476acc6"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::api::tools_graph::entity_facts: FunctionTooLong \u2014 utopia_server::api::tools_graph::entity_facts runs 166 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":681}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c0ab4c1f8933805502a5f774bb75c58d77be0113bccc07c0a0804e6b4455b99"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: KbSettings.KbMembers: FunctionTooLong \u2014 KbMembers runs 166 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 66 over it, 1.66\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/KbSettings.tsx"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f4fd0380ed96b89ee6550d589c9af6ac36908904832f11a7e59aef2a09b9711"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::graph::entity_history: FunctionTooLong \u2014 utopia_store::graph::entity_history runs 164 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 64 over it, 1.64\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/graph.rs"},"region":{"startLine":2292}}}],"partialFingerprints":{"codehealthFindingId/v1":"edccffbe70be008455691c75cb7228eb6d8d215e2338e85d4db3658cc79de66a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::resolution::resolve_by_name: FunctionTooLong \u2014 utopia_store::resolution::resolve_by_name runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62\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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"3267dda1a940466a46bdb8f8a74c13b8188598b954270ce483b4fb30b1912109"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 807 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 307 over it, 1.61\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":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7085b2b1fee98f0ef269b58a49a6641f0b0f4772cbbdee551cd1c7309c2509e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/governance.rs: FileTooLong \u2014 806 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 34 free functions. The bar is 500 significant lines; this is 306 over it, 1.61\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":"crates/utopia-store/src/governance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"89285cc867305d79508f09614a60caf3763dc674d640b4615e3dafab1d5e8184"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_ingest::parsers::docx_xml_to_text: FunctionTooLong \u2014 utopia_ingest::parsers::docx_xml_to_text runs 159 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"95442d75db18cea647dedafd819fc664494228f9cc8befb89ffead93717d47fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/business_rules.rs: FileTooLong \u2014 793 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 293 over it, 1.59\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":"crates/utopia-store/src/business_rules.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5d78216dace1d0768fd89a0a28cd3438f8ceed5b2dd6884107497dbbe5fdce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::implication::propose_rules: FunctionTooLong \u2014 utopia_server::implication::propose_rules runs 158 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 58 over it, 1.58\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":"crates/utopia-server/src/implication.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c416ace37c6339e3de63508b36465a3953893668cbe2776e6d88600f8ea35600"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_ingest::table::render_rows: FunctionTooLong \u2014 utopia_ingest::table::render_rows runs 157 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\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":"crates/utopia-ingest/src/table.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"487365afeeb6bd59d351d9c9e3096755352b854071765619f8f9d3ab529f2578"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ontologyDialogs.AttributeDialog: FunctionTooLong \u2014 AttributeDialog runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57\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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"206b7cb3ff715f902d70cf32b85a59e01562fea5bea6d5d139547d1b0903e14d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Login.Login: FunctionTooLong \u2014 Login runs 156 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 56 over it, 1.56\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":"web/src/pages/Login.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a1f419b4c898bdf3da6e9540c9445e678ccd157dec73a5e57e9c88fb5ae0b89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/export.rs: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 278 over it, 1.56\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":"crates/utopia-store/src/export.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26bd04c5bf14975801065a18cb3f01b69f9de2d6595f9d803bd42171f4168fda"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::errata::review_document: FunctionTooLong \u2014 utopia_server::errata::review_document runs 154 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/utopia-server/src/errata.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fda12e427a3b137e53e746a4de30da724def3697746e1a49f2ca1ee6dcc1fe0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ReviewOverview.ReviewOverview: FunctionTooLong \u2014 ReviewOverview 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":"web/src/pages/ReviewOverview.tsx"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"862243f80bf354906b0349456fce11e66c94464bd4854dedf6abe407d799c4ff"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::adjudication::adjudicate_entities: FunctionTooLong \u2014 utopia_server::adjudication::adjudicate_entities runs 152 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 52 over it, 1.52\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/adjudication.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"90bf2ed94961e5b9f22d9bc8bb8be8b4d2bc60cfd4c96d6441f9bd4e22af4dc8"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Chat: ClassTooLong \u2014 606 significant lines (blank, comment-only and punctuation-only lines excluded), 10 methods. The bar is 400 significant lines; this is 206 over it, 1.52\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":"web/src/pages/Chat.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9088022f1de6c1baaf508ba2dc6eb380e21aa817e32afa65ce9e0fe9508b0cf2"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::documents::upsert_source_document_tx: FunctionTooLong \u2014 utopia_store::documents::upsert_source_document_tx runs 150 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"crates/utopia-store/src/documents.rs"},"region":{"startLine":316}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9cc89e2eeea3b20949da39bbffde1cdc14c04435d71143b8b8ef34a9274f43"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Library.SourceBar: FunctionTooLong \u2014 SourceBar runs 150 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 50 over it, 1.50\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":"web/src/pages/Library.tsx"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"b44209249b1e77efc2575039ff492109b48fc1db61947d3ee5f402bfddfa8fce"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::ingest_sources::sync_rss: FunctionTooLong \u2014 utopia_server::ingest_sources::sync_rss runs 149 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 49 over it, 1.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":"crates/utopia-server/src/ingest_sources.rs"},"region":{"startLine":599}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeb75db5acb004b78f2138f5081f0d19c7ff0b34e44591e7d3e105f3326e98fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/OntologySchemaGraph.tsx: FileTooLong \u2014 737 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 237 over it, 1.47\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":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"70a1bfd0e10d6b661a16162ed0d4aabcd2056574b86c520f048a4905c10613fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::paths::paths_between: FunctionTooLong \u2014 utopia_store::paths::paths_between runs 146 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 46 over it, 1.46\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":"crates/utopia-store/src/paths.rs"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"15a7a241c9e63d002ec8ef3d89b0146a0cd9c53e43e8bad082a0246bf131457f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/ontologyDialogs.tsx: FileTooLong \u2014 721 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 221 over it, 1.44\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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bdfc782e4fb340efb9e905c71a388bd8b0fa85c5c9ff0c582779536c530f658a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Library.SchedulePicker: FunctionTooLong \u2014 SchedulePicker runs 141 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 41 over it, 1.41\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Library.tsx"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d902709bdb205305532b28f0cabd4a64fd8810bc9271d29e118f0fedfa58180"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Ontology: ClassTooLong \u2014 560 significant lines (blank, comment-only and punctuation-only lines excluded), 28 methods. The bar is 400 significant lines; this is 160 over it, 1.40\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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9359e346a315a45e7de1f3bb0c807666e0828ccd52ca4c7d251605f0d461fc44"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: index.MultiSearchSelect: FunctionTooLong \u2014 MultiSearchSelect runs 140 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 40 over it, 1.40\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":"web/src/ui/index.tsx"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3a0987a90994cd033c1e56557ac861ec18cbe13523e9bdf42ba24358cfcfc12"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/governance.rs: FileTooLong \u2014 698 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 198 over it, 1.40\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":"crates/utopia-server/src/governance.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c7a1b81cd85c19d166c6e894aeed202fbf67df4b2462613bd449b2f17e0a85c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/oidc_routes.rs: FileTooLong \u2014 688 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), declaring 35 free functions. The bar is 500 significant lines; this is 188 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":"crates/utopia-server/src/api/oidc_routes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"62a15ddf58d78862199e68da19f1adb29c0758a08c1ae1fe97d24a0b7a700476"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/KbSettings.tsx: FileTooLong \u2014 668 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 168 over it, 1.34\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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfc669baffacb6c3e89b4f83e3422e1387d0b3b38c3e8eaf3df2b7918284ff9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: KbMenuList.KbGroupRow: FunctionTooLong \u2014 KbGroupRow runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"web/src/pages/KbMenuList.tsx"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"2440b76edbd72d45d2d47cd85a09ce2079f3ac5d0f99d3edce31b971e42d8ad4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Mappings.DataSources: FunctionTooLong \u2014 DataSources runs 132 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 32 over it, 1.32\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":"web/src/pages/Mappings.tsx"},"region":{"startLine":610}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8dbd11f77547f3bc4b56a803a45e193b787d7c0ed872983f358cee70de4f95a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::ontology_agent::propose_questions_with: FunctionTooLong \u2014 utopia_server::ontology_agent::propose_questions_with runs 129 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 29 over it, 1.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":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":1478}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5fc4275eb92ed4c872462b4b421be084c85fb3e769f582692be0ad820ab2c04"}},{"ruleId":"D3","level":"warning","message":{"text":"MethodTooLong: DatabricksEngine.run: MethodTooLong \u2014 run runs 128 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 28 over it, 1.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":"crates/utopia-server/src/query_engine/databricks.rs"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"6efc18ca3364cda63dacb42dbee446e1490bc48c321b79cef45287eabd79194a"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Settings: ClassTooLong \u2014 509 significant lines (blank, comment-only and punctuation-only lines excluded), 11 methods. The bar is 400 significant lines; this is 109 over it, 1.27\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":"web/src/pages/Settings.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5d4137603a97159d6794db21fcd91fb8769de389d0128c53b89dca67bda9aa0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::main: FunctionTooLong \u2014 utopia_server::main runs 127 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 27 over it, 1.27\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":"crates/utopia-server/src/main.rs"},"region":{"startLine":95}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c8c3346970ffa6655433dce96d3d8b211fd738593b20fac6431072a6fd084f"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyFields: EntityFact: TooManyFields \u2014 38 stored fields. The bar is 30 stored fields; this is 8 over it, 1.27\u00D7 the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member \u2014 each reader then names only the group it uses."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-core/src/models.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"622222d36d5e7a99f78db75f41731924d80ffbb0b750758d91dba72a20321756"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/errata.rs: FileTooLong \u2014 632 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 132 over it, 1.26\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":"crates/utopia-store/src/errata.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2ebd8203925556ebbc3a8921ad3d9e8fe9d59762ad6390d7ab984a47d79b78"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/ontology_routes.rs: FileTooLong \u2014 622 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 122 over it, 1.24\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/ontology_routes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0be16863f849d06489c286701bdfe9a84b40fab729f8d5ede2e29cadd4fb8383"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_reason::derive::contradictions: FunctionTooLong \u2014 utopia_reason::derive::contradictions runs 124 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"crates/utopia-reason/src/derive.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c35331bd0ac7d8141bcfa12daa58780f99ba7201e23780475ab043340da46e8"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ontologyTables.ClassesTable: FunctionTooLong \u2014 ClassesTable runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c04efef855d0a745e8197fe39bcde9201ed7616d090c3ed027a9e2f175facd4"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: ontologyTables.OntologyTables: FunctionTooLong \u2014 OntologyTables runs 124 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 24 over it, 1.24\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":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"945619ebdd1c183697b5d1ea4d3450fd4d1965d3a750d20d7934d906cd9b2e01"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_reason::derive::derive: FunctionTooLong \u2014 utopia_reason::derive::derive runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.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":"crates/utopia-reason/src/derive.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"b127c3f543e562cb171938957d0ea968b870a491085565f37e5a4f012c1cfe0b"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::extraction_open::call_and_parse_one_chunk: FunctionTooLong \u2014 utopia_server::extraction_open::call_and_parse_one_chunk runs 123 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 23 over it, 1.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":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"92db38898af3d9d8006e3f8dfbf4922db725314fb6521d1682373d8331630142"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Ontology.UniquenessPanel: FunctionTooLong \u2014 UniquenessPanel runs 122 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 22 over it, 1.22\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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1673}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1f1fafc838d8be9d6f0ddda39cb2e89522f4e93d52bb85cb111a0fe670a9890"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/Mappings.tsx: FileTooLong \u2014 608 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 108 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":"web/src/pages/Mappings.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"289c7bed875eca58138df339a6ad985102efa82bbdf0a088c756b0923484439c"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: Library: ClassTooLong \u2014 486 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 86 over it, 1.22\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":"web/src/pages/Library.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa3d9cd2d69806936611f62fe8b22fbcb5f2a0d258c1305b31da529f64fc3f9"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::reasoning::attribute_rules: FunctionTooLong \u2014 utopia_store::reasoning::attribute_rules runs 121 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"f20cd2808a53d77296d7b7f07f7367b06cf13740fd2d013255afd29f42e979cf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: api/sources_routes.rs: FileTooLong \u2014 603 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 103 over it, 1.21\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":"crates/utopia-server/src/api/sources_routes.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49e6e94a7b95b3f2cb77d2a57498180e9fe8907e5ddc897856c313b3e889fd5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_extract::ontology_agent::parse_proposal_response: FunctionTooLong \u2014 utopia_extract::ontology_agent::parse_proposal_response runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"crates/utopia-extract/src/ontology_agent.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"213018f2302c73e518355ff3ba9822e1a7ebfd1edcce11049d2631a807ab022a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::api::tools_graph::paths_between: FunctionTooLong \u2014 utopia_server::api::tools_graph::paths_between runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0170a711d33c9ac97b93d780048295dab74e2fabaecbdd9cc9bb9dc64dc5c5f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::ontology_agent::adopt_map_to: FunctionTooLong \u2014 utopia_server::ontology_agent::adopt_map_to runs 120 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b6bbdb3e89bc6363b926d7451cba88ca5e4960768276c175bd8bdd45779ec0"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Settings.NewDataSourceDialog: FunctionTooLong \u2014 NewDataSourceDialog runs 120 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 20 over it, 1.20\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":"web/src/pages/Settings.tsx"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d65ab45b31d1b66e93283d6ebe5441476523dcfa48572271939ad315cd72b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::materialize::imply_in_tx: FunctionTooLong \u2014 utopia_store::materialize::imply_in_tx runs 119 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/materialize.rs"},"region":{"startLine":538}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4c8f9c05682cb672f2dd748f2cd0df525c12cc5350dc039b0e58c72b1eec8f5"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Library.DocRow: FunctionTooLong \u2014 DocRow runs 119 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 19 over it, 1.19\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Library.tsx"},"region":{"startLine":2216}}}],"partialFingerprints":{"codehealthFindingId/v1":"74fcf931b04d0b47c84c156b83e3c7114401a93021feab624bff9847f4503a14"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/rdf.rs: FileTooLong \u2014 592 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 92 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":"crates/utopia-server/src/rdf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd6595c99d40feec4d7d4fb60e4b6eb2db83719e4fc03804c07667d90d2a10aa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/lib.rs: FileTooLong \u2014 591 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). 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":"crates/utopia-extract/src/lib.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c18994959eddf1ca93353b419cff38897d87cef47c0a72de59c5019dd2bc3a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::ontology::update_relation_type: FunctionTooLong \u2014 utopia_store::ontology::update_relation_type runs 118 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 18 over it, 1.18\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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a4f4ce5d13dabb7a8e4abb2928194d489ccaca0f97006cf856c8acf270903b1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::ontology_agent::adopt_on: FunctionTooLong \u2014 utopia_server::ontology_agent::adopt_on runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":1040}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b9ee7ae8615eb0f15c8ecee57e3adcdd7db9bfaa006f55ada66d2af41fd1221"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::owl_import::plan: FunctionTooLong \u2014 utopia_server::owl_import::plan runs 115 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 15 over it, 1.15\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/owl_import.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d7a1f87fb558e6232b717e1fcc16dfce48694c7bfaec7803a6e69d0495de7e9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/ontology_rdf.rs: FileTooLong \u2014 571 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 71 over it, 1.14\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":"crates/utopia-ingest/src/ontology_rdf.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"939b4b9eb6e49fda066f8ecd889fb81091f45b37af644ebc5463774f81ad7cd1"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: Settings.DataSourcesAdmin: FunctionTooLong \u2014 DataSourcesAdmin runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14\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":"web/src/pages/Settings.tsx"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c66aeeedcfe65009eb65bf51213c2005bc9928c4add053e02fbbe3201e5a76c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::temporal::uniqueness_candidates: FunctionTooLong \u2014 utopia_store::temporal::uniqueness_candidates runs 113 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 13 over it, 1.13\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/temporal.rs"},"region":{"startLine":1588}}}],"partialFingerprints":{"codehealthFindingId/v1":"012ebf67867e4b0b4d5f96ac58ef04f6f1a143e19ec790e1c13ebc1f551bed12"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::api::tools_graph::neighbors: FunctionTooLong \u2014 utopia_server::api::tools_graph::neighbors runs 112 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 12 over it, 1.12\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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8af09290d3e4c616ecd930b9402f5fdde9aa082dcebbb76a239afe69984c71"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_reason::rules::joined_evaluate: FunctionTooLong \u2014 utopia_reason::rules::joined_evaluate runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-reason/src/rules.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b39c691e3932b9cad2e550c79345c7a2df484fa141a8f142169eee85f64c73"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::api::review_routes::decide_violation: FunctionTooLong \u2014 utopia_server::api::review_routes::decide_violation runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/review_routes.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cde9185700312f87bb34e2f5d223e5d8d7f26078c70185ebedb57487b68955d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::resolution::resolve_type_drift: FunctionTooLong \u2014 utopia_store::resolution::resolve_type_drift runs 111 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 11 over it, 1.11\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"853be1c305cf88f305b1cbebd41540aee7f229f23a29378ec0faa6674725035f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::documents::replace_chunks_for_snapshot: FunctionTooLong \u2014 utopia_store::documents::replace_chunks_for_snapshot runs 110 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 10 over it, 1.10\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/documents.rs"},"region":{"startLine":1559}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8c4b86a538e35c64fb05784d9ff01610d5d80636ba78047360304ce62767d99"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/time_resolution.rs: FileTooLong \u2014 549 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 49 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":"crates/utopia-server/src/time_resolution.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"07ee39181d2ae9d9720a30b602ad4a6f014124a1ee7082db0cfb2342c841f22d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::governance::lookup: FunctionTooLong \u2014 utopia_server::governance::lookup runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/utopia-server/src/governance.rs"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8d04c037521fa77436c62e64ce214bdc2a5e5c4613f1d57af1f6f09786a893a"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::type_resolution::preview_with: FunctionTooLong \u2014 utopia_server::type_resolution::preview_with runs 109 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/utopia-server/src/type_resolution.rs"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac2e9ec04014536818ea25f11613c853f19377a70f7b81dd82c61cc7a90f1333"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_ingest::parsers::pptx_xml_to_text: FunctionTooLong \u2014 utopia_ingest::parsers::pptx_xml_to_text runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":1242}}}],"partialFingerprints":{"codehealthFindingId/v1":"418f78ec5adf1342b58e9f0567fe61df3cf1014fe28d2357db2d6ae82b3efe8c"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::pending::propose: FunctionTooLong \u2014 utopia_store::pending::propose runs 108 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 8 over it, 1.08\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":"crates/utopia-store/src/pending.rs"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba3d1cd0e499d15c83e5a562bdb15fbb67a390d372013e6fa06ef1d22008b456"}},{"ruleId":"D3","level":"warning","message":{"text":"ClassTooLong: LlmClient: ClassTooLong \u2014 428 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted), 20 methods, 2 blocks, lines 438-1155. The bar is 400 significant lines; this is 28 over it, 1.07\u00D7 the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d8844cbf92a306a7c8dd7c1a318f353aaaa868b5ee56ad0f678f0dbb17f6242"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_ingest::parsers::xlsx_sheet: FunctionTooLong \u2014 utopia_ingest::parsers::xlsx_sheet runs 107 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 7 over it, 1.07\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef5df0a267b265b3919f26f2c126448c069fbdd584309656bfa0e159092d185"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::api::export_routes::export: FunctionTooLong \u2014 utopia_server::api::export_routes::export runs 106 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/utopia-server/src/api/export_routes.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cdafd437876ddb00d698b36e5ed7cfeafc15a2d4b6a137c79e0bfba357a5ecd"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::governance::apply: FunctionTooLong \u2014 utopia_server::governance::apply runs 105 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 5 over it, 1.05\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/governance.rs"},"region":{"startLine":504}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e2237e806b5e952b86feabb7832aec8678757f5bf07c984b9421820e9001cb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/main.rs: FileTooLong \u2014 519 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 19 over it, 1.04\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-cli/src/main.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7971b35e50e981dba30e885cf4b355be388904a146647895e0e982a79002ea97"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: KbSettings.KbActivity: FunctionTooLong \u2014 KbActivity runs 103 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 3 over it, 1.03\u00D7 the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/KbSettings.tsx"},"region":{"startLine":512}}}],"partialFingerprints":{"codehealthFindingId/v1":"df6325333658f0ec761f2a877946f47ea786c73425747ee95d600d8494f5c392"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pages/ontologyTables.tsx: FileTooLong \u2014 513 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 13 over it, 1.03\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f13971ed47eed443f193dd5256e1be5b7c939ed0d7bbdfefd1471100f5f2019"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/materialize.rs: FileTooLong \u2014 512 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 12 over it, 1.02\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":"crates/utopia-store/src/materialize.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"85613a8697c4bd3358351aee58cdaf4a3c6c96893ba17efaacc628b6322b333e"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_reason::rules::evaluate_with_pool: FunctionTooLong \u2014 utopia_reason::rules::evaluate_with_pool runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"crates/utopia-reason/src/rules.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c28cca040fe49b76f583eb394ff21726eb76b5ddd55a4a63fadb2ef9325ff2d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::api::tools::list_rules: FunctionTooLong \u2014 utopia_server::api::tools::list_rules runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"crates/utopia-server/src/api/tools.rs"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"edeaeb597fbd64d66022a814b5939ec8b826c10d9a8c6a1a30d6e6a922f35083"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_store::graph::entity_detail: FunctionTooLong \u2014 utopia_store::graph::entity_detail runs 102 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) in one body. The bar is 100 significant lines; this is 2 over it, 1.02\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":"crates/utopia-store/src/graph.rs"},"region":{"startLine":1768}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ad91bfe4c4a330569bd98ef8a5ca423c38415a8d0df49ea91b568c08296381"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: src/owl_import.rs: FileTooLong \u2014 508 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted). The bar is 500 significant lines; this is 8 over it, 1.02\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":"crates/utopia-server/src/owl_import.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d29f91cf743eecfbeb82ce216a3cb83187a50a90c271f6efaf1e4ffb40a106b3"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: utopia_server::ingest_sources::ingest_item_with_outcome: FunctionTooLong \u2014 utopia_server::ingest_sources::ingest_item_with_outcome runs 101 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code \u2014 #[cfg(test)] modules and bare #[test] functions \u2014 not counted) 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":"crates/utopia-server/src/ingest_sources.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"70992b32961f418e19c8a6d0ee06cda5feffba4ddeb479754e771832cc8b5ef2"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (59 shared lines): crates/utopia-server/src/api/tools_graph.rs:892-1030 | crates/utopia-server/src/api/tools_graph.rs:1034-1151 \u2014 These two members are variants of one another: 59 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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"99df440ec97d5f85ed95854db741fb34d8c385c2c980f1128e56a2a928f7a2b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): crates/utopia-store/src/documents.rs:99-157 | crates/utopia-store/src/documents.rs:203-250 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain \u2014 factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/documents.rs"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b343cdb2d83b441fa54d7c0640be09ff1b0439b2a2cb8606cbd06bbca8b60d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201324 lines \u00D7 2): crates/utopia-server/src/ingest_sources.rs:1221-1244 | crates/utopia-server/src/ingest_sources.rs:1275-1292 \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":"crates/utopia-server/src/ingest_sources.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"7364e092b372af108241970bbbdc2082cf2aa36faf16d9e8ccbcc1024c8c2948"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): crates/utopia-server/src/extraction_open.rs:337-356 | crates/utopia-server/src/extraction_open.rs:645-664 \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":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6cf691e38c2a242128549f2b877be0e51c3edf746103a93f5957177bf12ec5b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/utopia-reason/src/rules.rs:347-365 | crates/utopia-reason/src/rules.rs:512-529 \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":"crates/utopia-reason/src/rules.rs"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"324f81f21cc7f8940644b8b4db729ff8d685f5b14a2a54519085a8cf66fc5e59"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/utopia-server/src/api/sources_routes.rs:570-588 | crates/utopia-server/src/api/sources_routes.rs:629-646 \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":"crates/utopia-server/src/api/sources_routes.rs"},"region":{"startLine":570}}}],"partialFingerprints":{"codehealthFindingId/v1":"317bfb0f6a14468bc77e9592ca98643c591722be8ddda0f1a2685c0f01092aa0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): crates/utopia-store/src/graph.rs:1508-1526 | crates/utopia-store/src/graph.rs:1857-1875 \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":"crates/utopia-store/src/graph.rs"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"26998626d66f329924f4c2b111cae66cc935ddefd2be7613b564378d872d9985"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): crates/utopia-store/src/resolution.rs:565-583 | crates/utopia-store/src/resolution.rs:643-660 \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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1f681150bb651437b0b33a5661bd1df8f80e50d3ac3575d12e8c4c71dd069bf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201319 lines \u00D7 2): crates/utopia-store/src/temporal.rs:1110-1125 | crates/utopia-store/src/temporal.rs:1186-1204 \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":"crates/utopia-store/src/temporal.rs"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"10ddca9d5cc40e8d01b0e2dafaf1edd483e9c0434b03fe167d8b9d5fcf5c3fb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): crates/utopia-server/src/errata.rs:183-197 | crates/utopia-server/src/errata.rs:222-237 \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":"crates/utopia-server/src/errata.rs"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0d54899a6e232909cf46ce011bdb4658df7543478dcf84ac00923dd5a9d938d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): crates/utopia-server/src/api/sources_routes.rs:554-568 | crates/utopia-server/src/api/sources_routes.rs:614-627 \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":"crates/utopia-server/src/api/sources_routes.rs"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6903b7e148f3d7c9d6fc7430b10d56ebe9e26adccfe8b12709559cdd8146d2a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 3): crates/utopia-store/src/documents.rs:372-385 | crates/utopia-store/src/documents.rs:427-440 | crates/utopia-store/src/documents.rs:475-488 \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":"crates/utopia-store/src/documents.rs"},"region":{"startLine":372}}}],"partialFingerprints":{"codehealthFindingId/v1":"897255fc8bdfb5350cb850909d2bdf669e60ce8ad64b3167887879be092587b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/utopia-store/src/documents.rs:116-128 | crates/utopia-store/src/documents.rs:204-216 | crates/utopia-store/src/documents.rs:448-460 \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":"crates/utopia-store/src/documents.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3176904ae1e6ee18315394b07f4bd0d0a7b3bf24886528c477efa271bf6186b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/utopia-extract/src/governor.rs:146-157 | crates/utopia-extract/src/lib.rs:301-313 \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":"crates/utopia-extract/src/governor.rs"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce7e9b7e0a97cb35b6374952ac3b451687753560457a1f5e0ea3d66feba39fd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): crates/utopia-llm/src/lib.rs:967-978 | crates/utopia-llm/src/lib.rs:1076-1088 \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":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"7efd008ebfea176435f33640b3170a52719ab65a5f19539f217df88fdb6426b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/utopia-store/src/documents.rs:224-236 | crates/utopia-store/src/documents.rs:464-476 \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":"crates/utopia-store/src/documents.rs"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"46caa15ddb59649a1e3c6a424b1141767e264fc71cc58bf865aa07e00e7c7ec5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): crates/utopia-server/src/api/tools.rs:1120-1131 | crates/utopia-server/src/api/tools_graph.rs:398-409 | crates/utopia-server/src/api/tools_graph.rs:1160-1171 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/tools.rs"},"region":{"startLine":1120}}}],"partialFingerprints":{"codehealthFindingId/v1":"26726d5d6ca109138fda9f153a95ad2d30730a483b3fe074ea00677c3cd9d24f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 3): crates/utopia-store/src/export.rs:466-477 | crates/utopia-store/src/export.rs:668-678 | crates/utopia-store/src/export.rs:934-943 \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":"crates/utopia-store/src/export.rs"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc28343796b3f4b34269cfac0582ac3302ff3c339d00c41171fd41fe30093aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u201312 lines \u00D7 3): crates/utopia-extract/src/align.rs:103-105 | crates/utopia-extract/src/implication.rs:68-79 | crates/utopia-extract/src/phrase_align.rs:202-213 \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":"crates/utopia-extract/src/align.rs"},"region":{"startLine":103}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea832c7818ad62583d7707b9ff6581645f6890023b92eea4181f6a71421668ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/utopia-server/src/main.rs:540-551 | crates/utopia-server/src/main.rs:557-568 \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":"crates/utopia-server/src/main.rs"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"27c2de371993f2794a63d9e9304de67efa71d7432ffaafaee1e2c6eb348575bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/utopia-store/src/jobs.rs:54-65 | crates/utopia-store/src/jobs.rs:116-127 \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":"crates/utopia-store/src/jobs.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"245fc991200887a1853ef7036d3d2c915b55081f2890722a81613d130589c5f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/utopia-store/src/reasoning.rs:2903-2914 | crates/utopia-store/src/reasoning.rs:2979-2990 \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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":2903}}}],"partialFingerprints":{"codehealthFindingId/v1":"cafb8760613d08c6490c9c764ff48325f596747d1186a5c7b1fbd9aa2a480bb4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): crates/utopia-llm/src/lib.rs:985-993 | crates/utopia-llm/src/lib.rs:1091-1101 \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":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":985}}}],"partialFingerprints":{"codehealthFindingId/v1":"18009cf3f0afbd204cf548681aec21b75ce3a255819c2ba8e3f3d8f2ce29229c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/utopia-server/src/api/mapping_routes.rs:276-286 | crates/utopia-server/src/api/mapping_routes.rs:365-375 \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":"crates/utopia-server/src/api/mapping_routes.rs"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"d514346e75245b918ebbeeb4c1c3a4126f4994a543d4c107fc49b94c28ecf1b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/utopia-server/src/api/oidc_routes.rs:893-903 | crates/utopia-server/src/api/oidc_routes.rs:951-961 \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":"crates/utopia-server/src/api/oidc_routes.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"1060641da9aee8571040bdc3a56781ad7e385afe67fabc9b0d83c21cbbfaaa3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/utopia-server/src/mapping_index.rs:154-164 | crates/utopia-server/src/retrieval.rs:89-99 \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":"crates/utopia-server/src/mapping_index.rs"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8910a327d28377d54da3662d91500c1ec40c6c6191f53586616acc2e0d5a363"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/utopia-store/src/export.rs:121-131 | crates/utopia-store/src/export.rs:1076-1086 \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":"crates/utopia-store/src/export.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"350ebf7b5931d519f8740bf05df379857995d6f11a86e3f89b2b140013d449a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/utopia-server/src/api/sources_routes.rs:589-598 | crates/utopia-server/src/api/sources_routes.rs:647-655 \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":"crates/utopia-server/src/api/sources_routes.rs"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a039b1955497c899808e22d9a65dd6bf5b7bb7523ec71feaca6e7c3ee13e45"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/utopia-server/src/main.rs:248-262 | crates/utopia-server/src/main.rs:268-277 \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":"crates/utopia-server/src/main.rs"},"region":{"startLine":248}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9e4b36ab6c8b6d63d9d9af0a2fd16aa3af95b777c8521f5303007ae58e189b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): crates/utopia-store/src/accounts.rs:68-77 | crates/utopia-store/src/accounts.rs:104-112 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/accounts.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"471fd45ab18d99613b8976ab7570f2d7b1b2770b6f4a35b33ddd73c2b004efec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/utopia-store/src/graph.rs:897-906 | crates/utopia-store/src/graph.rs:1144-1153 \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":"crates/utopia-store/src/graph.rs"},"region":{"startLine":897}}}],"partialFingerprints":{"codehealthFindingId/v1":"32680f56c29dd1d9b7a12c9c1736836d9093759c1cd978fd9bcf4c03a99bb950"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/utopia-store/src/ontology.rs:1666-1675 | crates/utopia-store/src/ontology.rs:1760-1769 \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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":1666}}}],"partialFingerprints":{"codehealthFindingId/v1":"5121022342a4cf7666ded42da3a8328fd4caf840606f662c8d4c91562ad98ed0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 3): crates/utopia-server/src/main.rs:539-547 | crates/utopia-server/src/main.rs:556-564 | crates/utopia-server/src/main.rs:603-608 \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":"crates/utopia-server/src/main.rs"},"region":{"startLine":539}}}],"partialFingerprints":{"codehealthFindingId/v1":"5abaa63cecde270ec19d05ab274aed9c88a0b8eef3a4050b9fa6d351f392849b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utopia-extract/src/governor.rs:136-144 | crates/utopia-extract/src/lib.rs:291-299 \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":"crates/utopia-extract/src/governor.rs"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"351bc81925aab31b2704d7d9c8f7666b34cfd4d2ad82b4d6ee6287aea52c783b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u20139 lines \u00D7 2): crates/utopia-extract/src/implication.rs:143-151 | crates/utopia-extract/src/implication.rs:247-254 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-extract/src/implication.rs"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"fda5a5f3594d3ce6bcc3efd96a16ea8111b0f5ac7efae8478ea43865692aef9b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utopia-llm/src/lib.rs:636-644 | crates/utopia-llm/src/lib.rs:900-908 \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":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"2549496e4e79f2352689e3ebe6b61830676971fc2aadfa57921b4e0e70ce2c40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utopia-server/src/api/tools_graph.rs:893-901 | crates/utopia-server/src/api/tools_graph.rs:1035-1043 \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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"f36df6da9ddfe43c3b1491d7823d3986d88dd867ad2932e4bc61b4f90116f1f7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utopia-server/src/api/tools_graph.rs:952-960 | crates/utopia-server/src/api/tools_graph.rs:1093-1101 \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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":952}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c6cd484f9b8a6135fed639c7a7d8642e46972b8ddf3774485675775d5cc7952"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utopia-store/src/paths.rs:340-348 | crates/utopia-store/src/paths.rs:372-380 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/paths.rs"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"210ff982516ad5763a802b53384c1573cf24630bd214fbfc893af091af32516a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-reason/src/rules.rs:334-342 | crates/utopia-reason/src/rules.rs:496-503 \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":"crates/utopia-reason/src/rules.rs"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"77c3a1433f1a7683e5ca61ee28bf693634aa3ae8cba836d54c6089656ec5d40e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7\u20138 lines \u00D7 2): crates/utopia-server/src/api/rig_model.rs:55-62 | crates/utopia-server/src/api/rig_model.rs:81-87 \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":"crates/utopia-server/src/api/rig_model.rs"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"627d1cd0890ed4b2697e1f82cb0d9af85478b389c65222ef40cfe96d591b3fda"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-server/src/http_fetch.rs:416-423 | crates/utopia-server/src/http_fetch.rs:426-433 \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":"crates/utopia-server/src/http_fetch.rs"},"region":{"startLine":416}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b4cf6c9fd759203ffdba39e034ac987921c05404095885b4df86b6215fd791"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-store/src/documents.rs:137-144 | crates/utopia-store/src/documents.rs:285-292 \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":"crates/utopia-store/src/documents.rs"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"48715968a0eec881ced7a7f272d09f17644319435a6ffda093a8676254ba809e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-store/src/paths.rs:131-138 | crates/utopia-store/src/paths.rs:143-150 \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":"crates/utopia-store/src/paths.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"4482e7b466e2d6b21c9f2517490f1f94ffae8d8a0bbc76e9f4ea8cab9df94049"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-store/src/resolution.rs:832-839 | crates/utopia-store/src/resolution.rs:1056-1063 \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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a36ae9f45a40ec9764bab260d5f46329bd80d0a728bcfaf131377496d8d7de6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/utopia-extract/src/ontology_agent.rs:156-162 | crates/utopia-extract/src/question_agent.rs:72-78 \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":"crates/utopia-extract/src/ontology_agent.rs"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c5a590dd6829ee86492b6adf9344f7fdf48f4d50199ce3332f6368f304a6ade"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/utopia-server/src/api/ontology_routes.rs:192-198 | crates/utopia-server/src/api/ontology_routes.rs:383-389 \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":"crates/utopia-server/src/api/ontology_routes.rs"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbf4830f7c827a363efbe2f443d953f40ee1bdaec6ee5997996f570a808da67"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20137 lines \u00D7 2): crates/utopia-server/src/extraction.rs:338-344 | crates/utopia-server/src/pipeline.rs:283-288 \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":"crates/utopia-server/src/extraction.rs"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"72b3484cd3b3d318e0764b5296c4c606e2d7f03f763efa3fafe7ae687ca88740"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/utopia-server/src/rdf.rs:332-338 | crates/utopia-server/src/rdf.rs:370-376 \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":"crates/utopia-server/src/rdf.rs"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"39a7d622a351e75ba28017a7e0a0ee3ceb9aa2a248eaaa72b79b31738a7d9ff5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/utopia-store/src/business_rules.rs:976-982 | crates/utopia-store/src/business_rules.rs:996-1002 \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":"crates/utopia-store/src/business_rules.rs"},"region":{"startLine":976}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8cfa51f2658240c06249aa047b2774b8e114b1776abda5613215fca1d14aa02"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/utopia-store/src/export.rs:973-979 | crates/utopia-store/src/export.rs:1091-1097 \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":"crates/utopia-store/src/export.rs"},"region":{"startLine":973}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9f37e8cbfa8de7be1c5e9dfc39ac20d8efca047740ab953d3a8d82f284e74d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/utopia-server/src/api/settings_routes.rs:66-71 | crates/utopia-server/src/api/settings_routes.rs:149-154 | crates/utopia-server/src/api/settings_routes.rs:208-213 \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":"crates/utopia-server/src/api/settings_routes.rs"},"region":{"startLine":66}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55d5c8cfc2a71ff21792defa03411fba78426155d730bdc49529b7c915a4796"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): crates/utopia-server/src/main.rs:219-224 | crates/utopia-server/src/main.rs:258-263 | crates/utopia-server/src/main.rs:273-278 \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":"crates/utopia-server/src/main.rs"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"89e2d1f70d900c2c2ede80296cb4a2c9d880b7f0d8115e3510a1aae849d7a19d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-extract/src/align.rs:116-121 | crates/utopia-extract/src/implication.rs:108-113 \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":"crates/utopia-extract/src/align.rs"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f62c8afaa190da8e54b1d58366b57dd47320047a22e14d8db7fa0f2e81446e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-ingest/src/parsers.rs:256-262 | crates/utopia-ingest/src/parsers.rs:1262-1267 \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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b7020ec4ff49582d13f61647e53638123e71befca15baea3a6e56741ab920b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-ingest/src/parsers.rs:462-467 | crates/utopia-ingest/src/parsers.rs:1363-1368 \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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb998b569d825353b116224d7a2a9fea204bd65da9cdedb004d985f4f3f6edb3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-ingest/src/parsers.rs:469-476 | crates/utopia-ingest/src/parsers.rs:1370-1375 \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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf57d7858aa17314f15019e8d298d2d6533f37ee95cfcfb9f0e4e71784137d1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-server/src/api/graph_routes.rs:37-42 | crates/utopia-server/src/api/kbs.rs:354-359 \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":"crates/utopia-server/src/api/graph_routes.rs"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d8f11815c79faaaabce007bd3ba89b41e9de352cce5e094eba2524756d49ec3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-server/src/api/ontology_routes.rs:208-215 | crates/utopia-server/src/api/ontology_routes.rs:251-256 \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":"crates/utopia-server/src/api/ontology_routes.rs"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb782aaad9e37bd6bdea6e4128527f4e1f5367b3d35f7799aa3c8296af3c025e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-server/src/api/sources_routes.rs:528-534 | crates/utopia-server/src/api/sources_routes.rs:830-835 \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":"crates/utopia-server/src/api/sources_routes.rs"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"3002ed8840faa793861e39cdf285fea7f0729bcc7d4ed886baf03ef8d04b9054"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-server/src/api/sources_routes.rs:535-540 | crates/utopia-server/src/api/sources_routes.rs:836-841 \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":"crates/utopia-server/src/api/sources_routes.rs"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"487fcafab8880857c23ed7c88d170d17808e084e79d24bee581c512b5caf9ba6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-server/src/ontology_agent.rs:571-576 | crates/utopia-server/src/ontology_agent.rs:588-593 \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":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":571}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aa9bbb3f1f5b5e4db09e4465ff1122177a5db821d6702b993ef8c5d12cddaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-server/src/phrase_alignment.rs:412-417 | crates/utopia-server/src/type_alignment.rs:98-103 \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":"crates/utopia-server/src/phrase_alignment.rs"},"region":{"startLine":412}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca224432554c2446d8b79dd71c70ff69ebc46ef3bc2a500d98d3786946c6ae7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/utopia-ingest/src/parsers.rs:179-183 | crates/utopia-ingest/src/parsers.rs:276-280 \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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":179}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b8784b0ed9259f0b5a5ae14ca2f57d04d988f16e43481430cf1946cd14cf98d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/utopia-ingest/src/parsers.rs:597-601 | crates/utopia-ingest/src/parsers.rs:663-667 \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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad88ebbf5076ee29f98fbef1278e3d82e6572417096cf968f3dbb369bd91a1c5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/utopia-store/src/reasoning.rs:2275-2279 | crates/utopia-store/src/reasoning.rs:2342-2348 \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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":2275}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f31bb4813289fa0536d786482a3b10cba0fe4fd326127655863d27cf02f5438"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/utopia-extract/src/align.rs:295-301 | crates/utopia-extract/src/time.rs:498-504 \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":"crates/utopia-extract/src/align.rs"},"region":{"startLine":295}}}],"partialFingerprints":{"codehealthFindingId/v1":"38034281b6ee0425ead1cc55dc92c7ada25553107ba47771df3352bfe341d8ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-extract/src/errata.rs:302-307 | crates/utopia-extract/src/implication.rs:324-329 \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":"crates/utopia-extract/src/errata.rs"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6d7bef9e4e6fb203d284c958471c51e699f990e2a138f5bb4d8692c42818718"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-extract/src/open.rs:495-500 | crates/utopia-extract/src/time.rs:564-569 \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":"crates/utopia-extract/src/open.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03d7d562fcaaac68919837b7f7986013a46069374f30242e101d53f5b99d318"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utopia-server/src/api/chat.rs:1510-1518 | crates/utopia-server/src/api/tools.rs:1002-1010 \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":"crates/utopia-server/src/api/chat.rs"},"region":{"startLine":1510}}}],"partialFingerprints":{"codehealthFindingId/v1":"5235188af3046e7ba6a7734687ef880ac19dd700a0f7d21be11a4de82e4aec41"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utopia-server/src/api/chat.rs:1549-1557 | crates/utopia-server/src/api/tools.rs:1326-1334 \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":"crates/utopia-server/src/api/chat.rs"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"a57a6dff491e3c098072b5d91a51aea83883e24fa1722d0609855910956e11ce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-server/src/query_engine/mysql.rs:197-202 | crates/utopia-server/src/query_engine/postgres.rs:31-36 \u2014 before extracting anything, compare \u0060crates/utopia-server/src/query_engine/mysql.rs\u0060 and \u0060crates/utopia-server/src/query_engine/postgres.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"crates/utopia-server/src/query_engine/mysql.rs"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"18008eb2f8bcd86884a11049e1fe47d0488920dd5cb2941e242e6e0815201086"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-server/src/query_engine/snowflake.rs:222-229 | crates/utopia-server/src/query_engine/trino.rs:154-161 \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":"crates/utopia-server/src/query_engine/snowflake.rs"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"e05e3c7224dc64a9333f2b18a1d51bc793a8b5de6b316f5e32eaab21339e772e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-store/src/documents.rs:1327-1332 | crates/utopia-store/src/jobs.rs:71-76 \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":"crates/utopia-store/src/documents.rs"},"region":{"startLine":1327}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3294a78338a7490377782938c65575002bf477390d9d3cde92cb9166b40674d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/utopia-store/src/reasoning.rs:155-188 | crates/utopia-store/src/reasoning.rs:1796-1808 \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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":155}}}],"partialFingerprints":{"codehealthFindingId/v1":"9501507e3b927bc7994508b412f3508304140cff31a57933279f3ec62b1c39b5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/utopia-store/src/ontology.rs:366-379 | crates/utopia-store/src/ontology.rs:911-933 \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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c10a19ed24783ddc0b448844c92bc30a2ceb71d5f56068f88f11132e034a130"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/utopia-store/src/ontology.rs:1657-1671 | crates/utopia-store/src/ontology.rs:1738-1758 \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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"446a54e46fd3283945506a1a28ed2b4729e5549cc005ad8740b1d2c2e9d9ea77"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/utopia-server/src/query_engine/mysql.rs:205-224 | crates/utopia-server/src/query_engine/postgres.rs:39-52 \u2014 before extracting anything, compare \u0060crates/utopia-server/src/query_engine/mysql.rs\u0060 and \u0060crates/utopia-server/src/query_engine/postgres.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"crates/utopia-server/src/query_engine/mysql.rs"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"5faa03a0f270a788535bbc3da6304df64e52397e09ce89099d7e5a36271a5ad3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): crates/utopia-store/src/resolution.rs:353-362 | crates/utopia-store/src/resolution.rs:961-980 | crates/utopia-store/src/resolution.rs:2872-2884 \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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":353}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ffe386de0adbc5dffdef2a1208f64886459cf0b992df749a32ec6a065e058cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): crates/utopia-store/src/temporal.rs:1140-1155 | crates/utopia-store/src/temporal.rs:1218-1234 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/temporal.rs"},"region":{"startLine":1140}}}],"partialFingerprints":{"codehealthFindingId/v1":"4cc771be4972360409845af8cd812684d49e7f0e6be4da373b3af723b9c188c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/utopia-store/src/ontology.rs:1516-1531 | crates/utopia-store/src/ontology.rs:1588-1599 \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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":1516}}}],"partialFingerprints":{"codehealthFindingId/v1":"33a9bf929c886c4a2152e19796ae12ceba942f05fb3b442a905cbd4ce208cc4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/utopia-store/src/conversations.rs:41-55 | crates/utopia-store/src/mappings.rs:286-301 \u2014 before extracting anything, compare \u0060crates/utopia-store/src/conversations.rs\u0060 and \u0060crates/utopia-store/src/mappings.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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":"crates/utopia-store/src/conversations.rs"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"a829569c6204535b0a85bb22fbf6994803a1c717229e3ad262b12ad3a2d5d944"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/utopia-server/src/phrase_alignment.rs:696-708 | crates/utopia-server/src/type_alignment.rs:129-143 \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":"crates/utopia-server/src/phrase_alignment.rs"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebad9be6644a6f81d579fa9ea4a0c31d6d9c49b0a84c29f35e359412db286167"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/utopia-store/src/alerts.rs:269-283 | crates/utopia-store/src/alerts.rs:317-327 \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":"crates/utopia-store/src/alerts.rs"},"region":{"startLine":269}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf7c0afd1d1a32ce843f683e40025fc836669b92a149f269210662a779dc1eba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/utopia-store/src/type_bindings.rs:562-576 | crates/utopia-store/src/type_bindings.rs:630-643 \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":"crates/utopia-store/src/type_bindings.rs"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"b277e1591a2e8acc7bdda70c811a71031a52c2d068c19b6d77ef3774a767c2ac"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): crates/utopia-store/src/reasoning.rs:984-998 | crates/utopia-store/src/reasoning.rs:2754-2768 \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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"289334c64c5456df7caed4e0edb62782576e6be5c2e5640edf869c6f54cc3933"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/utopia-store/src/conversations.rs:84-97 | crates/utopia-store/src/mappings.rs:187-201 \u2014 before extracting anything, compare \u0060crates/utopia-store/src/conversations.rs\u0060 and \u0060crates/utopia-store/src/mappings.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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":"crates/utopia-store/src/conversations.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"4666a29aeb48a1c8c20b2423bac651c042c2e4ff7eeb05465679fd673ea505c2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): crates/utopia-server/src/query_engine/snowflake.rs:204-217 | crates/utopia-server/src/query_engine/trino.rs:136-149 \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":"crates/utopia-server/src/query_engine/snowflake.rs"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"dff706de337991809821ea69a102e650c5fca63e7dbc68c762064b86546081ec"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/utopia-store/src/governance.rs:90-102 | crates/utopia-store/src/governance.rs:103-116 \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":"crates/utopia-store/src/governance.rs"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4edb073a39108bbab0d7d0224400e80f825e0072fde455ce088115b0fb83cdd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/utopia-store/src/documents.rs:968-980 | crates/utopia-store/src/documents.rs:1080-1093 \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":"crates/utopia-store/src/documents.rs"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b7a5746f038c567d3423623411045acc418d4c17a660a172cc21c2a5144435"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/utopia-server/src/api/review_routes.rs:598-610 | crates/utopia-server/src/api/review_routes.rs:622-634 \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":"crates/utopia-server/src/api/review_routes.rs"},"region":{"startLine":598}}}],"partialFingerprints":{"codehealthFindingId/v1":"3865e48673e77a07e5c8d2be8f838d588e3a34c9a0923ec70f7286fb014f69d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/utopia-server/src/api/tools_graph.rs:904-916 | crates/utopia-server/src/api/tools_graph.rs:1045-1056 \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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ddd544f5a5c46dc3ca5c9185bfc16cced69f9051efd2745aee06d261750dfb6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): crates/utopia-server/src/api/review_routes.rs:213-225 | crates/utopia-server/src/api/review_routes.rs:600-612 | crates/utopia-server/src/api/review_routes.rs:624-636 \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":"crates/utopia-server/src/api/review_routes.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9191bff2958db1c3bb3d132ad27a2168ea08e38fa9b0b6221846555a765a10b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): crates/utopia-store/src/name_vectors.rs:68-80 | crates/utopia-store/src/signature_vectors.rs:56-68 \u2014 the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-store/src/name_vectors.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"845b98cd73a73a3e488296c4bb0e2a8af85c363da68ed747b743cc959b6b616a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): crates/utopia-server/src/adjudication.rs:432-444 | crates/utopia-server/src/adjudication.rs:471-481 \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":"crates/utopia-server/src/adjudication.rs"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"095b5158c09ece806246ace291babc2407b107c9bb9c23dce7c72354f56ec968"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/utopia-server/src/api/admin_routes.rs:172-183 | crates/utopia-server/src/api/admin_routes.rs:197-208 \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":"crates/utopia-server/src/api/admin_routes.rs"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"03d164c88b02aabff3028183489a3a54c2a0da9de3c9d1470e8fb4f9f944e22b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/utopia-store/src/jobs.rs:174-183 | crates/utopia-store/src/jobs.rs:200-211 \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":"crates/utopia-store/src/jobs.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b9344442e479318318b9caa71f7a1465a23cef197dd6eae1736c60010f4aff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): crates/utopia-server/src/api/tools_graph.rs:922-933 | crates/utopia-server/src/api/tools_graph.rs:1062-1073 \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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec652728b67a2006cfae61657f91b06a5effe34c0bf7120478cf10df04db35b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/utopia-store/src/audit.rs:174-182 | crates/utopia-store/src/conversations.rs:49-56 | crates/utopia-store/src/documents.rs:538-546 | crates/utopia-store/src/mappings.rs:294-304 \u2014 before extracting anything, compare \u0060crates/utopia-store/src/conversations.rs\u0060 and \u0060crates/utopia-store/src/mappings.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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":"crates/utopia-store/src/audit.rs"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1ccdf9e1471391b6e638c3d98d4f090e31f0d43323d9ccc4fd1de274f94c0a6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-ingest/src/ontology_rdf.rs:391-401 | crates/utopia-ingest/src/ontology_rdf.rs:434-441 \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":"crates/utopia-ingest/src/ontology_rdf.rs"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbfe5d55f2c97787cec93185ce70c1a34808206c1aee841f9778f4b67e941325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/utopia-store/src/audit.rs:175-183 | crates/utopia-store/src/conversations.rs:50-57 | crates/utopia-store/src/graph.rs:2455-2465 | crates/utopia-store/src/mappings.rs:295-305 \u2014 before extracting anything, compare \u0060crates/utopia-store/src/conversations.rs\u0060 and \u0060crates/utopia-store/src/mappings.rs\u0060 as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 53 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":"crates/utopia-store/src/audit.rs"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"f04b5c0ebf91428c1800c62e139948809fd9c749b28f3b7a4a93a62ff5b47593"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utopia-store/src/ontology.rs:495-503 | crates/utopia-store/src/ontology.rs:999-1008 \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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"53bf97054055d60833758fe6da7a8c1083d93d76250d7bce4302f696ad0c79c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 3): crates/utopia-server/src/api/tools_graph.rs:688-695 | crates/utopia-server/src/api/tools_graph.rs:899-908 | crates/utopia-server/src/api/tools_graph.rs:1041-1048 \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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":688}}}],"partialFingerprints":{"codehealthFindingId/v1":"40339ebe8eeec790f7deb017534b11ca0823c0cbac1374261c6d1e726fe338c6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): crates/utopia-server/src/query_engine/mysql.rs:229-238 | crates/utopia-server/src/query_engine/postgres.rs:54-63 \u2014 before extracting anything, compare \u0060crates/utopia-server/src/query_engine/mysql.rs\u0060 and \u0060crates/utopia-server/src/query_engine/postgres.rs\u0060 as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 36 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":"crates/utopia-server/src/query_engine/mysql.rs"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66c9827103f437916953c2f923395f5f18b2191725842a5c2412ef2e0352fd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-server/src/api/tools_graph.rs:935-944 | crates/utopia-server/src/api/tools_graph.rs:1075-1082 \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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"825f064c9e9c8a16e902533ac8dc7cc412ac567a6c5012d875c149c31f492092"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utopia-store/src/resolution.rs:2085-2093 | crates/utopia-store/src/resolution.rs:2095-2104 \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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":2085}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7d5ca485c059ccd2f6672fba535e0785e7274987b0beac707bd2d87fa69e2d9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 4): crates/utopia-server/src/api/tools_graph.rs:689-696 | crates/utopia-server/src/api/tools_graph.rs:900-909 | crates/utopia-server/src/api/tools_graph.rs:1042-1049 | crates/utopia-server/src/api/tools_graph.rs:1233-1240 \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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"06bfa67ed8e6e9c754bbf1632df835ceae2cb632365fde4b64fd9286e611a77d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): crates/utopia-store/src/alerts.rs:242-250 | crates/utopia-store/src/alerts.rs:297-306 \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":"crates/utopia-store/src/alerts.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"0030e1a25c8af14f3ae5bf96ff65d5ec9b983e0959d69fde50620954add40564"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-store/src/export.rs:133-140 | crates/utopia-store/src/export.rs:1080-1087 \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":"crates/utopia-store/src/export.rs"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"be263249ed655c3400711c2d741c8b1368ff86c7424163a712a227e1582eb4ed"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-server/src/api/tools_graph.rs:1023-1030 | crates/utopia-server/src/api/tools_graph.rs:1144-1151 \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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"606e7c5087baa0ea7348257d5bc13913ae2d787c7682ffbcfc8591ea52a2155b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): crates/utopia-store/src/ontology.rs:327-334 | crates/utopia-store/src/ontology.rs:657-664 \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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"85dc6ac2f3ae4b762774cfe7ea5519101274d83cebea98045ad6ffafceb7b668"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/utopia-extract/src/ontology_agent.rs:166-172 | crates/utopia-extract/src/question_agent.rs:82-88 \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":"crates/utopia-extract/src/ontology_agent.rs"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"68c3c5b0001d5fee6b2a847cc6adf7082b757cd99d36611a33eca7ba1caa610d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-ingest/src/ontology_rdf.rs:446-451 | crates/utopia-ingest/src/ontology_rdf.rs:452-458 \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":"crates/utopia-ingest/src/ontology_rdf.rs"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"73d8b4f20fc8777445db2679c5c3a7f4c3a59d93f2eae32abbeda4dbec9f9020"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): crates/utopia-server/src/readers.rs:230-236 | crates/utopia-server/src/readers.rs:293-299 \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":"crates/utopia-server/src/readers.rs"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"24af7af6e7f681e0632878f72057636bd6bf2114ce7c5d5cc7823079e2f21fc5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): crates/utopia-llm/src/lib.rs:637-643 | crates/utopia-llm/src/lib.rs:901-907 | crates/utopia-llm/src/lib.rs:1131-1137 \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":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":637}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3e4f9d06fb6a6941005fc5b26990525d29ac7bbd67505406a449d843d5db1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (2\u20137 lines \u00D7 3): crates/utopia-store/src/ontology.rs:1791-1792 | crates/utopia-store/src/ontology.rs:1817-1823 | crates/utopia-store/src/ontology.rs:1848-1854 \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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d2d4f4af9ff0c45e88b3ec20c600a44403fafc6f8f5a391cb074f05b7c36733"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-server/src/main.rs:374-379 | crates/utopia-server/src/main.rs:424-429 \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":"crates/utopia-server/src/main.rs"},"region":{"startLine":374}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcfadfbc603cc4d004c2d6952b510260358c9bd76d0215bff1e12c402e6c98a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-server/src/main.rs:555-560 | crates/utopia-server/src/main.rs:613-618 \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":"crates/utopia-server/src/main.rs"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"44daf41edc2afd4b976fb1a656faab6e0d7cdc50b943700f8cfac05bc1a16986"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-store/src/ontology.rs:454-459 | crates/utopia-store/src/ontology.rs:977-982 \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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"91026ad8b9d63e9ef876a8f586f7285a0ed60ee7dde3e14a4dd14ee2218ccc31"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 6): crates/utopia-server/src/errata.rs:54-58 | crates/utopia-server/src/implication.rs:240-244 | crates/utopia-server/src/ontology_agent.rs:76-81 | crates/utopia-server/src/ontology_agent.rs:1462-1466 | crates/utopia-server/src/phrase_alignment.rs:669-674 | crates/utopia-server/src/type_alignment.rs:114-118 \u2014 there are 6 copies across 5 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 6 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/errata.rs"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aa9a41e8b7d7e7328c0c32c377228f0b69f954eaa59ac82afdf1bde0828645e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/utopia-extract/src/align.rs:311-315 | crates/utopia-extract/src/phrase_align.rs:439-443 \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":"crates/utopia-extract/src/align.rs"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea3079ceb08937fb73027bcca1594cae39df350c27709110dfe7858cab25355"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/utopia-server/src/api/auth_routes.rs:86-90 | crates/utopia-server/src/api/auth_routes.rs:154-158 \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":"crates/utopia-server/src/api/auth_routes.rs"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebf376d86eab1b4f0088e4d6961d584a5f101705207b43ca03e89a0f73a75ee0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/utopia-server/src/api/datasource_routes.rs:201-205 | crates/utopia-server/src/api/datasource_routes.rs:246-250 \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":"crates/utopia-server/src/api/datasource_routes.rs"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"e69e3dd39963a05da281ab64c73d5e8e82c0baca48e3641b856e9197f26d16e3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/utopia-server/src/extraction_open.rs:818-822 | crates/utopia-server/src/extraction_open.rs:833-837 \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":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9ccecf3ac149bff84c62ee76a5c010f4087a4a936c730808d4b8224b72cc440"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): crates/utopia-server/src/ingest_sources.rs:1023-1028 | crates/utopia-server/src/ingest_sources.rs:1264-1269 \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":"crates/utopia-server/src/ingest_sources.rs"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7966972f46c74e3c39420e648862f8a053cc67c279a6f54335de7883933999d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/utopia-server/src/owl_import.rs:190-194 | crates/utopia-server/src/owl_import.rs:195-199 \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":"crates/utopia-server/src/owl_import.rs"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"35222939196ef842cffd98c7677704a526b5bf30e212f0c0c9d582d79c6485ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): crates/utopia-store/src/paths.rs:360-364 | crates/utopia-store/src/paths.rs:391-395 \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":"crates/utopia-store/src/paths.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be6ecf220e78db1e2e558d701439c4845d8fddc7856f52d5b3adf336e5c4774"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: utopia-core: utopia-core: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 3 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"3baf93755b25720a70c324ec43b53f158c2cfaa06ad06e66c11997e5743ab97d"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: utopia-ingest: utopia-ingest: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9d2ed0ef21cc0b285cf2f9d3b120384683c3b19c82c69e19db71144b84fd47f7"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: utopia-llm: utopia-llm: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"1d9927281966f5db7813004bdfef7e4c54959ea9bc4ba158b55bc56e083cde81"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: utopia-reason: utopia-reason: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 2 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5093417686ceab19e2aca4b2deebedc03124b9a106460b9673505ce0446d43ba"}},{"ruleId":"D5","level":"warning","message":{"text":"Off the main sequence: utopia-search: utopia-search: abstractness 0.00, instability 0.00, distance 1.00 \u2014 zone of pain \u2014 concrete and depended on by 1 project(s), so it\u0027s rigid to change."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9ba4816a18c0b5fc7058877bff375bf65eeb52173324cb54881e1deff4e98a86"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0001 \u00B7 Ontology import and governance: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0001-ontology-import-and-governance.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46397c541ec514f1cbe7389cf7c357a3575ee717575c1ae0d52a91361cc02695"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0002 \u00B7 Reasoning engine: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0002-reasoning-engine.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"27bfdb46b776ebeae3ad3925d6c53db2123af8480dae28a2489d213b2f1b1f54"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0003 \u00B7 The ontology grows out of the corpus: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0003-ontology-growth-loop.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78931f4b48c482628125937c6c736f0ca6e776da194239a893b004fb9dfbc8a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0004 \u00B7 Language follows the reader of each text: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0004-language-and-localization.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8a90afd4dfdf676cadab9942454c6d271a6f4fc5866d1e6432d933f11e8dbcb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0005 \u00B7 The alert center: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0005-alert-center.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8e0946cbc79fa4a5caaa60f811cd49de62bea18ec689c905b557737a3a6c52"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0006 \u00B7 Ontology scale and the extraction prompt: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0006-ontology-scale-and-the-prompt.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd65e385b3512cde92d166dc3eed571a7883e91b2a6cbe524c0850c1279e2015"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0007 \u00B7 Counting decides what becomes a relation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0007-who-decides-what-becomes-a-relation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f394f3ce54865d1255938821814eeeaa688119fb426e39dc601ea8afd1e42f79"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0008 \u00B7 Ontology packs as the cold start: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0008-ontology-packs-as-cold-start.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eb7cf8ef5e7f518990eb9d95685dccb6d707177214aab3d308ac62255b67448"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0009 \u00B7 An undecided type stays empty: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0009-no-type-is-a-type.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7e04067083364b78aa738f6fa4113e8d25323b010e422946a5fbf8d9c4b33b1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0010 \u00B7 An unnamed relation stays empty: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0010-no-relation-is-no-relation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"20a6cade195883bbbc9f96d9be6b62795c3fb33d2bea7f6f49eff8fba68ac729"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0011 \u00B7 A mapping is configuration: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0011-a-mapping-is-not-a-fact.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42c10c840e361d2b0f82d5fafca48c870f037307096029f76f3e3910d8fb21d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0012 \u00B7 The ontology is a contract: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0012-the-ontology-is-a-contract-not-a-suggestion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"454c3ab0b20eb49d7a1c8e44fb59105080ac6d6ae3d6c0c439af722de998a91d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0013 \u00B7 A source hands over its history: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0013-a-source-should-hand-over-its-history.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b80bbd31054d358fb6a4300242eac6b358d0707a3d1e4dc026dc0e52974fc0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0014 \u00B7 Identity from the person, scope from the token: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0014-identity-from-the-person-scope-from-the-token.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb3fd1f04247532270ae75ead94ade6e44c5e0fdb144d369eb6474ae724a6fd4"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0015 \u00B7 A recorded sentence waits for a nod: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0015-recording-a-sentence-is-not-asserting-a-fact.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"97089f26d69d27ec4b770664a2a2a9a0a86e18914e4fc13bb4d9500a8408bbe1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0016 \u00B7 Close the open seams before cutting new ones: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0016-close-the-open-seams-before-cutting-new-ones.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1325c93013b7cf9c0883b1a839b4e0ff394582d67387f408e9be012c7d7fd303"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0017 \u00B7 A contradiction points at an error upstream: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0017-a-contradiction-points-upstream.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ebb391d12c7dc563cec3964b5e482d4d9a8c1f7c5dfe86e076c45041fd4a172"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0018 \u00B7 The lakehouse is one protocol away: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0018-the-lakehouse-is-one-protocol-away.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8b2df6a5e7e1d96a5b7d06be391308c89302720e5325f5a361479b85104d4bb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0019 \u00B7 The second clock can be rewound: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0019-the-second-clock-can-be-rewound.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5e5734aeaa62525b8c23bae1589c0fa6f58d55b2e1c689ea66f2533bd786ab"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0020 \u00B7 An auditor reads it without us: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0020-an-auditor-reads-it-without-us.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4371bb4a611028ca0fa795500dfb2d1408979931ffff32a7d5c94282ec47bc14"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0021 \u00B7 A rule reads attributes and concludes a type: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0021-a-rule-reads-attributes-and-concludes-a-type.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"600169ad83d35fa16723ac582bf521c92fb37065bd3f738f56106e1ab5dfe1e5"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0022 \u00B7 An unknown date is not an open one: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0022-an-unknown-date-is-not-an-open-one.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e430c671ccb953d985da9fbe9a6e7533693242e2c1d2c1580de9b354b30a8ecb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0023 \u00B7 RSS observations are not documents: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0023-rss-observations-are-not-documents.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"12080fe780219a4c28dbe929b59d7f11a42ed11cbfa488d27701e9c1e5b91037"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0024 \u00B7 The world axis reaches the second: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0024-the-world-axis-reaches-the-second.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c07351874c79e862609ca144999b65786ee975ba25145e722ff7887a3d0b8356"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0025 \u00B7 Governance reads the ledger before it decides: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0025-governance-reads-the-ledger-before-it-decides.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a48be83db0e0f9f61df6238e1c039442b6cc29f98bf0f673a3b61e24d7297573"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0026 \u00B7 A decision records why: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0026-a-decision-records-why.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"28b435d1ea2a5c1ca5d17fee4c669323dc26b4e8258a2793a869532fcba95a54"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0027 \u00B7 An automatic merge is gated by what it can undo: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0027-an-automatic-merge-is-gated-by-what-it-can-undo.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"da35c08b285ded819aa091585646d8ef8bf69d59ad2d05e1975815259a3faa85"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0028 \u00B7 The adjudicator looks before it asks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0028-the-adjudicator-looks-before-it-asks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3975eb9ab89342cbec3261b2e6ce211e5300f2f3297b4dd4d83890fc3d13092"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0029 \u00B7 A rule may say \u0022or\u0022, once: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0029-a-rule-may-say-or-once.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"351821073863ce9bcaac54260a05f36a692b874056ea377ccb9f54e47eb93229"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0030 \u00B7 A rule may read what a rule concluded: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0030-a-rule-may-read-what-a-rule-concluded.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b367fafe3a3a8042290ea30578e0033e17a2ae90b9e8761c30ba5b79df4135d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0031 \u00B7 An event holds at the moment it names: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0031-an-event-holds-at-the-moment-it-names.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ef036d9eab407a11444e382dc9b045cfba8f0d357be265aeb96180f35e608f6"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0032 \u00B7 A rule computes what it concludes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0032-a-rule-computes-what-it-concludes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49e2b8bbf71c647f35146ff201e30a9f27c84de01bfb52de6965a3c27874cbe"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0033 \u00B7 RSS summaries are scoped to the source being listed: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0033-rss-source-summaries-are-source-scoped.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dfdb76e8a58bf70e009cbb1ffdd4c1e9d1079eab6f4bd0dd4033adae1ecc66d1"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0034 \u00B7 An action is a declared call: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0034-an-action-is-a-declared-call.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b305196c1866d73cd065ab83e98d2a2499103c34b6845c02f8898c8ff98165"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0035 \u00B7 A vector index is built by a job: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0035-a-vector-index-is-built-by-a-job.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d762ad753db021c08a73ac570dfaa06aec4b60f98f366fdf10fb7364f0b1088"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0036 \u00B7 Exploration aligns a schema to the ontology: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0036-exploration-aligns-a-schema-to-the-ontology.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf1cf197de3b94a9d25db524c094ccf7659549d1178a62da00dedc3da681c89b"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0037 \u00B7 A relation carries its own attributes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0037-a-relation-carries-its-own-attributes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bd1bdf2fe5344ab935c0469cbe958d11edf1962c4d6ffbedd222f1cd8a072db"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0038 \u00B7 The interface has a light side: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0038-the-interface-has-a-light-side.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eec5378678ba17804fc64165662ec79f53e529f14fb9e2f339414cf4799126a"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0039 \u00B7 A chunk is what extraction sees: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0039-a-chunk-is-what-extraction-sees.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a837810d3d449509a09d1e315a078f79457d11d494bac876f2cec370c146b8ea"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0040 \u00B7 A chunk says where its words came from: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0040-a-chunk-says-where-its-words-came-from.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac92a3957f08dbe12aaaf0e2add5dbfef82402d5fe6aef43e9ad5a13dd49308"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0041 \u00B7 A name is a claim about an entity: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0041-a-name-is-a-claim-about-an-entity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f5d2229fbae46303bc8ac21b797ce0022c36bd5b3297ba8449b46261901d0d0"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0042 \u00B7 The chat loop is a runner with hooks: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0042-the-chat-loop-is-a-runner-with-hooks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8b5864d869a44a87bc3072ea7a5fbc92adbb75578b8776f17235b8cd74287d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0043 \u00B7 Every review queue is governed: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0043-every-review-queue-is-governed.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e434d7b7e73afe197a959ccf3bcccdec2e7e30d392b888c3f7a98d1235bf034"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0044 \u00B7 The ontology is a view over what documents say: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0044-the-ontology-is-a-view-over-what-documents-say.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"13c5fa3e24254133a844b8d4c4020b7468e86fc0550c72f65f7767cc51c7c049"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0045 \u00B7 A time mention is resolved against its document: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0045-a-time-mention-is-resolved-against-its-document.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f997d302fb791e48c95b1ad3c1542e2ab811864834aff32e6c4813fd9e8bc7f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0046 \u00B7 The app surface is MCP: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0046-the-app-surface-is-mcp.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d78e9aa2db778668c8e0b69af6fb923d3c220b5f780c9db41ea3d50a4c9e68ad"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0047 \u00B7 A rule may conclude a relation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0047-a-rule-may-conclude-a-relation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b17b9973990df66e9a909b8d5ec3def52aed628c753599bf0688ecdf9fcde7f"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0048 \u00B7 Provenance references stay inside the knowledge base: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0048-provenance-references-stay-inside-the-knowledge-base.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"487a04d54c2573a0dfb95d21d85422543f8fea6b9ff16a1d31e190da2bdcad5c"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0049 \u00B7 Expression declarations are checked when a rule is written: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0049-expression-declarations-are-checked-when-a-rule-is-written.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffde8725030917af34d119371b0b817abc108b284610bc26ca9b05471fe53896"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0050 \u00B7 An action attempt keeps its identity and uncertain outcome: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0050-an-action-attempt-keeps-its-identity-and-uncertain-outcome.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2881a11d3cc0d69a3307037297adce55450e31679b10f36947a447922ed7710"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0051 \u00B7 A human phrase decision carries its materialization work: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0051-a-human-phrase-decision-carries-its-materialization-work.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2c62233c61e4336076f4e74b2deda2e5084273bc6bf57c6917522e12b25229d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0052 \u00B7 Document content is a read contract over the retained ledger: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0052-document-content-is-a-read-contract.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b3f86465cd3949ce00d1adfce138fcd113cd5ee771a540a1101515477b8d93"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0053 \u00B7 A phrase decision records the inputs it considered: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0053-a-phrase-decision-records-the-inputs-it-considered.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"838c18ad7a7a344829851ef8226b87c1cefc67733e729fc2cd4de199e60e60eb"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0054 \u00B7 A source may push statements in the open contract: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0054-a-source-may-push-statements-in-the-open-contract.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d988ac9cc8a14505be6418db72382a7110b542f901b3979bfb53f86630517882"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0060 \u00B7 A rule\u0027s definition has a history: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0060-a-rule-definition-has-a-history.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c36c68fe44f4961d505d46b7c21ce2231f2b3196f6e0e283b83c3416ec5ea488"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0061 \u00B7 The ontology is proposed from the open graph and judged by its questions: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0061-the-ontology-is-proposed-from-the-open-graph-and-judged-by-its-questions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41a206d03c4be2c3c29e6877b289e872e9b21aa0581f6bf09a8be87b920621e"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0062 \u00B7 The export says what is contested: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0062-the-export-says-what-is-contested.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efd3478ed84f8a26b1f73f2e0013d99ed4f8eb9cfe8bb0ec51b0ba6d1b4da82"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0063 \u00B7 Stopping a chat ends the generation: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0063-stopping-a-chat-ends-the-generation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"32ce8149012cd8f744ee7ccb45d6c52e98033d9127cc239164311533d1e11bd9"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0064 \u00B7 Extraction reads time as it goes: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0064-extraction-reads-time-as-it-goes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e45118b852538435f7414b2a7d25c82fd0f78411e98d9dd0b32da1d12073495"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0065 \u00B7 The OCR reader chooses its provider: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0065-readers-choose-their-provider.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a9e8c179eaf83755457f5e1c593a97a9da2bf10631f2bd3244ecd375462f678"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0066 \u00B7 Another app may trade a fresh ID token for a session: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0066-another-app-may-trade-a-fresh-id-token-for-a-session.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3c51ec318fe0c54ae9956e656bcfd6ed6f4ec11bbb6704ee6d0f6d84d254d3"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0069 \u00B7 The identity provider vouches for listed domains: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0069-the-identity-provider-vouches-for-listed-domains.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"0742b4af2d473983e24dc5610bbaa1a0fbc2af25193f65e480a230147cd597fc"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0070 \u00B7 A role word speaks while its chunk is live: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0070-a-role-word-speaks-while-its-chunk-is-live.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"86e4627c7e936a850f967ca541f27ac1b0be19f1d87c7be809a2d165b44ce45d"}},{"ruleId":"D7","level":"note","message":{"text":"Classify ADR enforcement: 0071 \u00B7 A source may declare its names identities: This record carries no \u0060enforcement:\u0060 field, so nothing says whether the decision is checked by anything or is upheld by convention alone \u2014 and an unclassified record is counted as UNENFORCED in this dimension\u0027s score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or \u0060enforcement: analyzer|test\u0060); if it\u0027s a design decision, mark \u0060enforcement: not-applicable\u0060 so it isn\u0027t counted as unenforced."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0071-a-source-may-declare-its-names-identities.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d612b17030a3a147d74b4d2ea4ff318e7ba3067dffd426ccb1fe236a66c3fd23"}},{"ruleId":"D8","level":"warning","message":{"text":"Coverage not measured \u2014 JavaScript/TypeScript suite: Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured \u2014 web/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov \u2014 add \u0060@vitest/coverage-v8\u0060 (or \u0060@vitest/coverage-istanbul\u0060) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository\u0027s maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"62e63e619c28f057e129f2997c965d32a457366a9ce18ca019ffb6bdfba85c99"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: preserves the HTTP status and code for an already-running conversation: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 0 real object(s) of its own, and its only verification is 4 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":"web/src/chatStream.test.ts"},"region":{"startLine":57}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ebbe8be3ac580174c025d46dcc396a20a9fb6fa8e4f94b8e1efdacebcad6f9"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: reads the generation identity and stopped outcome on reattach=%s: This test sets up 8 test doubles (for example \u0060vi.fn\u0060) against 2 real object(s) of its own, and its only verification is 5 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":"web/src/chatStream.test.ts"},"region":{"startLine":123}}}],"partialFingerprints":{"codehealthFindingId/v1":"85cb686d19006456b7f65398bc97f2bffcf1ae3262c59bdf5c8dc67caceb8f6f"}},{"ruleId":"D10","level":"note","message":{"text":"Mock-dominated test: hands the stored id of the question to the page with the conversation: This test sets up 7 test doubles (for example \u0060vi.fn\u0060) against 1 real object(s) of its own, and its only verification is 3 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":"web/src/chatStream.test.ts"},"region":{"startLine":182}}}],"partialFingerprints":{"codehealthFindingId/v1":"49cda63d476ccbc7660f6b868f89d0dd217034c3651738c0f98a7187d866b141"}},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"354692e9b399bdd97973809bcc76410ab84655786f343227d0d6bfe7a7d29eb5"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"82e28f434fa0ea8353cf9048e1f80c495b2ae55a15b876aaa70e70b155fa27eb"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5183bf21b3934b0896aab2beeaea28c5f2be85dd43a54f6f709a453e6a9d55b2"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c3612edfb7bf06da229e2de366a0585aa53666719d94c20f60e0fb4b33b35b19"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b47ac4398e9f29a31899054c3ad5b985a0cba0c27c1fdfe6778076ea2f782818"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"9746b07010d4df5543b5a08c327806ee59b79fa63b7551572281c10c7a6357e6"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"83ff98b1bbe654bfe5e42751005e2250b91507f212de7cf32d926556b7e16085"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D13","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"404e3fdf6e6df45b12927967a0707e84f880d94d25c798f6fbc2fe422effd321"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Graph.tsx: web/src/pages/Graph.tsx changed 68 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 242 in Graph.Graph at line 268. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Graph.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":"web/src/pages/Graph.tsx"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be8932053483c86974efc4eb8b1859c343094cbb2541d01a8504836d6440a92"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Chat.tsx: web/src/pages/Chat.tsx changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 122 in Chat.Chat at line 112. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Chat.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":"web/src/pages/Chat.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6efac7b48e10f9373f8692e03f9d753063cae20a1e42ec4a260055ae7b1b892"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-store/src/graph.rs: crates/utopia-store/src/graph.rs changed 82 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in utopia_store::graph::insert_fact_on at line 595. 2 of those changes were fix/bug commits, and the other 80 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-store/src/graph.rs\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":"crates/utopia-store/src/graph.rs"},"region":{"startLine":595}}}],"partialFingerprints":{"codehealthFindingId/v1":"afc5c11a03043b86d5c308e8589d61e0653cb79f6d222118946541246b41b35a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Review.tsx: web/src/pages/Review.tsx changed 46 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in Review.Review at line 1351. 1 of those changes was a fix/bug commit, and the other 45 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Review.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":"web/src/pages/Review.tsx"},"region":{"startLine":1351}}}],"partialFingerprints":{"codehealthFindingId/v1":"f944ad569dd4925a0d193b901327e723b16d8f79f938ff447fccf400fd113543"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Ontology.tsx: web/src/pages/Ontology.tsx changed 58 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 66 in Ontology.Ontology at line 135. 2 of those changes were fix/bug commits, and the other 56 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Ontology.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":"web/src/pages/Ontology.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e51663e78b126ea5acd7dcc6a44175ab823ac34507b192a5952856a93fb539f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/api.ts: web/src/api.ts changed 128 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in api.consumeChatStream at line 2894. 2 of those changes were fix/bug commits, and the other 126 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/api.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":"web/src/api.ts"},"region":{"startLine":2894}}}],"partialFingerprints":{"codehealthFindingId/v1":"54feb854eb89ad068a74f60e727d483daeb053b4622aa201eca8bfe34c8a8c75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/api/chat.rs: crates/utopia-server/src/api/chat.rs changed 60 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 58 in utopia_server::api::chat::chat at line 676. 2 of those changes were fix/bug commits, and the other 58 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/api/chat.rs\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":"crates/utopia-server/src/api/chat.rs"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"104c431a57d0b77a2dbe9967b9579cf1a97dd4953e4a0f9c3c16c4ec6a0c6085"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Library.tsx: web/src/pages/Library.tsx changed 42 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 81 in Library.SourceModal at line 1325. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Library.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":"web/src/pages/Library.tsx"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba37f6532bfc7aa211c761a111c93a3630820fb4feaf236b8f8e2f2594118c89"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/phrase_alignment.rs: crates/utopia-server/src/phrase_alignment.rs changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 84 in utopia_server::phrase_alignment::align_phrases_locked at line 727. 1 of those changes was a fix/bug commit, and the other 22 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/phrase_alignment.rs\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":"crates/utopia-server/src/phrase_alignment.rs"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aace1da4be7f627c2690c6dd4d27f9a136e8d806eb40c0bd56d36519f269022"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Settings.tsx: web/src/pages/Settings.tsx changed 34 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 51 in Settings.Settings at line 900. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Settings.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":"web/src/pages/Settings.tsx"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"d88484483df141ae5d4459aa8267a354ba84170ced33b476762bbc095d4aa74b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/OntologySchemaGraph.tsx: web/src/pages/OntologySchemaGraph.tsx changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 78 in OntologySchemaGraph.OntologySchemaGraph at line 579. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/OntologySchemaGraph.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":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"54307d9824489e5fdf4c7f8a095d16267ce135438e730e09f422d3c5bc6fa017"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/main.rs: crates/utopia-server/src/main.rs changed 53 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in utopia_server::dispatch at line 360. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/main.rs\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":"crates/utopia-server/src/main.rs"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"3539d4ea64564a53f227caabff8b9ce36b2c063dea59032aa9e81cd873592661"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-ingest/src/parsers.rs: crates/utopia-ingest/src/parsers.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 63 in utopia_ingest::parsers::docx_xml_to_text at line 252. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-ingest/src/parsers.rs\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":"crates/utopia-ingest/src/parsers.rs"},"region":{"startLine":252}}}],"partialFingerprints":{"codehealthFindingId/v1":"f92ce12b146057a8559b5b262a527b0529f054ead5bd9514a5235d7a1af4f6a1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-store/src/resolution.rs: crates/utopia-store/src/resolution.rs changed 62 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in utopia_store::resolution::resolve_by_name at line 439. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-store/src/resolution.rs\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":"crates/utopia-store/src/resolution.rs"},"region":{"startLine":439}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fdf86e8c29ea6686dbf6d72892da522aa3c388efefab4e2c09dd709f00481a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-extract/src/lib.rs: crates/utopia-extract/src/lib.rs changed 51 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in utopia_extract::scan_quantity at line 469. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-extract/src/lib.rs\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":"crates/utopia-extract/src/lib.rs"},"region":{"startLine":469}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8a2866988b02a6891f9ed27cfb6ed2b5497686d6e7c00d76b840a7056af7240"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/ui/index.tsx: web/src/ui/index.tsx changed 41 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in index.MultiSearchSelect at line 482. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/ui/index.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":"web/src/ui/index.tsx"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"542f8f449ea6aa6395979a521fc12b9eddd4ec00b7f2f9587da9ecc37574ea75"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-store/src/reasoning.rs: crates/utopia-store/src/reasoning.rs changed 38 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in utopia_store::reasoning::resolve at line 2071. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-store/src/reasoning.rs\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":"crates/utopia-store/src/reasoning.rs"},"region":{"startLine":2071}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ed9861ad53a97eedadcad5d0df0c6a04582152c890fbfc96fa641d25c674820"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/KbSettings.tsx: web/src/pages/KbSettings.tsx changed 26 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 38 in KbSettings.KbSettings at line 86. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/KbSettings.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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"8db5c65a41f69433cbee51a5aa45d57d09ec4fc998d07c5dd7098e36add733d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/extraction_open.rs: crates/utopia-server/src/extraction_open.rs changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in utopia_server::extraction_open::apply_open_extraction at line 242. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/extraction_open.rs\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":"crates/utopia-server/src/extraction_open.rs"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf384bd55579eb03856f9b4081d117ffde305e5714a8d0dc2e23e9cccdd1d92e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-store/src/ontology.rs: crates/utopia-store/src/ontology.rs changed 52 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in utopia_store::ontology::update_relation_type at line 798. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-store/src/ontology.rs\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":"crates/utopia-store/src/ontology.rs"},"region":{"startLine":798}}}],"partialFingerprints":{"codehealthFindingId/v1":"883a757b01fd9859db8f74ff585186b9ab9823970d8b8049805e1be78b7e1175"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-ingest/src/ontology_rdf.rs: crates/utopia-ingest/src/ontology_rdf.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in utopia_ingest::ontology_rdf::project 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-ingest/src/ontology_rdf.rs\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":"crates/utopia-ingest/src/ontology_rdf.rs"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d5a3bfdad05d90c55f784b8da452787ed057531bfebab82e887c87a6a1ca3bc"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/api/tools.rs: crates/utopia-server/src/api/tools.rs changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in utopia_server::api::tools::get_document at line 375. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/api/tools.rs\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":"crates/utopia-server/src/api/tools.rs"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"93850d753fdafa316dc3e6dd1019e9f4e6fb5a427d7f7f0c6eb19ef6abe88c71"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-llm/src/lib.rs: crates/utopia-llm/src/lib.rs changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in LlmClient::chat_tools_stream_with at line 958. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-llm/src/lib.rs\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":"crates/utopia-llm/src/lib.rs"},"region":{"startLine":958}}}],"partialFingerprints":{"codehealthFindingId/v1":"1298bf68ef7efaaf67efbb90569073dd298a29f63534da923bb3cc87dd03e0bf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/owl_import.rs: crates/utopia-server/src/owl_import.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in utopia_server::owl_import::apply at line 406. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/owl_import.rs\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":"crates/utopia-server/src/owl_import.rs"},"region":{"startLine":406}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd624502511c7c025885b75f27c2ee72d8ab0b3d1f6e6ea9b6b0c1cc596a3ba6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/ontology_agent.rs: crates/utopia-server/src/ontology_agent.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 67 in utopia_server::ontology_agent::propose_locked at line 117. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/ontology_agent.rs\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":"crates/utopia-server/src/ontology_agent.rs"},"region":{"startLine":117}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f0b99bb7194cbacd95255e1d093145a5dcd2b753af16375b59fb83867b2fa8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/RulesPanel.tsx: web/src/pages/RulesPanel.tsx changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in RulesPanel.RulesPanel at line 327. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/RulesPanel.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":"web/src/pages/RulesPanel.tsx"},"region":{"startLine":327}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a1967535c25e7aea1cb33093a22e43aef483e236d967508f1cfaf379fbdc43"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Docs.tsx: web/src/pages/Docs.tsx changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Docs.DocsPage at line 107. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Docs.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":"web/src/pages/Docs.tsx"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49b288c015f0f087930e19785e215cad33f38a78a3b150544ba733b979196e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/rdf.rs: crates/utopia-server/src/rdf.rs changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in utopia_server::rdf::emit_fact at line 460. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/rdf.rs\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":"crates/utopia-server/src/rdf.rs"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"67257c86901c1837242d981219e155fd208591e7cbe3652355523d4b8c31df20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/time_resolution.rs: crates/utopia-server/src/time_resolution.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 42 in utopia_server::time_resolution::resolve_document at line 456. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/time_resolution.rs\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":"crates/utopia-server/src/time_resolution.rs"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"152ae7673d7e44e69b066432a3b93c98955a45be0e63e8d7fddd4f4de608b04a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/bench/temporal.mjs: scripts/bench/temporal.mjs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 76 in temporal.main at line 108. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/bench/temporal.mjs\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":"scripts/bench/temporal.mjs"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"15e28ffcb2914be55e61f408f6743365175bd37301abe2210eddee1e53722026"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/api/sources_routes.rs: crates/utopia-server/src/api/sources_routes.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in utopia_server::api::sources_routes::validate_statements_payload at line 682. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/api/sources_routes.rs\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":"crates/utopia-server/src/api/sources_routes.rs"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"04336e9e5f94a57ce9c687645e495bb05ced8192eb48748e5573ba3755280dff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-reason/src/derive.rs: crates/utopia-reason/src/derive.rs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in utopia_reason::derive::contradictions at line 588. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-reason/src/derive.rs\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":"crates/utopia-reason/src/derive.rs"},"region":{"startLine":588}}}],"partialFingerprints":{"codehealthFindingId/v1":"126ce2d46fe59d58283a8b95e835b246d8a622bfbf33ae0910a9e71e6f3b590e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/DocViewer.tsx: web/src/pages/DocViewer.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in DocViewer.DocViewer at line 23. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/DocViewer.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":"web/src/pages/DocViewer.tsx"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc20ff19b711015de34cd647394c178d9af6f3427ce8fe1fd5112cc61d7ce2e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/type_alignment.rs: crates/utopia-server/src/type_alignment.rs changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in utopia_server::type_alignment::align_types_locked at line 161. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/type_alignment.rs\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":"crates/utopia-server/src/type_alignment.rs"},"region":{"startLine":161}}}],"partialFingerprints":{"codehealthFindingId/v1":"448f95eee8980e44b7385e6002efe0ae899a87ca51ee565c494ed04418075a46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-ingest/src/table.rs: crates/utopia-ingest/src/table.rs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in utopia_ingest::table::render_rows at line 476. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-ingest/src/table.rs\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":"crates/utopia-ingest/src/table.rs"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec0eec10ce69bfd64c03e29f2541f25c311acc6c65e881bbb9c2878177745a85"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/api/tools_graph.rs: crates/utopia-server/src/api/tools_graph.rs changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in utopia_server::api::tools_graph::paths_between at line 1221. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/api/tools_graph.rs\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":"crates/utopia-server/src/api/tools_graph.rs"},"region":{"startLine":1221}}}],"partialFingerprints":{"codehealthFindingId/v1":"4033f73341d5f23e53001eb5610156e82269ed6dd625b35cf868cdd97fb83146"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/pipeline.rs: crates/utopia-server/src/pipeline.rs changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in utopia_server::pipeline::run at line 118. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/pipeline.rs\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":"crates/utopia-server/src/pipeline.rs"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"1aba9973429b03cd5ef8db684e416d35ff9502266867215b2af834ad44208459"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-store/src/governance.rs: crates/utopia-store/src/governance.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in utopia_store::governance::name_shape at line 315. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-store/src/governance.rs\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":"crates/utopia-store/src/governance.rs"},"region":{"startLine":315}}}],"partialFingerprints":{"codehealthFindingId/v1":"b802aac2961c13d1fd6f9a06fa285c1c26b1c277851da3cc830b7c8fb0df2398"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/governance.rs: crates/utopia-server/src/governance.rs changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in utopia_server::governance::rounds at line 168. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/governance.rs\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":"crates/utopia-server/src/governance.rs"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"585eeb61907584be07b4d62f9f450cf2dc18cb5b9c38b93b73690d30d5e366a5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/mappings.rs: crates/utopia-server/src/mappings.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in utopia_server::mappings::explore at line 211. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/mappings.rs\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":"crates/utopia-server/src/mappings.rs"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"7345439caebf9cb343dc1b3109dcb088362b1d9f5bea624db9a45ce4ed8490ab"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/ingest_sources.rs: crates/utopia-server/src/ingest_sources.rs changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in utopia_server::ingest_sources::ingest_item_with_outcome at line 257. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/ingest_sources.rs\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":"crates/utopia-server/src/ingest_sources.rs"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"c102f73bdd18ba95597078df3e592340f8b31381b4b42393dc489637228bb793"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/type_resolution.rs: crates/utopia-server/src/type_resolution.rs changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in utopia_server::type_resolution::resolve_with at line 484. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/type_resolution.rs\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":"crates/utopia-server/src/type_resolution.rs"},"region":{"startLine":484}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7a452219aaae5e89802e5e0e11ba84fc3a9cf852453fa6af652bb855917e117"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/bench/run.mjs: scripts/bench/run.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in run.main at line 105. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/bench/run.mjs\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":"scripts/bench/run.mjs"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a6bf3db7eaf87d7125bcaa46885e6e8720f6ee12a7872293a9c6d62ad3772f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/MyKbs.tsx: web/src/pages/MyKbs.tsx changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in MyKbs.MyKbs at line 43. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/MyKbs.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":"web/src/pages/MyKbs.tsx"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97d8087143bde7ca0a1ab17f166d02eba6dfa89d820220924828c3ccc48e15d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Members.tsx: web/src/pages/Members.tsx changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in Members.Members at line 121. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Members.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":"web/src/pages/Members.tsx"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"eab6b7deeefd7f7e279d611ed1bd3d1cf942239e5aef1bd74b5b513d7d7a2714"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/bench/typed.mjs: scripts/bench/typed.mjs changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in typed.score at line 320. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/bench/typed.mjs\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":"scripts/bench/typed.mjs"},"region":{"startLine":320}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0768c229b8af8aea4f6e1400c70bc7fd087bab1e7ff2234e34f8c77269a2e46"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Mappings.tsx: web/src/pages/Mappings.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Mappings.Mappings at line 87. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Mappings.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":"web/src/pages/Mappings.tsx"},"region":{"startLine":87}}}],"partialFingerprints":{"codehealthFindingId/v1":"be300b0ade56fc5854fe82e931414ea5a812b5ab96cf9607be33a161aaadaf87"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-extract/src/open.rs: crates/utopia-extract/src/open.rs changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in utopia_extract::open::salvage at line 365. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-extract/src/open.rs\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":"crates/utopia-extract/src/open.rs"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f4964a1a541f84acf1e386028f6da50048d694acaa0ecf4b3e8aac999db0a8f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/adjudication.rs: crates/utopia-server/src/adjudication.rs changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in utopia_server::adjudication::adjudicate_entities at line 167. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/adjudication.rs\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":"crates/utopia-server/src/adjudication.rs"},"region":{"startLine":167}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9eb6152425d5fdd78fd8e9e2c512b5099e1ffd7bf43d0e69b71128ff8e15b79"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Tokens.tsx: web/src/pages/Tokens.tsx changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in Tokens.Tokens at line 199. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Tokens.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":"web/src/pages/Tokens.tsx"},"region":{"startLine":199}}}],"partialFingerprints":{"codehealthFindingId/v1":"0788f0105bd34c7724e4dfe848890a02a0f9a8946e05485cd43ad968678ca778"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/Login.tsx: web/src/pages/Login.tsx changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Login.Login at line 32. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/Login.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":"web/src/pages/Login.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba458d3572eeeaee4a4f6d7844b60220a39baa101fbac1b3d1fe1bc770c14d4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-reason/src/rules.rs: crates/utopia-reason/src/rules.rs changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in utopia_reason::rules::joined_evaluate at line 441. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-reason/src/rules.rs\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":"crates/utopia-reason/src/rules.rs"},"region":{"startLine":441}}}],"partialFingerprints":{"codehealthFindingId/v1":"493d2c70a8f731ca10374a422fcefaf5e2fac754e8539d552e09da2f1463e897"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/bench/recall.mjs: scripts/bench/recall.mjs changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in recall.score at line 97. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/bench/recall.mjs\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":"scripts/bench/recall.mjs"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"660155d2b4774ffcb407398e7f0e2db3e75dd0aa027e93a207151855db1a047b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/ontologyTables.tsx: web/src/pages/ontologyTables.tsx changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in ontologyTables.OntologyTables at line 511. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/ontologyTables.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":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1d7bab5590c7bc00ce6f0ff61273357c80e4d573c4d706abb08595755795810"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/bench/ask.mjs: scripts/bench/ask.mjs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 45 in ask.main at line 202. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/bench/ask.mjs\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":"scripts/bench/ask.mjs"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7bf4ddf61ebf782c4838357d0a9f2e1df9ad5330c138a91537dd6dd96b60280"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-ingest/src/chunker.rs: crates/utopia-ingest/src/chunker.rs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in utopia_ingest::chunker::units at line 84. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-ingest/src/chunker.rs\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":"crates/utopia-ingest/src/chunker.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"403a5793354628a1081a16650891d565306d250cffd668e5ad86b1df71466c72"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-store/src/errata.rs: crates/utopia-store/src/errata.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in utopia_store::errata::record at line 379. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-store/src/errata.rs\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":"crates/utopia-store/src/errata.rs"},"region":{"startLine":379}}}],"partialFingerprints":{"codehealthFindingId/v1":"864cc6c621855f4d610ff64ad1a90e9e5b2f5124ee9ed1d5fa165fd1441824b4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: web/src/pages/ontologyDialogs.tsx: web/src/pages/ontologyDialogs.tsx changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in ontologyDialogs.PropertyDialog at line 290. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- web/src/pages/ontologyDialogs.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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"732cb6d5caa269ef9184a20388dbb78c2c80f78e4d9b3c558e08afb2233dfaaf"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/time_text.rs: crates/utopia-server/src/time_text.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in utopia_server::time_text::span at line 89. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/time_text.rs\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":"crates/utopia-server/src/time_text.rs"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"b50a00a57309b93ed35f1e992e411a8b44b5bd3631b1a2929225da0eb5a14e99"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/webdav.rs: crates/utopia-server/src/webdav.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in utopia_server::webdav::parse_multistatus at line 59. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/webdav.rs\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":"crates/utopia-server/src/webdav.rs"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee64851be9a910828ba9ad30692858a48edb8d796b90e7fc2cf3c2b3534b0ab6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-extract/src/ontology_agent.rs: crates/utopia-extract/src/ontology_agent.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in utopia_extract::ontology_agent::parse_proposal_response at line 294. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-extract/src/ontology_agent.rs\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":"crates/utopia-extract/src/ontology_agent.rs"},"region":{"startLine":294}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a55cdbe42f0d2ec4b361c69971d556c41bc6a644d5d17dee9945f17ef67a0ff"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/api/rig_model.rs: crates/utopia-server/src/api/rig_model.rs changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in utopia_server::api::rig_model::push_message at line 284. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/api/rig_model.rs\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":"crates/utopia-server/src/api/rig_model.rs"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"09d450362cfda4a07f5d229b76636538c1ee08b9b957b399eec811e1f293c078"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/bench/timewords.mjs: scripts/bench/timewords.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in timewords.run at line 29. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/bench/timewords.mjs\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":"scripts/bench/timewords.mjs"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"c04e52dda47357a2a3f6fa14cb23dd1c14b6a6ad677c70249069eec76d26d5e7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/implication.rs: crates/utopia-server/src/implication.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in utopia_server::implication::propose_rules at line 35. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/implication.rs\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":"crates/utopia-server/src/implication.rs"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2a2bb82490635f77083ffadab3c5c1a7d6916448ce15d6d731c33e09b3cb6c1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/query_engine/snowflake.rs: crates/utopia-server/src/query_engine/snowflake.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in SnowflakeEngine::run at line 68. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/query_engine/snowflake.rs\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":"crates/utopia-server/src/query_engine/snowflake.rs"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f01eab77612d6d17029609fcb3d92e241820efdf28c4090b261318e9a6aee83"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: crates/utopia-server/src/api/export_routes.rs: crates/utopia-server/src/api/export_routes.rs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 22 in utopia_server::api::export_routes::export at line 39. 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-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- crates/utopia-server/src/api/export_routes.rs\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":"crates/utopia-server/src/api/export_routes.rs"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"5599bbdaad6aa2afc6567a4d9333e4746366032536644f64fc522ac6f5be51c6"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: scripts/bench/competency.mjs: scripts/bench/competency.mjs changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in competency.main at line 56. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-22..2026-10-20, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-07-22 13:06:52 \u002B08:00\u0027 --until=\u00272026-10-20 13:06:52 \u002B08:00\u0027 --full-history --no-merges -- scripts/bench/competency.mjs\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":"scripts/bench/competency.mjs"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e6fe42920689b17c6d5a2768488567f975e4b153c79abead2e336e6814a63a"}},{"ruleId":"D16","level":"note","message":{"text":"Off-boarding risk: anonymized user #1: If anonymized user #1 becomes unavailable, 54 significant file(s) lose their only recent owner: web/src/ui/index.tsx, crates/utopia-reason/src/lib.rs, web/src/pages/OntologySchemaGraph.tsx, crates/utopia-server/src/governance.rs, crates/utopia-server/src/type_resolution.rs, web/src/pages/KbSettings.tsx, crates/utopia-server/src/extraction.rs, web/src/pages/ontologyDialogs.tsx (\u002B46 more). Pair on, review, or document these before any departure."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"b4a006c1b53eff0881e7ffb656cea48ec920f57209129988d4d00bfb3355ef72"}},{"ruleId":"D16","level":"note","message":{"text":"Further sole-owners (lower concentration): 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold \u2014 folded into the bus-factor score and metrics (59 single-owned of 244 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 244 of the 295 production source files in this repository met that bar). They are anonymized user #2 (4 file(s)), anonymized user #3 (1 file(s)) \u2014 spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: crates/utopia-server/src/webdav.rs, crates/utopia-server/src/api/chat_finalization.rs, crates/utopia-server/src/api/chat_context.rs, web/src/pages/ExpressionDraftEditor.tsx, crates/utopia-server/src/docs_corpus.rs."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6eac528f2429e724e1a97ed868f79eefbcf1888dab4af9a9e673429369bb5b2f"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0001-ontology-import-and-governance.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0001-ontology-import-and-governance.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8550f88025490879e2ebec43342ac0216c543c833e7d43f77a1e1606e7f760d"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0002-reasoning-engine.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0002-reasoning-engine.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f44070a823d27dfe48e825b845eac18783f322357d68247e586f45a8727179e"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0003-ontology-growth-loop.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0003-ontology-growth-loop.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fabcddf234eeaa8a69052abf98babc1fe5d4cd25a4b3f80f7573e9fc767b2911"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0004-language-and-localization.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0004-language-and-localization.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"55901f58d1717d52408f44b5b1c2d6c52e9496aab54a070884b17d383ba49f7c"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0005-alert-center.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0005-alert-center.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc3c2a67ffb34e800ea1daad4774b9fb9b8ffe66f32d136f01c1524014d50e9"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0006-ontology-scale-and-the-prompt.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0006-ontology-scale-and-the-prompt.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ec03c27cfd41afc8c6412c76cf3f22629a143f0dc77dd95ba22b332a90e978"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0007-who-decides-what-becomes-a-relation.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0007-who-decides-what-becomes-a-relation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed7689782b4d3e2b847b7c2b4f4b854a6c6b507e24f67f6a8a384e62ef7302e"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0008-ontology-packs-as-cold-start.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0008-ontology-packs-as-cold-start.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"964ea5e142e59aebea8c2197a30901ce192f648fd73a078d12ab0d2d476f0422"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0009-no-type-is-a-type.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0009-no-type-is-a-type.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff7a2e7516fab8841c4a8a0049f36d4eadd7e73088494e711a0cc48d29da9903"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0010-no-relation-is-no-relation.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0010-no-relation-is-no-relation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43eb5a1a3ad0f8273e7398b97a50207678334882ded76a0be7e277dee07e4b5"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0011-a-mapping-is-not-a-fact.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0011-a-mapping-is-not-a-fact.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cf0ddeb81a03537b5c5ca7054d4f01b587cdb8bcb03c0db5598fb322b2aa6ba"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0012-the-ontology-is-a-contract-not-a-suggestion.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0012-the-ontology-is-a-contract-not-a-suggestion.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"044b9ae54da2f1c3559188fe973e5b7961e3e94c355b21a5a2db69ce0a992e84"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0013-a-source-should-hand-over-its-history.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0013-a-source-should-hand-over-its-history.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cd5d2d7113c2c66648a4264245e44669bce64cd5a0d735ed9c5ba87fbac8bf5"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0014-identity-from-the-person-scope-from-the-token.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0014-identity-from-the-person-scope-from-the-token.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"383eb1a967d695f4397003e27a72709609978a7684a85697e9fa1f8d2739d74c"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0015-recording-a-sentence-is-not-asserting-a-fact.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0015-recording-a-sentence-is-not-asserting-a-fact.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"82958f62ee44501364583312fa709c941f0d5f86616a34d5d18f6134fd13c586"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0017-a-contradiction-points-upstream.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0017-a-contradiction-points-upstream.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ef2805fd7140148578c7676331afc5007f29123a23f9905afb42b0beb77199b"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0021-a-rule-reads-attributes-and-concludes-a-type.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0021-a-rule-reads-attributes-and-concludes-a-type.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9991b7a6cf08cddd7d9d5cfe3d2adf0afee7c839a9039a3affa45a6c3e7fd526"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0022-an-unknown-date-is-not-an-open-one.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0022-an-unknown-date-is-not-an-open-one.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ab964aef2ad271238e8acd3ae9869052ebb2191baff06e9582577937bc4022d"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0024-the-world-axis-reaches-the-second.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0024-the-world-axis-reaches-the-second.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03228ed0a809cffaf97c509640c90a6be214a14f8a51388ea57b71491bd823e4"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0025-governance-reads-the-ledger-before-it-decides.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0025-governance-reads-the-ledger-before-it-decides.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7bb1b6afd1fb400034190e0201910e26076fcee5bec19f6b92aca0d932390f4"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0026-a-decision-records-why.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0026-a-decision-records-why.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f671cf17751c90913752eb52822ae14d4492543344d1e4b70bddab382a5a1f0"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0027-an-automatic-merge-is-gated-by-what-it-can-undo.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0027-an-automatic-merge-is-gated-by-what-it-can-undo.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dddff42e278055855620f6e4684043e58735725613049fbbea957050d2473aca"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0028-the-adjudicator-looks-before-it-asks.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0028-the-adjudicator-looks-before-it-asks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf9ccbb165d96a27f68664900b12b50501d5703a635449b15863c01dd45b4863"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Decision section: docs/decisions/0029-a-rule-may-say-or-once.md has no Context and Decision section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0029-a-rule-may-say-or-once.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"db845c639f791784ee8bcd8d0ce0f0936c8a29e5a7d41ba0f0bf45a9b275e264"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0031-an-event-holds-at-the-moment-it-names.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0031-an-event-holds-at-the-moment-it-names.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c93112f84f8a6a32248ac56b50981dc2f7f5bfa9b5a660925158f0b8b216b714"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Decision section: docs/decisions/0032-a-rule-computes-what-it-concludes.md has no Context and Decision section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0032-a-rule-computes-what-it-concludes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d55c452f014c08eb722740a58030baa14302069304c395aba1da4cf59913562"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0035-a-vector-index-is-built-by-a-job.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0035-a-vector-index-is-built-by-a-job.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f5a4e3c83030f46bfdff8bf34570f62c5b453e91912257474dfe5362e945632"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0036-exploration-aligns-a-schema-to-the-ontology.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0036-exploration-aligns-a-schema-to-the-ontology.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d84b39802d122fd819f01256a9d8616c72dbdd7937874a79a91ecb15dd27d23"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0037-a-relation-carries-its-own-attributes.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0037-a-relation-carries-its-own-attributes.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6549a2574683958789c78505caf296331fe854f30a51457116361563eb0b2a18"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0038-the-interface-has-a-light-side.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0038-the-interface-has-a-light-side.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"58aa24e52276dd7e64468c3e733ff9c3b233952d363ececc0931aabbf1828d79"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0039-a-chunk-is-what-extraction-sees.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0039-a-chunk-is-what-extraction-sees.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74477a8993201bfe6cf41cabecbb8f3c715f9c7c1641360bde256f4b36f32912"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0040-a-chunk-says-where-its-words-came-from.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0040-a-chunk-says-where-its-words-came-from.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b805658975b5ceb81e74918f9e318e0db468d726ab9e5ea4fa2326f301bf14"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0041-a-name-is-a-claim-about-an-entity.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0041-a-name-is-a-claim-about-an-entity.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b9285b9ddfbe9e2ddebdbe217f2ef98be658f0ecbac4530279897ae7b96b4b9"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0042-the-chat-loop-is-a-runner-with-hooks.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0042-the-chat-loop-is-a-runner-with-hooks.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7df954b768b660e390279c2380d75f676faf0384d42228cb65e8c99d4b0c5f4"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0043-every-review-queue-is-governed.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0043-every-review-queue-is-governed.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b6760335bcd6f0bd68738fb827c29a839f62f774f6ce9fb5f111ad18b96d612"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Consequences section: docs/decisions/0044-the-ontology-is-a-view-over-what-documents-say.md has no Consequences section (a heading such as \u0060## Consequences\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0044-the-ontology-is-a-view-over-what-documents-say.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f4006990f5f9460e24a04b683d542dd17c92fd5c4792c4b035489acf1631bcf"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0045-a-time-mention-is-resolved-against-its-document.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0045-a-time-mention-is-resolved-against-its-document.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"489d4d10b87364a6fbf7f1ddc24d740a4d6f663e161a67d4d73b9a1edebbf5e6"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0047-a-rule-may-conclude-a-relation.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0047-a-rule-may-conclude-a-relation.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e56ef80b2de08d582a7e42a718d968509ade1fdd3acbd387d39198a5534fe7fe"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Decision and Consequences section: docs/decisions/0051-a-human-phrase-decision-carries-its-materialization-work.md has no Decision and Consequences section (a heading such as \u0060## Decision\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0051-a-human-phrase-decision-carries-its-materialization-work.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5aeb2d82ace56f8fb68edea900601a2943b53cf9912d3f5afca1bc0f90872533"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Consequences section: docs/decisions/0053-a-phrase-decision-records-the-inputs-it-considered.md has no Consequences section (a heading such as \u0060## Consequences\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0053-a-phrase-decision-records-the-inputs-it-considered.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a5941c59b295bd3ba25f20cb0a770ed9977839624a82f896d08c6cd5feea17c"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0060-a-rule-definition-has-a-history.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0060-a-rule-definition-has-a-history.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81a71a5d12e7adf2f6aa12cd7a7c6924bfa843b1ecdea08d9b9a7aab77ee0e5e"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Context and Consequences section: docs/decisions/0061-the-ontology-is-proposed-from-the-open-graph-and-judged-by-its-questions.md has no Context and Consequences section (a heading such as \u0060## Context\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0061-the-ontology-is-proposed-from-the-open-graph-and-judged-by-its-questions.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"03dc2e14e05ded62d47f99132f2216336ccb4ef67b8fe965ee6234a2f27b10f0"}},{"ruleId":"D20","level":"note","message":{"text":"ADR has no Consequences section: docs/decisions/0062-the-export-says-what-is-contested.md has no Consequences section (a heading such as \u0060## Consequences\u0060, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0062-the-export-says-what-is-contested.md"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"311db4363f6b1c078814d85e28950512cf110ac5a0c33373c3d5b8715111de23"}},{"ruleId":"D25","level":"note","message":{"text":"ADR not followed: 0003 \u00B7 The ontology grows out of the corpus: docs/decisions/0003-ontology-growth-loop.md:43 rules out \u0060functional\u0060, but production code uses it: web/src/api.ts:1276, web/src/api.ts:1416, web/src/api.ts:1464, web/src/pages/Ontology.tsx:1119, web/src/pages/Ontology.tsx:1275 (\u002B20 more). Remove the use, or supersede the record if the decision changed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0003-ontology-growth-loop.md"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"37061f515a570709b43842bd496a94219508af7dc59c5933519df545ecf6c096"}},{"ruleId":"D25","level":"note","message":{"text":"ADR not followed: 0015 \u00B7 A recorded sentence waits for a nod: docs/decisions/0015-recording-a-sentence-is-not-asserting-a-fact.md:48 rules out \u0060object_value\u0060 in facts, but production code uses it: web/src/pages/PendingFacts.tsx:25. Remove the use, or supersede the record if the decision changed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0015-recording-a-sentence-is-not-asserting-a-fact.md"},"region":{"startLine":48}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec00ca948942a690164414fabcafbb6e34b0118b62e271de8d3d1418ed4f19c"}},{"ruleId":"D25","level":"note","message":{"text":"ADR not followed: 0065 \u00B7 The OCR reader chooses its provider: docs/decisions/0065-readers-choose-their-provider.md:17 rules out \u0060ocr\u0060 in Pages, but production code uses it: web/src/pages/Settings.tsx:985, web/src/pages/Settings.tsx:1023, web/src/pages/Settings.tsx:1085, web/src/pages/Settings.tsx:1087, web/src/pages/Settings.tsx:1088 (\u002B5 more). Remove the use, or supersede the record if the decision changed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0065-readers-choose-their-provider.md"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1acf0a3f69c64e20ff7df87a5bb8a9af8715c41624fb59278aa21682539f87b"}},{"ruleId":"D25","level":"note","message":{"text":"ADR not followed: 0069 \u00B7 The identity provider vouches for listed domains: docs/decisions/0069-the-identity-provider-vouches-for-listed-domains.md:15 rules out \u0060email\u0060 in login, but production code uses it: web/src/pages/Login.tsx:36, web/src/pages/Login.tsx:48, web/src/pages/Login.tsx:49, web/src/pages/Login.tsx:131, web/src/pages/Login.tsx:132. Remove the use, or supersede the record if the decision changed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"docs/decisions/0069-the-identity-provider-vouches-for-listed-domains.md"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf0fe0c38afaf3eb88faaf2d1ce930d3f462d01de25766731729ce4feecac1e1"}},{"ruleId":"D26","level":"note","message":{"text":"Projects may be oversized for their cohesion: 3 of 11 project(s) overshoot their size bounds, lowering Project Cohesion to 4.5/10. The most over is \u0060crates/utopia-server\u0060 (48135 LoC, 253 module-visible types across 4 directories). Review these for cohesion \u2014 draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d5a94650dc74886a0f1f08eb9fb6775f1fc395279ef7e901c970c9d26f767a72"}},{"ruleId":"D28","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"b854f1d357377cc1111101f23ae7143595aa248db48c56611bda938c836a5a20"},"properties":{"commitSha":"2ecde857302e249cb0ace1f3bfd3a465abe57cac"},"taxa":[{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-540","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A01:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D28","level":"note","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3cdfd7beb31b791ae18dcb425e21eb157c842e7bbcd522cc330573c1a6538db1"}},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"fc29cfca53b0af2eb18e3f92605362c8a879854d27ee79108d9ef39b10471f08"},"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":"28f1946785258e7cd925d8fe89b9cc64b3b025b8b8357b16fcc161e93d0650d4"},"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":"f5bba60ddf22db4c4c30d83b65dc14e1c4f30f97dd927be8e412a31a68213cd7"},"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":"f9e0e756e8686003e30f0c5cbc44d5f20bc29da6ec3eafadca006a67f3583420"},"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":"c16d3c42af671ccd9a3f8c8fbfd8cb2e9b8098849255a038dbd3956faea1aafb"},"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":"4bddb174865a7ed8a92c9137857aa825b318b470ef0cb00d5ea9edaaf9d842da"},"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":"ba334be1b7d1ab01f0e5714a0ff84bebc1616ed3f6ceec77edfd952033487924"},"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":"2feb5746f6ab7b13feb42577b5a6bada29c6ca5617def30fa0a957aba2c87d19"},"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":"8a8840f6871dff3abfef788412679fc089fe78f7f010564be551738b3ffde7a8"},"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":"d316515c02596f01d811341583e3a7fb6b2a63039a18b7839f508b7c152ed372"},"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":"9b11613ed85bd5aa7fd31c149068ea6ce76c2290e4a09a9f548d00beb5c83998"},"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":"6e16d1f8af4ccb30879979367fd1d87fc784d1c7f8ab8c779b5c042cfb5cfced"},"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":"2ba2bb871473d899fe7cb5d53362f6f3337dccb4718a1aa83c6d659135fc3351"},"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":"b763590c050de6a2a41e88e230114faf685476810fa19986f8d336bb41b11e5f"},"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":"a7f0aa43ad522dfec8fade66c731cf57a41b7aaffa8a1128b94e43709568b682"},"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":"5e40c458867cdc7c72b7377aea23b128b1358c3c5f23b78b8b899cc1c65e3d99"},"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":"693249723480b7d3690fbc9002e4acaa2fd5c4f5277d52948268b51530c89d1e"},"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":"3a026a3eb7cd15b3a5357c8fb99723041171195b53d4226265d0e082cca4f871"},"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":"129c6af4c7e5a8632e8e96f33a011917b7cbf2e5b33594f1bbc5b43ba48dc53a"},"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":"865c1256b0af6cac7fabd52ec1703a6840a81e82c2cc09619e5e78e47af02756"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"297052c4437aba70e5f5ee1949998e68317d343c96f2d8ab34085c8345d5a15e"},"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":"fdd698ef6bd7011b091c6ad2b96823de74f9117d1926dfe0d977df291c6d00b0"},"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":"f40b734f5fc8f448770506e7c34e2a65f4a6bbdec240f0f7285a9b100152251d"},"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":"194a1865ac28c4ae38c004b2601f2b28923cef7e57a09e701d1f0c62e1a4f16b"},"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":"49c16b6fbc91670e61b639ab9c9270b4df42b6b11889eae216a02e4dd9c52b80"},"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":"8b56acc822032228d4ee0db7d5ad5309cc13e7d8de225309ce243c2c79d2234c"},"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":"f95108069e3f57a4bba666c24426d7a2e71454e1c1eb1b6c741dbc18edf7a2bc"},"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":"e8e18d2a8f20376724197f4821264a0a9f0e273d56749195409cdb6066877285"},"taxa":[{"id":"CWE-522","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-829","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A06:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-6","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ca3d75e51e800e377915c3db1c5738dee0115cf5c8e752c49df96bdb3a380942"},"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":"80828c073478d05a52dc2a34f5101b8c03fd43d60082a6107c652feb015e62e4"},"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":"e669551e1f0177df320633323790461e54eac2f44b9adb385d8a8a6a472a10cb"},"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":"bbc4f9a800290f98ef533d4b1b9fbe8b593fc57014a0e7bdb9754061e4300cb6"},"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":"5b2bc62b74710c47a793e3c31fca4d7b09501fabd47123e313eb828a2aa619be"},"taxa":[{"id":"CWE-89","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":"7cb964858c7785b11fed1730aa057f31a55be1e456cee1a72c9e45d3b208e63f"},"taxa":[{"id":"CWE-89","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":"25d36587ccbf5ccb3fb75bd1ae8b0efedd020c9fb49452434f0ee34ac05f4d5a"},"taxa":[{"id":"CWE-89","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":"806f57d3e8072c3dbb794d27ad914435d25e2bea256f01d0bfc0ce630dd9ce32"},"taxa":[{"id":"CWE-89","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":"f0a5f19b5f4ac923c5121c4911fd5eeede67ae7bc9812636fa72adab1275ff01"},"taxa":[{"id":"CWE-89","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":"f832ef5d58ba025606b640a7f77cdeebd5b471ca80cb45332a800ff08e4ad1fa"},"taxa":[{"id":"CWE-89","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":"3b699d77b842c25fb5cde112ddf7a88a3c4678e09f8e3ae8cf01703b196acd82"},"taxa":[{"id":"CWE-89","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":"072c39b5fd67cc66c810875d86bda2981f4ef1c877ea1dfe251a48021e25c7a3"},"taxa":[{"id":"CWE-89","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":"911a4d673598b35663251fcac03e1cda7159320e274b8d2d3871d16e7309b2ec"},"taxa":[{"id":"CWE-89","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":"41cb0d08ac6226a856ac645d45b8829fe4c9f66d45a722fb05c30a3c2865ff0d"},"taxa":[{"id":"CWE-89","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":"d6597d3547cb6de5db68b2ccfcb1726e61ea76162c480925300d53e725424331"},"taxa":[{"id":"CWE-89","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":"78e05fe37065696838142171ab24ed55d710e20fe19f8de7ee4dd28d41f91c32"},"taxa":[{"id":"CWE-89","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":"c51912cbc205966f962fadbb3741a480f654abde1da4f7000cf2bd27c51b548c"},"taxa":[{"id":"CWE-89","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":"4b628458d59fe9acfc116c40e090b9d107b0338b875cfe86b7b75bae143c601e"},"taxa":[{"id":"CWE-89","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":"9ae3fe98f0d177f2ef74bbc2c63e830b659f8a91e590d894379c697e689b0e6b"},"taxa":[{"id":"CWE-89","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":"f0ea9c84259f7477998304dc2bfe0d2e617732ec17abe82e2f2347c7a305ab13"},"taxa":[{"id":"CWE-89","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":"f5854530ab255f6f4d76e76d27777a72994c9a632c4e36622cc242a216cbc24a"},"taxa":[{"id":"CWE-89","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":"becd80212174632082eac982c43d6589f851672a379ed6addf434ddba7153ef7"},"taxa":[{"id":"CWE-89","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":"c6d0513cd88e2e7a5dbfec6b2c71fb3da74135d2e86ee8fd326d37411cd04bb9"},"taxa":[{"id":"CWE-89","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":"ffcdb813769efac58bc420ab24bbdedab5fda411adc1406a8bcb8f5693959b63"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"b3a6264a8545f0658dd79dcd06f4596d3eaa34c7beb6d9a07207875d4ffdfa0b"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"d1e0fbc9c3a0e4ccbb245f7ee8356b1cdc205a22e9c9014961b48ceb988525be"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"8b69c20d6d098cdeac32abe4e3c9ed2a554b71c1052dadfe308a1bf5f02b8616"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"22ab9e36c66fb694eed11e4b47b1bbbc513434e377c908879f91b9ed397a5ea4"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"2858ac8b1d69d244a96d06a827c9c1cd6bdfeea08690937e93b73109295b39e1"},"taxa":[{"id":"CWE-1188","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"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":"76f18167920ee1d9178dbbd781b789984e9e7f914ef9be8d4189e3eee2982083"},"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":"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":"864c33a865628e612cad1ca6e0ce7be6a083e6ad23f5b16803870a5335bbcf84"},"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":"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":"07ddcef9cd448e68b9918cc5adbb3f05b1651c4ce89f2976b7a8973d26f4b35a"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1352","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},{"id":"CICD-SEC-7","toolComponent":{"name":"OWASP Top 10 CI/CD Security Risks","guid":"3c9b2a6e-5d14-4f7b-8e02-6a1d9c4b7f35"}}]},{"ruleId":"D29","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"c8f8225e20042eb654d484e4e4b921afdaacb6d3b17e662cdfcfe91a4b5ba969"},"taxa":[{"id":"CWE-125","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":"5d38bd690f7da166a4bcb8fdbb90e29cc3804a83fd42575c1389e1dba3de549c"},"taxa":[{"id":"CWE-125","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":"4409b93bc3c3487531f887508842cb2bbbd3261933d66402325c5d5a298900d0"},"taxa":[{"id":"CWE-125","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":"4fbf274af5cee4206101a2c6df0b7aaaac1e5cab99310cf896c5b5ec06b878f1"},"taxa":[{"id":"CWE-125","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":"dcea31eb7734c5b858f8d34e04faff3d458597205aa8f69bd7d10084a98444d3"},"taxa":[{"id":"CWE-1333","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A02: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":"eed526562b11349e9227ac370b3c4afed9f156ca18604c4a7c91dd078b06e0d9"},"properties":{"dependency":{"package":"body-parser","version":"2.3.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"006c83de6467dcb4249082f8c54c1739d62908610bc2d13c64351d2866776bb8"},"properties":{"dependency":{"package":"undici","version":"7.29.1","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"not-imported"}}}},{"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":"cdcd54e0e2280927e71bd3cd0ec017af3f69c4ad5c6fc69f9be77e9f52efde99"},"properties":{"dependency":{"package":"vite","version":"6.4.3","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]"],"reachability":{"kind":"test-or-tooling","file":"web/tests/chat-pagination.test.mjs","line":5}}}},{"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":"bd01e879339cce91d3089315987dc1cc74fb44e9d449b514014ef306aca40c92"},"properties":{"dependency":{"package":"zod","version":"3.25.76","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":"ac07f6d7edfd49261e66a0ecf670dc83aeb27f637d0eaec58b89ac41744f7835"},"properties":{"dependency":{"package":"rsa","version":"0.9.10","advisory":"RUSTSEC-2023-0071","aliases":["[CVE redacted]","[GHSA redacted]","[GHSA redacted]"],"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":"232458f1e861a473d11b103db83010acd3c76ee2f5eb5b53069ae6f2eda9586f"},"properties":{"dependency":{"package":"webpki-roots","version":"1.0.9","advisory":"RUSTSEC-2026-0381","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0382","RUSTSEC-2026-0383"],"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":"7ec937081c3ad6882e9c07735996d40cd6d5332ac535d70bb5252c6040e1f211"},"properties":{"dependency":{"package":"rustls-webpki","version":"0.103.15","advisory":"RUSTSEC-2026-0382","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0383"],"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":"c78c7c829ffb431fb928ff724c9cf0276a780b7b7d9be87f32343d1209a988f8"},"properties":{"dependency":{"package":"webpki-root-certs","version":"1.0.9","advisory":"RUSTSEC-2026-0383","aliases":["[CVE redacted]","GO-2026-6809","RUSTSEC-2026-0381","RUSTSEC-2026-0382"],"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":"c356dafc2d2f879539349393edf47ceccc3e0771bf15e4dae816abd8594fd25c"},"properties":{"dependency":{"package":"ttf-parser","version":"0.25.1","advisory":"RUSTSEC-2026-0192","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":"422864efbc32ee020d94634a443edac9d818b90faf02ac96d91c4d66ffa4da37"},"properties":{"dependency":{"package":"lru","version":"0.16.4","advisory":"RUSTSEC-2026-0253","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":"c64e30c28e3c0e2ac4c865fc1656b78d3404e0bf0484e55f9176b7c5f283f360"},"properties":{"dependency":{"package":"tokio","version":"1.53.1","advisory":"RUSTSEC-2026-0386","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":"06e8dc8c07565b965cad3fead890e0d682e96e4f994ab4a0654e3f10afe7962d"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0395","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":"414bb4a49ee404ddc9dbe92931374dee643d4d3104e067391ed93041a77ff631"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0396","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":"d67834474e5564706ab5d6117a7537fa7ddd9f89e1070ff0f40846a68262b203"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0397","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":"64bc44f41a35cd29a5d01a7b192ce2cc5f1d458c15d9df1d5239ebb5b7c6fd43"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0399","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":"a79bcf37fda3b3cfb40243fa81b1818f80a0fe095c267b68e3c7eee6f042ddc9"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0400","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":"21df614167acad094349de8aa7cfc685e485f636d67b1ded35b43230df65a136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0401","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":"fd61c6a1a6d23109e3da0a091cdbb2ecd3102dd1235e0548e2d8ffd7db2a7005"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0402","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":"a910032c7367726c7f26107809b36a5b0ab01a6e3af6f2b0cf67b659ecca9e49"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0404","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":"d11388e41908d6112e7f61d01d0c0d9062830b07945356073c8069de5b88d627"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0405","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":"dbb5f2efe8d9cca6344840981b65d21b774960589fc9976e6690dc84fce97102"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0406","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":"22995033016ae3861d571b2c92ada6244555e3aeec08bc870b909cda12b35c06"},"properties":{"dependency":{"package":"rustls","version":"0.23.45","advisory":"[GHSA redacted]","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0346","RUSTSEC-2026-0347","RUSTSEC-2026-0348","RUSTSEC-2026-0349"],"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":"ca383df8f93c1fcb449201c7c47b9fc487e55acf31a9bb60212d29fe36dde189"},"properties":{"dependency":{"package":"block-buffer","version":"0.10.4","advisory":"[GHSA redacted]","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":"5585c48a8c4ed670247ebaa40a533d385248c4e49079fee700e7b93cbab137a9"},"properties":{"dependency":{"package":"quick-xml","version":"0.37.5","advisory":"RUSTSEC-2026-0194","aliases":["RUSTSEC-2026-0195"],"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":"ffba3a9076a73cf66b6daacb5914c478fbdc74d1383d8d2e4003b6bf3aa7b43d"},"properties":{"dependency":{"package":"quinn-proto","version":"0.11.17","advisory":"RUSTSEC-2026-0338","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0340","RUSTSEC-2026-0343"],"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":"2f88d3a70d29acb7742d775c7077dafff055d53d623adea4448751985efe8ee1"},"properties":{"dependency":{"package":"zip","version":"6.0.0","advisory":"RUSTSEC-2026-0367","aliases":["[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","RUSTSEC-2026-0368","RUSTSEC-2026-0369"],"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":"cc4db900d7247116e90ac1f55322889d7c04a2f09430308fea72e799e9229468"},"properties":{"dependency":{"package":"crypto-bigint","version":"0.5.5","advisory":"RUSTSEC-2026-0387","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":"f4999ef69e42f46a403f3866a4a634365963f93fdd6e82c0c4a8e528a960ab52"},"properties":{"dependency":{"package":"zstd","version":"0.13.3","advisory":"RUSTSEC-2026-0391","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":"d7870b77ea4843334d11fffa265d6d0542e94eec7f4c8e852762d55c28578136"},"properties":{"dependency":{"package":"zstd-safe","version":"7.3.0","advisory":"RUSTSEC-2026-0398","aliases":["RUSTSEC-2026-0403"],"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":"84f9b61ffb7d87f7a0ea344424bcbd7389e2ed41eb01432b04fba9f732cd312c"},"properties":{"dependency":{"package":"zstd-sys","version":"2.1.0\u002Bzstd.1.5.7","advisory":"RUSTSEC-2026-0410","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":"b845a0d69be31b24807122c8fc93828e5944c4c4a2659d3ecc80c1893d8e19f9"},"properties":{"dependency":{"package":"@vitest/mocker","version":"5.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE 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":"a2940820fba557a9fecaf803478147938e4220641c30206bb1670df0b833cdbf"},"properties":{"dependency":{"package":"fast-uri","version":"3.1.8","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA 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":"e16892fe05809ba6fd2b8ae34a45b9fe9d37b9560172901b6ce96ddd4af65ce9"},"properties":{"dependency":{"package":"hono","version":"4.13.7","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[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":"b10b76b257b99da26e51953909c80384de1eb9b5f5d03fbf773f918616513eff"},"properties":{"dependency":{"package":"ip-address","version":"10.7.3","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":"c552988528998219abdcbcaa382b768954cda6713ffdc9a0a01cb4383ce19ad1"},"properties":{"dependency":{"package":"postcss-selector-parser","version":"6.0.10","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":"c8fc45c7ba5c698ab67f91fd5a4164f46346d686b57a4848b59089fd51dd45a6"},"properties":{"dependency":{"package":"qs","version":"6.16.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"not-imported"}}}},{"ruleId":"D31","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":"f9deb0b3e9568df1171bacf908174d514cb7e71041f1c1975b38340d1bde8fc0"}},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3e0cfde0dfff92a8e4e19275909c93aa1d7b46f944f4c3ff0c2591168a99bcd6"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5c66ea615207ca71b5bb4d16d304a4f63954c64e83c302b6c11b637f292b5a62"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"3fa80d44b864f2e2bcf4cae9780fdf19bb85d5962086c8f67a9ffd3c01a75281"},"taxa":[{"id":"CWE-1357","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-353","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}}]},{"ruleId":"D31","level":"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":"ccc0cc717a360059224d480b2bc872b7f88a881960a07fa78798e15be3c752b9"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: zh.ts \u2192 models.rs, ingest_sources.rs, alerts.rs, extraction_drops.rs, governance.rs: \u0060web/src/i18n/zh.ts\u0060 changes together with 5 other files \u2014 \u0060crates/utopia-core/src/models.rs\u0060, \u0060crates/utopia-server/src/ingest_sources.rs\u0060, \u0060crates/utopia-store/src/alerts.rs\u0060, \u0060crates/utopia-store/src/extraction_drops.rs\u0060, \u0060crates/utopia-store/src/governance.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 5 separate couplings, not 5 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 5."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/i18n/zh.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"84b18fa97a0bd325745779cca35a300e84af478a75bf78bbf4f85573745eb47c"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: Graph.tsx \u2194 OntologySchemaGraph.tsx: \u0060web/src/pages/Graph.tsx\u0060 and \u0060web/src/pages/OntologySchemaGraph.tsx\u0060 change together 72% of the time (13 of the 18 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are \u0060d116534b\u0060 A highlighted edge draws last on both canvases (#625); \u0060cb323566\u0060 Colours the light theme missed (#606); \u00602767877a\u0060 The interface has a light side (#599) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Graph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef0f8fccfb0dbb261ff843cee91f5b2fab6ece4952c124a387d201f7e83e7c9a"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: phrase_alignment.rs \u2194 type_alignment.rs: \u0060crates/utopia-server/src/phrase_alignment.rs\u0060 and \u0060crates/utopia-server/src/type_alignment.rs\u0060 change together 67% of the time (8 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are \u0060fa6cd6cc\u0060 A reply that keeps repeating itself comes back cut instead of running\u2026; \u0060fce1f8e0\u0060 Every model call uses the workspace\u0027s reasoning effort, and none is a\u2026; \u0060c7435ecc\u0060 Refresh the ontology vector index when the editor creates or relabels\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/phrase_alignment.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c63dc5075b3e8f0a53f53f6ef6fc70667746851ea401b1efa4ed4d674cb0dc2"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling clique: AccountShell.tsx, Docs.tsx, Shell.tsx: 3 files \u2014 \u0060web/src/pages/AccountShell.tsx\u0060, \u0060web/src/pages/Docs.tsx\u0060, \u0060web/src/pages/Shell.tsx\u0060 \u2014 all change together with no explicit dependency: a fully-connected co-change clique, not 3 separate couplings. They share one concern (thin parallel siblings over a common abstraction), so extract the shared part into ONE unit and the whole clique\u0027s coupling clears at once \u2014 you do not need to break each pair individually."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/AccountShell.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9435502758211ff4e49ddbc07fb16a59e62a611f098dee48392ba47fe759d5"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: mod.rs \u2194 api.ts: \u0060crates/utopia-server/src/api/mod.rs\u0060 and \u0060web/src/api.ts\u0060 change together 61% of the time (43 of the 71 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 43 shared commits counted here, the most recent 3 are \u00602bce3280\u0060 SSO-only deployments: trusted domains sign in without linking, passwo\u2026; \u006070bf7a7f\u0060 A system admin can make another user a system admin (#1234); \u0060bb5cde28\u0060 Show saved property regression comparisons so people can check ontolo\u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/mod.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"53397afdbd136cc781ca333c9fc45695d00a95e32d21ebc2ed2320bbe84002a7"}},{"ruleId":"D35","level":"warning","message":{"text":"Change-coupling hub: extraction.rs \u2192 lib.rs, kbs.rs, mappings.rs, pending.rs: \u0060crates/utopia-server/src/extraction.rs\u0060 changes together with 4 other files \u2014 \u0060crates/utopia-extract/src/lib.rs\u0060, \u0060crates/utopia-server/src/api/kbs.rs\u0060, \u0060crates/utopia-server/src/mappings.rs\u0060, \u0060crates/utopia-store/src/pending.rs\u0060 \u2014 none of which declares a dependency on it: one file is the hub of 4 separate couplings, not 4 unrelated pairs. Read the hub first: if the others each duplicate a part of what it does, the shared concern belongs in ONE unit and extracting it clears every edge at once; if the hub is a registry, dispatcher or barrel that must name each of them, the coupling is structural and the question is whether that list can be discovered instead of enumerated. Fixing the hub is one change; breaking the couplings one pair at a time is 4."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/extraction.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a837167870af7d6ae22baaec491d96ff396f419b9b9b4af73f010dade5b3a739"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ingest_sources.rs \u2194 Library.tsx: \u0060crates/utopia-server/src/ingest_sources.rs\u0060 and \u0060web/src/pages/Library.tsx\u0060 change together 59% of the time (10 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are \u0060d62e880b\u0060 A base can follow a GitHub repository\u0027s markdown files, fetching only\u2026; \u006022c21eac\u0060 Let a source push statements in the open contract (#884); \u0060e02f820f\u0060 Deleting a document is an event, and it can be undone (#273) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/ingest_sources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1304b5363281b35ce614d6efe71683fe568caf43d681ded9f1c63cc226699739"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: ingest_sources.rs \u2194 SourcesRail.tsx: \u0060crates/utopia-server/src/ingest_sources.rs\u0060 and \u0060web/src/pages/SourcesRail.tsx\u0060 change together 53% of the time (9 of the 17 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit \u2014 they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary \u2014 an event or message name, a route, a serialised shape \u2014 that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other\u0027s build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 9 shared commits counted here, the most recent 3 are \u0060d62e880b\u0060 A base can follow a GitHub repository\u0027s markdown files, fetching only\u2026; \u006022c21eac\u0060 Let a source push statements in the open contract (#884); \u006083099a77\u0060 Every source kind the UI offers can be created (#253) \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/ingest_sources.rs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c13abe559fa2ad18984c33b0ac687af669ad603621d7165a073d774b9b55506f"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: DocViewer.tsx \u2194 Ontology.tsx: \u0060web/src/pages/DocViewer.tsx\u0060 and \u0060web/src/pages/Ontology.tsx\u0060 change together 50% of the time (5 of the 10 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module \u2014 a sibling reference still needs an import \u2014 so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 5 shared commits counted here, the most recent 3 are \u0060bb5cde28\u0060 Show saved property regression comparisons so people can check ontolo\u2026; \u0060f8655b23\u0060 Every page titles itself with one PageHeader (#452); \u006088e53f15\u0060 The area right of a rail fills it, and a form inside a card stops at \u2026 \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/DocViewer.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c5e44aba255fb1779038f3be2ca86a416cba600e311a6c7604b48ff16c8ebc2"}},{"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":"c6eb5a94052c328a9f9d4f3228923a5f2d4d56700f96d3ddbb1b358415402983"},"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":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Graph.tsx"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bd5bbe87e806fa28228b1c2d61479149f826be458ebc5581b5722b16a7d484"}},{"ruleId":"AC1","level":"warning","message":{"text":"\u003Ccanvas\u003E without a text alternative: A \u003Ccanvas\u003E with no aria-label/title and no inner fallback content can\u0027t be described by assistive tech. Add a name or fallback content."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"33fb936ad109f7221763f53b1004c4adc48e984e8a79e7c5594784249bb4edfc"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextarea\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Chat.tsx"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"798577d561e542b0ea0ab40190961457e937f7398f098842b807bbe674438487"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel htmlFor\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Graph.tsx"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"2391ab5134c0d89056ae985ca506e577474e583a9982dfdf51d063f2b152e6a0"}},{"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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"69a0c9ee2b7a3f78ee8195d305f151370f190cc3cda08b207652a8c29fe4fd33"}},{"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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b38124b4a95ed10e66f923ad0f932549eb1c3a8044d14c3f847b1d76ad1545f"}},{"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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"007db89739f8f93d9f17f65868b6232528fad51ec7e5496f7fb864d6a650f234"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextarea\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id \u2014 and neither does anything it renders (a name prop is the form-submission key, not a label) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Library.tsx"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"51ec0c66e4f3051d8df8da3458029f2974b921071b35bafc233613939d01170f"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextarea\u003E field component without a label: This UI-library field component is named only by a placeholder \u2014 a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Library.tsx"},"region":{"startLine":1749}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fbc680f161bcfa4da975233650a7500191cd508ab2daa2c24ee992214a859f1"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CTextarea\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id \u2014 and neither does anything it renders (a name prop is the form-submission key, not a label) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Library.tsx"},"region":{"startLine":2022}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7614e64ed2d21ac1451e3f6fdb0f4095b164a81bfdd0a2dbf311b14176e7ada"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1215}}}],"partialFingerprints":{"codehealthFindingId/v1":"a70230910fc8f3edc0b7dfd720a50de115efc3dd364012a04e74f3669ea33d5c"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"60ba0ebce6d991010e2b13d2f8f49d9bb3cf798491e9a7e5832f968d52d603ca"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1234}}}],"partialFingerprints":{"codehealthFindingId/v1":"7df1aae7b70c781aadb4d282f9f70bb636764bdee2d427e196e6f2379064402d"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1257}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63cea41c59633dd827aa089722992263b74fa647ae63b2c899b44323204a387"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1311}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe8a4ceb5de64845126079ec351f5134567a18efad783c75e5e2fff82bd3a29"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1321}}}],"partialFingerprints":{"codehealthFindingId/v1":"e20cb2584a670b330e1f20affc65a58ee4aeef6c8a12da9c5fc073a7f6f2b5b5"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1330}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cfe186cbaed93a7fe1ecb375ff6c8256d9feb43149c49779ede048da79e1e91"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e7fbc027cd7c6388ad1f5c06e7c983cdd372e87fa8d9a354706cd9b664901c7"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1402}}}],"partialFingerprints":{"codehealthFindingId/v1":"7dc8fff70f0a78ccea1dc3d3b92075d158eaa9631ffc9507c38fe7d33f6f45de"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1413}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cdc42573ea79fb1126bc80ba019ab6709daf19b39d6290dea9bc2640f6f5feb"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"0009a11ef251b200c97c03a6bb2ef7acff88d549abe92ff96772333eb8bd16a5"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1433}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6c0b1d0b5831e5e5a7cfb86b2d7fefe36445e3f2c7a255e9aa6054c73f2b817"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1481}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f00976aa38ef2ff54e9e770db62bbd2c51a53158c78cbe1a338c41e17216485"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1491}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fa8d47020925fd7bef3f4607b5ad4573399bb7b4c73f35609e2cef8940858e"}},{"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":"web/src/pages/Settings.tsx"},"region":{"startLine":1500}}}],"partialFingerprints":{"codehealthFindingId/v1":"99c275de8aaf47381e09fd1486771c37235ddaba741ac5f277bc2090672b0e3f"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CRadioGroup\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id \u2014 and neither does anything it renders (a name prop is the form-submission key, not a label) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Tokens.tsx"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fe51e738b29607c0324ca707cffa863ba709bda309c6dc234cb9c8818d2536b"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CRadioGroup\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id \u2014 and neither does anything it renders (a name prop is the form-submission key, not a label) \u2014 so it likely renders an unlabelled control. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/graphDialogs.tsx"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a3ce37421401178848decef448bf390e5d48f9cafedc952baf5142b4150f64"}},{"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":"web/src/ui/index.tsx"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0515f39f3d8cd747d83fe4510c9b4b863e29f0228c97b47c1b2035b2040adb"}},{"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":"web/src/ui/index.tsx"},"region":{"startLine":730}}}],"partialFingerprints":{"codehealthFindingId/v1":"f964da1589ba47d831335b3e566a98f2ba07cae830ba3a8f44df22a190a85b7f"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/ui/index.tsx"},"region":{"startLine":778}}}],"partialFingerprints":{"codehealthFindingId/v1":"9061d0abb6b1ec4f165995f11b11dfceb8f7977175851cb1516172c532b8363a"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/ui/index.tsx"},"region":{"startLine":785}}}],"partialFingerprints":{"codehealthFindingId/v1":"99875839d6942f8abfbd76fba8457376c83e91cb1c94fc45e8fcc851bef9c077"}},{"ruleId":"AC2","level":"warning","message":{"text":"\u003CSelect\u003E field component without a label: This UI-library field component has no label / aria-label / aria-labelledby / id, and nothing it renders carries one either (a name prop is the form-submission key, not a label). The text inside it does not stand in for one: these compound APIs render a trigger with role=\u0022combobox\u0022 (or role=\u0022button\u0022), and those roles take their name from the AUTHOR, not from their content \u2014 so the words on screen never reach the accessibility tree as a name. Name it whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a \u003Clabel htmlFor\u003E pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) \u2014 labelling each item leaves the set unnamed."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/ui/index.tsx"},"region":{"startLine":1545}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c653f0917f2b3ff34ebdcfa4a4ccfdfd36c287263cee8f56de6ed9fb7a2565c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cbutton\u003E with no accessible text: A button with no text and no aria-label has no accessible name. Add visible text or an aria-label (an icon-only button still needs one)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/ui/toast.tsx"},"region":{"startLine":74}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86a13a4b603b7f2e183a953e73c32a4091d441795db22226c541218862a2436"}},{"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":"web/src/pages/Graph.tsx"},"region":{"startLine":2137}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb93eb4cfb8fd707a8901d1879269d1e879e454b8f60c01482f5853aac53eac0"}},{"ruleId":"AC4","level":"error","message":{"text":"Focusable \u003Cspan\u003E isn\u0027t keyboard-operable: This \u003Cspan\u003E carries tabIndex={0}, so it is in the tab order and a keyboard user will land on it \u2014 but its behaviour is bound to the pointer only, with no key handler. A tabindex makes an element focusable, not operable: Enter and Space fire a click on a native \u003Cbutton\u003E or \u003Ca href\u003E and nowhere else, so this can be focused and never activated. Use a \u003Cbutton\u003E, or handle Enter/Space in a key handler."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/Graph.tsx"},"region":{"startLine":2758}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ccba285998b6312c1e91efee51580a19ccf33b4eacf213ead27e70839fe712"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.u-scrub-island\u0060 moves (\u0060transition: background-color var(--u-base) ease,\n      width 300ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/styles.css"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b6fae811830e8bd67a6640d065e224986557f19bfd652a668c1f89ac3eceb7e"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.u-modal-in\u0060 moves (\u0060animation: u-modal-panel-kf 0.18s cubic-bezier(0.16, 1, 0.3, 1) both\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/styles.css"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa50ac27c2927fbc96f2f4d34d08b72264bd00e0152a194fb26b6a0f5cb1bf1d"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.u-progress-fill\u0060 moves (\u0060transition: width 500ms ease\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/styles.css"},"region":{"startLine":904}}}],"partialFingerprints":{"codehealthFindingId/v1":"074a5c9302f8f4ee9fe962ef804a3395dc851df9c8a41fb83aaa9a5e938243cf"}},{"ruleId":"AC6","level":"warning","message":{"text":"Animation without a prefers-reduced-motion guard: \u0060.u-thinking\u0060 moves (\u0060animation: u-thinking-kf 1.8s linear infinite\u0060) and nothing reads prefers-reduced-motion for it \u2014 no @media (prefers-reduced-motion) rule for this element, no reset this project loads \u2014 so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/styles.css"},"region":{"startLine":1375}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2ff8a4643780b244393ddc00d05d1f49393b64d7ae9adc7cf79b424dfd651fd"}},{"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 74 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":[],"partialFingerprints":{"codehealthFindingId/v1":"d46019b86eff5ddad9db289e6802ac158899e980df54c34f67722442787ead62"}},{"ruleId":"C4","level":"note","message":{"text":"Partial data-retention evidence: A retention mechanism is present, but the data-lifecycle is not yet complete \u2014 missing: an expiry limit \u2014 a declared maximum age / TTL after which the data is no longer kept, a documented retention period / data-expiry."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"e6c843eccaff7ffcfe5241125b74768c2364055ab6678b12b10d47f44086afa4"}},{"ruleId":"P10","level":"note","message":{"text":"Large public API surface: 311/368 types (85%) declared in the published library are public. For a library, every public type is a stability contract \u2014 keep implementation types off the surface and expose only the intended API."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"ed2ba843444ae377c17142f58f714e281e4bd3f183ab100ee1fbef389875d3e6"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"P7","level":"warning","message":{"text":"Outbound HTTP without resilience: \u0060AgentBuilder::new(\u0060 makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service\u0027s request, thread or connection until the call gives up on its own \u2014 or never, for a client with no default timeout."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/chat.rs"},"region":{"startLine":922}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9c7c6c425ee00560ff0f460a329bd0c22d24a17fa4782327145534de3d445fd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (145 matched lines \u00D7 2 locations): web/src/pages/KbSettings.tsx:634 \u00B7 web/src/pages/Members.tsx:135 \u2014 the two spans are one implementation copied and then locally edited \u2014 878 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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":634}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da9acacb502355cfbd5b35f7132691d05f18d7e10e6afb028e1f9d8ef4f03d6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (86 matched lines \u00D7 2 locations): web/src/pages/Library.tsx:1390 \u00B7 web/src/pages/Library.tsx:1918 \u2014 the two spans are one implementation copied and then locally edited \u2014 542 tokens are still identical, in the same order in both spans, 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":"web/src/pages/Library.tsx"},"region":{"startLine":1390}}}],"partialFingerprints":{"codehealthFindingId/v1":"e400de3b0e76f3711ded8dc2fe3c4d42d7128d8dbbaa36c7a57c238b29964605"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (79 matched lines \u00D7 2 locations): web/src/pages/ontologyDialogs.tsx:84 \u00B7 web/src/pages/ontologyDialogs.tsx:309 \u2014 the two spans are one implementation copied and then locally edited \u2014 582 tokens are still identical, in the same order in both spans, 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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c05d2d2bb69a58b1abbfd0e436572d2aada1cbcfb509ab9781631c16811a3c1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (69 matched lines \u00D7 2 locations): web/src/pages/Review.tsx:226 \u00B7 web/src/pages/Review.tsx:376 \u2014 the two spans are one implementation copied and then locally edited \u2014 309 tokens are still identical, in the same order in both spans, 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":"web/src/pages/Review.tsx"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccc89f84e20b07098aa86d3051ff5cb8ab57ec2577f3cb88c6e654559fd12de8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (46 lines \u00D7 2 locations): web/src/pages/Library.tsx:1606 \u00B7 web/src/pages/Library.tsx:2017 \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":"web/src/pages/Library.tsx"},"region":{"startLine":1606}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd09dc92d1ea3fdeb2d080f751a269522f01c6e34aee9fb85958013e868698cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (46 matched lines \u00D7 2 locations): web/src/pages/Mappings.tsx:644 \u00B7 web/src/pages/Settings.tsx:118 \u2014 the two spans are one implementation copied and then locally edited \u2014 307 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":"web/src/pages/Mappings.tsx"},"region":{"startLine":644}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4ba12ece7107d7f1b188b9999db86e44061900843ae5c571f41bbf291f45fa2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (43 matched lines \u00D7 2 locations): web/src/pages/Settings.tsx:1332 \u00B7 web/src/pages/Settings.tsx:1435 \u2014 the two spans are one implementation copied and then locally edited \u2014 238 tokens are still identical, in the same order in both spans, 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":"web/src/pages/Settings.tsx"},"region":{"startLine":1332}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed21ccfd36e8c3fea538347ffff41f713fa1dc43be5cc507c1ca46aeb9d6fd93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (39 matched lines \u00D7 2 locations): web/src/pages/KbSettings.tsx:589 \u00B7 web/src/pages/Library.tsx:1279 \u2014 the two spans are one implementation copied and then locally edited \u2014 227 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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":589}}}],"partialFingerprints":{"codehealthFindingId/v1":"336faa74a9c1477501a0f69f336b0f75ecf46eb797e4da1e378c3424c19ef0ab"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (38 matched lines \u00D7 2 locations): web/src/pages/ontologyTables.tsx:340 \u00B7 web/src/pages/ontologyTables.tsx:440 \u2014 the two spans are one implementation copied and then locally edited \u2014 308 tokens are still identical, in the same order in both spans, 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":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":340}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb001e10e90a5edb7cc9f236a58e02cffed17fe56b0731d1d0bbd077fdc62a2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 3 locations): web/src/pages/Settings.tsx:1204 \u00B7 web/src/pages/Settings.tsx:1300 \u00B7 web/src/pages/Settings.tsx:1470 \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":"web/src/pages/Settings.tsx"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"165192aca880c0a431b90f855a76d45fee56c839522e0afba68a6595703c89ed"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (31 matched lines \u00D7 2 locations): web/src/pages/ontologyTables.tsx:196 \u00B7 web/src/pages/ontologyTables.tsx:455 \u2014 the two spans are one implementation copied and then locally edited \u2014 246 tokens are still identical, in the same order in both spans, 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":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a34108032abd12e898c7c7f5c46697b3d1dc8b5ca4c8cb98b899d79dbe2aca92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (25 lines \u00D7 2 locations): web/src/pages/Settings.tsx:263 \u00B7 web/src/pages/Settings.tsx:295 \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":"web/src/pages/Settings.tsx"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"05cbdf673cf0a89ced4c884dd97a6c3bf9f3380cc16a7ba185009d43dec38895"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2 locations): web/src/pages/ontologyDialogs.tsx:272 \u00B7 web/src/pages/ontologyDialogs.tsx:579 \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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"951ad112128b740a5d86081ea818d519c0e25d4d91c188f90a0838d48c28e35f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): web/src/pages/Graph.tsx:1784 \u00B7 web/src/pages/OntologySchemaGraph.tsx:1116 \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":"web/src/pages/Graph.tsx"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b77b6933c9ff2decc58f7c1f7299b5df20819fd316f89a18300d261d5592155"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 3 locations): web/src/pages/ontologyDialogs.tsx:136 \u00B7 web/src/pages/ontologyDialogs.tsx:387 \u00B7 web/src/pages/ontologyDialogs.tsx:653 \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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe248dded6e84d9f605fb4600e6606b40bdca5f6b4c7786328148613dbb12e78"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2 locations): web/src/pages/Graph.tsx:2664 \u00B7 web/src/pages/Graph.tsx:3630 \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":"web/src/pages/Graph.tsx"},"region":{"startLine":2664}}}],"partialFingerprints":{"codehealthFindingId/v1":"bece064635185552ebdfd2231703c60e9eddd28a4daeb05be04ae53fd5acd668"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2 locations): web/src/pages/Settings.tsx:746 \u00B7 web/src/pages/Sso.tsx:97 \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":"web/src/pages/Settings.tsx"},"region":{"startLine":746}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c12c3ea86d1b8cc20dbe52444e7da760de9a3c73bf6cdfebd243c82f50eecb0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): web/src/components/ui/select.tsx:142 \u00B7 web/src/components/ui/select.tsx:161 \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":"web/src/components/ui/select.tsx"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a31ad1cdcc31b67700426e6711b67c9bec93db8d79244a14865495cbc58d4c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): web/src/pages/Graph.tsx:2469 \u00B7 web/src/pages/Graph.tsx:2731 \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":"web/src/pages/Graph.tsx"},"region":{"startLine":2469}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a46ff8e29b06515c7fc3c437e2d2de31cf48483a80ebbc9e507d58e64509566"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): web/src/pages/Ontology.tsx:2508 \u00B7 web/src/pages/Ontology.tsx:2752 \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":"web/src/pages/Ontology.tsx"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b02e9b6861b869f6162d9e952385932222bd94315b26b7f386512457771d6e7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 3 locations): web/src/pages/Ontology.tsx:2588 \u00B7 web/src/pages/RulesPanel.tsx:527 \u00B7 web/src/pages/Tokens.tsx:269 \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":"web/src/pages/Ontology.tsx"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"418f7bf3d63df903e452b6afabe73c5cd6f9ac0e3d4c7b132380e4d8ec110a92"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): web/src/pages/Review.tsx:2026 \u00B7 web/src/pages/Review.tsx:2047 \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":"web/src/pages/Review.tsx"},"region":{"startLine":2026}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c88857d155fed51e49ff0fa8a93b71a6efc0f536949be798c132567639ed99a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): web/src/pages/Review.tsx:2064 \u00B7 web/src/pages/Review.tsx:2087 \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":"web/src/pages/Review.tsx"},"region":{"startLine":2064}}}],"partialFingerprints":{"codehealthFindingId/v1":"8242756e954531b25de9661c7922145b60b4ba32aa31c44e31f29549749b0a55"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2 locations): web/src/pages/Settings.tsx:1258 \u00B7 web/src/pages/Settings.tsx:1501 \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":"web/src/pages/Settings.tsx"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef05ae5ba085c69d175b5ada467994c3f6e143aea3ee28893a0cc2244a98800"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): web/src/i18n/en.ts:1971 \u00B7 web/src/i18n/zh.ts:1717 \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":"web/src/i18n/en.ts"},"region":{"startLine":1971}}}],"partialFingerprints":{"codehealthFindingId/v1":"4233585fef8e53d127cfa8b2aaa95b42586d618cd99aff7b180b95f4e6feb227"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): web/src/pages/Graph.tsx:1267 \u00B7 web/src/pages/OntologySchemaGraph.tsx:932 \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":"web/src/pages/Graph.tsx"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5e7f13cd945060a9565b6a8758b6b29748f17524793de17fc2888a06e3b2713"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): web/src/pages/Review.tsx:757 \u00B7 web/src/pages/Review.tsx:796 \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":"web/src/pages/Review.tsx"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"f03080a2fa2ccc302b22de1dd40a16f7bf6b12976a443735b8823185bd7de15b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): web/src/pages/ontologyTables.tsx:278 \u00B7 web/src/pages/ontologyTables.tsx:407 \u00B7 web/src/pages/ontologyTables.tsx:492 \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":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"be7d5f1ed9b3f93a745ea78f700e7a477bc7a537868dee970fbd97953a11f3ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 3 locations): web/src/pages/Library.tsx:1718 \u00B7 web/src/pages/Library.tsx:1748 \u00B7 web/src/pages/Library.tsx:1783 \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":"web/src/pages/Library.tsx"},"region":{"startLine":1718}}}],"partialFingerprints":{"codehealthFindingId/v1":"86f0cb3ccabc48cf789ca562ce4bd1b2277ef61643428705dae4de221f8a8775"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/src/pages/Members.tsx:283 \u00B7 web/src/pages/Tokens.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":"web/src/pages/Members.tsx"},"region":{"startLine":283}}}],"partialFingerprints":{"codehealthFindingId/v1":"df1498a440a23753437388116f7f67556e58d8a51628716635d6ba14542527cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/src/pages/Members.tsx:463 \u00B7 web/src/pages/Settings.tsx:550 \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":"web/src/pages/Members.tsx"},"region":{"startLine":463}}}],"partialFingerprints":{"codehealthFindingId/v1":"6421bda46d9c2671f5540723a2a3e7dd52c0c8bf1634010d013365a0afe6740a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/src/pages/Review.tsx:1965 \u00B7 web/src/pages/Review.tsx:2011 \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":"web/src/pages/Review.tsx"},"region":{"startLine":1965}}}],"partialFingerprints":{"codehealthFindingId/v1":"99dafd6743feb10d3d5ebd644207f0c0bc0a1aae665deec36833e4198785cae1"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): web/src/pages/ontologyDialogs.tsx:190 \u00B7 web/src/pages/ontologyDialogs.tsx:437 \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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"27ac09440c2126799ae0ded29ac7c9b0442e3dd7e833e4b76cdfb48a7cd19107"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): web/src/pages/KbMenuList.tsx:190 \u00B7 web/src/pages/KbMenuList.tsx:247 \u2014 the two spans are one implementation copied and then locally edited \u2014 72 tokens are still identical, in the same order in both spans, 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":"web/src/pages/KbMenuList.tsx"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfdc04c2b4a9233e02fd15d08536e699996a29e0d18125ac6b7e06c38386a93"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): web/src/pages/Review.tsx:322 \u00B7 web/src/pages/Review.tsx:335 \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":"web/src/pages/Review.tsx"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8c1e35827df93e296c8732f13e65ba43dc7cb81564198727d9b82c515861c0b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): web/src/pages/graphCanvas.ts:178 \u00B7 web/src/pages/graphCanvas.ts:203 \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":"web/src/pages/graphCanvas.ts"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"debaca8ade45f9311ca20e002abb284a32b256603a27b2fb1b0ecac2b4ad589b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): web/src/pages/graphCanvas.ts:207 \u00B7 web/src/pages/graphCanvas.ts:233 \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":"web/src/pages/graphCanvas.ts"},"region":{"startLine":207}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7a488b2c60be57549dc603142d22a9f35c5f5de97774908cda80ca29c6c84c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/src/pages/Chat.tsx:225 \u00B7 web/src/ui/index.tsx:671 \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":"web/src/pages/Chat.tsx"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"caad798b3fc551a81d58d40d6a8ecac19e0de5d736dbfd7d035f37fe6082d2be"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): web/src/pages/Docs.tsx:58 \u00B7 web/src/ui/citation.tsx:87 \u2014 the two spans are one implementation copied and then locally edited \u2014 59 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":"web/src/pages/Docs.tsx"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"c63589742261f2687b840b7db5d02a7bca59121c69b4134ab2a939b237935796"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/src/pages/Graph.tsx:1462 \u00B7 web/src/pages/Graph.tsx:1556 \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":"web/src/pages/Graph.tsx"},"region":{"startLine":1462}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e9564bd93ac3a7c0504b975ca04361656072203e7ac7e78f0e62d6817b277ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/src/pages/KbSettings.tsx:691 \u00B7 web/src/pages/RulesPanel.tsx:489 \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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"b705fc5d7fcea419d6b10faf67dd3f5ec8fd90d3925b6dc56ab3bee09867ed6f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/src/pages/Ontology.tsx:2280 \u00B7 web/src/pages/Ontology.tsx:2292 \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":"web/src/pages/Ontology.tsx"},"region":{"startLine":2280}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc03f67062cd5cdf9e523ce0b9471011a4d213ae029fc87684ff3a259c1ba22"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): web/src/pages/PendingFacts.tsx:112 \u00B7 web/src/pages/Review.tsx:283 \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":"web/src/pages/PendingFacts.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c00fe3d21eb6f433c711c657ab560551923cbad862750bb79d57e1b74f96b73"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (11 matched lines \u00D7 2 locations): web/src/pages/Chat.tsx:345 \u00B7 web/src/pages/Chat.tsx:525 \u2014 the two spans are one implementation copied and then locally edited \u2014 116 tokens are still identical, in the same order in both spans, 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":"web/src/pages/Chat.tsx"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"edb9cd7d346af158b740344c5880c1d706af9a249f91d778b373a1d8325de961"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/pages/Graph.tsx:609 \u00B7 web/src/pages/Graph.tsx:651 \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":"web/src/pages/Graph.tsx"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"87a107bedba7dc82e9ec20b4542b7463d303129a4dd39fbb69c0052ea6c42e64"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/pages/Graph.tsx:3194 \u00B7 web/src/pages/Graph.tsx:3251 \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":"web/src/pages/Graph.tsx"},"region":{"startLine":3194}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cc6ef65f232b0fb31db201e51053f93f0534010efb88f4975d8241c259feaee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): web/src/pages/Review.tsx:872 \u00B7 web/src/pages/Review.tsx:967 \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":"web/src/pages/Review.tsx"},"region":{"startLine":872}}}],"partialFingerprints":{"codehealthFindingId/v1":"38b975e094b964b8e0838f89a353a6136fbbb0196b4321b18cf891311277a8c8"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 3 locations): web/src/pages/Review.tsx:1051 \u00B7 web/src/pages/Review.tsx:1238 \u00B7 web/src/pages/Review.tsx:1256 \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":"web/src/pages/Review.tsx"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ead4521db256170e68696e9df6164b96f22bb46400e1f4176529c1722c2d284"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/pages/AccountShell.tsx:32 \u00B7 web/src/pages/Shell.tsx:72 \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":"web/src/pages/AccountShell.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"73edcc5418bd5947cde5723c9cc93cd8411df7e9e5a5171e0a97f7964c405c2a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/pages/Graph.tsx:388 \u00B7 web/src/pages/Search.tsx:31 \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":"web/src/pages/Graph.tsx"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4a718390586fd3bc834360d995f07faf7b8389d9271ccf665cce4961a287b25"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): web/src/pages/KbSettings.tsx:231 \u00B7 web/src/pages/KbSettings.tsx:316 \u00B7 web/src/pages/KbSettings.tsx:393 \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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"eadb7e627f3b5b6d58b6a59c8e30074a0e87ec373c131d9cb0791890a1a84c5c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): web/src/pages/Review.tsx:1944 \u00B7 web/src/pages/Review.tsx:2066 \u00B7 web/src/pages/Review.tsx:2089 \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":"web/src/pages/Review.tsx"},"region":{"startLine":1944}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fecf16905bc408a3a6f4279bb9bc06bafd917e323849fa68bb7629da8eacaa9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/pages/Settings.tsx:980 \u00B7 web/src/pages/Settings.tsx:992 \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":"web/src/pages/Settings.tsx"},"region":{"startLine":980}}}],"partialFingerprints":{"codehealthFindingId/v1":"55e48a7f3b5113da912485f29fd6a2d8ae769c6b16318cadd9a4e7878a183e58"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/pages/ontologyDialogs.tsx:453 \u00B7 web/src/pages/ontologyDialogs.tsx:463 \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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6828a5bc8a06e60e7788208191d335313c73c7f9653bbf4ebe811c3248730d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): web/src/pages/ontologyDialogs.tsx:545 \u00B7 web/src/pages/ontologyDialogs.tsx:555 \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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":545}}}],"partialFingerprints":{"codehealthFindingId/v1":"f521cee7742d89e608395dc7f98d9d4b2f435773f272402d47311eafd5bb247b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3 locations): web/src/pages/ontologyTables.tsx:170 \u00B7 web/src/pages/ontologyTables.tsx:332 \u00B7 web/src/pages/ontologyTables.tsx:436 \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":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"6310bf0726361d2fed57e89eb6767d0d143be0421104d781f7360ea0269bbf3c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 3 locations): web/src/components/ui/dialog.tsx:8 \u00B7 web/src/components/ui/dropdown-menu.tsx:6 \u00B7 web/src/components/ui/popover.tsx:3 \u2014 the 3 copies are spread across 3 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":"web/src/components/ui/dialog.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f176e10283ebda1da3054c99c5e658e2ed7a6cf4f8b36fcfe629881bf5b0dd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/pages/Graph.tsx:1305 \u00B7 web/src/pages/OntologySchemaGraph.tsx:966 \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":"web/src/pages/Graph.tsx"},"region":{"startLine":1305}}}],"partialFingerprints":{"codehealthFindingId/v1":"855d309b7c42ac9e5202fde00614d213046dfbc1479a226161112f510b6e564d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/pages/KbSettings.tsx:318 \u00B7 web/src/pages/KbSettings.tsx:395 \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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":318}}}],"partialFingerprints":{"codehealthFindingId/v1":"342408d3ab6d06db3697ac6d5593368561e4b5bfc7f7fc4a0856161367dd9a01"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2 locations): web/src/pages/Review.tsx:2232 \u00B7 web/src/pages/Review.tsx:2252 \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":"web/src/pages/Review.tsx"},"region":{"startLine":2232}}}],"partialFingerprints":{"codehealthFindingId/v1":"994f4e968aedcd350f6baf43c4c80174b3da23c82e39e2b40785d928064c6ca5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/api.ts:55 \u00B7 web/src/api.ts:2914 \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":"web/src/api.ts"},"region":{"startLine":55}}}],"partialFingerprints":{"codehealthFindingId/v1":"6eeb7f34dfe387342cd6227ed6bc01ad68e6da2bf88d8f01003feca736ce6a6b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/api.ts:2426 \u00B7 web/src/api.ts:2435 \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":"web/src/api.ts"},"region":{"startLine":2426}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca6bbf74dcea4200973806aa18820162eb1e5d2463010783de87a3949b8dffd"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/pages/MyKbs.tsx:297 \u00B7 web/src/pages/Tokens.tsx:316 \u2014 the 2 copies are spread across 2 files, 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":"web/src/pages/MyKbs.tsx"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"54040aca148d1296c8b653a023d2585057e1daa20a5f4791cb9798974a06b096"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/pages/Review.tsx:789 \u00B7 web/src/pages/Review.tsx:847 \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":"web/src/pages/Review.tsx"},"region":{"startLine":789}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3dec395c56c2dc533defc208d1e4f1a86de6111fec72d33626eb803bf5f8c48"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/pages/Review.tsx:1110 \u00B7 web/src/pages/Review.tsx:1196 \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":"web/src/pages/Review.tsx"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"f885df7278fd10a723f6ade3d88c2fe2053a0243da699286f5eae734f15d79ff"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2 locations): web/src/router.tsx:114 \u00B7 web/src/router.tsx:162 \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":"web/src/router.tsx"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae2cc9cd98d24e86bcbe47e675c4a60df9a7915f39059a65beb62b83c891460"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/pages/AddOntologyRegressionDialog.tsx:18 \u00B7 web/src/pages/Mappings.tsx:623 \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":"web/src/pages/AddOntologyRegressionDialog.tsx"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"fee31a78e7bfcd3755b7bb799f0acd328da04753523169a38ac101aab252c49d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/pages/Graph.tsx:776 \u00B7 web/src/pages/OntologySchemaGraph.tsx:294 \u2014 the 2 copies are spread across 2 files, 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":"web/src/pages/Graph.tsx"},"region":{"startLine":776}}}],"partialFingerprints":{"codehealthFindingId/v1":"3be6354137ae2038eb9c376d64193a8f36d65a08bd073c496ad2ca291403b4cb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/pages/KbSettings.tsx:255 \u00B7 web/src/pages/KbSettings.tsx:262 \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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e02422ec3fe7afe2255fce53dc8824baed1fe0a10fb732aa2f19042e4acaa83b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): web/src/pages/KbSettings.tsx:281 \u00B7 web/src/pages/KbSettings.tsx:320 \u00B7 web/src/pages/KbSettings.tsx:397 \u2014 all 3 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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":281}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac9bb227cc223d81ad2b5fb0b87d4ca2acbd3e6d30fd8087a51da1819d92060"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/pages/Ontology.tsx:1164 \u00B7 web/src/pages/ontologyTables.tsx:135 \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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1164}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1bd04543c9f588d92097b8af0932a126c8351e94f0a1a614ab98456ab8f4e1a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/pages/Ontology.tsx:1181 \u00B7 web/src/pages/Ontology.tsx:1258 \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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1181}}}],"partialFingerprints":{"codehealthFindingId/v1":"00125e5c750b4cf1e27c2788a96315413cda3f32d725574fb57de64afe478bee"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/pages/Ontology.tsx:2302 \u00B7 web/src/pages/Ontology.tsx:2317 \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":"web/src/pages/Ontology.tsx"},"region":{"startLine":2302}}}],"partialFingerprints":{"codehealthFindingId/v1":"680c0788741dd0cb5eb31b184885fc9d3770f3a5ddb1ada976643e0169947c12"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3 locations): web/src/pages/PendingFacts.tsx:169 \u00B7 web/src/pages/Review.tsx:2031 \u00B7 web/src/pages/Review.tsx:2052 \u2014 the 3 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":"web/src/pages/PendingFacts.tsx"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"338e7fa77d70793bbadb931dead5cb9603820fe63ea32c9bbaee45739f14c9a7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2 locations): web/src/pages/Review.tsx:1520 \u00B7 web/src/pages/Review.tsx:1534 \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":"web/src/pages/Review.tsx"},"region":{"startLine":1520}}}],"partialFingerprints":{"codehealthFindingId/v1":"425d253f96cddcc4e9f2fd6a575a522c49648145732049c23ac5b95d565b8c3b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/pages/KbSwitcher.tsx:37 \u00B7 web/src/pages/MyKbs.tsx:56 \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":"web/src/pages/KbSwitcher.tsx"},"region":{"startLine":37}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7ff97107a4e08da9e05427efacf352ed73e45e81a34574fde521fd967a4bfb6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/pages/Library.tsx:423 \u00B7 web/src/pages/Library.tsx:444 \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":"web/src/pages/Library.tsx"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d4c3ec9fe05981ce4c9c8f3cdd1e20f397b9e40b4eab297110598f995076b7e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 5 locations): web/src/pages/Library.tsx:1339 \u00B7 web/src/pages/Library.tsx:1345 \u00B7 web/src/pages/Library.tsx:1351 \u00B7 web/src/pages/Members.tsx:122 \u00B7 \u002B1 more site(s) not listed \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":"web/src/pages/Library.tsx"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0cd6f6978776312ea08131de9cdf5d64177e2fecd9976699bf3504646393917"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/pages/Library.tsx:1356 \u00B7 web/src/pages/Login.tsx:35 \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":"web/src/pages/Library.tsx"},"region":{"startLine":1356}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea6c2e952ad6f1baf6cef085377f8b9cf1adccaf9ae6a306d12336a2358c274"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/pages/LoginScene.tsx:293 \u00B7 web/src/pages/LoginScene.tsx:300 \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":"web/src/pages/LoginScene.tsx"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aa0b9467af15e165540ca73b8660dedd7e5ff516993ce81087269cc5fff6d06"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3 locations): web/src/pages/Mappings.tsx:680 \u00B7 web/src/pages/Ontology.tsx:1517 \u00B7 web/src/pages/Ontology.tsx:1583 \u2014 the 3 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":"web/src/pages/Mappings.tsx"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c99ff18b341084eadba2896691cd4ce9a23231554a34ec5f9f48450e752a9b7"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/pages/Ontology.tsx:1338 \u00B7 web/src/pages/Ontology.tsx:1388 \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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"acf94a184aebc6e3e3717228ca0db1b6a87b8c180e084b75915c116c60162d57"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/pages/Ontology.tsx:2719 \u00B7 web/src/pages/Ontology.tsx:2726 \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":"web/src/pages/Ontology.tsx"},"region":{"startLine":2719}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b5f28d333c3296cf47cc3e3152349d504af0958bc46503fbdd1067e6570ed5d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/pages/ReviewOverview.tsx:158 \u00B7 web/src/pages/ReviewOverview.tsx:168 \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":"web/src/pages/ReviewOverview.tsx"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"49f8df5b830f8185d9d2a82cdffb6004a304879e4cfe85bfb7ebe3020d66750b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/pages/RulesPanel.tsx:817 \u00B7 web/src/pages/RulesPanel.tsx:964 \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":"web/src/pages/RulesPanel.tsx"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"110db351a6f63b2ab31a4b710cafa5abf550f3f4087fac4baa969c9d83dd8e0c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2 locations): web/src/pages/ontologyDialogs.tsx:313 \u00B7 web/src/pages/ontologyDialogs.tsx:615 \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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ad12418f1934893b165a753300d17daee4f9d0003386157e4e1cfba32e26eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (6 matched lines \u00D7 2 locations): web/src/time.ts:20 \u00B7 web/src/ui/index.tsx:1338 \u2014 the two spans are one implementation copied and then locally edited \u2014 78 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":"web/src/time.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2afecba163d4d0c3f343d1aed112fa28b0b0c03f4565ab64f0faaf448f8234d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2 locations): web/src/pages/Library.tsx:380 \u00B7 web/src/pages/Review.tsx:1409 \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":"web/src/pages/Library.tsx"},"region":{"startLine":380}}}],"partialFingerprints":{"codehealthFindingId/v1":"a052e2069fb8ffd2927fbe1d5e1f17289d5f6002916012919c02d0ec2d38350f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Ontology (cyclomatic 59, cognitive 49): Ontology has cyclomatic complexity 59 and cognitive complexity 49; 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":"web/src/pages/Ontology.tsx"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b4c58a37ed63396822aae3cc696a1691f606cc56989f6a12ae3402d93f24d9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Settings (cyclomatic 53, cognitive 51): Settings has cyclomatic complexity 53 and cognitive complexity 51; 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":"web/src/pages/Settings.tsx"},"region":{"startLine":900}}}],"partialFingerprints":{"codehealthFindingId/v1":"55fc00689c49b6537982500b8f3abe747c9e1886e99266f01acba6417b2c7d35"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function edgeReducer (cyclomatic 51, cognitive 69): edgeReducer has cyclomatic complexity 51 and cognitive complexity 69; 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":"web/src/pages/Graph.tsx"},"region":{"startLine":1065}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cae3f3f9684ea5e5a6b44ff8dc8b5eb531fdb9919f3a9a1f3a136cd0152d8f9"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Library (cyclomatic 48, cognitive 41): Library has cyclomatic complexity 48 and cognitive complexity 41; 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":"web/src/pages/Library.tsx"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a1d6d2812e3757a5fcca3537b4f5eb2a396909dbf161cee2b0915d5d439ebfa"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function readExpression (cyclomatic 46, cognitive 49): readExpression has cyclomatic complexity 46 and cognitive complexity 49; 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":"web/src/pages/ruleExpressions.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac80479d674887bf77dee31e5b2bd87d7a002ec0921e6f485f7543bd8bec9f19"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Graph (cyclomatic 44, cognitive 39): Graph has cyclomatic complexity 44 and cognitive complexity 39; 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":"web/src/pages/Graph.tsx"},"region":{"startLine":268}}}],"partialFingerprints":{"codehealthFindingId/v1":"b154094e62c7b0d948fb06d379038ed42324fc629756ddc3a5bb0abab0d4a332"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SourceModal (cyclomatic 41, cognitive 29): SourceModal has cyclomatic complexity 41 and cognitive complexity 29; 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":"web/src/pages/Library.tsx"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a86cb7ff45d1dd7f0c29f09debcd477475d06c9e9a341fa580864a6de7a4ca"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function draw (cyclomatic 38, cognitive 73): draw has cyclomatic complexity 38 and cognitive complexity 73; 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":"web/src/pages/LoginScene.tsx"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"305505611424892346e5b4721a14ecf1bf51f6bc9bfade83d2d83f9dcaa2968c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SourceEditModal (cyclomatic 38, cognitive 37): SourceEditModal has cyclomatic complexity 38 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":"web/src/pages/Library.tsx"},"region":{"startLine":1872}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff6e47d1e4200fb0b762d6a4a29d73c54d7dec00b4240b8351f38d63185b8cb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Chat (cyclomatic 37, cognitive 32): Chat has cyclomatic complexity 37 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 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":"web/src/pages/Chat.tsx"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"561c04804ef598940c306a5ff54c4f02db4d2110a5294e009fe3b99a702130bb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function SourceBar (cyclomatic 37, cognitive 31): SourceBar has cyclomatic complexity 37 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 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":"web/src/pages/Library.tsx"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d555160cc0233c4e58103b94889bcdafd42e59e435e0874e384ef8574210af"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function KbSettings (cyclomatic 37, cognitive 28): KbSettings has cyclomatic complexity 37 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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":86}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8f40eb04fc808eec68477758bfa5ed8b2efb8d95865938bbb993ffb60c8b80"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function PropertyDialog (cyclomatic 36, cognitive 33): PropertyDialog has cyclomatic complexity 36 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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":290}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f918260ff3a1b0da80b586008da10d2dfb5be0d56908728395e20cdc7a8034"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function buildSchemaGraph (cyclomatic 35, cognitive 59): buildSchemaGraph has cyclomatic complexity 35 and cognitive complexity 59; 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":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf7826e8c53bfc259ddea553a858f1d42f6c7b31871a61e759167a6b6e5371a2"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function mutationFn (cyclomatic 35, cognitive 34): mutationFn has cyclomatic complexity 35 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 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":"web/src/pages/Library.tsx"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a497c0c6c01b07302598c2ad49319bb326520336d22cb2b4f55c465a5a2c899"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function stepDetail (cyclomatic 30, cognitive 29): stepDetail has cyclomatic complexity 30 and cognitive complexity 29; 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":"web/src/steps.ts"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5112170748650e2dd40894916f6fe2029ab95ecb66360e992de18ef71ad3cf"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function nodeReducer (cyclomatic 28, cognitive 34): nodeReducer has cyclomatic complexity 28 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":"web/src/pages/Graph.tsx"},"region":{"startLine":981}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f48d1823e201c8c38983dd96e87833a3135fbe57bf10c784ac1065914285513"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function edgeReducer (cyclomatic 26, cognitive 23): edgeReducer has cyclomatic complexity 26 and cognitive complexity 23; 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":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"6315b89e7d0870be34d0d560797a89df4a18806eed96565c49d2bbde8157a9ab"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function AgentRow (cyclomatic 24, cognitive 20): AgentRow has cyclomatic complexity 24 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 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":"web/src/pages/Review.tsx"},"region":{"startLine":532}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a84f55ecc68f4b97328a34a91ec826a461c4444690fc920af97d47371213ef"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function CaseRow (cyclomatic 21, cognitive 19): CaseRow has cyclomatic complexity 21 and cognitive complexity 19; 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":"web/src/pages/OntologyRegressionsPanel.tsx"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"46b13518b5198f791646230647ae68dc5cc383910bd8dc0f7835540b854fe73c"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/Graph.tsx: 3540 lines of code: web/src/pages/Graph.tsx has 3540 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":"web/src/pages/Graph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8a4b8f72cfd8f26ef3a84b9f5719cbd16b2442850555ce3d1f766f8c508e006"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/api.ts: 2865 lines of code: web/src/api.ts has 2865 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":"web/src/api.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3ad22207919a80dacde0366eb0326b3fc7d079003853d95f399bc8937a987ec"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/Ontology.tsx: 2772 lines of code: web/src/pages/Ontology.tsx has 2772 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":"web/src/pages/Ontology.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4793578708d8f5434c6f98c03ec69c01638c1ccb68225de0f69b6429fe6c31d5"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/i18n/en.ts: 2523 lines of code: web/src/i18n/en.ts has 2523 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":"web/src/i18n/en.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e581a78c4cf8f7c91db72db5f312477d3b9e9afe67922d959cd1c5394739a6a"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/Library.tsx: 2280 lines of code: web/src/pages/Library.tsx has 2280 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":"web/src/pages/Library.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed21c0fad09cf6f5fc12c1d75d4f839efc3b2eae17082d36796ef9d4c44d185"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/Review.tsx: 2236 lines of code: web/src/pages/Review.tsx has 2236 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":"web/src/pages/Review.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"05a4914a5ee65d2a12351533252aad30d845a98e902923e40eafee134e5a9ce1"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/i18n/zh.ts: 2208 lines of code: web/src/i18n/zh.ts has 2208 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":"web/src/i18n/zh.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3996712c5950d282efa193b8826bc10e300d9ccc26909072c07824fb10bcd8e7"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/ui/index.tsx: 1841 lines of code: web/src/ui/index.tsx has 1841 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":"web/src/ui/index.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5ccc170c7c354dc3a34d7ceef859e99c684866a3f49e358f26ef1b667813226"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/Settings.tsx: 1469 lines of code: web/src/pages/Settings.tsx has 1469 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":"web/src/pages/Settings.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"06aceb5fa9ad3ec02e150bd9a7d183cc5594ad9c1a0277a4ec6da6c1eaa88771"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/OntologySchemaGraph.tsx: 1105 lines of code: web/src/pages/OntologySchemaGraph.tsx has 1105 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":"web/src/pages/OntologySchemaGraph.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d072bd2f5efc785bd71721dab2df24b4b74b11d6e5256c28092cd0620306c9fd"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/Chat.tsx: 1098 lines of code: web/src/pages/Chat.tsx has 1098 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":"web/src/pages/Chat.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"24ed4e9f251a0d33665f14c595f0c48b1cdd1afda442a8adff90f0f7e81fa565"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/RulesPanel.tsx: 1028 lines of code: web/src/pages/RulesPanel.tsx has 1028 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":"web/src/pages/RulesPanel.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5680b44f70d1ebde272cac38ccb0844a170dace344277c47f32626c7585ed038"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/ontologyDialogs.tsx: 848 lines of code: web/src/pages/ontologyDialogs.tsx has 848 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":"web/src/pages/ontologyDialogs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d73800d2e2e2dd36023a56b3092b0a67064986e7f4914eb6679e2e63dc471eb7"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/KbSettings.tsx: 788 lines of code: web/src/pages/KbSettings.tsx has 788 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":"web/src/pages/KbSettings.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"42ff04c31e7f0bc916fe7fc0ee4f25287c6f409f33baaaeae16e8e45fd11fc55"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/Mappings.tsx: 735 lines of code: web/src/pages/Mappings.tsx has 735 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":"web/src/pages/Mappings.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b9c55e31494b08c674981933680fce77d2b8f36f51ee419a0b4d6dcf30661f"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/ontologyTables.tsx: 632 lines of code: web/src/pages/ontologyTables.tsx has 632 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":"web/src/pages/ontologyTables.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e97245cc7e2285f3f64f600d46be75abead0d02f70cf6c97a8845168aa3304d"}},{"ruleId":"R3","level":"warning","message":{"text":"web/src/pages/Members.tsx: 543 lines of code: web/src/pages/Members.tsx has 543 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":"web/src/pages/Members.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e99e45bf6f739e4ed9e1983b0eb3b22d720442c43f14bd7b2255e0c15c7c08f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test rig can mount a component in this workspace: web/vite.config.ts declares environment \u0022node\u0022, and no package here declares a DOM implementation (jsdom / happy-dom), a component testing library or a browser runner \u2014 so none of the 34 unreached component module(s) can be tested as written, however the suite is authored: web/src/pages/Review.tsx, web/src/pages/Chat.tsx, web/src/pages/KbSettings.tsx, web/src/router.tsx, web/src/pages/AlertBell.tsx, web/src/pages/Docs.tsx and 28 more. Add a DOM environment and a component testing library (for example jsdom \u002B @testing-library, or the runner\u0027s browser mode), then test the components. Reported once because these files share one cause, not one omission each."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/vite.config.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6edd05bc5993a0ac161d99aeab3b519ea8086e63f17df4391a5959b34cd8a6b"}},{"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":"scripts/e2e_type_drift.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c8e2ff6904022ae96fc286a4604485545892163f9fd3ddb6b090c7449a5af98"}},{"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":"scripts/star-history.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7c8ec15fc43e3725da2639a286f0906de9e5b7c3a762cbf7336d1defa9b716f"}},{"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":"web/scripts/style-guard.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fb2a3eca904a094f9aa6da7c77745b992d4ab2dc287ececd0f925f8a3a09040"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~115 LoC): no import path from any entry point (13 application, 4 tooling, 48 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":"web/src/components/ui/table.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cb622eec03b8438c820eac165aaabf6072061b7ca00ad05bf17bd8b3c27a56c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~102 LoC): no import path from any entry point (13 application, 4 tooling, 48 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":"web/src/components/ui/card.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"105068eff267426ffedd7e032494515a1cef24cc88497962db8904765deeb6fe"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~87 LoC): no import path from any entry point (13 application, 4 tooling, 48 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":"web/src/components/ui/tabs.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"81c6fbbfe765ee4e5cf69a12766b6a35f944eb4711f6ea6f51178c3374c90f0f"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~54 LoC): no import path from any entry point (13 application, 4 tooling, 48 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":"web/src/components/ui/tooltip.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"416c49ed9a0df38f951fecf244f508b651f2924b98741e2e262679e9c2021dee"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~30 LoC): no import path from any entry point (13 application, 4 tooling, 48 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":"web/src/components/ui/switch.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2d15a3843cdc7351417a725526e6cfb0118c8f010aebb5ff7b44737a4c47e0c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~27 LoC): no import path from any entry point (13 application, 4 tooling, 48 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":"web/src/components/ui/separator.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"af015640ee9962488a6bfbd7a44bbca80d9a71f432de3e1c543412aaeda25b40"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~21 LoC): no import path from any entry point (13 application, 4 tooling, 48 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":"web/src/components/ui/label.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"65588864dd3c6efeb25313f92341798c60a966894f47c6d4f10c87bc663dee0c"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~13 LoC): no import path from any entry point (13 application, 4 tooling, 48 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":"web/src/components/ui/skeleton.tsx"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"640e0a19a53261c7c8e20d2c61555b77427d3f5726b1e6bec6899d535b21945b"}},{"ruleId":"R7","level":"warning","message":{"text":"Dead file (~1 LoC): no import path from any entry point (13 application, 4 tooling, 48 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":"web/src/lib/utils.ts"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a50d8c9ba978b8a97495effe183304204275db9eadb56be92c009175881fd388"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027Origin\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/origin.ts"},"region":{"startLine":6}}}],"partialFingerprints":{"codehealthFindingId/v1":"0895d352d2a5eb195e88cdf96ec05378d5f4e942d5b8e8c5b952e24c40f995fd"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CANVAS_TITLE_SIZE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/graphVisuals.ts"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff98a9d79c10e47d6936ed48ccd4956e355ad1f05f476714138cba8ee62c1c6"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027CANVAS_META_SIZE\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/graphVisuals.ts"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80ad701b2f280a3ac19ba3b90ab6536b5510bcd7db8d3d546af6b2cfe7da588"}},{"ruleId":"R7","level":"note","message":{"text":"Unused export \u0027hexToRgb\u0027: Nothing imports this binding \u2014 it is safe to review for removal."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/pages/graphVisuals.ts"},"region":{"startLine":71}}}],"partialFingerprints":{"codehealthFindingId/v1":"afcf6f59a021c380b3b0b561986f03ba38909d3bddaa8dd403d0408118bcb649"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027@sigma/node-square\u0027: Declared in web/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":"7948436fc3f186dd595584849071a65bd022bf0912549c0d6198658ec957fd49"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): web/src/ui/dialog.tsx \u2192 web/src/ui/index.tsx \u2192 web/src/ui/dialog.tsx (one verified cycle inside a mutually-dependent group of 4 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"web/src/ui/dialog.tsx"},"region":{"startLine":8}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dd3b3309e4da69b987f9359514f405afe98511350fad10709ee455a3a950187"}},{"ruleId":"S1","level":"warning","message":{"text":"Weak hash algorithm: MD5/SHA1 is computed here, and both are collision-broken. If this digest protects anything \u2014 a signature, an integrity or tamper check, a credential, or any value an attacker can influence \u2014 that is a real weakness: use SHA-256\u002B (\u0060sha2::Sha256::digest(\u2026)\u0060) for content integrity, or a KDF (bcrypt/Argon2/scrypt) for password storage. If it only derives a non-security identifier (a cache key, an avatar URL, an ETag), collision resistance carries no security consequence here; make that intent explicit instead \u2014 a non-cryptographic hash such as xxhash or murmurhash says it in code \u2014 since the algorithm alone cannot distinguish the two uses. Where a protocol this code does not own fixes the digest (a k-anonymity range query, a legacy signature format), the protocol decides; say so beside the call."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/github_repo.rs"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"06b435610471b983e0e44dc798b7011ee011fdc0b9ca8754d9992bea4c19476e"}},{"ruleId":"S1","level":"note","message":{"text":"No security response headers detected: None of the 11 security response headers the OWASP Secure Headers Project recommends (Content-Security-Policy, Strict-Transport-Security, X-Content-Type-Options, X-Frame-Options, \u2026) is set on a response this repository\u0027s Rust server sends \u2014 defense in depth, even when a proxy could set them. (\u22122.0 on this card.) The server: \u0060axum::serve(\u0060 (crates/utopia-server/src/main.rs:312)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bd19c680309417e132c0be93c2002123f0664b42afe6172b1319da65a6a57ba7"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060c.operand \u0026\u0026 typeof c.operand === \u0022object\u0022 \u0026\u0026 !Array.isArray(c.operand)\u0060 appears character-identically in 2 files \u2014 web/src/pages/ExpressionDraftLab.tsx, web/src/pages/ruleDependencies.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":"web/src/pages/ExpressionDraftLab.tsx"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"16a7b64bed80d6b7f9b65f72c7ddc27fc5f06fbc7fc9f45f456c768bcbb7f5a1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060depth \u003E 4 || !raw || typeof raw !== \u0022object\u0022 || Array.isArray(raw)\u0060 appears character-identically in 2 files \u2014 web/src/pages/ruleDependencies.ts, web/src/pages/ruleExpressions.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":"web/src/pages/ruleDependencies.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d88323593e0a190483ce5b01ab8dc9e32ab88e6bc21408327e3c41bce9a4e77"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060me.error instanceof ApiError \u0026\u0026 me.error.status === 401\u0060 appears character-identically in 2 files \u2014 web/src/pages/AccountShell.tsx, web/src/pages/Shell.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":"web/src/pages/AccountShell.tsx"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"1deab5b383edd104e702b2fdf7be9ac4095676ce7e89554903b95d9a28bf341e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!note.is_primary_key \u0026\u0026 note.references_table.is_none()\u0060 appears character-identically in 2 files \u2014 crates/utopia-server/src/query_engine/mysql.rs, crates/utopia-server/src/query_engine/postgres.rs. 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":"crates/utopia-server/src/query_engine/mysql.rs"},"region":{"startLine":579}}}],"partialFingerprints":{"codehealthFindingId/v1":"995a410d6d1a26a5a40ad0f0a5de5f114cad864cf4faeceedee3ba31a455b55f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060!req.email.contains(\u0027@\u0027) || req.email.len() \u003E 254\u0060 appears character-identically in 2 files \u2014 crates/utopia-server/src/api/admin_routes.rs, crates/utopia-server/src/api/auth_routes.rs. 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":"crates/utopia-server/src/api/admin_routes.rs"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"810e6415125aa39b8212ef71fa3c16091aabce5d81d42b5efde0e93a9a3ab142"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060id.is_primary_key \u0026\u0026 id.references_table.is_none()\u0060 appears character-identically in 2 files \u2014 crates/utopia-server/src/query_engine/mysql.rs, crates/utopia-server/src/query_engine/postgres.rs. 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":"crates/utopia-server/src/query_engine/mysql.rs"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e9283f5c065eafb26887224300ee0fba377d9c01888f4b126de0068aff3ebeb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.is_empty() || name.chars().count() \u003E 64\u0060 appears character-identically in 4 files \u2014 crates/utopia-server/src/api/auth_routes.rs, crates/utopia-server/src/api/kbs.rs, crates/utopia-server/src/api/workspaces.rs, crates/utopia-store/src/tokens.rs. 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":"crates/utopia-server/src/api/auth_routes.rs"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f0113ba04c33a709903167cf9abf653c6029258585ab289a0e48bef95d014cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060p2_id.is_primary_key \u0026\u0026 p2_id.references_table.is_none()\u0060 appears character-identically in 2 files \u2014 crates/utopia-server/src/query_engine/mysql.rs, crates/utopia-server/src/query_engine/postgres.rs. 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":"crates/utopia-server/src/query_engine/mysql.rs"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"c302853ff24029d4dd59cc8dca45a4b7403d21ec85c712abe1f06f30326ec357"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060req.display_name.trim().is_empty() || req.display_name.chars().count() \u003E 64\u0060 appears character-identically in 2 files \u2014 crates/utopia-server/src/api/admin_routes.rs, crates/utopia-server/src/api/auth_routes.rs. 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":"crates/utopia-server/src/api/admin_routes.rs"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c9df1491b22dc2d4ffa56ba79fecc09e858c465949da3c381e84cf01b4a15cd"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060typed.added \u003E 0 || typed.merged \u003E 0 || typed.retired \u003E 0\u0060 appears character-identically in 2 files \u2014 crates/utopia-server/src/main.rs, crates/utopia-server/src/phrase_alignment.rs. 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":"crates/utopia-server/src/main.rs"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"364726b34762508468932b43c35c220b288981dce826ad9fd351210d62bd80ea"}},{"ruleId":"X2","level":"note","message":{"text":"Not all async functions that make a request accept an AbortSignal: Only 1/2 async functions that make a cancellable request (fetch, axios, ky, ofetch) 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: stargazerDates: \u0060stargazerDates\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":"scripts/star-history.mjs"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e71d47a0be0e4a20e60548549ab0c3c6db76abcf401d12c86eef92bf7fa20ee"}},{"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":"web/src/api.ts"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6aa58b29ffdbc537ee136a1a678b6d931033a984ae5d625c00597d37b91abdd"}},{"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":"web/src/api.ts"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7f930359df3c1b713b42dd37a3bc578ff127d858781f5d102fffc3f038abdc3"}},{"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":"web/src/api.ts"},"region":{"startLine":2921}}}],"partialFingerprints":{"codehealthFindingId/v1":"711a4397a3ca127fb2c3f92248784f52c8e08797d53a8613c65b83cb14cb8ea2"}},{"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":"web/src/api.ts"},"region":{"startLine":2966}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d77b87145ba7b359737e037bcdec476fdc27e106904199682d1e35134547206"}},{"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":"web/src/api.ts"},"region":{"startLine":2973}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b4918f331b06d2f2337ea2c8d1880c1e58d0c5fe7dbfa61917e28ab1d53623"}},{"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":"web/src/clipboard.ts"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba00f9eba65b2b8309b03944f64f716677b984b693245e1a07f96200b3b3feb4"}},{"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":"web/src/theme.ts"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"f481aa35a5f410406423a21707b96237a67497707537728aa73615aa983c14a8"}},{"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":"web/src/unread.ts"},"region":{"startLine":39}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afa7b0a6a6e724fbb2c992b807489a2bb6a5f11f8c2c6e5b8e1660241fc4ffe"}},{"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":"web/src/unread.ts"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad23f7dc4f2c6a93617e98b0e85353e0cdfe3785f2fd9487d3f7177db3fe2c05"}},{"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":"web/src/pages/Graph.tsx"},"region":{"startLine":2223}}}],"partialFingerprints":{"codehealthFindingId/v1":"46bd7c7e8d1a8e5cd6456e0627417c2f4e9e0e7c4d30304e029fc5a639dab2e2"}},{"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":"web/src/pages/Ontology.tsx"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"b336746330a5a45d8a89457487ff43c30512f0b7b898187402d9e49f4a2d84bf"}},{"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":"web/src/i18n/index.ts"},"region":{"startLine":25}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4139ebe4136e22398e21c9a576f64dd741ff881f6525686832f3823b122954e"}},{"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":"web/src/i18n/index.ts"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"e58c379125c796a5c626bf612522942c8d22b9ddd0f391c837c6fbbd8f8444d6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 145 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/main.rs"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ea5f20936788ecda4042be53dbf31abca56188abed7437c3b727066fad3e6c6"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 300 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/main.rs"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b88cf4a18335d69fea7c0912ca65e1344fd565624c6eb8fab2dd28bc99a7f1"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 308 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/main.rs"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"cada010309c80178315406935172f8e610ca47bcc12d1745d947e8c4e46e656d"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 673 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/main.rs"},"region":{"startLine":673}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7251681ce30d507ec4fb473759091e12438dc796039e08f63472ac4e618f7f"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 691 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/phrase_alignment.rs"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7f76565ed39ecd802802443a4d3cb6ae50ec27f0ce599d71c09953f5c7ffdc"}},{"ruleId":"X4","level":"note","message":{"text":"Interpolated log message defeats structured logging: \u0060info!\u0060 at line 96 is handed a format string with \u0060{\u2026}\u0060 values in it, so tracing records one finished \u0060message\u0060 field \u2014 the values in it cannot be queried, filtered or aggregated as fields, and every occurrence reads as a different message. Record the values as fields beside a constant message instead: \u0060info!(order_id = %order_id, status = ?status, \u0022order status updated\u0022)\u0060 (\u0060%\u0060 records a value by its \u0060Display\u0060, \u0060?\u0060 by its \u0060Debug\u0060, a bare name as itself), which a JSON subscriber, OpenTelemetry or a log store keeps as queryable keys. An error goes in as a field too: \u0060error = %err\u0060."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/api/mod.rs"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"75ff5713fb80a032f9ebebd76a9f4bdf7d15eb55267de268896588154143a928"}},{"ruleId":"X5","level":"note","message":{"text":"Null assertions (\u0060!\u0060) reduce the strict null checking score: ~2.7 \u0060!\u0060 null assertions per 1k TypeScript source lines \u2014 111 assertion(s) across the 40733 source line(s) of the 109 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: web/src/pages/Review.tsx (20), web/src/pages/Library.tsx (15), web/src/pages/Graph.tsx (8). Each one tells the compiler to trust the author about null, suppressing the very diagnostic \u0060strictNullChecks\u0060 exists to produce."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"edb251d0f8dd1deb75ff6fa12d145c3d5c948a70b0aaf8da052107c857335979"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on Err: \u0060execute\u0060 turns every \u0060Err\u0060 into \u0060\u0022{}\u0022.into()\u0060 \u2014 a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with \u0060?\u0060. 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 arm or in the doc comment, and the row stops firing."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"crates/utopia-server/src/query_engine/postgres.rs"},"region":{"startLine":106}}}],"partialFingerprints":{"codehealthFindingId/v1":"7610dbb6734ffcec7abdeea8d997d38b14893491b9baf6a6cddae6dfb1054e80"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060load\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":"web/src/unread.ts"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e13757649a6eef9561cc7fd1bb204ae0226e1fa9cf12941abeba3b11c7855d7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060queryFn\u0060 (in \u0060useKb\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":"web/src/kb.tsx"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"77b03a488080b6b91bd53b5468bc02431389a26d64815ed2128d4695be5f264d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060stored\u0060 swallows every exception into \u0060return \u0022dark\u0022\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":"web/src/theme.ts"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"f676237e1dc3cfc617ebdff751a239186cb61dea5d1030ea79721c7b79ede473"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1032","guid":"5f21e517-68aa-a650-9a25-5771ef024637","name":"OWASP Top Ten \u2014 Security Misconfiguration category","shortDescription":{"text":"OWASP Top Ten \u2014 Security Misconfiguration category"},"helpUri":"https://cwe.mitre.org/data/definitions/1032.html"},{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1104","guid":"4c918cb5-b2a6-6c55-9963-a44ee464305e","name":"Use of Unmaintained Third Party Components","shortDescription":{"text":"Use of Unmaintained Third Party Components"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1188","guid":"90b5d93c-2e8f-7d58-b831-915e7ee4a150","name":"CWE-1188","shortDescription":{"text":"CWE-1188"},"helpUri":"https://cwe.mitre.org/data/definitions/1188.html"},{"id":"CWE-125","guid":"98717707-96bf-ca5b-9568-8d1d257574c1","name":"CWE-125","shortDescription":{"text":"CWE-125"},"helpUri":"https://cwe.mitre.org/data/definitions/125.html"},{"id":"CWE-1333","guid":"11a336ce-63de-c45c-845e-29ca1e8df13d","name":"CWE-1333","shortDescription":{"text":"CWE-1333"},"helpUri":"https://cwe.mitre.org/data/definitions/1333.html"},{"id":"CWE-1352","guid":"5257f322-5cfc-6b52-bedd-0b9a526b4c7d","name":"CWE-1352","shortDescription":{"text":"CWE-1352"},"helpUri":"https://cwe.mitre.org/data/definitions/1352.html"},{"id":"CWE-1357","guid":"e4d2e772-757e-0a5c-bd7d-77052949d866","name":"Reliance on Insufficiently Trustworthy Component","shortDescription":{"text":"Reliance on Insufficiently Trustworthy Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1357.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-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-540","guid":"1a9db5db-e5bb-ae5d-935a-d1b4e9ee080b","name":"Inclusion of Sensitive Information in Source Code","shortDescription":{"text":"Inclusion of Sensitive Information in Source Code"},"helpUri":"https://cwe.mitre.org/data/definitions/540.html"},{"id":"CWE-732","guid":"1da27e8f-b330-7650-ab63-bd61953eae5d","name":"Incorrect Permission Assignment for Critical Resource","shortDescription":{"text":"Incorrect Permission Assignment for Critical Resource"},"helpUri":"https://cwe.mitre.org/data/definitions/732.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-829","guid":"13c33925-97fb-5a5e-b40c-56d328b8a4d7","name":"Inclusion of Functionality from Untrusted Control Sphere","shortDescription":{"text":"Inclusion of Functionality from Untrusted Control Sphere"},"helpUri":"https://cwe.mitre.org/data/definitions/829.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A01:2025","guid":"df693558-c822-0452-8f7b-4d53cb6bcc59","name":"Broken Access Control","shortDescription":{"text":"Broken Access Control"},"helpUri":"https://top10.owasp.org/2025/A01_2025-Broken_Access_Control/"},{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"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-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-7","guid":"4c4af28d-49e3-2d51-b597-e1396c49658b","name":"Insecure System Configuration","shortDescription":{"text":"Insecure System Configuration"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-07-Insecure-System-Configuration"},{"id":"CICD-SEC-8","guid":"b6b2dacf-a168-4957-876e-a8c73ee00eb0","name":"Ungoverned Usage of 3rd Party Services","shortDescription":{"text":"Ungoverned Usage of 3rd Party Services"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-08-Ungoverned-Usage-of-3rd-Party-Services"},{"id":"CICD-SEC-9","guid":"b3d36727-0395-5b51-94c4-5e173d62eab3","name":"Improper Artifact Integrity Validation","shortDescription":{"text":"Improper Artifact Integrity Validation"},"helpUri":"https://owasp.github.io/www-project-top-10-ci-cd-security-risks/CICD-SEC-09-Improper-Artifact-Integrity-Validation"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":123,"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."]}]}