{"$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":"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":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D19","name":"Documentation Quality","shortDescription":{"text":"Documentation Quality"},"helpUri":"https://codehealth.canine.dev/dimensions/D19"},{"id":"D21","name":"Naming Consistency","shortDescription":{"text":"Naming Consistency"},"helpUri":"https://codehealth.canine.dev/dimensions/D21"},{"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"]}],"properties":{"cwe":["CWE-798","CWE-259"]}},{"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"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"]}},{"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"]}],"properties":{"cwe":["CWE-1395","CWE-937"]}},{"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"]}],"properties":{"cwe":["CWE-1032","CWE-732","CWE-16"]}},{"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"]}],"properties":{"cwe":["CWE-1357","CWE-494"]}},{"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"]}],"properties":{"cwe":["CWE-1059"]}},{"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"]}],"properties":{"cwe":["CWE-506"]}},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"AXB2","name":"Runtime readiness","shortDescription":{"text":"Runtime readiness"},"helpUri":"https://codehealth.canine.dev/dimensions/AXB2"},{"id":"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":"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":"R11","name":"Import Boundaries","shortDescription":{"text":"Import Boundaries"},"helpUri":"https://codehealth.canine.dev/dimensions/R11"},{"id":"R2","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/R2"},{"id":"R3","name":"Large Files","shortDescription":{"text":"Large Files"},"helpUri":"https://codehealth.canine.dev/dimensions/R3"},{"id":"R4","name":"Test Coverage","shortDescription":{"text":"Test Coverage"},"helpUri":"https://codehealth.canine.dev/dimensions/R4"},{"id":"R5","name":"Dependency Freshness","shortDescription":{"text":"Dependency Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/R5"},{"id":"R6","name":"Tooling","shortDescription":{"text":"Tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/R6"},{"id":"R7","name":"Dead Code","shortDescription":{"text":"Dead Code"},"helpUri":"https://codehealth.canine.dev/dimensions/R7"},{"id":"R8","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/R8"},{"id":"R9","name":"Circular Imports","shortDescription":{"text":"Circular Imports"},"helpUri":"https://codehealth.canine.dev/dimensions/R9"},{"id":"SC1","name":"Supply-chain hygiene","shortDescription":{"text":"Supply-chain hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/SC1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"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":"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":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"search.Document.search (cyclomatic 215): search.Document.search has cyclomatic complexity 215 (threshold 15). Of this number, 204 points are the body\u0027s own statements and 11 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/search.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"897d95802055e9ff3c9879b340f33baeb448d4ff8996b15a785a9b623bf01c16"}},{"ruleId":"D1","level":"warning","message":{"text":"highlight.highlight_fields (cyclomatic 135): highlight.highlight_fields has cyclomatic complexity 135 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/highlight.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"89057196c51c6aef75e794f5d80ac2aa4f7e3be4002b7fef3c9ead7bbc342374"}},{"ruleId":"D1","level":"warning","message":{"text":"encoder.Encoder.encode (cyclomatic 72): encoder.Encoder.encode has cyclomatic complexity 72 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/encoder.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b593bfb19691866e70687ea0079b46e4c7c74b5a39b04be285ced32077737b3"}},{"ruleId":"D1","level":"warning","message":{"text":"handler.Resolver.handler (cyclomatic 72): handler.Resolver.handler has cyclomatic complexity 72 (threshold 15). Of this number, 66 points are the body\u0027s own statements and 6 belong to 3 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/handler.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"72962d467dbf5cf24feba8c25fa8c95d8963a2bf6b12aca25641e8c0e1dc459a"}},{"ruleId":"D1","level":"warning","message":{"text":"search.Index.search (cyclomatic 61): search.Index.search has cyclomatic complexity 61 (threshold 15). Of this number, 49 points are the body\u0027s own statements and 12 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/search.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"92a226484ed92eac3dd2db3451e75d3c448bf110115e9343df78a60bd2de62bd"}},{"ruleId":"D1","level":"warning","message":{"text":"add.Document.add (cyclomatic 55): add.Document.add has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/add.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"e508029500d5438c7120eb8e30bf185ea50c12b263de135432f848de1e2e0fd8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.Index (cyclomatic 54): index.Index has cyclomatic complexity 54 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f41b004b795b3bbb63dae47159106686b8e8f787211824bb15db60db5c8e626"}},{"ruleId":"D1","level":"warning","message":{"text":"document.Document (cyclomatic 54): document.Document has cyclomatic complexity 54 (threshold 15). Of this number, 52 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb6fdd973d73935248999daa5e6472fe099064c0146af0023a42b52c05e046b1"}},{"ruleId":"D1","level":"warning","message":{"text":"add.Index.add (cyclomatic 49): add.Index.add has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/add.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f988f5f46c4772b95ed5a7de6c1137385fb37eb9abbe2626e2273e4ee7953f9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.IdxDB.commit (cyclomatic 45): index.IdxDB.commit has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 15 of the 45 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 464, 410, 423, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/indexeddb/index.js"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"f42cf7071b6b82a07165f5d759bd23e49cd4a8f745c9fcc2283d609707201501"}},{"ruleId":"D1","level":"warning","message":{"text":"index.SqliteDB.commit (cyclomatic 45): index.SqliteDB.commit has cyclomatic complexity 45 (threshold 15). Most of this is not in the body itself: 10 of the 45 points are its own statements and the rest belongs to one function literal inside it that branches (line 630). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3814db828ddb802eaecbcaa9bcb612d43a295e3600c5d73b2e507bb69eb5190"}},{"ruleId":"D1","level":"warning","message":{"text":"intersect.intersect (cyclomatic 43): intersect.intersect has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intersect.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e50b0dab6e2e5787d402b8a365ca210be88c1998121be47472325dd6a7e5ee9"}},{"ruleId":"D1","level":"warning","message":{"text":"index.PostgresDB.commit (cyclomatic 42): index.PostgresDB.commit has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 9 of the 42 points are its own statements and the rest belongs to one function literal inside it that branches (line 592). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"43fe764ade2d57192b1273001779b02f945f018b69e91e9206bf920f5f3c1386"}},{"ruleId":"D1","level":"warning","message":{"text":"index.RedisDB.commit (cyclomatic 42): index.RedisDB.commit has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 9 of the 42 points are its own statements and the rest belongs to one function literal inside it that branches (line 362). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8e236829005a5727bc7b3ee3d722814bb7ed4c5fa69942013ca3913e6aa2d30"}},{"ruleId":"D1","level":"warning","message":{"text":"index.ClickhouseDB.commit (cyclomatic 37): index.ClickhouseDB.commit has cyclomatic complexity 37 (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":"src/db/clickhouse/index.js"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d660f6cec9e4c76928fab050e772d55c132e2765a8fe287fceb8dc9a47e4915"}},{"ruleId":"D1","level":"warning","message":{"text":"index.MongoDB.commit (cyclomatic 36): index.MongoDB.commit has cyclomatic complexity 36 (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":"src/db/mongodb/index.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"298fcb152b1b0ba1c84e6f47e8d58cbd072f7264c6ca41b687a4154c9f270483"}},{"ruleId":"D1","level":"warning","message":{"text":"encoder.Encoder.assign (cyclomatic 34): encoder.Encoder.assign 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":"src/encoder.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f0f7f7a5c45626addedd5d5128473551f73c842fe9db33aec776cfe7faff04"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 34): (anonymous) has cyclomatic complexity 34 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 17 belong to 3 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"task/babel.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"5742fa3e162d57fc11f0018cd36e46983de6e991f9158d361845cb0b4fbe6f80"}},{"ruleId":"D1","level":"warning","message":{"text":"document.parse_descriptor (cyclomatic 31): document.parse_descriptor has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4a6e3d0b2faa524110064edf1d9dfb359f8190048f1e2c49c2ac5a799601732"}},{"ruleId":"D1","level":"warning","message":{"text":"index.ClickhouseDB.search (cyclomatic 31): index.ClickhouseDB.search has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3d65ef99fa36ecf544bcd6499078c5b528add9ac9b984c6c8d58747fa7ea1f"}},{"ruleId":"D1","level":"warning","message":{"text":"index.MongoDB.search (cyclomatic 31): index.MongoDB.search has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9a6fef9c80d6f0554ea71c43a7c4c35d7b0b83a81a3cf623aa17ef8c027bf4"}},{"ruleId":"D1","level":"warning","message":{"text":"index.PostgresDB.search (cyclomatic 31): index.PostgresDB.search has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b173dfe999dcbad22511c47ad173c292449c851dc3b4a36b0036aafe1bd74e2"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 31): (anonymous) has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 6 of the 31 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 384, 303, 313, \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":"task/build.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"da01f6b450c00e3c4a9020d96a8f6bec81c86aeae44c5504deb54e596da61219"}},{"ruleId":"D1","level":"warning","message":{"text":"index.SqliteDB.search (cyclomatic 30): index.SqliteDB.search has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ff185c1e4e46920c480d29ff9e190ba99efb43deb7b65e2fde6a93b529d9d6"}},{"ruleId":"D1","level":"warning","message":{"text":"add.Index._push_index (cyclomatic 29): add.Index._push_index has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/add.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b31e733a6aec3ee1dec42a8ad5bf3241acbbc4fcae2a97a8ad4398f26a58c3"}},{"ruleId":"D1","level":"warning","message":{"text":"keystore.KeystoreArray (cyclomatic 25): keystore.KeystoreArray has cyclomatic complexity 25 (threshold 15). Of this number, 16 points are the body\u0027s own statements and 9 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/keystore.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cee1b75d98b58b76e968998a16b4422fceb98729d8aedc595036aec720e5b04"}},{"ruleId":"D1","level":"warning","message":{"text":"index.RedisDB.search (cyclomatic 25): index.RedisDB.search has cyclomatic complexity 25 (threshold 15). Of this number, 19 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3342cbbcfe67d8d15596ba2b2d0bdf3b1ffb9ad16d7016d3740e7d3fd4e652f"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver.Resolver (cyclomatic 24): resolver.Resolver has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolver.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"79f1c8465c349316230b82cb92182f361d5e386b437dee53fe563b1d17b1de9f"}},{"ruleId":"D1","level":"warning","message":{"text":"handler.default (cyclomatic 23): handler.default 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":"src/worker/handler.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24edf5a94c64ed56017789422fc3626eb2387bc20cb650380c0a424fed11beb"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 23): (anonymous) 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":"src/worker/handler.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd691ed53465b87a5b0624bbadd1401120619751bedfc21894d1d8a3a899b1d0"}},{"ruleId":"D1","level":"warning","message":{"text":"resolver.Resolver.resolve (cyclomatic 22): resolver.Resolver.resolve has cyclomatic complexity 22 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolver.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec1f1fff0ab9e235d1dc46360a85c83b54c0a27780524c5877ff5c0ef330302"}},{"ruleId":"D1","level":"warning","message":{"text":"intersect.union (cyclomatic 21): intersect.union has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intersect.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ee6bc19345e330b693769cc4bbcc97f7574edec78041ca392622fc34e6a6d8"}},{"ruleId":"D1","level":"warning","message":{"text":"index.IdxDB.get (cyclomatic 21): index.IdxDB.get has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 6 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 223). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/indexeddb/index.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"bba7f3e3076736de5d09a24f73c3425a2331ac14aca5ae637cbc68e373b5a793"}},{"ruleId":"D1","level":"warning","message":{"text":"xor.exclusive (cyclomatic 20): xor.exclusive has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/xor.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"de50d433d10364a4edbd5901d2496180a528d0ba8e6ed82477a9d50e322ebba1"}},{"ruleId":"D1","level":"warning","message":{"text":"node.parentPort.on(\u0022message\u0022) (cyclomatic 20): node.parentPort.on(\u0022message\u0022) has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"77249650030cd98c24b3d4ccdf755c3d7f94ed6b6f7322fb953381f4879d5e9a"}},{"ruleId":"D1","level":"warning","message":{"text":"node.parentPort.on(\u0022message\u0022) (cyclomatic 20): node.parentPort.on(\u0022message\u0022) has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7d1f98324e11fa2b8916b52a6ddd4e46fd29bfde93ab7d10e427f0648a64c6a"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"1672cbbbe6a7f2a16f36ad75f3aaa3092e390b7977fae755679c8a6fc9c91549"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 20): (anonymous) has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"61a20304a3e38721cb2af42099d24cca353b093cce83366dd6f24188acc0be2a"}},{"ruleId":"D1","level":"warning","message":{"text":"cache.searchCache (cyclomatic 18): cache.searchCache 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":"src/cache.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"7648fbca56847ae3d4a00210d686d0bdeabed910085128f3dd9699674512930e"}},{"ruleId":"D1","level":"warning","message":{"text":"serialize.importDocument (cyclomatic 18): serialize.importDocument 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":"src/serialize.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f50197fd3b6108c392f4a204009da2bfaa0440d1fb64d65b52761419a49b5933"}},{"ruleId":"D1","level":"warning","message":{"text":"worker.WorkerIndex (cyclomatic 18): worker.WorkerIndex has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body\u0027s own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"81603046c1394c4a78dfb1038ef32b5acf2d8babf96dfd462f5c6b830af98764"}},{"ruleId":"D1","level":"warning","message":{"text":"default.default (cyclomatic 18): default.default has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/default.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"56b7117977b71d9e113e8ebe3d1352739b13988ea947faab94c55d074683f23d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.SqliteDB.open (cyclomatic 18): index.SqliteDB.open has cyclomatic complexity 18 (threshold 15). Of this number, 15 points are the body\u0027s own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"b422bb53f67c1f03b76d8a105627c29358131b53bfea299a4c9bfdb3557a6cd0"}},{"ruleId":"D1","level":"warning","message":{"text":"(anonymous) (cyclomatic 18): (anonymous) has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/default.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"469544a7c3765dd48970e3f33154f03052f0f3997afb49e6c2f76998686fb974"}},{"ruleId":"D1","level":"warning","message":{"text":"remove.Index.remove (cyclomatic 17): remove.Index.remove 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":"src/index/remove.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae869d3994549a8390c419a023475a23461e37580b77da44e4526a06a797294"}},{"ruleId":"D1","level":"warning","message":{"text":"and.return_result (cyclomatic 16): and.return_result has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/and.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf0afbbdddc756025befaf7bd01bf0f034777c70d1c2bcac40d7e3b4ba6b35d"}},{"ruleId":"D1","level":"warning","message":{"text":"index.MongoDB.get (cyclomatic 16): index.MongoDB.get has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc4294883293a78e8cf6c06c9bbf961f2bd2deae629979d5d7c9ddd19d6e307"}},{"ruleId":"D1","level":"warning","message":{"text":"get (cyclomatic 16): get has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e0f70035b89e61438d7ef6417a0c2ae7b34dfed66025d2f2ca678dcd14313f"}},{"ruleId":"D1","level":"warning","message":{"text":"open (cyclomatic 16): open has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"3700137b89cd8c345611a870a0532a0b4e7d89809d4278dbefb7faf9edbafc00"}},{"ruleId":"D1","level":"warning","message":{"text":"get (cyclomatic 16): get has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"57dc30d2a6f70aa11c06f6de8860af701dc3ebbef4373b6d883ce7ef7c5540f8"}},{"ruleId":"D1","level":"warning","message":{"text":"get (cyclomatic 16): get has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cd7285d28675a43b3fa0a1f46062b1f9537c8eb838975657379245fdbeef799"}},{"ruleId":"D2","level":"warning","message":{"text":"highlight_fields (cognitive 652): highlight_fields has cognitive complexity 652 (threshold 15). Drivers by points: if/else 95 (478 pts), ternaries 22 (127 pts), loops 7 (27 pts), boolean chains 20 (nesting depth added 508). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/highlight.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"87adda35c160f2016aeeb200c8863c857689d9524074495c84cc8878e27b8bd6"}},{"ruleId":"D2","level":"warning","message":{"text":"search (cognitive 458): search has cognitive complexity 458 (threshold 15). Drivers by points: if/else 79 (228 pts), boolean chains 97, ternaries 22 (85 pts), loops 12 (48 pts) (nesting depth added 248). Of this number, 425 points are the body\u0027s own statements and 33 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/search.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"26da79a5afc68d4668b9c4d804f49a335350ef7d8b52cedf7d72b3d4c63451f6"}},{"ruleId":"D2","level":"warning","message":{"text":"add (cognitive 204): add has cognitive complexity 204 (threshold 15). Drivers by points: ternaries 14 (100 pts), loops 7 (46 pts), if/else 11 (43 pts), boolean chains 10, match/switch 1 (5 pts) (nesting depth added 161). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/add.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9d863cab03b3e7cc61cccb5ecbb84e034c3ce4ef3cdab5d5fced4f57765658d"}},{"ruleId":"D2","level":"warning","message":{"text":"add (cognitive 183): add has cognitive complexity 183 (threshold 15). Drivers by points: if/else 31 (128 pts), loops 5 (23 pts), boolean chains 18, ternaries 2 (14 pts) (nesting depth added 127). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/add.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"176b88b193fa6964ead367134cef13efde96301383b5256f9a5cf3447bebf722"}},{"ruleId":"D2","level":"warning","message":{"text":"handler (cognitive 164): handler has cognitive complexity 164 (threshold 15). Drivers by points: if/else 37 (115 pts), boolean chains 29, ternaries 4 (17 pts), loops 2 (3 pts) (nesting depth added 92). Of this number, 144 points are the body\u0027s own statements and 20 belong to 9 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":"src/resolve/handler.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d7c6dd80dff33c9c78cd5e0aabe12cff5d93e7d0473c87077a6b10f1502afa3"}},{"ruleId":"D2","level":"warning","message":{"text":"encode (cognitive 132): encode has cognitive complexity 132 (threshold 15). Drivers by points: if/else 40 (88 pts), boolean chains 30, loops 4 (10 pts), ternaries 2 (4 pts) (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/encoder.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcb343888bfa6593aa82c27048b13a3b44eaca14a89539a8f5e71c49c96cff79"}},{"ruleId":"D2","level":"warning","message":{"text":"intersect (cognitive 131): intersect has cognitive complexity 131 (threshold 15). Drivers by points: if/else 20 (83 pts), ternaries 4 (20 pts), boolean chains 16, loops 4 (12 pts) (nesting depth added 87). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intersect.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5349d08caa402c0eae8bb6371cb0e05e9aee570debced50a79750c40407b541"}},{"ruleId":"D2","level":"warning","message":{"text":"commit (cognitive 103): commit has cognitive complexity 103 (threshold 15). Drivers by points: if/else 17 (40 pts), loops 12 (28 pts), ternaries 7 (27 pts), boolean chains 8 (nesting depth added 59). Most of this is not in the body itself: 10 of the 103 points are its own statements and the rest belongs to one function literal inside it that branches (line 630). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":603}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b01472f1feef9b08029348adf3398e8e5b4625fda31f1d6dd63ee5ce1b77d82"}},{"ruleId":"D2","level":"warning","message":{"text":"index.PostgresDB.commit (cognitive 97): index.PostgresDB.commit has cognitive complexity 97 (threshold 15). Drivers by points: if/else 23 (56 pts), loops 12 (35 pts), boolean chains 6 (nesting depth added 56). Most of this is not in the body itself: 9 of the 97 points are its own statements and the rest belongs to one function literal inside it that branches (line 592). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"a124471c699710dc6aa9430e9fcd50451a8d0d1191901dcc4c6c7b82328fdd4c"}},{"ruleId":"D2","level":"warning","message":{"text":"index.RedisDB.commit (cognitive 94): index.RedisDB.commit has cognitive complexity 94 (threshold 15). Drivers by points: if/else 19 (44 pts), loops 15 (42 pts), boolean chains 8 (nesting depth added 52). Most of this is not in the body itself: 9 of the 94 points are its own statements and the rest belongs to one function literal inside it that branches (line 362). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49680ab2be571c6c67bd790d722ed3016ae8c6c37b2c359099435a17199bdde"}},{"ruleId":"D2","level":"warning","message":{"text":"Document (cognitive 89): Document has cognitive complexity 89 (threshold 15). Drivers by points: if/else 19 (48 pts), boolean chains 25, loops 3 (9 pts), ternaries 5 (7 pts) (nesting depth added 37). Of this number, 82 points are the body\u0027s own statements and 7 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e32cd2a07d4db5d657bdf25b11640f89be02d059066e58fad27125bb68137253"}},{"ruleId":"D2","level":"warning","message":{"text":"search (cognitive 86): search has cognitive complexity 86 (threshold 15). Drivers by points: if/else 25 (57 pts), boolean chains 23, loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 34). Of this number, 58 points are the body\u0027s own statements and 28 belong to one function literal inside it that branches. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/search.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6a2cd5fd1f092bd6f859370abc4a0181f351528d23604178d624f12f16b2885"}},{"ruleId":"D2","level":"warning","message":{"text":"union (cognitive 79): union has cognitive complexity 79 (threshold 15). Drivers by points: if/else 12 (50 pts), loops 5 (16 pts), ternaries 1 (8 pts), boolean chains 5 (nesting depth added 56). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intersect.js"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a09287a7b30b35a44ff0e9cacab719d1d50674cb76d391e2986d52c7a19ef1"}},{"ruleId":"D2","level":"warning","message":{"text":"index.ClickhouseDB.commit (cognitive 74): index.ClickhouseDB.commit has cognitive complexity 74 (threshold 15). Drivers by points: loops 12 (35 pts), if/else 17 (32 pts), boolean chains 7 (nesting depth added 38). 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":"src/db/clickhouse/index.js"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"be9547b975f3ee26e26244ed7c089606facd9508a9bbdb4c6c1b9a37b18fb127"}},{"ruleId":"D2","level":"warning","message":{"text":"_push_index (cognitive 72): _push_index has cognitive complexity 72 (threshold 15). Drivers by points: if/else 15 (44 pts), ternaries 4 (11 pts), boolean chains 9, loops 2 (8 pts) (nesting depth added 42). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/add.js"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eae53d8c3ff567c1021d79a60d026d1d9fc35a6b2d549d9e820a995fc4218fa"}},{"ruleId":"D2","level":"warning","message":{"text":"index.MongoDB.commit (cognitive 71): index.MongoDB.commit has cognitive complexity 71 (threshold 15). Drivers by points: loops 12 (35 pts), if/else 16 (29 pts), boolean chains 7 (nesting depth added 36). 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":"src/db/mongodb/index.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b4748af8de93ca348001d00617bef5a49729a2fff38f2da1736cd2a5d3df970"}},{"ruleId":"D2","level":"warning","message":{"text":"assign (cognitive 67): assign has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (33 pts), ternaries 6 (16 pts), boolean chains 9, error handling 2 (5 pts), loops 2 (4 pts) (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/encoder.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ab7c8aa5f5bf0ecb52985d76ed76f032925f2568f63c09ceb7b363731d1da33"}},{"ruleId":"D2","level":"warning","message":{"text":"parse_descriptor (cognitive 66): parse_descriptor has cognitive complexity 66 (threshold 15). Drivers by points: if/else 17 (40 pts), ternaries 4 (14 pts), boolean chains 9, loops 2 (3 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"09b6ce042f6ed93d629c193f3bef1a6670f6f629d2f3549fbed2c22b778cb4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"search (cognitive 64): search has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 21 (46 pts), loops 4 (10 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ae44fa8bd41185de8cad87f4e49cc4288972714a9759d9eb1651d83e9646a3"}},{"ruleId":"D2","level":"warning","message":{"text":"search (cognitive 64): search has cognitive complexity 64 (threshold 15). Drivers by points: ternaries 21 (46 pts), loops 4 (10 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"166ae14c85dda87bfcec2b337e3355bc64fc9662030257abc86ecf7d4d81f0e5"}},{"ruleId":"D2","level":"warning","message":{"text":"exclusive (cognitive 63): exclusive has cognitive complexity 63 (threshold 15). Drivers by points: if/else 11 (40 pts), loops 6 (12 pts), ternaries 2 (10 pts), boolean chains 1 (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":"src/resolve/xor.js"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cb18d5344fabe91c286f7e7d8bb2dfb44402c941507a489a9e60d9795c0625b"}},{"ruleId":"D2","level":"warning","message":{"text":"search (cognitive 62): search has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 20 (44 pts), loops 4 (10 pts), if/else 4 (6 pts), boolean chains 2 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":420}}}],"partialFingerprints":{"codehealthFindingId/v1":"d81f2b4e4b37c3bcb12ed65e84bfd2c57b6d0a92727f8f55b002f07638e94dc4"}},{"ruleId":"D2","level":"warning","message":{"text":"index.MongoDB.search (cognitive 56): index.MongoDB.search has cognitive complexity 56 (threshold 15). Drivers by points: if/else 13 (24 pts), ternaries 6 (14 pts), boolean chains 9, loops 4 (9 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"3db70cfe6ec965fc610affdf814518729ed937fd734dae774f176c5ea66a7ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"handler.default (cognitive 50): handler.default has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 7, ternaries 1 (2 pts), match/switch 1 (nesting depth added 25). 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":"src/worker/handler.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc383c446987a4c1bd4a3ac6242964ef4d694028c45c96ba92aadc8ebc60ba7c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 50): (anonymous) has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 7, ternaries 1 (2 pts), match/switch 1 (nesting depth added 25). 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":"src/worker/handler.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"8312a7e6337feaa3ef62a4f0d00e0124b37e3b733712a07bfc59a75e47683591"}},{"ruleId":"D2","level":"warning","message":{"text":"Index (cognitive 49): Index has cognitive complexity 49 (threshold 15). Drivers by points: boolean chains 26, ternaries 12, if/else 9 (11 pts) (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1612f68523767328cb3b3586a06b5b4ad9fd4eaacb90cb0f90ae7c1607eed8b"}},{"ruleId":"D2","level":"warning","message":{"text":"search (cognitive 49): search has cognitive complexity 49 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 5 (15 pts), ternaries 7 (13 pts), boolean chains 3 (nesting depth added 23). Of this number, 43 points are the body\u0027s own statements and 6 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a3c8023d40e058fbd60bd31a810b2c5f9491ceda025724dfc719d24fa5114a7"}},{"ruleId":"D2","level":"warning","message":{"text":"index.IdxDB.commit (cognitive 45): index.IdxDB.commit has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 14, loops 7 (11 pts), ternaries 1 (3 pts) (nesting depth added 12). Most of this is not in the body itself: 15 of the 45 points are its own statements and the rest belongs to 8 function literals inside it that branch (lines 464, 410, 536, \u2026). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals\u0027 work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/indexeddb/index.js"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"5641e5d6774c3faa3636d52fc5a38ec5f8f717a20cac08f4a347bc13aee854fa"}},{"ruleId":"D2","level":"warning","message":{"text":"common.merge_option (cognitive 44): common.merge_option has cognitive complexity 44 (threshold 15). Drivers by points: if/else 9 (30 pts), loops 2 (12 pts), boolean chains 1, ternaries 1 (nesting depth added 31). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/common.js"},"region":{"startLine":7}}}],"partialFingerprints":{"codehealthFindingId/v1":"e62add5f53cafc247c9a9aec7bf48fdb7f69a6e28abf0e55b43c4666323177fd"}},{"ruleId":"D2","level":"warning","message":{"text":"remove.remove_index (cognitive 44): remove.remove_index has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (36 pts), loops 2 (4 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/remove.js"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea492a3439436a91f9be30197f3d67594c40b07c8ee98b8e19070538ad9112f8"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 44): (anonymous) has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 18, if/else 7 (15 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 11). Of this number, 16 points are the body\u0027s own statements and 28 belong to 3 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"task/babel.js"},"region":{"startLine":13}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2510ab6632c936a0395fcf8f1248bd1023b50c258785712c8bd42b5b415253c"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 41): (anonymous) has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (17 pts), ternaries 10 (13 pts), boolean chains 6, loops 2 (5 pts) (nesting depth added 10). Most of this is not in the body itself: 5 of the 41 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 303, 384, 313, \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":"task/build.js"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f4266ba8a57cfe9789442c8f25171d522f1afc0b938ff5ebf08bbcc27a3bdb"}},{"ruleId":"D2","level":"warning","message":{"text":"node.parentPort.on(\u0022message\u0022) (cognitive 39): node.parentPort.on(\u0022message\u0022) has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 7, ternaries 1 (2 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba786df646d1651889b115b9a01e92867c09f385e10bbdc6b07f8f6c87e27336"}},{"ruleId":"D2","level":"warning","message":{"text":"node.parentPort.on(\u0022message\u0022) (cognitive 39): node.parentPort.on(\u0022message\u0022) has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 7, ternaries 1 (2 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"961d78aaba9ec9f3246b042e1476a58a4668d911cfd6cb48fb13dbb7c6597e81"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 39): (anonymous) has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 7, ternaries 1 (2 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.js"},"region":{"startLine":16}}}],"partialFingerprints":{"codehealthFindingId/v1":"097d5df31419b44071bf629b5e0019a06b84a3a067b6932ff411f90e7dee6451"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 39): (anonymous) has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 7, ternaries 1 (2 pts), match/switch 1 (nesting depth added 18). The drivers above price the dispatch low by construction \u2014 a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full \u2014 so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.mjs"},"region":{"startLine":17}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec47b1a712ff862872b9f0ef1e0c22d8bc014ff671e0d9299d194d29570c87bd"}},{"ruleId":"D2","level":"warning","message":{"text":"get (cognitive 37): get has cognitive complexity 37 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 7 (11 pts), loops 2 (6 pts), boolean chains 4 (nesting depth added 17). Most of this is not in the body itself: 5 of the 37 points are its own statements and the rest belongs to one function literal inside it that branches (line 223). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/indexeddb/index.js"},"region":{"startLine":218}}}],"partialFingerprints":{"codehealthFindingId/v1":"63fa93d05bb4d859cf3f069d7d129e5a5f8d5e1a4242dbe514833558828702bf"}},{"ruleId":"D2","level":"warning","message":{"text":"document.Document.remove (cognitive 36): document.Document.remove has cognitive complexity 36 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (10 pts), ternaries 1 (7 pts), boolean chains 3 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document.js"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e84ee909ca98302e7bf0f3a7523ec0b137378b153136443eda96cd1575f0f8"}},{"ruleId":"D2","level":"warning","message":{"text":"intersect.intersect_union (cognitive 35): intersect.intersect_union has cognitive complexity 35 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 5 (10 pts), boolean chains 3 (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intersect.js"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"33884daf00f6ec2ded902592d2418361459c90095f3538b9ba96ad107e0d7460"}},{"ruleId":"D2","level":"warning","message":{"text":"remove (cognitive 34): remove has cognitive complexity 34 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 7, loops 1 (3 pts), ternaries 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/remove.js"},"region":{"startLine":15}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb80bc340c2ac6cd5388269e3ea0bd5289391f9bf15efa557215af8f0e7e5b6"}},{"ruleId":"D2","level":"warning","message":{"text":"index.RedisDB.remove (cognitive 33): index.RedisDB.remove has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 4 (11 pts), boolean chains 1 (nesting depth added 17). Most of this is not in the body itself: 4 of the 33 points are its own statements and the rest belongs to one function literal inside it that branches (line 536). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":524}}}],"partialFingerprints":{"codehealthFindingId/v1":"24b317c637ff84d486ce6f27723863364b5b1dfab088ea1529f85eb976367862"}},{"ruleId":"D2","level":"warning","message":{"text":"and.return_result (cognitive 32): and.return_result has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 3, loops 1 (3 pts), ternaries 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/and.js"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8600c7eb0eff8be5379cba527107aad608d70a3e4cbe1bf6574206646ff2b79"}},{"ruleId":"D2","level":"warning","message":{"text":"KeystoreArray (cognitive 31): KeystoreArray has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 7, loops 2 (4 pts), ternaries 2 (nesting depth added 7). Most of this is not in the body itself: 4 of the 31 points are its own statements and the rest belongs to 8 function items inside it that branch (get, get::(anonymous), get::(anonymous), \u2026). 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":"src/keystore.js"},"region":{"startLine":32}}}],"partialFingerprints":{"codehealthFindingId/v1":"4306946549dbb4bc1b176060a52bdcbf09fe134e886f3bbb99570a0517e280d7"}},{"ruleId":"D2","level":"warning","message":{"text":"(anonymous) (cognitive 31): (anonymous) has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 5 (10 pts), boolean chains 2, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/default.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d5304bdab38a6367b973cd19c1ad7d202585607e2318221653747b5677466d0"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 29): open has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (18 pts), ternaries 2 (5 pts), match/switch 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 16). Of this number, 20 points are the body\u0027s own statements and 9 belong to 3 function literals inside it that branch. To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":78}}}],"partialFingerprints":{"codehealthFindingId/v1":"d773172e65e9d01af17558b3b4155560dbae12b98e0fbcd06d6216dc151ca31e"}},{"ruleId":"D2","level":"warning","message":{"text":"default.default (cognitive 28): default.default has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), ternaries 3 (7 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/default.js"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d28bb631752bce7bdd927a76757f569c78eefffa5253afc90523fcac901e06"}},{"ruleId":"D2","level":"warning","message":{"text":"not.exclusion (cognitive 28): not.exclusion has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (24 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/not.js"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f7d081ff0ceb5bca421329932501c63d15ab82ae50508cf7f5fc0f73fe55335"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 28): open has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (16 pts), ternaries 2 (9 pts), loops 2 (3 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"54f2f22aaa40e7e2e06a2cf30517bd6234719957a8868b3eeda1b21bfef7b224"}},{"ruleId":"D2","level":"warning","message":{"text":"get (cognitive 28): get has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, loops 2 (5 pts), ternaries 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"3daea32b54720d12841d3bba4c6670609ebf48d924f96046ad6139a8d6297b58"}},{"ruleId":"D2","level":"warning","message":{"text":"Resolver (cognitive 27): Resolver has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 17, if/else 6 (7 pts), ternaries 1 (3 pts) (nesting depth added 3). Of this number, 26 points are the body\u0027s own statements and 1 belongs 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":"src/resolver.js"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8b430f416858c8cd1590539babbacab0d3f587aec8619fc29b694d8930f13b"}},{"ruleId":"D2","level":"warning","message":{"text":"get (cognitive 27): get has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 12 (22 pts), if/else 3, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"28932617d81e0a1d3e63599fb166d784ebd89ad390811b935ec3126d0f881c6c"}},{"ruleId":"D2","level":"warning","message":{"text":"get (cognitive 27): get has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 12 (22 pts), if/else 3, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9188bcbc8119edd2f0b29198454e94228e152ba9946fa00736aad03faba13d3"}},{"ruleId":"D2","level":"warning","message":{"text":"get (cognitive 27): get has cognitive complexity 27 (threshold 15). Drivers by points: ternaries 12 (22 pts), if/else 3, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":231}}}],"partialFingerprints":{"codehealthFindingId/v1":"52e982c99d7a2749516ee17c7358d327b8d03a5d448e2094fa49d171f8e2a610"}},{"ruleId":"D2","level":"warning","message":{"text":"create_result (cognitive 25): create_result has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (8 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":157}}}],"partialFingerprints":{"codehealthFindingId/v1":"d307213039013e4de69eb5a96ee8240344a5b2ff58165cb490fe0d6232eedd77"}},{"ruleId":"D2","level":"warning","message":{"text":"add.add_index (cognitive 24): add.add_index has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 2 (9 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/add.js"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"c59871d8420113c20f4fd17df2f5f29853e0dee798ed2f51c3e264e643303441"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.Resolver.limit (cognitive 23): resolver.Resolver.limit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 1 (3 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolver.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"19b56f8c5f4191b6d6adc960d980fcb4e6962b04dda20d2022f46ff0e6ba6dd9"}},{"ruleId":"D2","level":"warning","message":{"text":"importDocument (cognitive 23): importDocument has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (9 pts), loops 2 (7 pts), boolean chains 3, match/switch 1 (2 pts), ternaries 2 (nesting depth added 8). To reduce it, split the body: this score is breadth rather than depth \u2014 many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serialize.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bc3d8c76c65fd2ec671da385374a7fbcd1ad3685e7e4f618ee67de323aff86"}},{"ruleId":"D2","level":"warning","message":{"text":"enrich (cognitive 23): enrich has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 3 (7 pts), loops 3 (6 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":"src/db/postgres/index.js"},"region":{"startLine":304}}}],"partialFingerprints":{"codehealthFindingId/v1":"59b2e55391277441206ec6f8fdf1440a36d6c353aaa36577a4f8bee602f05a34"}},{"ruleId":"D2","level":"warning","message":{"text":"handle (cognitive 23): handle has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 pts), ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/indexeddb/index.js"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"2100a0124e5714bda59b502c25aced93e62274e80a7f2748b1f2083733e48857"}},{"ruleId":"D2","level":"warning","message":{"text":"enrich (cognitive 23): enrich has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (9 pts), if/else 3 (7 pts), loops 3 (6 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":"src/db/clickhouse/index.js"},"region":{"startLine":300}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a6826790da1e0274831d69ba43760b4aa1f443be94c79f7dd13ef4106380a23"}},{"ruleId":"D2","level":"warning","message":{"text":"_slice (cognitive 22): _slice has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (14 pts), ternaries 2 (7 pts), loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/keystore.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4de8d309ff9bdd360a888166cd9869266262275828fa6a15a9712440b1cd1e"}},{"ruleId":"D2","level":"warning","message":{"text":"index.SqliteDB.enrich (cognitive 21): index.SqliteDB.enrich has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 3 (7 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). Most of this is not in the body itself: 7 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 388). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal\u0027s work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"254bc7f6834391ecb774757084ef6351108347880c266fee6834b3408aecb894"}},{"ruleId":"D2","level":"warning","message":{"text":"commit::(anonymous)::onsuccess (cognitive 21): commit::(anonymous)::onsuccess has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (7 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/indexeddb/index.js"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"91749973970533bbeea81170b6e551168e1ae111e8785f846d198f78de4cab39"}},{"ruleId":"D2","level":"warning","message":{"text":"commit::(anonymous)::onsuccess (cognitive 21): commit::(anonymous)::onsuccess has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (7 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/indexeddb/index.js"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"a66458f783192d31b15df432a3dc304df5c872fc448badd4243dd2e4a1973c9f"}},{"ruleId":"D2","level":"warning","message":{"text":"worker.WorkerIndex (cognitive 20): worker.WorkerIndex has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, ternaries 4 (5 pts) (nesting depth added 3). Of this number, 18 points are the body\u0027s own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"523c1600da02482330c658503efee7dab93e7a0c60179e20d98b0f624e6be0a8"}},{"ruleId":"D2","level":"warning","message":{"text":"parse_map (cognitive 20): parse_map has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 4 (13 pts), loops 3 (6 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":"src/serialize.js"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dca99c73871bf990477071daa70725179b122b023724c1007d69c70bbd2747d"}},{"ruleId":"D2","level":"warning","message":{"text":"create_result (cognitive 20): create_result has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 3 (9 pts), boolean chains 5, loops 2 (4 pts), if/else 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"7500faba2085092291954f0c8a5afed9ba018f964417386af1476c7bea11c2c5"}},{"ruleId":"D2","level":"warning","message":{"text":"resolve (cognitive 19): resolve has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 9, if/else 4 (5 pts), ternaries 3 (5 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolver.js"},"region":{"startLine":239}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff69166535d5ba60fdd4d77718d425345bdaf69b116f298c0e744144a8649089"}},{"ruleId":"D2","level":"warning","message":{"text":"cache.searchCache (cognitive 18): cache.searchCache has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 10, if/else 7 (8 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/cache.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a9d498b40dfc06cf6ab71ddb0cac7c7fd8d689e7c2f158e7dc43dcb55bbceed"}},{"ruleId":"D2","level":"warning","message":{"text":"search.merge_fields (cognitive 18): search.merge_fields has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), ternaries 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":"src/document/search.js"},"region":{"startLine":575}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa3e8d02783006a3b3fa096b207ab8439396b1f84e25f3696451322480bca1ec"}},{"ruleId":"D2","level":"warning","message":{"text":"index.create_result (cognitive 18): index.create_result has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), ternaries 1 (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":"src/db/clickhouse/index.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"a65eef669ff5966218e0c54d33b3deff9fae9dbd2af22392f419605fd9ae805a"}},{"ruleId":"D2","level":"warning","message":{"text":"index.create_result (cognitive 18): index.create_result has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), ternaries 1 (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":"src/db/postgres/index.js"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"58a6d31c68d6e57079c058490e473d22c114a710c3ff6e30308c132030cac1a6"}},{"ruleId":"D2","level":"warning","message":{"text":"index.create_result (cognitive 18): index.create_result has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), ternaries 1 (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":"src/db/sqlite/index.js"},"region":{"startLine":229}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffad4f07f805e1e1ce746a313ef0b30441edfe3605279489e8af312f627d9ab6"}},{"ruleId":"D2","level":"warning","message":{"text":"resolver.Resolver.offset (cognitive 17): resolver.Resolver.offset has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolver.js"},"region":{"startLine":147}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b9c49e9c8f6361c53bbd3bc90369be24ed73b1db647fbc6b15d75fc732f935f"}},{"ruleId":"D2","level":"warning","message":{"text":"open (cognitive 17): open has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (4 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (3 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"597e5c79dfa29ba6be2736cf441569e408d2fe86c8c713ceb0d4793a66a495d7"}},{"ruleId":"D2","level":"warning","message":{"text":"soundex.soundex (cognitive 16): soundex.soundex has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (14 pts), boolean chains 1, loops 1 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language\u0027s equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/charset/latin/soundex.js"},"region":{"startLine":28}}}],"partialFingerprints":{"codehealthFindingId/v1":"917a4dd1ff94a28f4b4cb0498555e0bbb6796951dca6d706f73b335f4de476e4"}},{"ruleId":"D2","level":"warning","message":{"text":"serialize (cognitive 16): serialize has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (10 pts), loops 2 (4 pts), boolean chains 1, if/else 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serialize.js"},"region":{"startLine":473}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad89645bd16dabc555251ad4694fa9641eb5468a44b8271400ffe40b1b4965c0"}},{"ruleId":"D2","level":"warning","message":{"text":"open::onupgradeneeded (cognitive 16): open::onupgradeneeded has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (12 pts), loops 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":"src/db/indexeddb/index.js"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"613feeac6cf908a769fde177c02e7a15b020c8231fbac8e1415a387d141bb140"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: highlight.highlight_fields: FunctionTooLong \u2014 highlight_fields runs 304 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 204 over it, 3.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":"src/document/highlight.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9a3041fe56541a74199e648ffec8e8e37cd923ab3f5858009056307f1a2af44"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: sqlite/index.js: FileTooLong \u2014 530 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 30 over it, 1.06\u00D7 the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6112883ca63e4d2c6ffe5007326e412e3fcc612db6bb7dae3ffba563fb9a5bf1"}},{"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 the mocha suite in test/ ran and not one test passed (throw new ERR_MODULE_NOT_FOUND(packageName, fileURLToPath(base), null);), so the coverage would describe the failed run, not the code. 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":"D11","level":"warning","message":{"text":"Test reliability not measured \u2014 JavaScript/TypeScript suite install refused the lockfile: Test reliability NOT MEASURED: the JavaScript/TypeScript suite\u0027s dependency install refused the committed lockfile, so no test ever ran and flakiness could not be exercised \u2014 the dependency install for the repository root refused the committed lockfile (npm error code EUSAGE), so the suite never ran. It is excluded from the score rather than counted as a defect; a lockfile in sync with package.json is what lets the suite be re-run."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"166e5a7f1e7f7840934bd0f1c14ddd658b4d7aa7c7571340b9874ca6caf351a2"}},{"ruleId":"D11","level":"error","message":{"text":"Test suite cannot be installed from its own lockfile: the repository root: The mocha suite in the repository root was never exercised because its dependency install refused the committed lockfile \u2014 the dependency install for the repository root refused the committed lockfile (npm error code EUSAGE), so the suite never ran. The suite is declared and committed but cannot be installed from what the repository ships, so neither this scan nor a new contributor can run it. The ask is the one the owner performs: run the install locally and commit the lockfile it writes."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"10b238b2ab6f091882f6ba22d70f4f159018916a05a0c57f435d1ae77a741b88"}},{"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":"d3af95dc2fac64616bbd02eea7036c4bc7a269503cf5d35b7e6cb8c720d536c2"},"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"}}]},{"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":"f224a7239976eb6ac23355352911d9674e8ac0748e524c5675ea18b05618361f"},"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"}}]},{"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":"0492f184ddd95b95705133b1d54f28f6a67135555fbb15fe08be0b182319130e"},"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"}}]},{"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":"2c964df8c005017846ce4b2f47587b1989445d31f3cfb0479e935e89aef69a69"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"387bce5dceed066c06cc59a22f87a8a3c76e91dc2092271a0f478e743e21b478"},"taxa":[{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"6728cdfd4a56028c8e6ef680ee8d67d159fba5d2dee739f1fe344c275deb57db"},"taxa":[{"id":"CWE-1104","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},{"id":"CWE-1329","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}}]},{"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":"a84c36387ac4c8a8b87630b51b666d0f25ed3de6648ca0528697714555bbd7a2"},"properties":{"dependency":{"package":"babel-traverse","version":"6.26.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":"56d7c0542bcbbd8d8c61f07327aa2080292f8d213e8f982f1a0933ffecde0a9c"},"properties":{"dependency":{"package":"brace-expansion","version":"1.1.11","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA 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":"b8a60c2a85d4d0ffdee273a7ac2abb883436814b517dea8664c3659ca0bb0c28"},"properties":{"dependency":{"package":"json5","version":"0.5.1","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":"3e8a38a547fbcb36d40d6b636f424331ac3f99faa67fed9e3f9e36364c737971"},"properties":{"dependency":{"package":"braces","version":"1.8.5","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":"613622f7032b6d2973c860b2a9fd6d2e703fddc9d44dee17c2c5fc2a34cbec1f"},"properties":{"dependency":{"package":"braces","version":"2.3.2","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":"39bf4f17c896c65ccf3a63c0eb27c85df1ab6d5c21c345daa1df073b7684a511"},"properties":{"dependency":{"package":"micromatch","version":"2.3.11","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":"3c3431b25d9e1c5b755bcbfffce6fecc957d203698d0901e42b570d51f9db592"},"properties":{"dependency":{"package":"micromatch","version":"3.1.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":"844ee9e41fa9ce4fe620c46bcd8caf24250b0825270972aba151cf6ffecb8920"},"properties":{"dependency":{"package":"decode-uri-component","version":"0.2.2","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":"efaf36895ea0439c246060377b185b450a686757bc18c1a1e1e2d449f914b673"},"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"}}]},{"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":"8e7899c75bd404b62249cba42496691549d461bf9e67c40ead5436a83b28511c"},"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"}}]},{"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":"f3b040eda9bec08e40bd88c972b81d39108933662848c8b082751e26b6c6e74f"},"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"}}]},{"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":"a7fc5073ecf784655ebea62fe22bce69cf067cd5482432c233e2e5b6a6e41288"},"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"}}]},{"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":"cc682cd7167c2c692b624e54d299d32b2ea2b5b3eb72f5516f0dfab9c0ce991d"}},{"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"}},{"ruleId":"D37","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":"2baf56be81cee4fea57b9fbc0bcca4df8426c883fe2356827c7e968782d68617"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"M2","level":"note","message":{"text":"No architecture diagram/doc: No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named \u0060architecture\u0060 or \u0060design\u0060 in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape \u2014 no \u0060## Architecture\u0060 heading, no \u0022architecture overview\u0022/\u0022high-level design\u0022 phrasing, no \u0022the architecture is \u2026\u0022 introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document \u2014 not evidence that nobody wrote the shape down."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"0c190e7c159d1850ee706c3ac4486e151e8a4fe169de4bf61436b9f399654f06"}},{"ruleId":"P2","level":"warning","message":{"text":"No structured logging: No logging call was found in the 54 JavaScript/TypeScript production file(s) this check read across 6 module(s). Each was searched for its ecosystem\u0027s logging libraries (JavaScript/TypeScript: pino, winston, bunyan, log4js, loglevel, consola, the NestJS Logger) and for a call on a receiver named \u0060log\u0060/\u0060logger\u0060 (or ending in \u0060Logger\u0060/\u0060_logger\u0060) with a level verb. It cannot see logging through a repo-local wrapper named otherwise, or in source it did not read \u2014 this is \u0027no logging found by this walk\u0027, not a verdict that nothing here logs. If it is right, production issues will be hard to diagnose."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"9f10d71351c6778ebe84e761f82a90d4f9ed6c64f5e01975ede8fda7e4e2ebc5"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add CodeQL\u0027s javascript-typescript pack, \u0060semgrep --config=p/javascript\u0060, or eslint-plugin-security as a CI step. What was searched, so you can tell an absence from a miss: the 2060 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P4","level":"note","message":{"text":"No rollback/health safety: Deployment is orchestrated by compose, but no service declares a \u0060healthcheck:\u0060 and nothing pins a previous image to fall back to \u2014 the runtime can tell that the container is up, not that it is serving, so a bad release is harder to detect and reverse."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"db6bab8a28a2145f47e5a4e6683cda39d2ba0296c723238e8057da979ae1c706"}},{"ruleId":"P5","level":"warning","message":{"text":"No DR/backup evidence: A persistence guard (data volume / purge-protection) was found, but no backup, geo-recovery or RTO/RPO controls were evidenced \u2014 a volume that survives a container recreate is not a tested restore from catastrophic loss."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"5daabb38c90b07af65b8738cf94ce884e90a7d8fef810d341de5c186188c8fe0"}},{"ruleId":"R1","level":"warning","message":{"text":"Type Safety: 1 typed \u00B7 78 plain JS \u2014 the untyped files are src/async.js, src/bundle.js, src/cache.js, src/charset.js, src/charset/cjk.js, src/charset/exact.js (\u002B72 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d00ee7953f55325a823d27e5db9657c80ca9b9861c0c0abf8fe487cd3fa586d3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplication concentrated across 6 sibling directories (21 clone groups): 21 duplicated blocks under src/db/ have copies in at least two of the sibling directories clickhouse, indexeddb, mongodb, postgres, redis, sqlite \u2014 16 of them are reported below, and 5 are counted here but not reported individually: those copies match on shape but no longer clear R10\u0027s bar for an individually reported row \u2014 either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 21 and which does not depend on how exactly each block\u0027s copies still match. That concentration is one structural fact, not 21 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module \u2014 a common library every sibling imports \u2014 rather than 21 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"4962c19639cb5175aa159719cad7a16d28e0d53e24ad7698fa0b1ddea80d16eb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (203 matched lines \u00D7 2 locations): src/db/postgres/index.js:14 \u00B7 src/db/sqlite/index.js:7 \u2014 the two spans are one implementation copied and then locally edited \u2014 1300 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae2d010e1fac8466aa4a9b0afc88f5ea07f12de10eb06ea16c6619042b1b9bb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (68 matched lines \u00D7 2 locations): src/db/clickhouse/index.js:534 \u00B7 src/db/mongodb/index.js:586 \u2014 the two spans are one implementation copied and then locally edited \u2014 433 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":534}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e2375fe5d0c61e857b8a4f41d61cfe84a391fb13c5d6ba79e1eb4e7d48832c6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 2 locations): src/db/mongodb/index.js:382 \u00B7 src/db/mongodb/index.js:458 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":382}}}],"partialFingerprints":{"codehealthFindingId/v1":"f30c7206d0dcabb1bc1efb50510eba8a714633e42ca9610af8a5e8b9a2d07b02"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (58 lines \u00D7 2 locations): src/worker/node.js:12 \u00B7 src/worker/node.mjs:13 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d2c254c0f8057f72dddeb33802afdfcebbb6c6b9cc913aa37f37ca8e16663e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (30 lines \u00D7 2 locations): src/db/redis/index.js:366 \u00B7 src/db/redis/index.js:417 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":366}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc6a804d2c7d274ce5f5dcd0b0f5688819802fc5bf366d023fa4b915e810d9e"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (28 lines \u00D7 2 locations): src/db/indexeddb/index.js:423 \u00B7 src/db/indexeddb/index.js:480 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/indexeddb/index.js"},"region":{"startLine":423}}}],"partialFingerprints":{"codehealthFindingId/v1":"62831a3fbdf23bacf987c5ebef23c30468547869052baf08d79586b5cdc2583a"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3 locations): src/db/clickhouse/index.js:203 \u00B7 src/db/postgres/index.js:208 \u00B7 src/db/sqlite/index.js:229 \u2014 the 3 copies are spread across 3 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 3 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b24e87a5f12d81e4bac0b720be71272d52363c817ebc1deb8b190ce89fadde2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 3 locations): src/db/mongodb/index.js:220 \u00B7 src/db/mongodb/index.js:399 \u00B7 src/db/mongodb/index.js:475 \u2014 all 3 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":220}}}],"partialFingerprints":{"codehealthFindingId/v1":"9614edf7cfaf5953a591d5587b04d3682285faaf24c22c6dfbe55749268217ba"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2 locations): src/db/postgres/index.js:684 \u00B7 src/db/postgres/index.js:732 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":684}}}],"partialFingerprints":{"codehealthFindingId/v1":"22a5a4d66f8051466c476d186bac127fc207f04536421669ab4e9cbe2c3b0a31"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/db/postgres/index.js:552 \u00B7 src/db/redis/index.js:333 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":552}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e78c65af8c3e545b0796b3d04fcdf12eb02db1f6d204befc825e3ab9264733d"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/db/postgres/index.js:811 \u00B7 src/db/redis/index.js:494 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":811}}}],"partialFingerprints":{"codehealthFindingId/v1":"092ea849af19329dabb0221014d3cd4cecbb31aaaeef5768a180c2f59ec790af"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (22 lines \u00D7 2 locations): src/keystore.js:158 \u00B7 src/keystore.js:214 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/keystore.js"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7bca3db8744c5381144a7d234d091e39206c33717a2f5fb159d211cdb575b83"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/db/clickhouse/index.js:280 \u00B7 src/db/postgres/index.js:284 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"abe91734e675773b7b6f550b1b0430d1bce8460c17c2f558bb7562ada7b6698f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2 locations): src/db/sqlite/index.js:437 \u00B7 src/db/sqlite/index.js:507 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c015e1b0898dc6f62fca0b534c57e887a97483732d6232910529b50dc7c11ac"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 3 locations): src/worker/handler.js:75 \u00B7 src/worker/node.js:59 \u00B7 src/worker/node.mjs:61 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/handler.js"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cde36cbd5a22e7299a9d510e562818fd0a3ac6eee610f62fbaff8cd77319cf0"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/db/postgres/index.js:653 \u00B7 src/db/postgres/index.js:697 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"73439d95adabef87f45e0e2acbfc68525cf7ee88fb13dc4245b42f7e9b039eb4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2 locations): src/db/sqlite/index.js:633 \u00B7 src/db/sqlite/index.js:668 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":633}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bb5a28fcee32276c1daf149166eaa73ebe45279ea6ee5bc066f9d64ab89bebe"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (17 matched lines \u00D7 2 locations): src/resolve/or.js:11 \u00B7 src/resolve/xor.js:11 \u2014 the two spans are one implementation copied and then locally edited \u2014 85 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/or.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c3f4708191fc199054976b604ff1fedbc3f4aa424d82503e4bd13fa69c149d4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 3 locations): src/db/clickhouse/index.js:322 \u00B7 src/db/postgres/index.js:323 \u00B7 src/db/sqlite/index.js:391 \u2014 the 3 copies are spread across 3 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":322}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a8e0871d71b372203da87207ade1143ae97ecc70aab8911ecd51872e918058"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2 locations): src/db/clickhouse/index.js:368 \u00B7 src/db/clickhouse/index.js:434 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":368}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2d0424dfac0278fbd6a88b1e493981ad713567b68d5b2227d329971ebe0968c"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/db/postgres/index.js:609 \u00B7 src/db/postgres/index.js:647 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":609}}}],"partialFingerprints":{"codehealthFindingId/v1":"653a3eb5cc8ad43a76947946076cc11f6e8f89c4706a704372be9e9c0b57dceb"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/document.js:130 \u00B7 src/document.js:339 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document.js"},"region":{"startLine":130}}}],"partialFingerprints":{"codehealthFindingId/v1":"251b3f1ba683fbab4cbe8599fbdcac4d1cf28bad3abc41f108f1f14857c19a65"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2 locations): src/index/search.js:156 \u00B7 src/index/search.js:206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/search.js"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f8e26ef9bca996db7f8281716499895f0291b70bea9539b0042c141de6dee7b"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/db/clickhouse/index.js:243 \u00B7 src/db/clickhouse/index.js:259 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"e219512f90141257098dc2d94f6b82375d6d1ba10d8214782e6b152f8cf81de4"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2 locations): src/resolver.js:114 \u00B7 src/resolver.js:147 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolver.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9d72deee6e74482d51e9d129a299682afde9aae00c238821d49d729533439d2"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/db/clickhouse/index.js:347 \u00B7 src/db/sqlite/index.js:417 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe9a82d4f598eba4931aec6ca15392876340b41817972b83665b7d66a1ac538f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2 locations): src/db/mongodb/index.js:18 \u00B7 src/db/sqlite/index.js:38 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d2e72ee1265dc8cf3b43f2ea182b11bdab3b8ad98eb8e5f57b17a7a80bdea97"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (13 matched lines \u00D7 2 locations): src/document/search.js:59 \u00B7 src/index/search.js:30 \u2014 the two spans are one implementation copied and then locally edited \u2014 60 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/search.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b4129104621933f1913bd83f2c560da3a95a058e27e9ea1e73dc94a47946af9"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/db/mongodb/index.js:41 \u00B7 src/db/postgres/index.js:66 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"787a09cbf56133a40d5e455777d0a9448f605b85b0b0291323b720a056ad62a3"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (12 matched lines \u00D7 2 locations): src/document/add.js:41 \u00B7 src/document/add.js:73 \u2014 the two spans are one implementation copied and then locally edited \u2014 52 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":"src/document/add.js"},"region":{"startLine":41}}}],"partialFingerprints":{"codehealthFindingId/v1":"94875cf570d587d8cc9010143dd45222868f69148d3427f6e7a9fe7145801322"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2 locations): src/document/search.js:394 \u00B7 src/document/search.js:461 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/search.js"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"37a810f7f97a7e4f2038d20fd31fb8eea467d93e5bb20e25879a0e41e9784988"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3 locations): src/serialize.js:30 \u00B7 src/serialize.js:68 \u00B7 src/serialize.js:106 \u2014 all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/serialize.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"689d0bc46b5b57a5ea4f6c0afb46c684795cd34fa3584c50d5fb3a084f7c07b6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4 locations): src/db/mongodb/index.js:670 \u00B7 src/db/postgres/index.js:814 \u00B7 src/db/redis/index.js:514 \u00B7 src/db/sqlite/index.js:774 \u2014 the 4 copies are spread across 4 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. There is one copy in each of 4 separate files rather than several in one place, so check first whether these are sibling modules that each declare their own version of one shape \u2014 one per entity, per provider, per language. Where they are, no single extracted module collapses them: each module still has to be written, and what recurs is the TEMPLATE. The moves that do collapse a template are to generate these modules from the set they enumerate, or to replace the repeated construction with one factory each site calls with its own values \u2014 and where the set is the point, each module pinning one distinct thing, the repetition IS the enumeration and there is nothing to delete."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":670}}}],"partialFingerprints":{"codehealthFindingId/v1":"f614a795b601ad65ca36764469795c14382798cbfab2fb18337bbc7380694fd6"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/db/postgres/index.js:51 \u00B7 src/db/redis/index.js:24 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":51}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fbcd25346fd0ce2b5e16d2776310ca56ecae7660bad1683223656a63f5aa103"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/document/add.js:114 \u00B7 src/index/add.js:270 \u2014 the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/add.js"},"region":{"startLine":114}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e4bbb20abb95b625c9601dcff305f6f6ded6d694a5af18a78aab010a597775"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/intersect.js:195 \u00B7 src/intersect.js:227 \u2014 all 2 copies are in the same file, and the CITED SPAN is not a self-contained block \u2014 it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead \u2014 the whole function, component or branch these lines sit in \u2014 and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intersect.js"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"a119177a9ac4f8df0a89345d481ad1c2a138e46a579447a0e2d70d66c0e786a5"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2 locations): src/resolve/and.js:21 \u00B7 src/resolve/not.js:10 \u2014 the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/and.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d82f761776946b3b09676e01eb04c2e96b561b3b23a2625796196e7fef2b63"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block with local edits (10 matched lines \u00D7 2 locations): src/compress.js:62 \u00B7 src/keystore.js:406 \u2014 the two spans are one implementation copied and then locally edited \u2014 74 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row\u0027s finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters \u2014 or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/compress.js"},"region":{"startLine":62}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d2f15b3a02e82902c207637f4cf27c90c5f517119ddd111e654c24f775da28f"}},{"ruleId":"R10","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2 locations): src/db/clickhouse/index.js:302 \u00B7 src/db/postgres/index.js:305 \u2014 the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"96fd47d1ddab54f1f766db9ac9814f27656b41e557a3cdf5ea35dd4ae4ace154"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: src/db/clickhouse/index.js:2 reaches into another package with a relative path (../interface.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd66b0d14e1a74ef3d531ab5f18ef207267c7e0def46f3986df5a745e91be7b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: src/db/clickhouse/index.js:3 reaches into another package with a relative path (../../common.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"1095ab65326d83cb0774aff8db779726e4ddbaa6fb5088c0e626ecd00d46e41e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: src/db/mongodb/index.js:10 reaches into another package with a relative path (../interface.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":10}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce9d0e1b5bbc3b0b4631a0063b2d5284ec864932bb725d50b58774bcf2be907c"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: src/db/mongodb/index.js:11 reaches into another package with a relative path (../../common.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c9bcefc803c04e1e64818cdfc54e47c0894cdf662ea495517331b54136395f2"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: src/db/postgres/index.js:2 reaches into another package with a relative path (../interface.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a8bcec0942ee6cb4cd873c02a31b654105128c8894a380d5cc0bf45796ca116"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: src/db/postgres/index.js:3 reaches into another package with a relative path (../../common.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a7cf2c94331d6c9707cc45d3f6ca60bba5865cf2beea75cc10de98f9fcf8ab0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: src/db/redis/index.js:2 reaches into another package with a relative path (../interface.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"07a09deae19670f55b6aba68516df7d8f474e47231bfce766a7d3403e95366ab"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: src/db/redis/index.js:3 reaches into another package with a relative path (../../common.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":3}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd46a3740d918b5bdc32102de979bf3b0bba1b3402d2e579d2ccb73049184778"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: src/db/sqlite/index.js:4 reaches into another package with a relative path (../interface.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":4}}}],"partialFingerprints":{"codehealthFindingId/v1":"9488e17d9f07ffe4f499675b3705c1333cbfaa50fb98471c9a7f16163c737ea9"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:relative-cross-package]: src/db/sqlite/index.js:5 reaches into another package with a relative path (../../common.js) \u2014 import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":5}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab9c667c53f60ac6f89270554d331f32a6c165e1b75bc14e10f3f2b1b8e5649f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/async.js:14 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/async.js"},"region":{"startLine":14}}}],"partialFingerprints":{"codehealthFindingId/v1":"666a06b752a51c19f2158604d7833c0fc3e22cdfa1e679562835f8fa537e7d64"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/basic.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/basic.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"e851aa038acfcc524b3e9cc51014ac9ada7d39a247aabd72f6917ae700decc8d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/cache.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/cache.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b34fc7207fa1e6c0bd080170e3a3cd341e4a95a755081687e54f491d546cf2d"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/context.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/context.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"88f1913d601d808aac8d6cf59c25815cdd7b0333a1ea9f9ef54fa64fabf93f7e"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/debug.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/debug.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"42d0d975a76fdb950ef5f20e208602fb18872f536214b2ecb23120c8d23c6077"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/document.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/document.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6980122ff9d78d8b7cc3a406ef2e88381b7c9e73eece70564a9a7ceec7e32010"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/document.tag.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/document.tag.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb49c321d056ca7d40b6917be513ce61fee1667313dae629cf1793bc2b9edd2f"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/encoder.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/encoder.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"45f39b009eb4be880a68bbcba3555bf6a276afc3ad494db464987d962bafa6db"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/highlight.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/highlight.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0aabc664ce9a661c21d616844064e819f61fd300982e91986ac4cc47464f6b4"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/issues.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/issues.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25b8b98825201a27f547ff2a003d196363c187c24f307f3277e52c35f02d39b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/issues.js:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/lang/en.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/issues.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c82102bde8a275d8a00014ec404acd0940566765a27a34c303a9c19b75697a3"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/keystore.js:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/keystore.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2490980a54742f18ceddf7b4b285961d28e98af6b1af500d3bce8ef14be4603"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/persistent.clickhouse.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/persistent.clickhouse.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"d911d135442d10cb46e68b3c627525eef60cd9f616c3687cdd7e1a8ddbc3a2dc"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/persistent.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/persistent.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c55057cc5ea2c292616d8df4df2853939e17b96b95899ec4bac3fd6a504c540"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/persistent.mongo.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/persistent.mongo.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a78c8f6730c9e2e7f475c6d8eb2e175eae436f9fbb61717b0d2c43c56dde8147"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/persistent.postgres.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/persistent.postgres.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"920cd8a800bc5b4206476878361c7fa4e79a89f4ef436d1051fd6f8b2ec6edc0"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/persistent.redis.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/persistent.redis.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2380cc96883fb2e44099e2e0295c58288e19cd4156d68d7dea6634c9721a483"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/persistent.sqlite.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/persistent.sqlite.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"819271710c14c56dfcf5e2c75d86a550c1bd4798887f2e91bbc841e2f513d27b"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/resolver.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/resolver.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d409567622914ae7b68fc601cf1f835fc02454e2836442b647d806059340713"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/scoring.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/scoring.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5dcd706821416e43a330f3e1de6b66b4f29be64795af47a384377553e6fb79"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/serialize.js:12 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/serialize.js"},"region":{"startLine":12}}}],"partialFingerprints":{"codehealthFindingId/v1":"90b6475210937a1abe3d99299525bec112b0fc974323dbcab32e0b0031bba180"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/tokenize.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/tokenize.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f96e3b2418bdf996d3600f7694f7182d1413344ff08b57eb015efdfd53b7fa8"}},{"ruleId":"R11","level":"warning","message":{"text":"Boundary violation [package:test-cross-package-internals]: test/worker.js:11 reaches past another workspace package\u0027s public entry into its internals with a relative path (../src/charset.js) \u2014 the test is coupled to a file layout that package makes no promise about, so a refactor behind its entry point breaks the suite. Import the package by name instead."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"test/worker.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac96fb8de37372b5dface0d40178a2c48c23cdf5eac0e121ce30ace38b20f2a7"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 204, cognitive 425): search has cyclomatic complexity 204 and cognitive complexity 425; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/search.js"},"region":{"startLine":59}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc57ca4d4e32b25aa94b029e762b515b462694f5946d54942ea6fbaf779e718"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function highlight_fields (cyclomatic 135, cognitive 652): highlight_fields has cyclomatic complexity 135 and cognitive complexity 652; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/highlight.js"},"region":{"startLine":21}}}],"partialFingerprints":{"codehealthFindingId/v1":"3adbb237e2df16eb0ce662d10830cc84e0c21df7de8941ddaec58bf1806b70fb"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function encode (cyclomatic 72, cognitive 132): encode has cyclomatic complexity 72 and cognitive complexity 132; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/encoder.js"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a8e7eb34cabf5649d2718975c4b9597c972b51786035456c6739ef2eb102442"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function handler (cyclomatic 65, cognitive 144): handler has cyclomatic complexity 65 and cognitive complexity 144; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/resolve/handler.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"647e13b22f62e5c2ff5ec5b282c4d4c3b003f056566c3eac552ec37731482af0"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 55, cognitive 183): add has cyclomatic complexity 55 and cognitive complexity 183; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document/add.js"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"d96becfcf57a1f8610d901bfeacba0dd09fa306715319292adace03a6397131f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Index (cyclomatic 54, cognitive 49): Index has cyclomatic complexity 54 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":"src/index.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c012e93b155bc81bb423a0e68d8de6be23f09c864990902465f7eece65e44cd"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function Document (cyclomatic 52, cognitive 82): Document has cyclomatic complexity 52 and cognitive complexity 82; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document.js"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"67c0eb2c18897d2ca3c8f257501385ab8b46a0783142d18b68446c3852e5aa32"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function add (cyclomatic 49, cognitive 204): add has cyclomatic complexity 49 and cognitive complexity 204; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/add.js"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"b868c3b045afdb4bd21648c5a0396aad5b4864bd02e00ec660371e124c3b443b"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 49, cognitive 58): search has cyclomatic complexity 49 and cognitive complexity 58; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/index/search.js"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7f1f5bb6a049883b503bdcfec0d7b06a7e379840dfb542b2bd131cdc2826197"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function intersect (cyclomatic 43, cognitive 131): intersect has cyclomatic complexity 43 and cognitive complexity 131; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/intersect.js"},"region":{"startLine":29}}}],"partialFingerprints":{"codehealthFindingId/v1":"70cbfea067404b9109fcda8edfee7f26a79c485b2f7c1141dc2e9c387d107115"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commit (cyclomatic 37, cognitive 74): commit has cyclomatic complexity 37 and cognitive complexity 74; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"3117b22e533337d539e192e86988b5afefc0c49a17ee6cc6a311adf7b909bcd1"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 36, cognitive 93): (anonymous) has cyclomatic complexity 36 and cognitive complexity 93; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":630}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8e2e2a6181a25340595bf66a23d814bdeb1a217a6d874672c6aa77a1288574"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function commit (cyclomatic 36, cognitive 71): commit has cyclomatic complexity 36 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":551}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fa674aa8fda1a13143d11cbdaaf6711f55ffb583f8164ec6c8131125dc57e79"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 88): (anonymous) has cyclomatic complexity 34 and cognitive complexity 88; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"34302ab15dfcf61e32a3ab8e3e5fd08c92c8881a485311e627f15e1284e301b3"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function (anonymous) (cyclomatic 34, cognitive 85): (anonymous) has cyclomatic complexity 34 and cognitive complexity 85; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":362}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ca4729783f3d3ee111ff62d8c92d6591a0c811e87d81ae1f73b0812857b241c"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function assign (cyclomatic 34, cognitive 67): assign has cyclomatic complexity 34 and cognitive complexity 67; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/encoder.js"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4dee65e52119a3c4e771b8051d9af1d15b183c14aef200d52b626d536aedc8f"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function parse_descriptor (cyclomatic 31, cognitive 66): parse_descriptor has cyclomatic complexity 31 and cognitive complexity 66; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/document.js"},"region":{"startLine":287}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b27f8b54e209f8b2eaa11901ac137c9eb91212cea47143086feaf613429528"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 31, cognitive 64): search has cyclomatic complexity 31 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"21519945c982ff64b831de3461bf61a81b98cc86a223fe773447bb23fa15ffb5"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 31, cognitive 64): search has cyclomatic complexity 31 and cognitive complexity 64; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ef68f9a112f1e2d4491b3aa5cb8668e3c1088a9fe3378ef30be6e7d571d37dc"}},{"ruleId":"R2","level":"warning","message":{"text":"Complex function search (cyclomatic 31, cognitive 56): search has cyclomatic complexity 31 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side \u2014 extracting each decision into its own named function is the change that pays. Measured by this repository\u0027s own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":356}}}],"partialFingerprints":{"codehealthFindingId/v1":"75b075055f70e791edbe2d18169f81c47c9f73312098666f1152219e537d05d3"}},{"ruleId":"R3","level":"warning","message":{"text":"Large Files: 14 file(s) over 400 lines (counted as significant lines \u2014 blank lines excluded \u2014 over production source only, tests excluded), largest first: src/db/postgres/index.js (918), src/document/highlight.js (771), src/db/sqlite/index.js (758), src/intersect.js (662), src/db/clickhouse/index.js (643), src/db/indexeddb/index.js (632) (\u002B8 more)."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"cecee31b569df4f07e06db732f1ca037af27b5afef9023da51f9673d931a142f"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/postgres/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ac7b1044b2979f46da20179492c9a8555107a95bb2d1dd5a27ce37c32a92d23"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/sqlite/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"207b7735bbbea301d1fe09a608ab22b68983089afd344c7227a1accaba7c511e"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/mongodb/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"832355c79c50ced7e848efb7d62e7b94992927b39895028928e5353f4edad820"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/clickhouse/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"652d4d32dad2f74f33cf03a8c3733f808402e376e2d18b7e3dfe58dee42cf5b5"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/db/redis/index.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d39ddbb077dcfd9948f6cd0943fbef24c70a10195d0cd7570ca3a1a2e8ff202"}},{"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":"task/build.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6657c1babbf2e6e62c090d9a07e7a13f25b7a2b33f4caa740fc12d5fd3f4e625"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lang/fr.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d3afb0d70fcb4d790f9a95eea84063408106f7d189bc80abe286db4e8bc4747"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/lang/de.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8ef1690fca49ec9d5dff839b667c74eed5d556deefca5d9cf7ad53aa27c1645"}},{"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":"task/babel.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2999a62d80c60cf1d36393b5cc0b8d192870539802eda29030c78772a9ba44d3"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.mjs"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8541f568211967a7ad17fcdfdffd1f8961b7fe519448a4aea21690d5479afad8"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/node.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d81c5bfca485c1f9d36f30f9a799f8240b9eac4d91826fcf6292daef6c2aaa0"}},{"ruleId":"R4","level":"warning","message":{"text":"No test reaches this file: No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL \u2014 if neither does, no test reaches this one."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/worker/worker.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5b0a4c176af8379a10d147ba4171c1a38902e586a0a4c37f91572a5080f656a"}},{"ruleId":"R6","level":"warning","message":{"text":"No lint script: test \u2713 \u00B7 lint \u2717 \u00B7 typecheck \u2713 \u2014 read from this repository\u0027s package.json scripts and corroborated against its CI workflows. A script counts when its name or command matches the step: \u0060test\u0060 for the suite, \u0060lint\u0060 or \u0060prettier\u0060 for linting, \u0060typecheck\u0060/\u0060type-check\u0060/\u0060tsc\u0060 for type checking. \u2717 therefore means no script or CI step under those names was found, NOT that the step is absent from your pipeline \u2014 a task invoked by a runner this check does not read, or named something else entirely, is not seen and is worth confirming before acting on a cross. A \u2713 means the wiring is DECLARED \u2014 a script or CI step under those names exists. It is not a statement that the step passes, or that it runs at all: nothing here installs a dependency or executes a suite."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"bc8e67e81453cf5399dd04786d18b232180426b135169175fee670bdd83ccb03"}},{"ruleId":"R8","level":"warning","message":{"text":"Unused dependency \u0027google-closure-compiler\u0027: Declared in the root 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":"6cd96162c5b4c73974bed17558dcbcedf08cb250ef8efbe7f652174c77454bce"}},{"ruleId":"R9","level":"error","message":{"text":"Import cycle (2 files): src/async.js \u2192 src/document.js \u2192 src/async.js (one verified cycle inside a mutually-dependent group of 33 files)"},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"src/async.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"071bfbf8420f8a513a3e16a5f0a2dad86f9faf8f117888af4c7e22cabea8168b"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fs.existsSync(\u0022dist\u0022) || fs.mkdirSync(\u0022dist\u0022)\u0060 appears character-identically in 2 files \u2014 task/babel.js, task/build.js. 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":"task/babel.js"},"region":{"startLine":11}}}],"partialFingerprints":{"codehealthFindingId/v1":"94a9241bff31f98bbdf93c81e8d2b592afce9eaf21a8f838863634c150653d03"}}],"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":"CWE-1104","shortDescription":{"text":"CWE-1104"},"helpUri":"https://cwe.mitre.org/data/definitions/1104.html"},{"id":"CWE-1329","guid":"f70f1c3f-4ccf-cb5e-bdd3-03ba4868d36d","name":"CWE-1329","shortDescription":{"text":"CWE-1329"},"helpUri":"https://cwe.mitre.org/data/definitions/1329.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-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":"CWE-353","shortDescription":{"text":"CWE-353"},"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":"CWE-506","shortDescription":{"text":"CWE-506"},"helpUri":"https://cwe.mitre.org/data/definitions/506.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":"Command Injection","shortDescription":{"text":"Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"OS Command Injection","shortDescription":{"text":"OS Command Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Cross-site Scripting (XSS)","shortDescription":{"text":"Cross-site Scripting (XSS)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"SQL Injection","shortDescription":{"text":"SQL Injection"},"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":"Code Injection","shortDescription":{"text":"Code Injection"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]}],"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":21,"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."]}]}